A Novel Approach to Minimizing Reconfiguration Cost for LUT-Based FPGAs

Authors:
Krishna Prasad Raghuraman;Haibo Wang;Spyros Tragoudas
Affiliations:
Southern Illinois University;Southern Illinois University;Southern Illinois University
Venue:
VLSID '05 Proceedings of the 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design
Year:
2005

Citing 0
Cited 3

Maximum edge matching for reconfigurable computing

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A dynamically reconfigurable communication architecture for multicore embedded systems

Journal of Systems Architecture: the EUROMICRO Journal
Placing multimode streaming applications on dynamically partially reconfigurable architectures

International Journal of Reconfigurable Computing - Special issue on Selected Papers from the International Conference on Reconfigurable Computing and FPGAs (ReConFig'10)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a novel approach to reducing the size of FPGA reconfiguration bitstreams by fixing appropriate orders for LUT inputs. With such LUT input orders, memory locations that need to be altered during partial reconfiguration are relocated into common frames. We present a novel problem formulation that relates the number of frames (that need to be downloaded into FPGAs) to the number of minterms of a specially constructed logic function. A heuristic procedure is developed to solve the formulated problem in polynomial time. The proposed methodology is validated by experiments conducted on Xilinx Virtex FPGA platform. Considerable reduction on the size of reconfiguration bitstreams have been observed from our experimental results.