论文信息 - On semifast Fourier transform algorithms - 字舞流文

On semifast Fourier transform algorithms

Abstract In this paper, following [1, 2, 3, 4, 5, 6, 7] we consider the relations between well-known Fourier transform algorithms.

Sergei V. Fedorenko

[1] G. Goertzel. An Algorithm for the Evaluation of Finite Trigonometric Series , 1958 .

[2] Richard E. Blahut. Algebraic Codes on Lines, Planes, and Curves: An Engineering Approach , 2008 .

[3] Richard E. Blahut,et al. Fast Algorithms for Digital Signal Processing , 1985 .

[4] Peter Trifonov,et al. A Method for Fast Computation of the Fourier Transform over a Finite Field , 2003, Probl. Inf. Transm..

[5] Sergei V. Fedorenko. A method for computation of the discrete Fourier transform over a finite field , 2006, Probl. Inf. Transm..

[6] R. Blahut. Theory and practice of error control codes , 1983 .

[7] Richard E. Blahut,et al. Algebraic Codes on Lines, Planes, and Curves: Sequences and the One-Dimensional Fourier Transform , 2008 .

[8] Richard C. Singleton,et al. On computing the fast Fourier transform , 1967, Commun. ACM.

[9] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .