Sciweavers

14 search results - page 2 / 3
» Memory Saving Discrete Fourier Transform on GPUs
Sort
View
ICS
2009
Tsinghua U.
13 years 11 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...
SIPS
2008
IEEE
13 years 11 months ago
Efficient image reconstruction using partial 2D Fourier transform
In this paper we present an efficient way of doing image reconstruction using the 2D Discrete Fourier transform (DFT). We exploit the fact that in the frequency domain, informati...
Lanping Deng, Chi-Li Yu, Chaitali Chakrabarti, Jun...
PACT
2009
Springer
13 years 11 months ago
Parallel FFT with Eden Skeletons
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
Jost Berthold, Mischa Dieterle, Oleg Lobachev, Rit...
CORR
2007
Springer
79views Education» more  CORR 2007»
13 years 4 months ago
Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
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...
Xuancheng Shao, Steven G. Johnson
ICASSP
2010
IEEE
13 years 2 months ago
Bandwidth-intensive FPGA architecture for multi-dimensional DFT
Multi-dimensional (MD) Discrete Fourier Transform (DFT) is a key kernel algorithm in many signal processing algorithms, including radar data processing and medical imaging. Althou...
Chi-Li Yu, Chaitali Chakrabarti, Sungho Park, Vija...