Basic HTML version of Foils prepared April 22 2000

Foil 6 Discrete Fourier Transform

From Parallel FFT and use in PDE Solvers Computational Science Class CPS615 -- Winter Semester 2000. by Geoffrey C. Fox


Let f be in 1D a typical function defined on a grid and labeled with index m= 0 ... N-1
Let i = sqrt(-1) and index matrices and vectors from 0.
The Discrete Fourier Transform G(f) of an N-element vector f is another vector of length N given by Matrix Vector Multiplication ? f
Where ? is the N*N matrix with matrix elements:
?km = v (-k*m)
and v is:
v = e (2pi/N) = cos(2p/N) + i*sin(2p/N)
This is a complex number with whose Nth power is 1 and is therefore called the Nth root of unity
E.g., for N = 4:
v = 0+1*i, v2 = -1+0*i, v3 = 0-1*i, v4 = 1+0*i,



© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Mon Apr 24 2000