By Topic

A new fast constraint graph generation algorithm for VLSI layout compaction

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)
J. Fang ; Dept. of Electron. Eng., Hong Kong Polytech., Kowloon, Hong Kong ; J. S. L. Wong ; K. Zhang ; P. Tang

A new fast constraint graph generation algorithm called the parallel plane sweep shadowing (PPSS) algorithm is presented for VLSI layout compaction. The algorithm is significant in two aspects. First, instead of analyzing each element shadow individually, PPSS estimates all element shadows simultaneously, which makes it more efficient to generate irredundant constraints. Second, instead of the conventional perpendicular plane sweep method, a parallel plane sweep scheme is developed. This reduces the number of events by half. The experimental results show that PPSS is linear in space and time complexity, and requires about one minute to build a graph from 10000 rectangles on a Sun 3/60 workstation

Published in:

Circuits and Systems, 1991., IEEE International Sympoisum on

Date of Conference:

11-14 Jun 1991