Lifting factorization-based discrete wavelet transform architecture design | IEEE Journals & Magazine | IEEE Xplore

Lifting factorization-based discrete wavelet transform architecture design


Abstract:

In this paper, two new system architectures, overlap-state sequential and split-and-merge parallel, are proposed based on a novel boundary postprocessing technique for th...Show More

Abstract:

In this paper, two new system architectures, overlap-state sequential and split-and-merge parallel, are proposed based on a novel boundary postprocessing technique for the computation of the discrete wavelet transform (DWT). The basic idea is to introduce multilevel partial computations for samples near data boundaries based on a finite state machine model of the DWT derived from the lifting scheme. The key observation is that these partially computed (lifted) results can also be stored back to their original locations and the transform can be continued anytime later as long as these partial computed results are preserved. It is shown that such an extension of the in-place calculation feature of the original lifting algorithm greatly helps to reduce the extra buffer and communication overheads, in sequential and parallel system implementations, respectively. Performance analysis and experimental results show that, for the Daubechies (see J.Fourier Anal. Appl., vol.4, no.3, p.247-69, 1998) (9,7) wavelet filters, using the proposed boundary postprocessing technique, the minimal required buffer size in the line-based sequential DWT algorithm is 40% less than the best available approach. In the parallel DWT algorithm we show 30% faster performance than existing approaches.
Page(s): 651 - 657
Date of Publication: 07 August 2002

ISSN Information:

References is not available for this document.

I. Introduction

Efficient system architecture design for the discrete wavelet transform (DWT) has received a lot of attention recently [2]–[4], [1], [5]–[8] due to the success of DWT-based techniques in areas as diverse as signal processing, digital communications, numerical analysis, computer vision and computer graphics [9]. Two important parameters have been used to measure the efficiency of practical DWT system designs: 1) the memory necessary for the DWT computation (mostly in sequential algorithms) and 2) the communication overhead required by parallel DWT algorithms. As a matter of fact, memory efficiency is one major design factor for wavelet-based image compression applications in printers, digital cameras and space-borne instruments where large size memory leads to high cost and demands more chip design area [1], [10], [11]. Similarly, communication efficiency is critical to the success of parallel DWT systems built upon the network of workstations (NOWs) or local area multicomputers (LAMs), since in these systems cheap but slower communication links are used (as compared with dedicated parallel systems) [12], [8], [13], [14].

Select All
1.
C. Chrysafis and A. Ortega, "Line based reduced memory wavelet image compression", Proc. Data Compression Conf., pp. 398-407, 1998.
2.
O. Rioul and P. Duhamel, "Fast algorithms for discrete and continuous wavelet transforms", IEEE Trans. Inform. Theory, vol. 38, pp. 569-586, Mar. 1992.
3.
M. Vishwanath, "The recursive pyramid algorithm for the discrete wavelet transform", IEEE Trans. Signal Processing, vol. 42, pp. 673-676, Mar. 1994.
4.
J. Fridman and E. S. Manolakos, "On the scalability of 2-D discrete wavelet transform alogrithms", Multidimensional Syst. Signal Processing, no. 8, pp. 185-217, 1997.
5.
M. A. Trenas, J. Lopez and E. L. Zapata, "A memory system supporting the efficient SIMD computation of the two dimensional DWT", Proc. ICASSP, pp. 1521-1524, 1998.
6.
W. Jiang and A. Ortega, "A parallel architecture for DWT based on lifting factorization", Proc. SPIE Parallel and Distributed Methods for Image Processing III, vol. 3817, pp. 2-13, 1999-Oct.
7.
A. Ortega, W. Jiang, P. Fernandez and C. Chrysafis, "Implementations of the discrete wavelet transform: complexity memory and parallelization issues", Proc. SPIE: Wavelet Applications in Signal and Image Processing VII, vol. 3813, pp. 386-400, 1999-Oct.
8.
W. Jiang and A. Ortega, "Efficient DWT system architecture design using filterbank factorizations", Proc. ICIP, vol. 2, pp. 749-753, 1999-Oct.
9.
Proc. IEEE: Special Issue on Wavelets, no. 4, 1996.
10.
C. Chrysafis and A. Ortega, "Line based reduced memory wavelet image compression", IEEE Trans. Image Processing, vol. 9, pp. 378-389, May 2000.
11.
J. Bowers, L. Keith, N. Aranki and R. Tawel, IMAS integrated controller electronics, 1998.
12.
L. Yang and M. Misra, "Coarse-grained parallel algorithms for multi-dimensional wavelet transforms", J. Supercomputing, vol. 12, no. 1/2, pp. 99-118, 1998.
13.
T. E. Anderson, D. E. Culler and D. A. Patterson, "A case for NOW (Networks of Workstations)", IEEE Micro, vol. 151, pp. 54-64, Feb. 1995.
14.
LAM/MPI parallel computing, [online] Available: .
15.
R. Blahut, Fast Algorithms for Digital Signal Processing, MA, Reading:Addison-Wesley, 1985.
16.
F. Kossentini, Spatially segmented wavelet transform, 1998.
17.
I. Daubechies and W. Sweldens, "Factoring wavelet transforms into lifting steps", J. Fourier Anal. Appl., vol. 4, no. 3, pp. 247-269, 1998.
18.
Report on core experiment codeff1 Complexity reduction of SSWT, 1998.
19.
C. Chrysafis, Low memory line-based wavelet trasform using lifting scheme, 1998.
20.
P. Onno, Low memory line-based wavelet transform using lifting scheme, 1998.
21.
G. Lafruit, L. Nachtergaele, J. Bormans, M. Engels and I. Bolsens, "Optimal memory organization for scalable texture codecs in MPEG-4", IEEE Trans. Circuits Syst. Video Technol., vol. 9, pp. 218-243, Mar. 1999.
22.
S. Mallat, "A theory for multiresolution signal decomposition: The wavelet representation", IEEE Trans. Pattern Anal. Machine Intell., vol. 11, pp. 674-693, 1989.
23.
G. Beylkin, R. Coifman and V. Rokhlin, "Fast wavelet transforms and numerical algorithms I", CPAM, vol. 44, pp. 141-183, 1991.
24.
W. Jiang and A. Ortega, Discrete wavelet transform system architecture design using filterbank factorization, 1999.
Contact IEEE to Subscribe

References

References is not available for this document.