A Polymorphic Radix- n Framework for Fast Fourier Transforms

We provide a polymorphic framework for radix-n Fast Fourier Transforms (FFTs) where all known kinds of monomoporhic radix-n algorithms can be obtained by specialization. The framework is mathematically based on the Cooley-Tukey mapping, and implemented as a C++ template meta-program. Avoiding run-time overhead, all specializations are performed statically.

• Type: Conference
• Year: 2003
• Where: ERSHOV
• Authors: Marcin Zalewski, Sibylle Schupp
• Keywords: ERSHOV 2003, Fast Fourier Transforms, Monomoporhic Radix-n Algorithms, Polymorphic Framework