Unscrambling for Fast DFT Algorithms

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 36, Issue 7, 1988, Pages 1086-1087

  Burrus, C S ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SIGNAL PROCESSING - DIGITAL TECHNIQUES;

COOLEY-TUKEY FAST FOURIER TRANSFORM; PRIME FACTOR ALGORITHMS (PFA); UNSCRAMBLER REMOVAL;

MATHEMATICAL TRANSFORMATIONS;

EID: 0024050721     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/29.1631     Document Type: Article

References (18)

1. C. S. Burrus and T. W. Parks, DFT/FFT and Convolution Algorithms. New York: Wiley. 1985.
2. C. S. Burrus, “Bit-reversed unscrambling for a radix-2” FFT.” in Proc. ICASSP ’87, Dallas, TX. Apr. 1987, pp. 1809–1810.
3. G. D. Bergland, ’’Fast Fourier transform algorithms,” in Programs for Digital Signal Processing. New York: IEEE Press, 1979.
4. 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.
5. P. Duhamel and H. Hollmann, ’’Split radix FFT algorithm,” Electron. Lett., vol. 20, 14–16, Jan. 1984.
6. H. V. Sorensen, M. T. Heideman, and C. S. Burrus, “On calculating the split radix FFT,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 152–156, Feb. 1986.
7. R. Bracewell, The Hartley Transform. Oxford, England: Oxford Press, 1985, ch. 4.
8. H. V. Sorensen, D. L. Jones, C. S. Burrus, and M. T. Heideman, “On calculating the discrete Hartley transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-33, pp. 1231–1238, Oct. 1985.
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. H. W. Johnson and C. S. Burrus, “Structures of DFT algorithms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-33, pp. 248–254, Feb. 1985.
11. J. H. Rothweiler, “Implementation of the in-order prime factor transform for variable sizes,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-30, pp. 105–107, Feb. 1982.
12. L. R. Rabiner and B. Gold, Theory and Application of Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975, ch. 6. 10, 365, 578.
13. L. R. Morris, Digital Signal Processing Software, 3rd ed. Toronto: DSPSW, 1985, pp. 1–16.
14. D. M. W. Evans, “An improved digit-reversed permutation algorithm for the fast Fourier and Hartley transforms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, pp. 1120–1125, Aug. 1987.
15. J. K. Beard, “An in-place self reordering FFT,” in Proc. ICASSP’78, Tulsa, OK, Apr. 1978, pp. 632–633.
16. H. W. Johnson and C. S. Burrus, “An in-place, in-order radix-2 FFT,” in Proc. ICASSP’84, San Diego, CA. Mar. 1984, 28A.2.
17. G. Jayasumana and C. M. Loeffler, “Searching for the best FFT algorithms.” in Proc. ICASSP’87, Dallas, TX, Apr. 1987, pp. 2408–2411.
18. H. W. Johnson and C. S. Burrus, “New organizations for the DFT,” in Proc. Asilomar Conf. Circuits, Syst., Comput., Pacific Grove, CA, Nov. 1981, pp. 82–87.