By Topic

A New Placement Approach to Minimizing FPGA Reconfiguration Data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Weinan Chen ; Dept. of Comput. & Inf. Technol., Fudan Univ., Shanghai ; Ying Wang ; Xiaowei Wang ; Chenglian Peng

Dynamic reconfiguration for fine-grained architectures is still associated with significant reconfiguration costs. In this paper, a new placement algorithm is proposed to reduce the size of FPGA reconfiguration bitstream. The algorithm is modified on the existing placement algorithm within VPR. It introduces the CLBs configuration of the previous circuit into cost function to increase similarity of CLBs configuration for subsequent circuits at the layout level. By using difference-based partial reconfiguration design flow, the proposed approach is validated by experiments on Xilinx Virtex FPGA platform, and experimental results show that the size of reconfiguration bitstream can be reduced.

Published in:

Embedded Software and Systems, 2008. ICESS '08. International Conference on

Date of Conference:

29-31 July 2008