By Topic

A Novel General Graph-Based Simplex Algorithm Applied to IC Layout Compaction and Migration

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

3 Author(s)
Said, H. ; Ain Sahms Univ., Cairo ; Abbas, H.M. ; Shahein, H.I.

In this paper, a novel method for solving the IC layout compaction problem is introduced. The solution supports all kinds of linear constraints and linear optimization functions. Graph-based techniques are employed so that all matrix operations in linear programming are replaced by much faster graph operations. The proposed algorithm outperforms all studied compaction methods by combining the generality of linear programming and the efficiency of graph-based methods. Correct and optimal migrated layouts were produced with significant improvement in performance.

Published in:

Design and Test Workshop, 2007. IDT 2007. 2nd International

Date of Conference:

16-18 Dec. 2007