论文信息 - A prime factor FFT algorithm with real valued arithmetic

A prime factor FFT algorithm with real valued arithmetic

A prime factor FFT algorithm involving only real valued arithmetic is devised to compute the discrete Fourier transform of a real sequence. This letter extends an approach proposed by Bracewell.

R. Kumaresan | R. Kumaresan | P.K. Gupta | P.K. Gupta

[1] C. Rader. Discrete Fourier transforms when the number of data samples is prime , 1968 .

[2] I. J. Good,et al. The Relationship Between Two Fast Fourier Transforms , 1971, IEEE Transactions on Computers.

[3] T. Parks,et al. A prime factor FFT algorithm using high-speed convolution , 1977 .

[4] T. Parsons. A winograd-Fourier transform algorithm for real-valued data , 1979 .

[5] R. Bracewell. Discrete Hartley transform , 1983 .

[6] R. Bracewell. The fast Hartley transform , 1984, Proceedings of the IEEE.

[7] Ramdas Kumaresan,et al. Vector-radix algorithm for a 2-D discrete Hartley transform , 1986 .