Skip to main content
Article thumbnail
Location of Repository

Obstacle-Avoiding Rectilinear Minimum-Delay Steiner Tree Construction Toward IP-Block-Based SOC Design

By Jingyu Xu, Xianlong Hong, Tong Jing and Yang Yang

Abstract

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—Minimal delay, obstacle, routing, Steiner tree. I

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.3634
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ee.ucla.edu/~tomjin... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.