The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Ce travail présente un flux de routage de budgétisation de diaphonie RLC complet pour générer une conception de routage de haute qualité sous des contraintes de diaphonie strictes. Basé sur la fonction de coût traitant des réseaux sensibles dans les cellules globales visitées pour chaque réseau, le routage global peut réduire la congestion du routage ainsi que l'effet de couplage. Le routage des pistes basé sur la diaphonie minimise les effets de couplage capacitif et diminue les effets de couplage inductif en évitant de placer des réseaux sensibles sur les pistes adjacentes. Pour obtenir une optimisation de la budgétisation de la diaphonie inductive, le problème d'insertion du blindage peut être résolu avec un algorithme de couverture de colonne minimale qui est entrepris après le routage des pistes pour traiter les réseaux présentant un excès de diaphonie inductive. La méthode de flux de routage proposée peut identifier le nombre requis de boucliers avec plus de précision et traiter des problèmes de routage plus complexes que les méthodes de programmation linéaire (LP). Les résultats de cette étude démontrent que l’approche proposée peut réduire efficacement et rapidement la diaphonie inductive jusqu’à un tiers.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Peng-Yang HUNG, Ying-Shu LOU, Yih-Lang LI, "Minimum Shield Insertion on Full-Chip RLC Crosstalk Budgeting Routing" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 3, pp. 880-889, March 2009, doi: 10.1587/transfun.E92.A.880.
Abstract: This work presents a full-chip RLC crosstalk budgeting routing flow to generate a high-quality routing design under stringent crosstalk constraints. Based on the cost function addressing the sensitive nets in visited global cells for each net, global routing can lower routing congestion as well as coupling effect. Crosstalk-driven track routing minimizes capacitive coupling effects and decreases inductive coupling effects by avoiding placing sensitive nets on adjacent tracks. To achieve inductive crosstalk budgeting optimization, the shield insertion problem can be solved with a minimum column covering algorithm which is undertaken following track routing to process nets with an excess of inductive crosstalk. The proposed routing flow method can identify the required number of shields more accurately, and process more complex routing problems than the linear programming (LP) methods. Results of this study demonstrate that the proposed approach can effectively and quickly lower inductive crosstalk by up to one-third.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.880/_p
Copier
@ARTICLE{e92-a_3_880,
author={Peng-Yang HUNG, Ying-Shu LOU, Yih-Lang LI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Minimum Shield Insertion on Full-Chip RLC Crosstalk Budgeting Routing},
year={2009},
volume={E92-A},
number={3},
pages={880-889},
abstract={This work presents a full-chip RLC crosstalk budgeting routing flow to generate a high-quality routing design under stringent crosstalk constraints. Based on the cost function addressing the sensitive nets in visited global cells for each net, global routing can lower routing congestion as well as coupling effect. Crosstalk-driven track routing minimizes capacitive coupling effects and decreases inductive coupling effects by avoiding placing sensitive nets on adjacent tracks. To achieve inductive crosstalk budgeting optimization, the shield insertion problem can be solved with a minimum column covering algorithm which is undertaken following track routing to process nets with an excess of inductive crosstalk. The proposed routing flow method can identify the required number of shields more accurately, and process more complex routing problems than the linear programming (LP) methods. Results of this study demonstrate that the proposed approach can effectively and quickly lower inductive crosstalk by up to one-third.},
keywords={},
doi={10.1587/transfun.E92.A.880},
ISSN={1745-1337},
month={March},}
Copier
TY - JOUR
TI - Minimum Shield Insertion on Full-Chip RLC Crosstalk Budgeting Routing
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 880
EP - 889
AU - Peng-Yang HUNG
AU - Ying-Shu LOU
AU - Yih-Lang LI
PY - 2009
DO - 10.1587/transfun.E92.A.880
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2009
AB - This work presents a full-chip RLC crosstalk budgeting routing flow to generate a high-quality routing design under stringent crosstalk constraints. Based on the cost function addressing the sensitive nets in visited global cells for each net, global routing can lower routing congestion as well as coupling effect. Crosstalk-driven track routing minimizes capacitive coupling effects and decreases inductive coupling effects by avoiding placing sensitive nets on adjacent tracks. To achieve inductive crosstalk budgeting optimization, the shield insertion problem can be solved with a minimum column covering algorithm which is undertaken following track routing to process nets with an excess of inductive crosstalk. The proposed routing flow method can identify the required number of shields more accurately, and process more complex routing problems than the linear programming (LP) methods. Results of this study demonstrate that the proposed approach can effectively and quickly lower inductive crosstalk by up to one-third.
ER -