Welcome to IEEE Xplore 2.0: Efficient Algorithms for Routing Interchangeable Terminals

Cart | Sitemap | Help

Abstract


	BROWSE	SEARCH	IEEE XPLORE GUIDE	SUPPORT

View TOC |

Previous Article | Next Article

Efficient Algorithms for Routing Interchangeable Terminals
Kobayashi, H. Drozd, C.E.

This paper appears in: Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publication Date: July 1985
Volume: 4, Issue: 3
On page(s): 204- 207
ISSN: 0278-0070
Current Version Published: 2004-03-03

Abstract
This paper presents new algorithms for routing two rows of interchangeable terminals across a 2-layer channel. The number of horizontal tracks required for routing is significantly reduced by simply interchanging terminals in each cell. Savings up to one-third of horizontal tracks or more are achieved by interchanging terminals. The Deutsch Difficult Example is used as a test routing problem. The number of horizontal segments per net is limited to one, no "doglegs." The program is coded in Pascal and implemented on a VAX-11/780 computer.

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.

Citing Documents
Available to subscribers and IEEE members.

You are not logged in.

Guests may access Abstract records free of charge.