论文信息 - Discrete wavelet transforms in VLSI

Discrete wavelet transforms in VLSI

Three architectures, based on linear systolic arrays, for computing the discrete wavelet transform, are described. The AT/sup 2/ lower bound for computing the DWT in a systolic model is derived and shown to be AT/sup 2/= Omega (N/sup 2/N/sub w/k). Two of the architectures are within a factor of log N from optimal, but they are of practical importance due to their regular structure, scalability and limited I/O needs. The third architecture is optimal, but it requires complex control.<<ETX>>

Mary Jane Irwin | Robert Michael Owens | M. Vishwanath

[1] Franco P. Preparata,et al. Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform , 1981, ICALP.

[2] Martin Vetterli,et al. Wavelets and filter banks: relationships and new results , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[3] William R. Zettler,et al. Application of compactly supported wavelets to image compression , 1990, Other Conferences.

[4] S. Winograd. Arithmetic complexity of computations , 1980 .

[5] Mary Jane Irwin,et al. An Efficient Systolic Architecture For Qmf Filter Bank Trees , 1992, Workshop on VLSI Signal Processing.

[6] Richard Kronland-Martinet,et al. Analysis of Sound Patterns through Wavelet transforms , 1987, Int. J. Pattern Recognit. Artif. Intell..

[7] Ingrid Daubechies,et al. The wavelet transform, time-frequency localization and signal analysis , 1990, IEEE Trans. Inf. Theory.

[8] R. Coifman,et al. Fast wavelet transforms and numerical algorithms I , 1991 .

[9] G. Knowles. VLSI architecture for the discrete wavelet transform , 1990 .

[10] Stéphane Mallat,et al. Multifrequency channel decompositions of images and wavelet models , 1989, IEEE Trans. Acoust. Speech Signal Process..