A novel generic fast Fourier transform pruning technique and complexity analysis

IEEE Transactions on Signal Processing

Volumn 53, Issue 1, 2005, Pages 274-282

  Hu, Zhong ^a,b   Wan, Honghui ^a,c  

^a Maryland Inst of Dynamic Genomics   (United States)

^b IBM   (United States)

^c NATIONAL INSTITUTE OF ENVIRONMENTAL HEALTH SCIENCES   (United States)

Author keywords

FFT; Number of executed butterflies; Pruning

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DIGITAL FILTERS; DIGITAL SIGNAL PROCESSING; ITERATIVE METHODS; SPECTRUM ANALYSIS;

NUMBER-OF-EXECUTED BUTTERFLIES; PRUNING ALGORITHM;

FAST FOURIER TRANSFORMS;

EID: 11844256970     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2004.838925     Document Type: Article

References (23)

1. S. Barash and Y. Ritov, "Logarithmic pruning of FFT frequencies," IEEE Trans. Signal Process., vol. 41, pp. 1398-1400, Mar. 1993.
2. C. A. Christopoulos, J. Bormans, J. Cornelis, and A. N. Skodras, " The vector-radix fast cosine transform: Pruning and complexity analysis," Signal Process., vol. 43, pp. 197-205, 1998.
3. R. E. Crochiere and L. R. Rabiner, Multirate Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1983.
4. S. S. He and M. Torkelson, "Computing partial DFT for comb spectrum evaluation," IEEE Signal Process. Lett., vol. 3, pp. 173-175, Jun. 1996.
5. S. Holm, "FFT pruning applied to time domain interpolation and peak localization," IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-35, pp. 1776-1778, Dec. 1987.
6. C. Y. Hsu and W. M. Chen, "Application of pruning FFT technique to discrete extrapolation," Int. J. Electron., vol. 75, pp. 833-841, 1993.
7. Z. Hu and H. Wan, "An efficient approach to sequence alignment based on fast Fourier transform pruning," IEEE Trans. Bioinformatics, submitted for publication.
8. Y. M. Huang, J. L. Wu, and C. L. Chang, "A generalized output pruning algorithm for matrix-vector multiplication and its application to compute discrete cosine transform," IEEE Trans. Signal Process., vol. 48, pp. 561-563, Feb. 2000.
9. L. P. Jaroslavski, "Comments on FFT algorithm for both input and output pruning," IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-29, pp. 448-449, Jun. 1981
10. B. G. Lee, "A new algorithm to compute the discrete cosine transform," IEEE Trans. Acoust., Speech Signal Process., vol. ASSP-32, pp. 1243-1245, Dec. 1984.
11. J. D. Markel, "FFT pruning," IEEE Trans. Audio Electroacoust., vol. 19, pp. 305-311, Dec. 1971.
12. K. Nagai, "Pruning the decimation-in-time FFT Algorithm with frequency shift," IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-34, pp. 1008-1010, Aug, 1986.
13. M. J. Narasimha and A. M. Peterson, "On the computation of the discrete cosine transform," IEEE Trans. Commun., vol. COM-26, pp. 934-936, Jun. 1978.
14. L. R. Rabiner and B. Gold, Theory and Application of Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
15. S. R. Rangarajan and S. Srinivasan, "Generalized method for pruning an FFT type of transform," Proc. Inst. Elect. Eng. - Vis. Image Signal vol. 144, pp. 189-192, 1997.
16. C. Roche, "A split-radix partial input output fast Fourier-transform algorithm," IEEE Trans. Signal Process., vol. 40, pp. 1273-1276, May 1992.
17. D. P. Skinner, "Pruning the decimation-in-time FFT algorithm," IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-24, pp. 193-194, Apr. 1976.
18. A. N. Skodras, "Fast discrete cosine transform pruning," IEEE Trans. Signal Process., vol. 42, pp. 1833-1837, Jul. 1994.
19. H. V. Sorensen and C. S. Burrus, "Efficient computation of the DFT with only a subset of input or output points," IEEE Trans. Signal Process., vol. 41, pp. 1184-1200, Mar. 1993.
20. T. V. Sreenivas and P. V. S. Rao, "FFT algorithm for both input and output pruning," IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-27, pp. 291-292, Jun. 1979.
21. T. V. Sreenivas and P. V. S. Rao, "High-resolution narrow-band spectra by FFT pruning," IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-28, pp. 254-257, Apr. 1980.
22. W. Wang and D. H. Johnson, "Computing linear transforms of symbolic signals," IEEE Trans. Signal Process., vol. 50, pp. 628-634, Mar. 2002.
23. Z. Wang, "Pruning the fast discrete cosine transform," IEEE Trans. Commun., vol. 39, pp. 640-643, May 1991.