Publications
Filtered as:
all types
- all years
- all authors
- keyword:
Fast algorithms
Sorted by:
keyword - year
Corresponding
bibtex list
Fast algorithms
2013
- Jörn Schumacher
High Performance Sparse Fast Fourier Transform
Master thesis, Computer Science, ETH Zurich, Switzerland, 2013
2010
- Srinivas Chellappa
Computer Generation of Fourier Transform Libraries for Distributed Memory Architectures
PhD. thesis, Electrical and Computer Engineering, Carnegie Mellon University, 2010
2009
- Yevgen Voronenko and Markus Püschel
Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for Real DFTs
IEEE Transactions on Signal Processing, Vol. 57, No. 1, pp. 205-222, 2009
- Franz Franchetti, Markus Püschel, Yevgen Voronenko, Srinivas Chellappa and José M. F. Moura
Discrete Fourier Transform on Multicores: Algorithms and Automatic Implementation
IEEE Signal Processing Magazine, special issue on ``Signal Processing on Platforms with Multiple Cores'', Vol. 26, No. 6, pp. 90-102, 2009
- Franz Franchetti and Markus Püschel
Generating High-Performance Pruned FFT Implementations
Proc. International Conference on Acoustics, Speech, and Signal Processing (ICASSP), pp. 549-552, 2009
2008
- Markus Püschel and José M. F. Moura
Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
IEEE Transactions on Signal Processing, Vol. 56, No. 4, pp. 1502-1521, 2008
2006
- Yevgen Voronenko and Markus Püschel
Algebraic Derivation of General Radix Cooley-Tukey Algorithms for the Real Discrete Fourier Transform
Proc. International Conference on Acoustics, Speech, and Signal Processing (ICASSP), Vol. 3, 2006
2003
- Markus Püschel
Cooley-Tukey FFT like Algorithms for the DCT
Proc. International Conference on Acoustics, Speech, and Signal Processing (ICASSP), Vol. 2, pp. 501-504, 2003
- Markus Püschel and José M. F. Moura
The Algebraic Approach to the Discrete Cosine and Sine Transforms and their Fast Algorithms
SIAM Journal of Computing, Vol. 32, No. 5, pp. 1280-1316, 2003
