Sciweavers

502 search results - page 1 / 101
» Learning to Generate Fast Signal Processing Implementations
Sort
View
ICML
2001
IEEE
14 years 5 months ago
Learning to Generate Fast Signal Processing Implementations
A single signal processing algorithm can be represented by many mathematically equivalent formulas. However, when these formulas are implemented in code and run on real machines, ...
Bryan Singer, Manuela M. Veloso
JMLR
2002
117views more  JMLR 2002»
13 years 4 months ago
Learning to Construct Fast Signal Processing Implementations
A single signal processing algorithm can be represented by many mathematically equivalent formulas. However, when these formulas are implemented in code and run on real machines, ...
Bryan Singer, Manuela M. Veloso
ICASSP
2009
IEEE
13 years 8 months ago
Generating high performance pruned FFT implementations
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...
Franz Franchetti, Markus Püschel
IPPS
2002
IEEE
13 years 9 months ago
A SIMD Vectorizing Compiler for Digital Signal Processing Algorithms
Short vector SIMD instructions on recent microprocessors, such as SSE on Pentium III and 4, speed up code but are a major challenge to software developers. We present a compiler t...
Franz Franchetti, Markus Püschel
ISVLSI
2006
IEEE
104views VLSI» more  ISVLSI 2006»
13 years 10 months ago
Adaptive Signal Processing in Mixed-Signal VLSI with Anti-Hebbian Learning
We describe analog and mixed-signal primitives for implementing adaptive signal-processing algorithms in VLSI based on anti-Hebbian learning. Both on-chip calibration techniques a...
Miguel Figueroa, Esteban Matamala, Gonzalo Carvaja...