Wikipedia lists a number of different FFT algorithms:

Cooley–Tukey FFT algorithm, Prime-factor FFT algorithm, Bruun's FFT algorithm, Rader's FFT algorithm, and Bluestein's FFT algorithm

What are the pros and cons of each algorithms? (think about: computational expense, parallelizability, ease of implementation, etc.) And which ones are preferred for which applications?


closed as not constructive by datageist May 3 '13 at 21:10

As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance. If this question can be reworded to fit the rules in the help center, please edit the question.

migrated from scicomp.stackexchange.com May 3 '13 at 14:24

This question came from our site for scientists using computers to solve scientific problems.

Browse other questions tagged or ask your own question.