Full-chip routing optimization with RLC crosstalk budgeting

Authors:
Jinjun Xiong;Lei He
Affiliations:
Electr. Eng. Dept., Univ. of California, Los Angeles, CA, USA;-
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2006

Citing 0
Cited 7

Simultaneous shield insertion and net ordering for capacitive and inductive coupling minimization

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A Min-area Solution to Performance and RLC Crosstalk Driven Global Routing Problem

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Shielding area optimization under the solution of interconnect crosstalk

Journal of Computer Science and Technology
Simultaneous shield and buffer insertion for crosstalk noise reduction in global routing

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Deflecting crosstalk by routing reconsideration through refined signal correlation estimation

Proceedings of the 19th ACM Great Lakes symposium on VLSI
Priority-based routing resource assignment considering crosstalk

Journal of Computer Science and Technology
Extended global routing with RLC crosstalk constraints

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.03

Visualization

Abstract

Existing layout-optimization methods for both capacitive and inductive (RLC) crosstalk reduction assume a set of interconnects with a priori given crosstalk bounds in a routing region. RLC crosstalk budgeting is critical for effectively applying these methods at the full-chip level. In this paper, we formulate a full-chip routing optimization problem with RLC crosstalk budgeting, and solve this problem with a multiphase algorithm. In phase I, we solve an optimal RLC crosstalk budgeting based on linear programming to partition crosstalk bounds at sinks into bounds for net segments in routing regions. In phase II, we perform simultaneous shield insertion and net ordering to meet the partitioned crosstalk bounds in each region. In phase III, we carry out a local refinement procedure to reduce the total number of shields. Compared with the best alternative approach in experiments, the proposed algorithm reduces the total routing area by up to 5.71% and uses less runtime. To the best of our knowledge, this work is the first in-depth study on full-chip routing optimization with RLC crosstalk budgeting.