1108 search results - page 69 / 222 » Algorithm Transformation for FPGA Implementation |
110
Voted
ASPDAC
2001
ACM
15 years 5 months ago
2001
ACM
This paper describes a novel approach to high-level synthesis of complex pipelined circuits, including pipelined circuits with feedback. This approach combines a high-level, modula...
145
Voted
CCGRID
2011
IEEE
14 years 5 months ago
2011
IEEE
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
127
Voted
FPGA
2000
ACM
15 years 5 months ago
2000
ACM
In recent years the application space of reconfigurable devices has grown to include many platforms with a strong need for fault tolerance. While these systems frequently contain ...
130
click to vote
ICMCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We present an implementation of general FFTs for graphics processing units (GPUs). Unlike most existing GPU FFT implementations, we handle both complex and real data of any size t...
127
click to vote
ICCAD
2003
IEEE
15 years 10 months ago
2003
IEEE
Routing for FPGAs has been a very challenging problem due to the limitation of routing resources. Although the FPGA routing problem has been researched extensively, most algorithm...