Skip to Main Content
Fourier Transforms
book

Fourier Transforms

by Eric W. Hansen
September 2014
Intermediate to advanced content levelIntermediate to advanced
776 pages
24h 3m
English
Wiley
Content preview from Fourier Transforms

CHAPTER 3 THE DISCRETE FOURIER TRANSFORM

In the last chapter, it was shown how an arbitrary vector in an N-dimensional space can be represented as a linear combination of N mutually orthogonal basis vectors in that space. In this chapter we consider , the space of N-dimensional complex vectors, and a basis {ϕ0, ϕ1, …ϕN − 1} of complex exponential vectors:

numbered Display Equation

The expansion in this basis of a vector is

numbered Display Equation

and is called the discrete Fourier transform (DFT) of f.

The DFT is the principal computational tool of Fourier analysis and a logical place to begin our study. Being a mapping between finite-dimensional spaces, its mathematics are uncomplicated by questions about convergence of series or integrals. We will derive the basic properties of the DFT, including several theorems that facilitate its application, and develop the fast Fourier transform (FFT) algorithm for computing the DFT. The chapter concludes by introducing a close relative of the DFT, the discrete cosine transform (DCT), which is widely applied in signal compression algorithms such as JPEG.

3.1 SINUSOIDAL SEQUENCES

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Principles of Fourier Analysis, 2nd Edition

Principles of Fourier Analysis, 2nd Edition

Kenneth B. Howell
Engineering Mathematics

Engineering Mathematics

P. Sivaramakrishna Das, C. Vijayakumari
Advanced Mathematics

Advanced Mathematics

Stanley J. Farlow

Publisher Resources

ISBN: 9781118479148Purchase book