A Min-area Solution to Performance and RLC Crosstalk Driven Global Routing Problem

Authors:
Tong Jing;Ling Zhang;Jinghong Liang;Jingyu Xu;Xianlong Hong;Jinjun Xiong;Lei He
Affiliations:
Tsinghua University, Beijing, P. R. China;Tsinghua University, Beijing, P. R. China;Tsinghua University, Beijing, P. R. China;Tsinghua University, Beijing, P. R. China;Tsinghua University, Beijing, P. R. China;UCLA, Los Angeles, California;UCLA, Los Angeles, California
Venue:
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Year:
2005

Citing 8
Cited 1

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Simultaneous shield insertion and net ordering for capacitive and inductive coupling minimization

ISPD '00 Proceedings of the 2000 international symposium on Physical design
Towards global routing with RLC crosstalk constraints

Proceedings of the 39th annual Design Automation Conference
SSTT: efficient local search for GSI global routing

Journal of Computer Science and Technology
A coupling and crosstalk considered timing-driven global routing algorithm for high performance circuit design

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Post global routing crosstalk synthesis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Global routing with crosstalk constraints

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Full-chip routing optimization with RLC crosstalk budgeting

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Simultaneous shield and buffer insertion for crosstalk noise reduction in global routing

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.01

Visualization

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.