By Topic

FPGA technology mapping optimization by rewiring algorithms

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)
Wai-Chung Tang ; Dept. of Comput. Sci. & Eng., Chinese Univ. of Hong Kong, China ; Wing-Hang Lo ; Yu-Liang Wu ; Shih-Chieh Chang

Rewiring algorithms provide a new style of logic transformations by replacing a target wire with its alternative wire while maintaining the functionality of the circuit. In this paper, these algorithms are used to minimize the number of LUTs used to map a given circuit with Flowmap. The proposed approach is to evaluate each alternative wire with Flowmap and choose the first one which can reduce the number of LUTs by 1 or more. Despite its simplicity, it can efficiently transform the circuit to one suitable to be mapped with Flowmap and used in FPGA. Experimental result shows that the proposed approach can reduce up to 17% of the LUTs in a circuit without any depth increment.

Published in:

2005 IEEE International Symposium on Circuits and Systems

Date of Conference:

23-26 May 2005