Skip to main navigation Skip to search Skip to main content

A min-area solution to performance and RLC crosstalk driven global routing problem

  • Tong Jing
  • , Ling Zhang
  • , Jingyu Xu
  • , Jinghong Liang
  • , Xianlong Hong
  • , Jinjun Xiong
  • , Lei He
  • Tsinghua University
  • University of California at Los Angeles

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

This paper presents a novel global routing algorithm, AT-PO-GR, to minimize the routing area under both congestion, timing, and RLC crosstalk constraints. The proposed algorithm is consisted of three key parts: (1) timing and congestion optimization; (2) crosstalk budgeting and estimation; and (3) crosstalk elimination and local refinement. Compared with the recent work introduced in [9] and [10], the proposed algorithm can achieve smaller routing area and fewer shields under the same design constraints, yet use less running time.

Original languageEnglish
Title of host publicationProceedings of the 2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages115-120
Number of pages6
ISBN (Print)0780387368, 9780780387362
DOIs
StatePublished - 2005
Event2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005 - Shanghai, China
Duration: Jan 18 2005Jan 21 2005

Publication series

NameProceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
Volume1

Conference

Conference2005 Asia and South Pacific Design Automation Conference, ASP-DAC 2005
Country/TerritoryChina
CityShanghai
Period01/18/0501/21/05

Fingerprint

Dive into the research topics of 'A min-area solution to performance and RLC crosstalk driven global routing problem'. Together they form a unique fingerprint.

Cite this