Title :
A prime factor fast W transform algorithm
Author_Institution :
Dept. of Electr. Eng., Beijing Univ. of Posts & Telecommun., China
fDate :
9/1/1992 12:00:00 AM
Abstract :
A method for converting any nesting DFT algorithm to the type-I discrete W transform (DWT-I) is introduced. A nesting algorithm that differs from either the Windograd Fourier transform algorithm (WFTA) or the prime factor FFT algorithm (PFA) is presented. New small- N DETs, which are suitable for this nesting algorithm, are developed based on using sparse matrix decomposition. The proposed algorithm is more efficient that either WFTA or PFA for large N, and it is more flexible for the choice of transform length, because 32 points are used. For 2D processing, the proposed algorithm is more efficient than the polynomial transform
Keywords :
fast Fourier transforms; matrix algebra; signal processing; transforms; 2D processing; FFT; discrete Fourier transform; large N; nesting DFT algorithm; prime factor fast W transform algorithm; signal processing; small-N DFT; sparse matrix decomposition; transform length; type-I discrete W-transform; Adaptive filters; Adaptive signal processing; Fourier transforms; Least squares approximation; Nonlinear equations; Optimization methods; Poles and zeros; Polynomials; Signal processing algorithms; Statistics;
Journal_Title :
Signal Processing, IEEE Transactions on
