Sciweavers

245 search results - page 30 / 49
» A Fast Fourier Transform Compiler
Sort
View
ICASSP
2010
IEEE
13 years 8 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...
CORR
2011
Springer
151views Education» more  CORR 2011»
13 years 5 months ago
Generating and Searching Families of FFT Algorithms
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
Steve Haynal, Heidi Haynal
ICFP
1997
ACM
14 years 3 months ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves
CORR
2006
Springer
145views Education» more  CORR 2006»
13 years 11 months ago
Algebraic Signal Processing Theory
In [1], we presented the algebraic signal processing theory, an axiomatic and general framework for linear signal processing. The basic concept in this theory is the signal model d...
Markus Püschel, José M. F. Moura
CASES
2006
ACM
14 years 4 months ago
Code transformation strategies for extensible embedded processors
Embedded application requirements, including high performance, low power consumption and fast time to market, are uncommon in the broader domain of general purpose applications. I...
Paolo Bonzini, Laura Pozzi