作者: Chia‐Chun Tsai , Sao‐Jie Chen , Pei‐Yung Hsiao , Wu‐Shiung Feng
DOI: 10.1080/02533839.1991.9677332
关键词:
摘要: Abstract In this paper, an iterative‐construction based layout approach composed of three algorithms: net‐forest routing, track assignment, and block position refinement, is presented. These algorithms, unlike the conventional methods implemented separately with a sequence tools, are linked common data structure — H‐V model corner‐stitching. Thus, they have maximal compatibility. Given initial non‐overlapping placement, always generates more compact final layout. Several examples in literature tested to prove effectiveness our approach; these experimental results show that better than 1‐D compactors some 2‐D compactors.