318 search results - page 7 / 64 » Learning to Construct Fast Signal Processing Implementations |
ICASSP
2009
IEEE
15 years 3 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...
115
click to vote
VTS
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper presents an improved method to accurately estimate signal probabilities using ordered partial decision diagrams (OPDDs) [Kodavarti 93] for partial representation of the...
DATE
2009
IEEE
15 years 6 months ago
2009
IEEE
Reconfigurable Architectures are good candidates for application accelerators that cannot be set in stone at production time. FPGAs however, often suffer from the area and perfor...
ICASSP
2010
IEEE
14 years 11 months ago
2010
IEEE
Numerous MCFI methods have been proposed to increase the frame rate in the past ten years. However, these methods usually focus on how to double the frame rate and involve complex...
ESANN
2008
15 years 1 months ago
2008
In this paper we present an original neighborhood mechanism for WTM self-organizing Kohonen map implemented in CMOS 0.18 m process. Proposed mechanism is an asynchronous circuit an...