I want to implement a Fast Fourier Transform algorithm with MapReduce. I know of a recursive-FFT algorithm but I need your guideline in order to implement it using a Map/Reduce approach.
Any suggestions/references?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I want to implement a Fast Fourier Transform algorithm with MapReduce. I know of a recursive-FFT algorithm but I need your guideline in order to implement it using a Map/Reduce approach.
Any suggestions/references?
The basic idea that we can use some theorems to divide problem into subproblems.
In case of Fourier Transfom, problem is standard definition of FT:
After applying Cooley–Tukey FFT algorithm we can split it to two subproblems:
Moving forward with that transfomation, theoretically it could be solved with parallel programming.
Maybe, you’ll find following links useful:
for Multiplying Terabit Integers