Rader's FFT algorithm: Difference between revisions

Revision as of 17:55, 6 May 2004

Revision as of 18:50, 30 May 2004

Line 30:

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]].

'''==References:'''==

----

'''References:'''

* C. M. Rader, "Discrete Fourier transforms when the number of data samples is prime," ''Proc. IEEE'' '''56''', 1107–1108 (1968).