Journal ArticleDOI
Three-Layer Channel Routing
Yun Kang Chen,Mei Lun Liu +1 more
Reads0
Chats0
TLDR
Two special types of three-layer channel routing, VHV and HVH, are introduced in this paper, and the merging algorithm and the left edge algorithm used in two-layer routing can be extended to three layers.Abstract:
With the advent of VLSI technology, multiple-layer routing becomes feasible. Two special types of three-layer channel routing, VHV and HVH, are introduced in this paper. The merging algorithm and the left edge algorithm used in two-layer routing can be extended to three layers. Attempts are made to compare the lower bounds of channel width of three types of routing--two-layer, VHV, and HVH. The algorithms were coded in PASCAL and implemented on VAX 11/780 computer. The computational results are satisfactory, since all the results lead to a further reduction in routing area.read more
Citations
More filters
Proceedings ArticleDOI
Via minimization with associated constraints in three-layer routing problem
TL;DR: A heuristic algorithm is presented to globally eliminate the vias in the three-layer channel routing and it is shown that the algorithm is fast and efficient, thus generating very good results.
Journal ArticleDOI
A density-based greedy router
TL;DR: With its accurate calculation in selecting wire segments in each track, the new two- layer router solves Deutsch's difficult example in 19 tracks in the two-layer restricted-Manhattan model by a simple density-related function and also outperform other routers without backtracking, rerouting, or routing transformation.
Journal ArticleDOI
Automatic placement and routing techniques for gate array and standard cell designs
H.N. Brady,J. Blanks +1 more
TL;DR: The use of a convex quadratic objective function as a practical layout metric is discussed in some depth in this article, and a model of placement difficulty is developed in order to gain some insight into modern layout problems.
Proceedings ArticleDOI
An Efficient Graph-Theoretic Algorithm for Three-Layer Channel Routing
Rajat Kumar Pal,Ajit Pal +1 more
TL;DR: A new channel routing algorithm that uses three restricted reserved layers, either VHV or HVH, where H- and V-layers are used for horizontal and vertical segments of the nets present in the channel.
Journal ArticleDOI
On VHV-routing in channels with irregular boundaries
TL;DR: A branch-and-bound algorithm for finding optimal solutions for the VHV-channel-routing problem in irregular channels that partitions the channels into boxes and searches for the optimal among the various mappings of the horizontal net segments to the boxes.
References
More filters
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.
Circuit layout
TL;DR: A general overview of circuit layout, taking a unified approach to various styles of integrated circuits, printed circuit boards, and hybrid circuits, and problems associated with the implementation of a hierarchical system are discussed.
Proceedings ArticleDOI
LTX-A system for the directed automatic design of LSI circuits
TL;DR: LTX is a minicomputer-based design system for large-scale integrated circuit chip layout which offers a flexible set of interactive and automatic procedures for translating a circuit connectivity description into a finished mask design.