TY - JOUR
T1 - New iterative construction approach to routing with compacted area
AU - Tsai, C. C.
AU - Chen, S. J.
AU - Hsiao, P. Y.
AU - Feng, W. S.
PY - 1991
Y1 - 1991
N2 - The new iterative construction approach presented in this paper consists of three algorithms, namely, channel expansion routing, track assignment, and module location refinement. These algorithms, contrary to the conventional methods implemented with a sequence of tools separately, are linked with a common data structure which guarantees a maximal compatibility. With an initial nonoverlapping placement as input, the iterative construction approach generates a final layout with more compacted area than the layout result from the one-dimensional compactor or some of two-dimensional compactors. Several layout examples in the literature are tested to show the effectiveness of our approach.
AB - The new iterative construction approach presented in this paper consists of three algorithms, namely, channel expansion routing, track assignment, and module location refinement. These algorithms, contrary to the conventional methods implemented with a sequence of tools separately, are linked with a common data structure which guarantees a maximal compatibility. With an initial nonoverlapping placement as input, the iterative construction approach generates a final layout with more compacted area than the layout result from the one-dimensional compactor or some of two-dimensional compactors. Several layout examples in the literature are tested to show the effectiveness of our approach.
UR - https://www.scopus.com/pages/publications/0026068506
U2 - 10.1049/ip-e.1991.0008
DO - 10.1049/ip-e.1991.0008
M3 - 文章
AN - SCOPUS:0026068506
SN - 0143-7062
VL - 138
SP - 57
EP - 71
JO - IEE Proceedings E: Computers and Digital Techniques
JF - IEE Proceedings E: Computers and Digital Techniques
IS - 1
ER -