392 search results - page 6 / 79 » The Entropy of FPGA Reconfiguration |
101
click to vote
FCCM
2000
IEEE
15 years 4 months ago
2000
IEEE
Although run-time reconfigurable systems have been shown to achieve very high performance, the speedups over traditional microprocessor systems are limited by the cost of configur...
ISCAS
2003
IEEE
15 years 5 months ago
2003
IEEE
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
100
click to vote
JUCS
2007
14 years 11 months ago
2007
: This article presents an architecture that encrypts data with the AES algorithm. This architecture can be implemented on the Xilinx Virtex II FPGA family, by applying pipelining ...
101
click to vote
EH
2003
IEEE
15 years 5 months ago
2003
IEEE
Reconfigurable hardware devices make it possible to change the topology of electronic circuits at runtime. Using reconfigurable devices as a platform for Evolvable hardware (EHW) ...
102
click to vote
FCCM
1999
IEEE
15 years 4 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...