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

A fast algorithm for routability testing

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)
Sarrafzadeh, M. ; Dept. of Electr. & Comput. Eng., Northwestern Univ., Evanston, IL, USA ; Takahashi, T.

An L-shaped routing of a two-terminal net is its upper- or lower routing Given a set of nets: the planar testability problem (PTP) Is to decide if there exists a planar (i.e., pairwise non-crossing) L-shaped routing of all nets. PTP was solved via transformation to 2-satisfiability. Here, we propose an efficient greedy algorithm running in O(n(logn)2, where n is the number of nets. The density-1 testability problem (D1TP) is to decide if there exists an L-shaped routing of all nets with density 1 (i.e., overlap routing is not allowed, however routed nets may intersect each other). We extend-the PTP algorithm to solve the D1TP problem in O(nlogn) time

Published in:

Circuits and Systems, 1999. ISCAS '99. Proceedings of the 1999 IEEE International Symposium on  (Volume:6 )

Date of Conference:

Jul 1999

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.