DocumentCode
913103
Title
Efficient Algorithms for Routing Interchangeable Terminals
Author
Kobayashi, Hideaki ; Drozd, Charles E.
Author_Institution
Department of Electrical and Computer Engineering, University of South Carolina, Columbia, SC, USA
Volume
4
Issue
3
fYear
1985
fDate
7/1/1985 12:00:00 AM
Firstpage
204
Lastpage
207
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.
Keywords
Design automation; Merging; Programmable logic arrays; Programmable logic devices; Read only memory; Routing; Testing; Very large scale integration;
fLanguage
English
Journal_Title
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0278-0070
Type
jour
DOI
10.1109/TCAD.1985.1270116
Filename
1270116
Link To Document