The realizations of fast wavelet transform algorithms based on DSP

Wavelet transform is an important branch as a new theory in the history of mathematics. It is a signal analyzing and processing method in time-frequency domain, and has an excellent local character in time domain and frequency domain. Wavelet transform has led to many new wavelets applications in various fields such as signal detection, signal processing and image processing, and the hardware realization of wavelet transform algorithms receives more and more recognition. This paper introduces the principle of fast wavelet transform and the realizing method in DSP. The DSP instructions such as parallel multiply-accumulate instruction, circular addressing and repeating operation in TMS320C3X of, which are suitable to realize the wavelet algorithms, are described in detail. A framework of assemble language program for the calculation of scale expanding value is given out and the problem which should be paid attention to in the fast wavelet algorithms using DSP is discussed specially.

[1]  Keshab K. Parhi,et al.  Folded VLSI architectures for discrete wavelet transforms , 1993, 1993 IEEE International Symposium on Circuits and Systems.

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

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

[4]  C. Dorize,et al.  Optimizing time-frequency resolution of orthonormal wavelets , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[5]  Timo Hämäläinen,et al.  Parallel DSP implementation of wavelet transform in image compression , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[6]  Y. Iizuka,et al.  A DSP for DCT-based and wavelet-based video codecs for consumer applications , 1996, Proceedings of Custom Integrated Circuits Conference.