The Discrete Fourier Transform

Tim Olson ()
Additional contact information
Tim Olson: University of Florida, Department of Mathematics

Chapter Chapter 3 in Applied Fourier Analysis, 2017, pp 75-120 from Springer

Abstract: Abstract Fourier Series is a way to represent a function $$f(t) \in L^2[a, b]$$ f ( t ) ∈ L 2 [ a , b ] of a continuous variable t with a countable number of coefficients $$c_k$$ c k . Oftentimes, however, we are interested in representing a finite number of data points $$\{f(t_k)\}_{k=0}^{N-1}$$ { f ( t k ) } k = 0 N - 1 which probably come as samples of a function of a continuous variable t. We may not have enough information to represent the original function, but we would still like to know what its Fourier Transform looks like. We have three primary goals for our discrete Fourier Analysis: (1) having an accurate representation, (2) being able to calculate the representation quickly and easily, and (3) knowing what the coefficients of that representation represent. We will now try to accomplish these goals.

Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4939-7393-4_3

Ordering information: This item can be ordered from
http://www.springer.com/9781493973934

DOI: 10.1007/978-1-4939-7393-4_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().