Discrete Fourier transforms when the number of data samples is prime
- 1 June 1968
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 56 (6) , 1107-1108
- https://doi.org/10.1109/proc.1968.6477
Abstract
The discrete Fourier transform of a sequence of N points, where N is a prime number, is shown to be essentially a circular correlation. This can be recognized by rearranging the members of the sequence and the transform according to a rule involving a primitive root of N. This observation permits the discrete Fourier transform to be computed by means of a fast Fourier transform algorithm, with the associated increase in speed, even though N is prime.Keywords
This publication has 0 references indexed in Scilit: