By Topic

A linear program driven scheduling and allocation method followed by an interconnect optimization algorithm

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
$31 $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)
Papachristou, C.A. ; Dept. of Comput. Eng., Case Western Reserve Univ., Cleveland, OH, USA ; Konuk, H.

A new method for high-level logic synthesis is reported whose basic feature is the tight interaction and coupling of the scheduling and allocation phases providing a global direction to the synthesis. A linear-program-based allocation is proposed which uses multifunction-ALU cost estimation and iteratively drives a tree-search for scheduling. A new interconnect optimization algorithm is proposed. It is based on several interconnect transformations for multiplexer input collapsing and merging. Several other important synthesis aspects are included, e.g., register and interconnect bindings, operation chaining, and operation multicycling. The method has been implemented in C on a Sun 3/60 workstation

Published in:

Design Automation Conference, 1990. Proceedings., 27th ACM/IEEE

Date of Conference:

24-28 Jun 1990