By Topic

Pseudopin assignment with crosstalk noise control

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)
Chin-Chih Chang ; Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA ; J. Cong

This paper presents a new pseudopin assignment (PPA) algorithm with crosstalk noise control in multilayer gridless general-area routing. We propose a two-step approach that considers obstacles and minimizes the weighted sum of total wire length and the estimated number of vias under crosstalk noise constraints. We test our algorithms on a set of MCM examples and a set of standard-cell examples. Without crosstalk noise control in PPA, the average noise in the MCM test cases after detailed routing is 0.13-0.22 VDD with up to 11% of nets larger than 0.3 VDD. However, if the noise constraint of each net is set to 0.3 VDD in PPA, the average noise in each case reduces to 0.11-0.15 VDD (15%-31% reduction) with no crosstalk noise violations. Most of the nets in our standard-cell test cases do not have noise problems. Our PPA algorithms still give better noise distributions and have 1%-10% noise reduction on the global nets in these standard-cell test cases. Even without ripup and reroute, the detailed routing completion rate is 93%-99% and the average vias per net is only 0.7-1.4 for our MCM test cases and 1.0-1.7 for our standard-cell test cases

Published in:

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