We will look into details of Fourier transformation elsewhere.
Here we use it as an example of any operator containing complex numbers.
For now, we can think of Fourier transform as a square matrix .We denote the complex-conjugate transpose (or **adjoint**) matrix
with a prime,
i.e., .The adjoint arises naturally whenever we consider energy.
The statement that Fourier transforms conserve energy is
where .Substituting gives which shows that
the inverse matrix to Fourier transform
happens to be the complex conjugate of the transpose of .

With Fourier transforms,
**zero pad**ding and **truncation** are particularly prevalent.
Most programs transform a dataset of length of 2^{n},
whereas dataset lengths are often of length .The practical approach is therefore to pad given data with zeros.
Padding followed by Fourier transformation can be expressed in matrix algebra as

(5) |

(6) |

10/21/1998