论文信息 - Minimum multiplicative complexity algorithm for computing a single component of the discrete Fourier transform - 字舞流文

Minimum multiplicative complexity algorithm for computing a single component of the discrete Fourier transform

A new algorithm for computing a single component of the discrete Fourier transform is presented. The algorithm, which is optimum in the sense that it requires the minimum number of multiplications, is based on the cyclotomic basis decomposition.

Ricardo M. Campello de Souza | Gilson Jerônimo da Silva

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

[2] Alan V. Oppenheim,et al. Discrete-Time Signal Pro-cessing , 1989 .

[3] S. A. Gonzalez,et al. Implementation of a novel synchronization method using Sliding Goertzel DFT , 2007, 2007 IEEE International Symposium on Intelligent Signal Processing.

[4] Don H. Johnson,et al. Gauss and the history of the fast Fourier transform , 1984, IEEE ASSP Magazine.

[5] R. Blahut. Fast Algorithms for Signal Processing , 2010 .

[6] Michael T. Heideman. Multiplicative complexity, convolution, and the DFT , 1988 .

[7] S. Winograd. Arithmetic complexity of computations , 1980 .

[8] David Burton. Elementary Number Theory , 1976 .

[9] Joe F. Chicharo,et al. A sliding Goertzel algorithm , 1996, Signal Process..