论文信息 - New Algorithms for Computing a Single Component of the Discrete Fourier Transform

New Algorithms for Computing a Single Component of the Discrete Fourier Transform

This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general, than the well known Goertzel Algorithm.

Ricardo M. Campello de Souza | Hélio Magalhães de Oliveira | Gilson Jerônimo da Silva

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

[2] W. Steenaart,et al. Overflow analysis of a fixed-point implementation of the Goertzel algorithm , 1989 .

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

[4] David Burton,et al. Elementary Number Theory: Fourth Edition , 1997 .

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

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

[7] Alan V. Oppenheim,et al. Discrete-time Signal Processing. Vol.2 , 2001 .

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

[9] A. Dempster,et al. Finite-precision Goertzel filters used for signal tone detection , 2001 .

[10] R. McEliece. Finite Fields for Computer Scientists and Engineers , 1986 .