This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Symposium on Quality of Electronic Design (ISQED'05)
Obstacle-Avoiding Rectilinear Minimum-Delay Steiner Tree Construction towards IP-Block-Based SOC Design
San Jose, California
March 21-March 23
ISBN: 0-7695-2301-3
Jingyu Xu, Tsinghua Univ., Beijing, China
Xianlong Hong, Tsinghua Univ., Beijing, China
Tong Jing, Tsinghua Univ., Beijing, China
Yang Yang, Tsinghua Univ., Beijing, China
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.
Citation:
Jingyu Xu, Xianlong Hong, Tong Jing, Yang Yang, "Obstacle-Avoiding Rectilinear Minimum-Delay Steiner Tree Construction towards IP-Block-Based SOC Design," isqed, pp.616-621, Sixth International Symposium on Quality of Electronic Design (ISQED'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.