Basic HTML version of Foils prepared April 22 2000

Foil 18 What's Going On with DIT/DIF I

From Parallel FFT and use in PDE Solvers Computational Science Class CPS615 -- Winter Semester 2000. by Geoffrey C. Fox
DIT and DIF have identical computational complexity analyses at the superficial level we did so far
  • We will see some important features when we analyze where the data is stored and issues of good cache use and parallelism
First we will discuss a way of thinking about binary FFT's which will make the future discussion much clearer
Critical idea is to represent indices by their binary representation shown below as d digit words for k and m:
e.g.
k as a binary word
m as a binary word

© 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