Re: not exactly a linux question, what is FFT

From: Blake Eggemeyer <i.linwin@gmail.com>
Date: Tue Sep 12 2006 - 15:01:48 AKDT

glad to get alot of responses, but what i need is to find out how it actualy
works(even if it is dumbed down)
i know it can be used to multiply large integers faster, and find primes,
but i dont know how its aplied.
http://upload.wikimedia.org/math/5/a/1/5a1bdb3dc1e15ef35045138624ecd6d3.png

looking at the equation from wikipedia, this is my pseudocode
X is an array of N imaginary numbers (a+bi) and O is the out put array

for k=0;k<=N-1;k++
for n=0;n<=N-1;n++
O[k]+=X[n]*e^(-i*2*pi*k*n/N)
endfor
endfor
O=O*1/N

---------
To unsubscribe, send email to <aklug-request@aklug.org>
with 'unsubscribe' in the message body.
Received on Tue Sep 12 15:02:11 2006

This archive was generated by hypermail 2.1.8 : Tue Sep 12 2006 - 15:02:11 AKDT