Abstract
We have seen that the FFT allows one to calculate the DFT of an N-term sequence in O(N ln(N)) steps. As calculating a single element of the DFT requires O(N) steps, it is clear that when one does not need too many elements of the DFT, one is best off calculating individual elements, and not the entire sequence. In this chapter, we present a simple algorithm—the Goertzel algorithm—for calculating individual elements of the DFT.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag London Limited
About this chapter
Cite this chapter
(2008). The Goertzel Algorithm. In: Digital Signal Processing. Signals and Communication Technology. Springer, London. https://doi.org/10.1007/978-1-84800-119-0_30
Download citation
DOI: https://doi.org/10.1007/978-1-84800-119-0_30
Publisher Name: Springer, London
Print ISBN: 978-1-84800-118-3
Online ISBN: 978-1-84800-119-0
eBook Packages: EngineeringEngineering (R0)