By Topic

Extended compatibility path based hardware binding algorithm for area-time efficient designs

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)
Dhawan, U. ; Centre for High Performance Embedded Syst., Nanyang Technol. Univ., Singapore, Singapore ; Sinha, S. ; Siew-Kei Lam ; Srikanthan, T.

Hardware binding is a crucial step in high-level synthesis. In this paper we propose a path based hardware binding algorithm to create area-time efficient designs. The algorithm performs simultaneous FU and register binding based on weighted and ordered compatibility graphs. The proposed algorithm tries to reduce interconnects in the design by exploiting flow dependencies in the DFG, leading to area reduction. The algorithm has been successfully implemented within a C to RTL framework. Experimental results on a set of commonly used benchmarks show that the proposed algorithm is able to achieve significant reductions in routing resources, area and delay when compared to the weighted bipartite matching(WBM) algorithm and the compatibility path based(CPB) binding method. In addition, when compared to WBM and CPB methods, the new algorithm has an average reduction of 29.21% & 12.49% in the area-time product respectively.

Published in:

Quality Electronic Design (ASQED), 2010 2nd Asia Symposium on

Date of Conference:

3-4 Aug. 2010