Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

ERSHOV
2003
Springer

favoriteEmaildiscussreport

101views Theoretical Computer Science» more ERSHOV 2003»

A Polymorphic Radix- n Framework for Fast Fourier Transforms

14 years 4 months ago

A Polymorphic Radix- n Framework for Fast Fourier Transforms

Download sms.cs.chalmers.se

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.

Marcin Zalewski, Sibylle Schupp

Real-time Traffic

ERSHOV 2003 | Fast Fourier Transforms | Monomoporhic Radix-n Algorithms | Polymorphic Framework |

claim paper

Related Content

» Relating FFTW and SplitRadix

» TypeIV DCT DST and MDCT algorithms with reduced numbers of arithmetic operations

» TypeIIIII DCTDST algorithms with reduced number of arithmetic operations

» Cyclic Convolution Algorithm Formulations Using Polynomial Transform Theory

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	ERSHOV
Authors	Marcin Zalewski, Sibylle Schupp

Comments (0)