Proceedings ArticleDOI
Wire routing by optimizing channel assignment within large apertures
Akihiro Hashimoto,James D. Stevens +1 more
- pp 155-169
Reads0
Chats0
TLDR
The purpose of this paper is to introduce a new wire routing method for two layer printed circuit boards based on the newly developed channel assignment algorithm and requires many via holes.Abstract:
The purpose of this paper is to introduce a new wire routing method for two layer printed circuit boards. This technique has been developed at the University of Illinois Center for Advanced Computation and has been programmed in ALGOL for a B5500 computer. The routing method is based on the newly developed channel assignment algorithm and requires many via holes. The primary goals of the method are short execution time and high wireability. Actual design specifications for ILLIAC IV Control Unit boards have been used to test the feasibility of the routing technique. Tests have shown that this algorithm is very fast and can handle large boards.read more
Citations
More filters
Journal ArticleDOI
The NP-completeness column: An ongoing guide
TL;DR: This is the fourteenth edition of a quarterly column that provides continuing coverage of new developments in the theory of NP-completeness, and readers who have results they would like mentioned (NP-hardness, PSPACE- hardness, polynomialtime-solvability, etc.), or open problems they wouldlike publicized, should send them to David S. Johnson.
Journal ArticleDOI
Efficient Algorithms for Channel Routing
Takeshi Yoshimura,Ernest S. Kuh +1 more
TL;DR: Two new algorithms merge nets instead of assigning horizontal tracks to individual nets to route a specified net list between two rows of terminals across a two-layer channel in the layout design of LSI chips.
Proceedings ArticleDOI
A “DOGLEG” channel router
TL;DR: The routing algorithm presented here was developed as part of LTX, a computer-aided design system for integrated circuit layout and was implemented on an HP-2100 minicomputer.
Proceedings ArticleDOI
REAL: A Program for REgister ALlocation
Fadi J. Kurdahi,Alice C. Parker +1 more
TL;DR: The REAL REgister ALlocation program uses a track assignment algorithm taken from channel routing called the Left Edge algorithm to process designs output from MAHA and Sehwa, and is thought to be optimal for non-pipelined designs with no conditional branches.
Proceedings ArticleDOI
A "Greedy" Channel Router
TL;DR: A new, “greedy”, channel-router that always succeeds, usually using no more than one track more than required by channel density, and may be forced in rare cases to make a few connections "off the end” of the channel.
References
More filters
Journal ArticleDOI
An Algorithm for Path Connections and Its Applications
TL;DR: The algorithm described in this paper is the outcome of an endeavor to answer the following question: Is it possible to find procedures which would enable a computer to solve efficiently path-connection problems inherent in logical drawing, wiring diagramming, and optimal route finding?
Book ChapterDOI
A decomposition theorem for partially ordered sets
TL;DR: In this article, a partially ordered set P is considered and two elements a and b of P are camparable if either a ≧ b or b ≧ a. If b and a are non-comparable, then they are independent.
Proceedings ArticleDOI
A solution to line routing problems on the continuous plane
TL;DR: A new line-routing algorithm based on the continuous plane, which is much faster than the conventional method and has given good results when applied to many line- routing problems such as mazes, printed circuit boards, substrates, and PERT diagrams.
Proceedings Article
A computer program for optimal routing of printed circuit conductors.
Koichi Mikami,Kinya Tabuchi +1 more
Proceedings ArticleDOI
Cellular wiring and the cellular modeling technique
TL;DR: The purpose of this paper is to describe these programs, since they follow easily from the modeling technique, but rather to describe the ideas and concepts behind them.