Cart (Loading....) | Create Account
Close category search window
 

A wire segment reassignment algorithm for minimizing crosstalk for strait-type river routing

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)
Jong-Sheng Cherng ; Dept. of Electr. Eng., Da Yeh Univ., Changhwa, Taiwan ; Sao-Jie Chen

In this paper, an effective algorithm is proposed to generate crosstalk-reduced routing solutions, where nonmonotonic routing is allowed, for the gridded strait-type river routing (STRR) problem. Given an initial routing solution generated by a conventional STRR algorithm, the reduction of crosstalks is carried out by the reassignment of the horizontal and vertical wire segments. Besides minimizing crosstalks, the minimization of the number of jogs is also considered in the reassignment process for performance promotion. To effectively and optimally perform the reassignment process, an integer linear programming (ILP) formulation is proposed. The experimental results show that this approach of ILP is very encouraging

Published in:

Electronics, Circuits and Systems, 2001. ICECS 2001. The 8th IEEE International Conference on  (Volume:3 )

Date of Conference:

2001

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.