Discrete Data Systems

  • R.K. Rao Yarlagadda


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.


Transfer Function Discrete Fourier Transform Digital Filter Filter Design Infinite Impulse Response 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.School of Electrical & Computer EngineeringOklahoma State UniversityStillwaterUSA

Personalised recommendations