A VLSI implementation structure for wavelet decomposition filter

In recent years, the wavelet transform has found its wide use in various fields with the fast tower decomposition algorithm as a powerful tool. The DWT just takes the same position in the wavelet analysis as the FFT in the Fourier analysis and so its fast hardware implementation is very crucial to the wavelet application. In this paper, a high-speed implementation structure is derived by introducing the parallel systolic structure into the design of the wavelet decomposition filter. The structure has the advantages of higher computing speed and higher data flowing rate and lower power consumption with the presence of systolic and parallel techniques.

[1]  Shang Yong,et al.  Design of parallel adaptive FIR filters , 1998, IEEE. APCCAS 1998. 1998 IEEE Asia-Pacific Conference on Circuits and Systems. Microelectronics and Integrating Systems. Proceedings (Cat. No.98EX242).

[2]  P. P. Vaidyanathan,et al.  Multirate digital filters, filter banks, polyphase networks, and applications: a tutorial , 1990, Proc. IEEE.

[3]  Olivier Rioul,et al.  Fast algorithms for discrete and continuous wavelet transforms , 1992, IEEE Trans. Inf. Theory.

[4]  P. Bertrand,et al.  Discrete Mellin transform for signal analysis , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[5]  Stéphane Mallat,et al.  A Theory for Multiresolution Signal Decomposition: The Wavelet Representation , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  P. Flandrin,et al.  Some Aspects of Non-Stationary Signal Processing with Emphasis on Time-Frequency and Time-Scale Methods , 1989 .

[7]  Thomas Kailath,et al.  Regular iterative algorithms and their implementation on processor arrays , 1988, Proc. IEEE.

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

[9]  S. Kung,et al.  VLSI Array processors , 1985, IEEE ASSP Magazine.