FFT Algorithm

Discuss all kind of algorithms and data structures from their mathematical and programming sides.

Moderators: Darobat, RecursiveS, Dante Shamest, Bugdude, Wizard

FFT Algorithm

Postby iPod » Wed Mar 09, 2005 4:29 pm

Hey all,
I have to muliply two vector of vectors with eachother using the FFT algorithm. I have already constructed the vectors...but my question is regarding the FFT algorithm. Can anyone please point me in the right direction?? Is there anyone here who knows anything about it??

any help given will be much appreciated.
:lol:
User avatar
iPod
 
Posts: 73
Joined: Wed Mar 09, 2005 4:25 pm
Location: London, UK

Postby Corsix » Wed Mar 09, 2005 4:37 pm

Try links #2 and 6 from Google:FFT
Code: Select all
#include <stdio.h>
char*_="XxTIHRCXCxTIHRXRCxTIHXHRCxTIXIHRCxTXTIHRCxXxTIHRCX";
int main(int l){for(l+=7;l!=putchar(010);++l);if(*(++_))main
(*_!=88?(putchar(*_^073)|putchar(33))&1:0xffff2a8b);}
User avatar
Corsix
 
Posts: 1181
Joined: Fri Jul 23, 2004 9:33 am
Location: Berkeley, UK


Return to Algorithms & Data Structures

Who is online

Users browsing this forum: No registered users and 0 guests