Efficient architectures for 1-D and 2-D lifting-based wavelet transforms

The lifting scheme reduces the computational complexity of the discrete wavelet transform (DWT) by factoring the wavelet filters into cascades of simple lifting steps that process the input samples in pairs. We propose four compact and efficient hardware architectures for implementing lifting-based DWTs, namely, one-dimensional (1-D) and two-dimensional (2-D) versions of what we call recursive and dual scan architectures. The 1-D recursive architecture exploits interdependencies among the wavelet coefficients by interleaving, on alternate clock cycles using the same datapath hardware, the calculation of higher order coefficients along with that of the first-stage coefficients. The resulting hardware utilization exceeds 90% in the typical case of a five-stage 1-D DWT operating on 1024 samples. The 1-D dual scan architecture achieves 100% datapath hardware utilization by processing two independent data streams together using shared functional blocks. The recursive and dual scan architectures can be readily extended to the 2-D case. The 2-D recursive architecture is roughly 25% faster than conventional implementations, and it requires a buffer that stores only a few rows of the data array instead of a fixed fraction (typically 25% or more) of the entire array. The 2-D dual scan architecture processes the column and row transforms simultaneously, and the memory buffer size is comparable to existing architectures.

[1]  I. Daubechies,et al.  Factoring wavelet transforms into lifting steps , 1998 .

[2]  Sethuraman Panchanathan,et al.  VLSI implementation of discrete wavelet transform , 1996, IEEE Trans. Very Large Scale Integr. Syst..

[3]  Wolfgang Dahmen,et al.  Local Decomposition of Refinable Spaces and Wavelets , 1996 .

[4]  T. Nishitani,et al.  VLSI architectures for discrete wavelet transforms , 1993, IEEE Trans. Very Large Scale Integr. Syst..

[5]  V. Strela,et al.  Multiwavelet Construction via the Lifting Scheme , 1999 .

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

[7]  Qingtang Jiang,et al.  Construction of Biorthogonal Multiwavelets Using the Lifting Scheme , 2000 .

[8]  Bruce F. Cockburn,et al.  Efficient implementation of lifting-based discrete wavelet transform , 2002 .

[9]  C. Brislawn Classification of Nonexpansive Symmetric Extension Transforms for Multirate Filter Banks , 1996 .

[10]  Liang-Gee Chen,et al.  An efficient architecture for two-dimensional discrete wavelet transform , 2001, IEEE Trans. Circuits Syst. Video Technol..

[11]  Wim Sweldens,et al.  Lifting scheme: a new philosophy in biorthogonal wavelet constructions , 1995, Optics + Photonics.

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

[13]  Liang-Gee Chen,et al.  Lifting based discrete wavelet transform architecture for JPEG2000 , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

[14]  Chaitali Chakrabarti,et al.  A VLSI architecture for lifting-based forward and inverse wavelet transform , 2002, IEEE Trans. Signal Process..

[15]  Chaitali Chakrabarti,et al.  Efficient realizations of the discrete and continuous wavelet transforms: from single chip implementations to mappings on SIMD array computers , 1995, IEEE Trans. Signal Process..

[16]  A. S. Lewis,et al.  VLSI architecture for 2-D Daubechies wavelet transform without multipliers , 1991 .

[17]  Antonio Ortega,et al.  Parallel architecture for the discrete wavelet transform based on the lifting factorization , 1999, Optics + Photonics.

[18]  David R. Hanson,et al.  Multiwavelet Construction via the Lifting Scheme , 1997 .

[19]  C. Torrence,et al.  A Practical Guide to Wavelet Analysis. , 1998 .