456 search results - page 1 / 92 » Generating high performance pruned FFT implementations |
ICASSP
2009
IEEE
13 years 8 months ago
2009
IEEE
We derive a recursive general-radix pruned Cooley-Tukey fast Fourier transform (FFT) algorithm in Kronecker product notation. The algorithm is compatible with vectorization and pa...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
This paper proposes an ultra low energy FFT processor suitable for sensor applications. The processor is based on R4MDC but achieves full utilization of computational elements. It...
HPCC
2007
Springer
13 years 10 months ago
2007
Springer
Computing ”in-place and in-order”FFT poses a very difficult problem on hierarchical memory architectures where data movement can seriously degrade the performance. In this pape...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper, we propose a systemic approach for synthesizing field-programmable gate array (FPGA) implementations of fast Fourier transform (FFT) computations. Our approach cons...
ICS
2007
Tsinghua U.
13 years 10 months ago
2007
Tsinghua U.
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...