Abstract
The frequency-domain analysis of signals and systems is efficient, in practice, due to the availability of fast algorithms for the computation of the DFT. While the DFT is defined for any length, practically efficient algorithms are available only for fast computation of the N-point DFT with N an integral power of 2. The algorithms are based on the classical divide-and-conquer strategy of developing fast algorithms. A N-point DFT is recursively decomposed into half-length DFTs, until the DFT becomes trivial. The DFTs of the smaller transforms are combined to form the DFT of the input data. The decomposition can start from the time-domain end or the frequency-domain end. The first type is called decimation-in-time (DIT) algorithms. The second type is called decimation-in-frequency (DIF) algorithms. These algorithms are developed assuming that the data is complex-valued. They can be tailored to suit real-valued data. A set of algorithms are derived and examples of computing the DFT are given.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Sundararajan, D. (2018). Fast Computation of the DFT. In: Fourier Analysis—A Signal Processing Approach. Springer, Singapore. https://doi.org/10.1007/978-981-13-1693-7_10
Download citation
DOI: https://doi.org/10.1007/978-981-13-1693-7_10
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1692-0
Online ISBN: 978-981-13-1693-7
eBook Packages: Computer ScienceComputer Science (R0)