
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
Data Compression Conference (DCC '95)
Snowbird, Utah
March 28March 30
ISBN: 0818670126
ASCII Text  x  
A. SriKrishna, Cheehung Chu, M. Bayoumi, "FFT based fast architecture & algorithm for discrete wavelet transforms," Data Compression Conference, pp. 441, Data Compression Conference (DCC '95), 1995.  
BibTex  x  
@article{ 10.1109/DCC.1995.515550, author = {A. SriKrishna and Cheehung Chu and M. Bayoumi}, title = {FFT based fast architecture & algorithm for discrete wavelet transforms}, journal ={Data Compression Conference}, volume = {0}, year = {1995}, isbn = {0818670126}, pages = {441}, doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.1995.515550}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  Data Compression Conference TI  FFT based fast architecture & algorithm for discrete wavelet transforms SN  0818670126 SP EP A1  A. SriKrishna, A1  Cheehung Chu, A1  M. Bayoumi, PY  1995 KW  digital signal processing chips; wavelet transforms; filtering theory; convolution; fast Fourier transforms; computational complexity; transforms; estimation theory; FFT architecture; FFT algorithm; fast Fourier transform; discrete wavelet transforms; one dimensional sequence; DWT coefficients; DWT decomposition; control circuits complexity; nonrecursive method; recursive dyadic decomposition; decimators; filter length; input sequence; convolution VL  0 JA  Data Compression Conference ER   
Summary form only given. A nonrecursive (unlike classical dyadic decomposition) and fast Fourier transform based architecture for computing discrete wavelet transforms (DWT) of a one dimensional sequence is presented. The DWT coefficients at all resolutions can be generated simultaneously without waiting for generation of coefficients at a lower octave level. This architecture is faster than architectures proposed so far for DWT decomposition (which are implementations based on recursion) and can be fully pipelined. The complexity of the control circuits for this architecture is much lower as compared to implementation of recursive methods. Consider the computation of the DWT (four octaves) of a sequence. Recursive dyadic decomposition can be converted to a nonrecursive method as shown. We can move all the decimators shown to the extreme right (towards output end) and have a single filter and a single decimator in each path. We note that a decimator (of factor k) when so moved across a filter of length L will increase the length of the filter by a factor of k. Thus we will get first octave DWT coefficients by convolving input sequence with a filter of length L and decimating the output by a factor of 2.
Index Terms:
digital signal processing chips; wavelet transforms; filtering theory; convolution; fast Fourier transforms; computational complexity; transforms; estimation theory; FFT architecture; FFT algorithm; fast Fourier transform; discrete wavelet transforms; one dimensional sequence; DWT coefficients; DWT decomposition; control circuits complexity; nonrecursive method; recursive dyadic decomposition; decimators; filter length; input sequence; convolution
Citation:
A. SriKrishna, Cheehung Chu, M. Bayoumi, "FFT based fast architecture & algorithm for discrete wavelet transforms," dcc, pp.441, Data Compression Conference (DCC '95), 1995
Usage of this product signifies your acceptance of the Terms of Use.