Next: An Example
Up: fourier
Previous: The function and orthogonal
The summation expression for DFT
can also be written more conveniently as a matrix-vector multiplication:
and
It is obvious that the complexity of 1D DFT takes is
, which, as we
will see later, can be reduced to
by Fast Fourier Transform
(FFT) algorithms.
These matrix-vector multiplications can be represented more concisely as:
and
where both
and
are
column (vertical) vectors:
and
is an
matrix:
where
is an element in the mth row and nth column of matrix
and
is its complex conjugate:
Obviously
is symmetric (
)
but
is not Hermitian:
is a unitary matrix,
because its rows (or columns) are orthogonal:
This is because:
The DFT pair can be rewritten as:
See additional geometric explanation
of unitary/orthogonal transform.
Next: An Example
Up: fourier
Previous: The function and orthogonal
Ruye Wang
2009-12-31