Abstract
Discrete Fourier transform (DFT) is a frequency domain representation of finite-length discrete-time signals. It is also used to represent FIR discrete-time systems in the frequency domain. As the name implies, DFT is a discrete set of frequency samples uniformly distributed around the unit circle in the complex frequency plane that characterizes a discrete-time sequence of finite duration. DFT is also intrinsically related to the DTFT, as we will see in this chapter. Because DFT is a finite set of frequency samples, it is a computational tool to perform filtering and related operations. There is an efficient algorithm known as the fast Fourier transform (FFT) to perform filtering of long sequences, power spectrum estimation, and related tasks. We will learn about the FFT in this chapter as well.
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
References
Ahmed N, Natarajan T, Rao KR (1974) Discrete cosine transform. IEEE Trans on Computers C-23:90–93
Ansari R (1985) An extension of the discrete Fourier transform. IEEE Trans Circuits Sys CAS32:618–619
Bagchi S, Mitra SK (1998) Nonuniform discrete Fourier transform and its signal processing applications. Kluwer Academic Publishers, Norwell
Bellanger M (2000) Digital processing of signals: theory and practice, 3rd edn. Wiley, New York
Blahut RE (1985) Fast algorithms for digital signal processing. Addison-Wesley, Reading
Cochran WT et al (1967) What is the fast Fourier transform. Proc IEEE 55(10):164–174
Cooley JW, Tukey JW (1965) An algorithm for the machine calculation of complex Fourier series. Math Comput 19:297–301
Hadamard J (1893) Resolution d’une question relative aux determinants. Bull Sci Math Ser 2(17) Part I:240–246
Narasimha MJ, Peterson AM (1978) On the computation of the discrete cosine transform. IEEE Trans Comm COM-26(6):934–936
Oraintara S, Chen Y-J, Nguyen TQ (2002) Integer fast Fourier transform. IEEE Trans Signal Process 50:607–618
Author information
Authors and Affiliations
5.1 Supplementary Electronic Material
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Thyagarajan, K.S. (2019). Discrete Fourier Transform. In: Introduction to Digital Signal Processing Using MATLAB with Application to Digital Communications. Springer, Cham. https://doi.org/10.1007/978-3-319-76029-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-76029-2_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-76028-5
Online ISBN: 978-3-319-76029-2
eBook Packages: EngineeringEngineering (R0)