This Article 
 Bibliographic References 
 Add to: 
Generation of Digit Reversed Address Sequences for Fast Fourier Transforms
June 1991 (vol. 40 no. 6)
pp. 780-784

The hardware design of a circuit capable of producing digit reversed sequences for radix-2, radix-4, and mixed radix-2/4 fast Fourier transform (FFT) algorithms is presented in detail. The design requires selectively routing the output of a binary counter to the output address pointer used during the execution of the FFT. The digit reversed counter is capable of generating address sequences for fast sequences for fast Fourier transforms varying in size from 4 to 64 K data points.

[1] F. W. Thies, "Method and apparatus for reordering data," U. S. Patent 3,731,284, May 1, 1973.
[2] M. J. Collins and M. T. S. Ching, "Bit reversing apparatus," U.S. Patent 4,181,976, Jan. 1, 1980.
[3] D. Quong and R. Perlman, "One chip sequencer shapes up addressing for large FFTs,"Electron. Design, July 12, 1984.
[4] A. V. Oppenheim and R. W. Schafer,Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
[5] R. C. Singleton, "An algorithm for computing the mixed radix fast Fourier transform,"IEEE Trans. Audio Electroacoust., vol. AU-17, no. 1, June 1969.
[6] R. R. Shively, "Architecture of a programmable digital signal processor,"IEEE Trans. Comput., vol. C-31, no. 1, Jan. 1982.
[7] T. C. Choinski and T. T. Tylaska, "An improved FFT for a four parallel pipe SIMD arithmetic processor," Naval Underwater Systems Center Tech. Rep. 7363, May 1985.

Index Terms:
digit reversed address sequences generation; fast Fourier transforms; hardware design; radix-2; radix-4; binary counter; address sequences; computerised signal processing; fast Fourier transforms.
T.C. Choinski, T.T. Tylaska, "Generation of Digit Reversed Address Sequences for Fast Fourier Transforms," IEEE Transactions on Computers, vol. 40, no. 6, pp. 780-784, June 1991, doi:10.1109/12.90256
Usage of this product signifies your acceptance of the Terms of Use.