DocumentCode
3507392
Title
The Entropy of FPGA Reconfiguration
Author
Malik, Usama ; Diessel, Oliver
Author_Institution
Sch. of Comput. Sci. & Eng.,, New South Wales Univ., Sydney, NSW
fYear
2006
fDate
28-30 Aug. 2006
Firstpage
1
Lastpage
6
Abstract
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 propose using entropy as a gauge of the maximum configuration compression that can be achieved and determine the entropy of a set of 24 benchmark circuits for the Virtex device family. We demonstrate that simple off-the-shelf compression techniques such as Golomb encoding and hierarchical vector compression achieve compression results that are within 1-10% of the theoretical bound. We present an enhanced configuration memory system based on the hierarchical vector compression technique that accelerates reconfiguration in proportion to the amount of compression achieved. The proposed system demands little additional chip area and can be clocked at the same rate as the Virtex configuration clock
Keywords
entropy; field programmable gate arrays; logic CAD; FPGA reconfiguration entropy; Virtex configuration clock; Virtex device; benchmark circuits; configuration compression; enhanced configuration memory system; hierarchical vector compression technique; off-the-shelf compression techniques; Acceleration; Australia Council; Circuits; Clocks; Computer science; Entropy; Field programmable gate arrays; Hardware; Operating systems; Real time systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Field Programmable Logic and Applications, 2006. FPL '06. International Conference on
Conference_Location
Madrid
Print_ISBN
1-4244-0312-X
Type
conf
DOI
10.1109/FPL.2006.311223
Filename
4100985
Link To Document