From the algorithm complexity point of view It is well-known that a radix-4 FFT is better than a radix-2 FFT, a radix-8 FFT is better than a radix-4, and a radix-16 is better than a radix-8 FFT algorithm.

Has anyone tried out and measured the final execution times after rearranging the output data in its initial order? Is radix-2 really better than radix-4 and if so, how much better it is?

More Reiner Creutzburg's questions See All
Similar questions and discussions