Abstract
In the last chapter we have discussed the concepts of discrete Fourier transforms (DFTs). In this chapter we will briefly review these and discuss its fast implementations. There are several algorithms that come under the topic-fast Fourier transforms (FFTs). The first FFTmethod of computing the DFT was developed by Cooley and Tukey (1965).These are innovative and useful in the signal processing area.
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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Yarlagadda, R.R. (2010). Discrete Data Systems. In: Analog and Digital Signals and Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-0034-0_9
Download citation
DOI: https://doi.org/10.1007/978-1-4419-0034-0_9
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-0033-3
Online ISBN: 978-1-4419-0034-0
eBook Packages: EngineeringEngineering (R0)