Goertzel algorithm
The Goertzel algorithm is a technique in digital signal processing (DSP) for efficient evaluation of the individual terms of the discrete Fourier transform (DFT). It is useful in certain practical applications, such as recognition of dual-tone multi-frequency signaling (DTMF) tones produced by the push buttons of the keypad of a traditional analog telephone. The algorithm was first described by Gerald Goertzel in 1958. The Goertzel algorithm can also be used "in reverse" as a sinusoid synthesis function, which requires only 1 multiplication and 1 subtraction per generated sample.
- Comment
- enThe Goertzel algorithm is a technique in digital signal processing (DSP) for efficient evaluation of the individual terms of the discrete Fourier transform (DFT). It is useful in certain practical applications, such as recognition of dual-tone multi-frequency signaling (DTMF) tones produced by the push buttons of the keypad of a traditional analog telephone. The algorithm was first described by Gerald Goertzel in 1958. The Goertzel algorithm can also be used "in reverse" as a sinusoid synthesis function, which requires only 1 multiplication and 1 subtraction per generated sample.
- Has abstract
- enThe Goertzel algorithm is a technique in digital signal processing (DSP) for efficient evaluation of the individual terms of the discrete Fourier transform (DFT). It is useful in certain practical applications, such as recognition of dual-tone multi-frequency signaling (DTMF) tones produced by the push buttons of the keypad of a traditional analog telephone. The algorithm was first described by Gerald Goertzel in 1958. Like the DFT, the Goertzel algorithm analyses one selectable frequency component from a discrete signal. Unlike direct DFT calculations, the Goertzel algorithm applies a single real-valued coefficient at each iteration, using real-valued arithmetic for real-valued input sequences. For covering a full spectrum, the Goertzel algorithm has a higher order of complexity than fast Fourier transform (FFT) algorithms, but for computing a small number of selected frequency components, it is more numerically efficient. The simple structure of the Goertzel algorithm makes it well suited to small processors and embedded applications. The Goertzel algorithm can also be used "in reverse" as a sinusoid synthesis function, which requires only 1 multiplication and 1 subtraction per generated sample.
- Hypernym
- Technique
- Is primary topic of
- Goertzel algorithm
- Label
- enGoertzel algorithm
- Link from a Wikipage to an external page
- www.embedded.com/design/configurable-systems/4006427/A-DSP-algorithm-for-frequency-analysis
- web.archive.org/web/20180628024641/http:/en.dsplib.org/content/goertzel/goertzel.html
- www.embedded.com/the-goertzel-algorithm
- Link from a Wikipage to another Wikipage
- Aliasing
- Array data type
- Big O notation
- Bluestein's FFT algorithm
- Category:Digital signal processing
- Category:FFT algorithms
- Computational complexity theory
- Digital filter
- Digital signal processing
- Discrete Fourier transform
- Discrete signal
- Dual-tone multi-frequency signaling
- Fast Fourier transform
- Finite impulse response
- Frequency-shift keying
- Gerald Goertzel
- Infinite impulse response
- Marginal stability
- Numerical stability
- Nyquist–Shannon sampling theorem
- Object-oriented programming
- Phase-shift keying
- Pole (complex analysis)
- Pseudocode
- Radian
- Telephone
- Z transform
- Z-transform
- SameAs
- Algorithme de Goertzel
- Algoritmo di Goertzel
- Goertzel algorithm
- Goertzel-Algorithmus
- m.06p92b
- Q1472192
- UsGm
- Алгоритм Гёрцеля
- אלגוריתם גרצל
- 格策爾演算法
- Subject
- Category:Digital signal processing
- Category:FFT algorithms
- Title
- enGoertzel Algorithm
- Url
- goertzel.html
- WasDerivedFrom
- Goertzel algorithm?oldid=1086358955&ns=0
- WikiPageLength
- 19346
- Wikipage page ID
- 2133529
- Wikipage revision ID
- 1086358955
- WikiPageUsesTemplate
- Template:Citation
- Template:Citation needed
- Template:Cleanup
- Template:NumBlk
- Template:Refimprove section
- Template:Reflist
- Template:Short description
- Template:Webarchive
- Template:Which