Discrete Fourier transforms when the number of data samples is prime
暂无分享,去创建一个
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.
[1] Thomas G. Stockham,et al. High-speed convolution and correlation , 1966, AFIPS '66 (Spring).
[2] Peter D. Welch,et al. Fast Fourier Transform , 2011, Starting Digital Signal Processing in Telecommunication Engineering.