Sciweavers

392 search results - page 6 / 79
» The Entropy of FPGA Reconfiguration
Sort
View
197
Voted
FCCM
2000
IEEE
133views VLSI» more  FCCM 2000»
15 years 12 months ago
Configuration Caching Management Techniques for Reconfigurable Computing
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...
Zhiyuan Li, Katherine Compton, Scott Hauck
191
Voted
ISCAS
2003
IEEE
116views Hardware» more  ISCAS 2003»
16 years 21 days ago
Using FPGAs to solve the Hamiltonian cycle problem
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...
Micaela Serra, Kenneth B. Kent
205
Voted
JUCS
2007
102views more  JUCS 2007»
15 years 7 months ago
The Use of Runtime Reconfiguration on FPGA Circuits to Increase the Performance of the AES Algorithm Implementation
: 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 ...
Oscar Pérez, Yves Berviller, Camel Tanougas...
206
Voted
EH
2003
IEEE
138views Hardware» more  EH 2003»
16 years 21 days ago
Implementing Evolution of FIR-Filters Efficiently in an FPGA
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) ...
Knut Arne Vinger, Jim Torresen
185
Voted
FCCM
1999
IEEE
134views VLSI» more  FCCM 1999»
15 years 11 months ago
Runlength Compression Techniques for FPGA Configurations
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...
Scott Hauck, William D. Wilson