DocumentCode :
869473
Title :
Overflow analysis of a fixed-point implementation of the Goertzel algorithm
Author :
Beraldin, J-Angelo ; Steenaart, W.
Author_Institution :
Nat. Res. Council of Canada, Ottawa, Ont., Canada
Volume :
36
Issue :
2
fYear :
1989
fDate :
2/1/1989 12:00:00 AM
Firstpage :
322
Lastpage :
324
Abstract :
It is shown that the second-order Goertzel algorithm, though favored over the first-order Goertzel algorithm for its reduced computational complexity, is in fact prone to overflows when implemented in hardware with only fixed-point arithmetic. An overflow analysis reveals that the second-order Goertzel algorithm requires a different scaling factor at each frequency sample to systematically eliminate the possibilities of overflow
Keywords :
computational complexity; fast Fourier transforms; Goertzel algorithm; computational complexity; fixed-point implementation; overflows; scaling factor; second-order; Algorithm design and analysis; Computational complexity; Discrete Fourier transforms; Equations; Filtering algorithms; Fixed-point arithmetic; Frequency; Hardware; Nonlinear filters; Polynomials;
fLanguage :
English
Journal_Title :
Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-4094
Type :
jour
DOI :
10.1109/31.20217
Filename :
20217
Link To Document :
بازگشت