Abstract
This chapter deals with the discrete Fourier transform (DFT). In Sect. 3.1, we show that numerical realizations of Fourier methods, such as the computation of Fourier coefficients, Fourier transforms, or trigonometric interpolation, lead to the DFT. We also present barycentric formulas for interpolating trigonometric polynomials. In Sect. 3.2, we study the basic properties of the Fourier matrix and of the DFT. In particular, we consider the eigenvalues of the Fourier matrix with their multiplicities. Further, we present the intimate relations between cyclic convolutions and the DFT. In Sect. 3.3, we show that cyclic convolutions and circulant matrices are closely related and that circulant matrices can be diagonalized by the Fourier matrix. Section 3.4 presents the properties of Kronecker products and stride permutations, which we will need later in Chap. 5 for the factorization of a Fourier matrix. We show that block circulant matrices can be diagonalized by Kronecker products of Fourier matrices. Finally, Sect. 3.5 addresses real versions of the DFT, such as the discrete cosine transform (DCT) and the discrete sine transform (DST). These linear transforms are generated by orthogonal matrices.
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, K.R.: Discrete cosine transform. IEEE Trans. Comput. 23, 90–93 (1974)
Apostol, T.M.: Introduction to Analytic Number Theory. Springer-Verlag, New York (1976)
Arico, A., Serra-Capizzano, S., Tasche, M.: Fast and numerically stable algorithms for discrete Hartley transforms and applications to preconditioning. Commun. Inf. Syst. 5(1), 21–68 (2005)
Berrut, J.P., Trefethen, L.N.: Barycentric Lagrange interpolation. SIAM Rev. 46(3), 501–517 (2004)
Bracewell, R.N.: The Hartley Transform. Clarendon Press, Oxford University Press, New York (1986)
Briggs, W.L., Henson, V.E.: The DFT. An Owner’s Manual for the Discrete Fourier Transform. SIAM, Philadelphia (1995)
Davis, P.J.: Circulant Matrices. John Wiley and Sons, New York (1979)
Heideman, M.T., Johnson, D.H., Burrus, C.S.: Gauss and the history of the fast Fourier transform. Arch. Hist. Exact Sci. 34(3), 265–277 (1985)
Henrici, P.: Barycentric formulas for interpolating trigonometric polynomials and their conjugates. Numer. Math. 33(2), 225–234 (1979)
Horn, R.A., Johnson, C.R.: Matrix Analysis, second edn. Cambridge University Press, Cambridge (2013)
McClellan, J.H., Parks, T.W.: Eigenvalue and eigenvector decomposition of the discrete Fourier transform. IEEE Trans. Audio Electroacoust. 20(1), 66–74 (1972)
Morton, P.: On the eigenvectors of Schur’s matrix. J. Number. Theory 12(1), 122–127 (1980)
Rao, K.R., Yip, P.: Discrete Cosine Transform: Algorithms, Advantages, Applications. Academic Press, Boston (1990)
Runge, C., König, H.: Vorlesungen über Numerisches Rechnen. Springer-Verlag, Berlin (1924)
Strang, G.: The discrete cosine transform. SIAM Rev. 41(1), 135–147 (1999)
Trefethen, L.N.: Approximation Theory and Approximation Practice. SIAM, Philadelphia (2013)
Wang, Z.: Fast algorithms for the discrete W transform and for the discrete Fourier transform. IEEE Trans. Acoust. Speech Signal Process 32, 803–816 (1984)
Wickerhauser, M.V.: Adapted Wavelet Analysis from Theory to Software. A K Peters, Wellesley (1994)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Plonka, G., Potts, D., Steidl, G., Tasche, M. (2023). Discrete Fourier Transforms. In: Numerical Fourier Analysis. Applied and Numerical Harmonic Analysis. Birkhäuser, Cham. https://doi.org/10.1007/978-3-031-35005-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-031-35005-4_3
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-031-35004-7
Online ISBN: 978-3-031-35005-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)