Don't Care discovery for FPGA configuration compression
Authors:
Open Access
- 1 February 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 91-98
Abstract
One of the major overheads in reconfigurabl e computing is the time it takes to reconfigure the devices in the system. The configuration compression algorithm presented in our previous paper (Hauck98c) is one efficient technique for reducing this overhead. In this paper, we develop an algorithm for finding Don't Care bits in configuration s to improve the compatibility of the configuration data. With the help of the Don't Cares, higher configuration compression ratios can be achieved by using our modified configuration compression algorithm. This improves compression ratios of a factor of 7, where our original algorithm only achieved a factor of 4. 1. Configuration CompressionKeywords
This publication has 4 references indexed in Scilit:
- Configuration compression for the Xilinx XC6200 FPGAIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1999
- The roles of FPGAs in reprogrammable systemsProceedings of the IEEE, 1998
- Configuration prefetch for single context reconfigurable coprocessors1998
- Sequencing run-time reconfigured hardware with software1996