By Topic

Proposing an efficient method to estimate and reduce crosstalk after placement in VLSI circuits

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)
Mehdizadeh, A. ; Amirkabir Univ. of Technol., Tehran ; Zamani, M.S.

Due to the increasing number of elements on a single chip area and the growing complexity of routing, existing methods to reduce crosstalk at the routing or post-routing stage do not seem efficient anymore. So crosstalk estimation should be considered in earlier design stages such as placement. To estimate crosstalk after placement information about the topology of a net and adjacency of its wire-segments should be available. Yet it is not because of the lack of routing information. In this paper, we propose a probabilistic method to estimate intra-grid wirelength of nets after placement and global routing. Results of incorporating this method with the previous crosstalk estimation schemes and our proposed crosstalk reduction method show its efficiency in detecting failing noisy nets before having detailed information of wire adjacency. Our general method improved the number of correctly detected failing noisy nets by 15% on average. In a second improvement, the directed version of this method increased the number of correct detections by 19%. It also decreased the number of false detections considerably.

Published in:

Computer Systems and Applications, 2008. AICCSA 2008. IEEE/ACS International Conference on

Date of Conference:

March 31 2008-April 4 2008