作者:
Minami, TKasai, RMatsuda, HKusaba, RMemberNTT LSI Laboratories
Atsugi Japan 243-01 Graduated in 1980 from the Department of Electrical Engineering
Kyushu University where he received his Master's degree in 1982 and joined NTT. Until March 1986 he was engaged in the development of application software for electronic switching systems. He then engaged in research and development of LSIs for image signal processing. At present he is Senior Research Engineer Advanced LSI Laboratory NTT LSI Laboratories. He is a member of IEEE. Graduated in 1972 from the Department of Electrical Engineering
Osaka University where he received his Master's degree in 1974 and his Ph.D. in 1992. He joined NTT in 1974. He is engaged in research and development of analysis of MOS devices and design of ASIC for communication. At present he is Executive Research Engineer Advanced LSI Laboratory NTT LSI Laboratories. He is a member of IEEE. Graduated in 1987 from the Department of Communications
Tohoku University where he received his Master's degree in 1989 and joined NTT. He is engaged in research and development of high-speed design for image processing LSIs. At present he is Research Engineer Advanced LSI Laboratory NTT LSI Laboratories. He is a member of the Information Processing Society. Graduated in 1985 from the Department of Electrical Engineering
Keio University where he received his Master's degree in 1987 and joined NTT. He is engaged in CAD research. At present he is Senior Research Engineer Advanced LSI Laboratory NTT LSI Laboratories. He is a member of the Information Processing Society and IEEE.
This paper discusses the downsizing and speed improvement of short-word multiplier-accumulators, which are frequently used in digital signal processors. As a first step, the optimal configuration for an array-type car...
详细信息
This paper discusses the downsizing and speed improvement of short-word multiplier-accumulators, which are frequently used in digital signal processors. As a first step, the optimal configuration for an array-type carry-save adder is considered where the shortest path in the full-adder is used to propagate the sum signal and the carry signal is sent to the full-adder of the two lower stages by skipping a stage. A configuration of the full-adder suitable for the structure is proposed. The case of eight partial product additions shows that the delay can be reduced by 22 percent compared to a simple array-type carry-save adder. Then the short-word carry look-ahead adder using the pass-transistor logic is considered. It is shown that a single-stage carry look-ahead circuit with a four-bitwise iterative structure exhibits nearly the same delay as a two-stage carry look-ahead circuit. In other words, the former is better suited to downsizing. This paper intends to examine the effectiveness of the foregoing new array-type carry-save adder and the single-stage carry look-ahead circuit using the 0.5-mu m CMOS technology. A 16-bit x 14-bit + 31-bit multiplier-accumulator has been designed and is evaluated for cases where the array-type carry-save adder is used to handle accumulation as well as partial products. The resulting area and delay are 0.77 x 0.78 mm(2) and 6.8 ns, respectively. The effectiveness of the approach used in this paper is evaluated by constructing a multiplier-accumulator, but the method is also useful in constructing a multiplier.
In this correspondence, we propose a comprehensive theory for the morphological bounds on order-statistics filters (and their repeated iterations). Conditions are derived for morphological openings and closings to ser...
详细信息
In this correspondence, we propose a comprehensive theory for the morphological bounds on order-statistics filters (and their repeated iterations). Conditions are derived for morphological openings and closings to serve as bounds (lower and upper, respectively) on order-statistics filters (and their repeated iterations). Under various assumptions, morphological open-closings and close-openings are also shown to serve as (tighter) bounds (lower and upper, respectively) on iterations of order-statistics filters. Simulations of the application of the results presented to image restoration are finally provided.
This paper presents a texture segmentation algorithm based on a hierarchical wavelet decomposition. Using Daubechies' four-tap filter, an original image is decomposed into three detail images and one approximate i...
详细信息
This paper presents a texture segmentation algorithm based on a hierarchical wavelet decomposition. Using Daubechies' four-tap filter, an original image is decomposed into three detail images and one approximate image. The decomposition can be recursively applied to the approximate image to generate a lower resolution of the pyramid. The segmentation starts at the lowest resolution using the K-means clustering scheme and textural features obtained from various sub-bands. The result of segmentation is propagated through the pyramid to a higher resolution with continuously improving the segmentation. The lower resolution levels help to build the contour of the segmented texture, while higher levels refine the process, and correct possible errors.
In this correspondence, we propose a comprehensive theory of the convergence and characterization of roots of order-statistics filters. Conditions for the convergence of iterations of order-statistics filters are prop...
详细信息
In this correspondence, we propose a comprehensive theory of the convergence and characterization of roots of order-statistics filters. Conditions for the convergence of iterations of order-statistics filters are proposed. Criteria for the morphological characterization of roots of order-statistics filters are also proposed.
This paper is concerned with reducing the rank of the adaptive weight vector in radar array signalprocessing. The motivation for reducing the rank is that modern space-time processing requires many more weights than ...
详细信息
An algorithm based on the subband nonuniform discrete Fourier transform (SB-NDFT) is proposed for decoding dual-tone multi-frequency (DTMF) signals. To decode a DTMF signal, its energy at the eight DTMF frequencies mu...
详细信息
An algorithm based on the subband nonuniform discrete Fourier transform (SB-NDFT) is proposed for decoding dual-tone multi-frequency (DTMF) signals. To decode a DTMF signal, its energy at the eight DTMF frequencies must be determined by evaluating samples of the NDFT at these frequencies. In the proposed SB-NDFT algorithm, these NDFT samples are computed by decomposing the input signal into two subbands. Since DTMF signals occupy the low-frequency part of the telephone bandwidth, the higher subband can be discarded for a fast, approximate computation. A performance comparison between algorithms based on the NDFT, SB-NDFT, DFT, and SB-DFT shows that the SB-NDFT requires the lowest number of computations to attain a specified level of performance.
The compression of digital video data has many applications in the transmission and storage of video sequences. For moderate compression ratios there are many techniques which can provide satisfactory performance. For...
详细信息
The compression of digital video data has many applications in the transmission and storage of video sequences. For moderate compression ratios there are many techniques which can provide satisfactory performance. For high compression ratios, however, typical compression techniques produce noticeable artifacts in the reconstructed video. This paper proposes a technique for the post-processing of motion-compensated compressed video data. The technique utilizes a stochastic regularization approach which can be realized using a simple and fast iterative computational algorithm. The approach has been applied to the post-processing of color video sequences and yields good results.
Very-high-order FIR filters required for the new modulation schemes associated with wireless computer networks and cellular telephones can be implemented in VLSI circuitry using low-power CMOS technology and a novel a...
详细信息
Very-high-order FIR filters required for the new modulation schemes associated with wireless computer networks and cellular telephones can be implemented in VLSI circuitry using low-power CMOS technology and a novel application of Residue Number System (RNS) arithmetic. Through this approach 20-bit equivalent integer arithmetic can be obtained for filters with 8 to 256 taps with only a modest increase in hardware for filters above 8 taps. Simulations indicate that this new technique can increase dramatically the number of taps implemented on a single VLSI chip when compared with an FIR filter generated using FIRGEN.
This paper is concerned with reducing the rank of the adaptive weight vector in radar array signalprocessing. The motivation for reducing the rank is that modern space-time processing requires many more weights than ...
详细信息
This paper is concerned with reducing the rank of the adaptive weight vector in radar array signalprocessing. The motivation for reducing the rank is that modern space-time processing requires many more weights than can be supported on airborne and space-segment platforms. The loss incurred in partially adaptive radar processing is that the steady-state Wiener solution of the lower rank weight vector may not perform as well as the full rank solution. Hence, this paper examines the Wiener solution of partially adaptive radar arrays and compares the performance of principal component techniques with the cross-spectral technique.
Delta-operator based implementations can avoid the numerical ill-conditioning usually associated with the high speed shift-operator based implementations of discrete-time systems. Moreover, it provides a unified metho...
详细信息
Delta-operator based implementations can avoid the numerical ill-conditioning usually associated with the high speed shift-operator based implementations of discrete-time systems. Moreover, it provides a unified methodology for tackling both continuous- and discrete-time systems. In particular, it has been shown that, delta-operator based balanced realizations can offer superior coefficient sensitivity properties under fixed-point arithmetic. The authors address computation of balanced realizations. For this purpose, given a discrete-time system, the relationship between its shift- and delta-operator formulated balanced realizations is presented.
暂无评论