Abstract
The DFT and IDFT can be defined as follows.
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
Notes
- 1.
See problem 2.21(a).
References
H.J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms (Springer-Verlag, Heidelberg, Germany, 1981)
A.K. Jain, Fundamentals of Digital Image Processing (Prentice-Hall, Englewood Cliffs, NJ, 1989)
K.R. Rao, P.C. Yip (eds.), The Transform and Data Compression Handbook (CRC Press, Boca Raton, FL, 2001)
M. Borgerding, Turning overlap-save into a multiband mixing, downsampling filter bank. IEEE SP Mag. 23, 158–161 (Mar. 2006)
B.R. Hunt, A matrix theory proof of the discrete convolution theorem. IEEE Audio Electroacoustics 19, 285–288 (Dec. 1971)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Rao, K.R., Kim, D.N., Hwang, J.J. (2010). Discrete Fourier Transform. In: Fast Fourier Transform - Algorithms and Applications. Signals and Communication Technology. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-6629-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4020-6629-0_2
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-6628-3
Online ISBN: 978-1-4020-6629-0
eBook Packages: EngineeringEngineering (R0)