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
Este trabalho apresenta um fluxo de roteamento de orçamento de crosstalk RLC full-chip para gerar um projeto de roteamento de alta qualidade sob restrições rigorosas de crosstalk. Com base na função de custo que aborda as redes sensíveis nas células globais visitadas para cada rede, o roteamento global pode reduzir o congestionamento de roteamento, bem como o efeito de acoplamento. O roteamento de trilhos acionado por diafonia minimiza os efeitos de acoplamento capacitivo e diminui os efeitos de acoplamento indutivo, evitando a colocação de redes sensíveis em trilhos adjacentes. Para obter a otimização do orçamento de diafonia indutiva, o problema de inserção de blindagem pode ser resolvido com um algoritmo de cobertura mínima de coluna que é realizado seguindo o roteamento da trilha para processar redes com excesso de diafonia indutiva. O método de fluxo de roteamento proposto pode identificar o número necessário de blindagens com mais precisão e processar problemas de roteamento mais complexos do que os métodos de programação linear (LP). Os resultados deste estudo demonstram que a abordagem proposta pode reduzir de forma eficaz e rápida o crosstalk indutivo em até um terço.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -