Post global routing RLC crosstalk budgeting
Lists
Only you see this
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.
BibTeX
@inproceedings{xiong2002post,
author = {Jinjun Xiong and Jun Chen and J. Ma and Lei He},
title = {{Post global routing RLC crosstalk budgeting}},
booktitle = {ICCAD},
year = {2002},
doi = {10.1145/774572.774646},
}Loading related content...