By Topic

Maximum alignment of interchangeable terminals

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)
Lin, L.-S. ; AT&T Bell Lab., Murray Hill, NJ, USA ; Sahni, S.

The authors develop a linear algorithm to maximize the number of terminals aligned across a routing channel. It is assumed that the terminals in the cells on either side of the channel are interchangeable. This algorithm has application to the routing of PLAs and other circuits with interchangeable terminals

Published in:

Computers, IEEE Transactions on  (Volume:37 ,  Issue: 10 )