We now consider the vector space of all complex-valued periodic functions on the integers with period b. It turns out that every such function a(n) on the integers can be written as a polynomial in the bth root of unity ξn := e2πin/b. Such a representation for a(n) is called a finite Fourier series. Here we develop the finite Fourier theory using rational functions and their partial fraction decomposition. We then define the Fourier transform and the convolution of finite Fourier series, and show how one can use these ideas to prove identities on trigonometric functions, as well as find connections to the classical Dedekind sums.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2007). Finite Fourier Analysis. In: Computing the Continuous Discretely. Springer, New York, NY. https://doi.org/10.1007/978-0-387-46112-0_7
Download citation
DOI: https://doi.org/10.1007/978-0-387-46112-0_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-29139-0
Online ISBN: 978-0-387-46112-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)