Post global routing RLC crosstalk budgeting

Authors:
Jinjun Xiong;Jun Chen;James Ma;Lei He
Affiliations:
University of Wisconsin, Madison, WI;University of Wisconsin, Madison, WI;University of Wisconsin, Madison, WI;University of Wisconsin, Madison, WI
Venue:
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Year:
2002

Citing 10
Cited 0

Post global routing crosstalk risk estimation and reduction

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Minimum crosstalk channel routing

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Simultaneous shield insertion and net ordering for capacitive and inductive coupling minimization

ISPD '00 Proceedings of the 2000 international symposium on Physical design
Modeling and analysis of differential signaling for minimizing inductive cross-talk

Proceedings of the 38th annual Design Automation Conference
On convergence of switching windows computation in presence of crosstalk noise

Proceedings of the 2002 international symposium on Physical design
Towards global routing with RLC crosstalk constraints

Proceedings of the 39th annual Design Automation Conference
Dragon2000: standard-cell placement tool for large industry circuits

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
A twisted-bundle layout structure for minimizing inductive coupling noise

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Pre-Routing Estimation of Shielding for RLC Signal Integrity

ICCD '01 Proceedings of the International Conference on Computer Design: VLSI in Computers & Processors
Global routing with crosstalk constraints

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Existing layout optimization methods often assume a set of interconnects with given RLC crosstalk bounds in a routing region. RLC crosstalk bound partitioning is critical for effectively applying these methods at the full-chip level. In this paper, we develop an optimal crosstalk budgeting scheme based on linear programming (LP) formulation, and apply it to shield insertion and net ordering at the full-chip level. Experiment results show that compared to the best alternative approach, the LP based method reduces the total routing area by up to 7.61% and also uses less runtime. To the best of our knowledge, this is the first in-depth work that studies the RLC crosstalk budgeting problem.