Abstract
As was defined in a previous chapter, the discrete Fourier transform (DFT) is the sampled version of the discrete-time Fourier transform (DTFT), with a finite number of samples taken around the unit circle in the Z-domain. DFT is very useful in the analysis of discrete-time signals and linear time-invariant discrete-time systems. It is, therefore, necessary to determine the computational complexity in performing an N-point DFT of a sequence so that we may be able to come up with a more efficient computational algorithm. To this end, let us first evaluate the computational complexity of computing an N-point DFT using brute-force method. Consider an N-point discrete-time sequence {x[n]}, 0 ≤ n ≤ N − 1, N ∈ Z. Its DFT is given by
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 Comput C-23:90–93
Allen JB, Rabiner LR (1977) A unified approach to short-term Fourier analysis and synthesis. Proc IEEE 65:1558–1564
Bergland G (1969) Fast Fourier transform hardware implementations – an overview. IEEE Trans Audio Electroacoustics AU-17
Blahut RE (1985) Fast algorithms for digital signal processing. Addison-Wesley, Reading
Bongiovanni G, Corsini P, Forsini G (1976) One-dimensional and two-dimensional generalized discrete Fourier transform. IEEE Trans Acoust Speech Signal Process ASSP-24:97–99
Burrus CS (1977) Index mappings for multidimensional formulation of the DFT and convolution. IEEE Trans Acoust Speech Signal Process ASSP-25:239–242
Burrus CS (1988) Unscrambling for fast DFT algorithms. IEEE Trans Acoust Speech Signal process ASSP-36(7)
Chen C-T (2001) Digital signal processing: spectral computation and filter design. Oxford University Press, New York
Cooley JW, Tukey JW (1965) An algorithm for the machine calculation of complex Fourier series. Math Comput 19:297–301
Duhamel P (1986) Implementation of “split-radix” FFT algorithms for complex, real, and real-symmetric data. IEEE Trans Acoust Speech Signal Process ASSP-34:285–295
Evans D (1987) An improved digit-reversal permutation algorithm for the fast fourier and Hartley transforms. IEEE Trans Acoust Speech Signal Process ASSP-35(8)
Jacobson E, Lyons R (2003) The sliding DFT. IEEE Signal Process Mag 20:74–80
Kaiser JF (1980) On a simple algorithm to calculate the “energy” of a signal. Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, Albuquerque, pp 381–384
Kolba DP, Parks TW (1977) A prime factor FFT algorithm using high speed convolution. IEEE Trans Acoust Speech Signal Process 25:281–294
Malvar H, Hallapuro A, Karczezwicz M, Kerofsky L (2002) Low-complexity transform and quantization with 16-bit arithmetic for H.26L. Proceedings of the IEEE International Conference on Image Processing, pp. II-489–II-4924
Mar A (ed) (1992) Digital signal processing applications using the ADSP-2100 family. Prentice Hall, Englewood Cliffs
Marple SL Jr (1987) Digital spectral analysis with applications. Prentice Hall, Englewood Cliffs
Nawab SH, Quatieri TF (1988) Chapter 6: Short-time Fourier transform. In: Lim JS, Oppenheim AV (eds) Advanced topics in signal processing. Prentice Hall, Englewood Cliffs
Rabiner LR, Schafer RW, Rader CM (1969) The chirp-z transform algorithm. IEEE Trans Audio Electroacoustics AU-17:86–92
Regalia PA, Mitra SK, Fadavi-Ardekani J (1987) Implementation of real coefficient digital filters using complex arithmetic. IEEE Trans Circuits Sys CAS-34:345–353
Rodriguez JJ (1989) An improved FFT digit-reversal algorithm. IEEE Trans on Acoust Speech Signal Process ASSP-37(8)
Sorenson HV, Jones DL, Heideman MT, Burrus CS (June 1987) Real-valued fast Fourier transform algorithms. IEEE Trans Acoust Speech Signal Process ASSP-35(6)
Welch PD (1967) The use of fast Fourier transform for the estimation of power spectra: a method based on time averaging over short modified periodograms. IEEE Trans Audio Electroacoustics AU-15:70–73
Author information
Authors and Affiliations
9.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). Fast 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_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-76029-2_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-76028-5
Online ISBN: 978-3-319-76029-2
eBook Packages: EngineeringEngineering (R0)