摘要
n H-V tile-expansion router based on the H-V model of
cornerstitching data structure is presented in this paper. The H-V tile-
expansion consists of a sequence of alternatingH(V) and V(H) space tiles,
the expansion searching of which is guided by a heuristic cost function
using the A* technique and the damping concept, and the tile growing of
which is governed by the constrained expansion area, the limited expansion
depth, and the oriented expansion direction. The net-forest structure
combines several H-V tile-expansions; it obtains near-optimal connection
paths with a minimum number of bends, and guarantees that a feasible
solution can be found if one exists. The router is well suited for wiring
hierarchical modules by M3 technology and as part of the IDAF-a
database management system for VLSI design system. In addition,
we also present the results of running this router on several layout
examples. Experimentally, our router is always faster than the H-tile-
expansion method.
原文 | 美式英語 |
---|---|
頁(從 - 到) | 173-189 |
期刊 | Journal of Information Science and Engineering |
卷 | 6 |
發行號 | 3 |
出版狀態 | 已出版 - 1990 |