7 search results - page 1 / 2 » Runlength Compression Techniques for FPGA Configurations |
FCCM
1999
IEEE
13 years 9 months ago
1999
IEEE
The time it takes to reconfigure FPGAs can be a significant overhead for reconfigurable computing. In this paper we develop new compression algorithms for FPGA configurations that...
FPGA
1999
ACM
13 years 9 months ago
1999
ACM
One of the major overheads in reconfigurable computing is the time it takes to reconfigure the devices in the system. The configuration compression algorithm presented in our prev...
FPL
2006
Springer
13 years 9 months ago
2006
Springer
In line with Shannon's ideas, we define the entropy of FPGA reconfiguration to be the amount of information needed to configure a given circuit onto a given device. We propos...
FPL
2008
Springer
13 years 6 months ago
2008
Springer
This paper examines the opportunity of using compression for accelerating the (re)configuration of FPGA devices, focusing on the choice of compression algorithms, and their hardwa...
FCCM
1998
IEEE
13 years 9 months ago
1998
IEEE
One of the major overheads in reconfigurable computing is the time it takes to reconfigure the devices in the system. This overhead limits the speedups possible in this exciting n...