``Proof of Euler's Identity'' derives Euler's identity
in detail. This is an important tool for working with complex
numbers, and one of the critical elements of the DFT definition we
need to understand.
``Geometric Signal Theory'' provides an introduction to
vector spaces, inner products, orthogonality, projection of one signal
onto another, norms, and elementary vector space operations. In this
setting, the DFT can be regarded as a change of coordinates from one
basis set (shifted impulses) to another (sinusoids at different
frequencies).
``The DFT Derived'' derives the DFT as a projection of a
length signal onto the set of sampled complex
sinusoids generated by the th roots of unity.
``Example Applications of the DFT'' illustrates
practical FFT analysis in Matlab
and Octave (an open-source
matlab) through a series of examples. The various Fourier theorems of
the preceding chapter provide a ``thinking vocabulary'' for
understanding these applications.
Elementary and supporting information is provided in a series of
appendices. Topics include introductions to sampling theory, Taylor
series expansions, logarithms, decibels, digital audio number systems,
matrices, round-off noise, Fourier series, and continuous-time Fourier
theorems, such as the similarity and differentiation theorems. As a
segue to computer-based approaches, a well used Fast Fourier Transform
(FFT) algorithm is derived. Finally, various software examples in the
Matlab (or Octave) programming language are presented.
This book is first in a series of course readers for my
signal processing courses at CCRMA: