Sciweavers

187 search results - page 10 / 38
» Alternatives to the discrete fourier transform
Sort
View
FP
1989
124views Formal Methods» more  FP 1989»
14 years 18 days ago
Deriving the Fast Fourier Algorithm by Calculation
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
Geraint Jones
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
11 years 11 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
ICS
2009
Tsinghua U.
14 years 3 months ago
Computer generation of fast fourier transforms for the cell broadband engine
The Cell BE is a multicore processor with eight vector accelerators (called SPEs) that implement explicit cache management through direct memory access engines. While the Cell has...
Srinivas Chellappa, Franz Franchetti, Markus P&uum...
TSP
2010
13 years 3 months ago
Algebraic signal processing theory: sampling for infinite and finite 1-D space
We derive a signal processing framework, called space signal processing, that parallels time signal processing. As such, it comes in four versions (continuous/discrete, infinite/fi...
Jelena Kovacevic, Markus Püschel
CORR
2007
Springer
93views Education» more  CORR 2007»
13 years 8 months ago
Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations
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...
Xuancheng Shao, Steven G. Johnson