The Community for Technology Leaders
RSS Icon
Subscribe
San Jose, CA, USA
March 21, 2005 to March 23, 2005
ISBN: 0-7695-2301-3
pp: 616-621
Jingyu Xu , Tsinghua Univ., Beijing, China
Xianlong Hong , Tsinghua Univ., Beijing, China
Tong Jing , Tsinghua Univ., Beijing, China
Yang Yang , Tsinghua Univ., Beijing, China
ABSTRACT
With System-on-Chip design, IP blocks form routing obstacles that deteriorate global interconnect delay. In this paper, we present a new approach for obstacle-avoiding rectilinear minimal delay Steiner tree (OARMDST) construction. We formalize the solving of minimum delay tree through the concept of an extended minimization function, and trade the objective into a top-down recursion, which wisely produces delay minimization from source to critical sinks. We analyze the topology generation with treatment of obstacles and exploit the connection flexibilities. To our knowledge, this is the first in-depth study of OARMDST problem based on topological construction. Experimental results are given to demonstrate the efficiency of the algorithm.
INDEX TERMS
null
CITATION
Jingyu Xu, Xianlong Hong, Tong Jing, Yang Yang, "Obstacle-Avoiding Rectilinear Minimum-Delay Steiner Tree Construction towards IP-Block-Based SOC Design", ISQED, 2005, Proceedings. 6th International Symposium on Quality Electronic Design, Proceedings. 6th International Symposium on Quality Electronic Design 2005, pp. 616-621, doi:10.1109/ISQED.2005.86
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool