Next: 6.4.2 The FFT idea
Up: 6.4 FFT
Previous: 6.4 FFT
  Contents
6.4.1 1d Fourier analysis and synthesis
To simplify the presentation, we investigate the Fourier transformation with
an expansion into sinus and cosinus functions
although we have to handle complex coefficients
,
therein.
Denote by
the
tex2html_wrap_inline^th unit root of 1 (in
) then the
matrix of the Fourier transformation
is defined as
![$\displaystyle \ensuremath{{\cal F}}_{n} \;=\; \left\{ \ensuremath{{\cal F}}_{j,...
...ft\{ \omega^{j\cdot k}\right\}_{j,k=\overline{0,n-1} \makebox[0pt]{}} \enspace.$](img791.gif) |
(6.8) |
Together with the normalization
we achieve
- for the Fourier analysis :
- for the Fourier synthesis :
.
Gundolf Haase
2000-03-20