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

Interchangeable terminals in channel routing problem

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 $31
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

1 Author(s)
Bisztray, D. ; Research Institute for Telecommunication, Budapest, Hungary

The traditional channel routing problem is known to be solvable, if and only if the constraint graph is acyclic. In the letter we examine channels with two-terminal nets without doglegging and assume that some terminals are interchangeable. A necessary and sufficient condition is established for the interchangeability of the points to ensure solvability. Regular channel structures, like those in gate arrays, are compared. The routability condition is shown to be weaker if noninter-changeable points have different abscissas.

Published in:

Electronics Letters  (Volume:22 ,  Issue: 14 )

Date of Publication:

July 3 1986

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.