Generation of Digit Reversed Address Sequences for Fast Fourier Transforms

  • Authors:

  • T. C. Choinski;T. T. Tylaska

  • Affiliations:

  • -;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1991

Quantified Score

Hi-index 14.98

Visualization

Abstract

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.