A Prime Factor FTT Algorithm Using Distributed Arithmetic

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 30, Issue 2, 1982, Pages 217-227

  Chu, Shuni ^a   Burrus, C Sidney ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; COMPUTER ANALYSIS; FOURIER TRANSFORMATION; MICROPROCESSOR; NONBIOLOGICAL MODEL;

MATHEMATICAL TRANSFORMATIONS;

EID: 0020331996     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASSP.1982.1163875     Document Type: Article

References (15)

1. J. H. McClellan and C. M. Rader, Number Theory in Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1979.
2. I. J. Good, “The relationship between two fast Fourier transforms,” IEEE Trans. Comput., vol. C-20, pp. 310–317, Mar. 1971.
3. C. S. Burrus, “Index mappings for multidimensional formulation of the DFT and convolution,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, pp. 239–242, June 1977.
4. S. Winograd, “On computing the discrete Fourier transform,” Math. Comput., vol. 32, pp. 175–199, Jan. 1978.
5. C. M. Rader, “Discrete Fourier transforms when the number of data samples is prime,” Proc. IEEE, vol. 56, pp. 1107–1108, June 1968.
6. C. S. Burrus, “Digital filter structures described by distributed arithmetic,” IEEE Trans. Circuits Syst., vol. CAS-24, pp. 674–680, Dec. 1977.
7. A. Peled and B. Liu, “A new hardware realization of digital filters,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-22, pp. 456–462, Dec. 1974.
8. D. P. Kolba and T. W. Parks, “A prime factor FFT algorithm using high-speed convolution,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, pp. 281–294, Aug. 1977.
9. C. S. Burrus and P. W. Eschenbacher, “An in-place in-order prime factor FFT algorithm,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-29, pp. 806–817, Aug. 1981.
10. Programs for Digital Signal Processing. New York: IEEE Press, 1979.
11. B. Liu and A. Peled, “A new hardware realization of high speed fast Fourier transforms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-23, pp. 543–547, Dec. 1975.
12. S. Zohar, “Fast hardware Fourier transformation through counting,” IEEE Trans. Comput., vol. C-22, pp. 433–441, May 1973.
13. S. Zohar, “Addendum,” vol. C-23, p. 989, Sept. 1974.
14. C. S. Burrus and T. W. Parks, “Efficient techniques for signal processing,” prepared for the Ballistic Missile Defense Advanced Technol. Cen., Contract DAS60-78-C-0082, June 1979.
15. W. W. Smith, “Swift,” presented at the IEEE Circuits Syst. Symp. Workshop Signal Processing, Houston, TX, Apr. 1980.