By Topic

A game-theoretic approach for binding in behavioral synthesis

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

2 Author(s)
A. K. Murugavel ; Dept. of Comput. Sci. & Eng., Univ. of South Florida, Tampa, FL, USA ; N. Ranganathan

In this paper, we describe a new algorithm based on game theory for minimizing the average power of a circuit during binding in behavioral synthesis. The problem is formulated as an auction based non-cooperative finite game for which a solution is proposed based on the Nash equilibrium. For the binding algorithm, each functional unit in the datapath is modeled as a player bidding for executing an operation with the estimated power consumption as the bid. The operations are bound to the modules such that the total power consumption is minimized. Further, the techniques of functional unit sharing, path balancing and register assignment are incorporated within the binding algorithm for power reduction. The proposed algorithm yields power reduction without any increase in area or delay overhead. Experimental results indicate that the proposed game theoretic solution for binding yields an improvement of 13.9% over the linear programming (LP) method.

Published in:

VLSI Design, 2003. Proceedings. 16th International Conference on

Date of Conference:

4-8 Jan. 2003