5 search results - page 1 / 1 » A Polymorphic Radix- n Framework for Fast Fourier Transforms |
ERSHOV
2003
Springer
13 years 10 months ago
2003
Springer
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 framew...
ICESS
2004
Springer
13 years 10 months ago
2004
Springer
Recent work showed that staging and abstract interpretation can be used to derive correct families of combinatorial circuits, and illustrated this technique with an in-depth analys...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DST-IV), as well as for the modified discrete cosine transform (MDCT) and it...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additi...
JCP
2007
13 years 4 months ago
2007
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...