By Topic

Incremental layout placement modification algorithms

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)
C. -S. Choy ; Dept. of Electron. Eng., Chinese Univ. of Hong Kong, Shatin, Hong Kong ; T. -S. Cheung ; K. -K. Wong

Many circuit modifications require only a slight adjustment to the IC layouts. General purpose placement algorithms cannot take advantage of these situations because they are designed to generate a complete placement from scratch. In this paper, we present two new algorithms to effect incremental changes on a gate array layout automatically. The algorithms will selectively relocate a number of logic elements to vacate an empty slot. The empty slot is then ready for an added logic element. Results obtained prove that the two algorithms are superior over simple-minded layout modification methods. The computation time is of O(n3/2) where n is the number of elements in the neighborhood of change in a layout. For conventional placement algorithms, n will include all the elements in the layout. Therefore, the incremental algorithms will be several orders of magnitude faster

Published in:

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  (Volume:15 ,  Issue: 4 )