Rader's FFT algorithm: Difference between revisions

Revision as of 06:40, 20 December 2007

Revision as of 06:47, 20 December 2007

Line 3:

Since Rader's algorithm only depends upon the periodicity of the DFT kernel, it is directly applicable to any other transform (of prime order) with a similar property, such as a [[number-theoretic transform]] or the [[discrete Hartley transform]].

The algorithm can be modified to handle DFTs of real data (Chu and& Burrus, 1982), in which case the real DFT (RDFT) is re-expressed as two half-size convolutions.

==Algorithm==