A Timing Driven Crosstalk Optimizer for Gridded Channel Routing

Shih-Hsu HUANG; Yi-Siang HSU; Chiu-Cheng LIN

A Timing Driven Crosstalk Optimizer for Gridded Channel Routing

Shih-Hsu HUANG, Yi-Siang HSU, Chiu-Cheng LIN

Full Text Views

0

Share
Cite this

Summary :

The relative window method provides quantitative crosstalk delay degradation for the post-layout timing analysis in deep sub-micron VLSI design. However, to the best of our knowledge, the relative window method has not been applied to the crosstalk minimization in gridded channel routing problem. Most conventional crosstalk optimizers only use the coupling length to estimate the crosstalk. In this paper, we present a post-layout timing driven crosstalk optimizer based on the relative window method. According to the relative signal arrival time and the coupling length, we define a delay degradation graph to describe the crosstalks between nets in a routing solution. Our optimization goal is to maximize the time slack by iteratively improving the delay degradation graph without increasing the channel height. Benchmark data consistently show that our post-layout timing driven crosstalk optimizer can further improve the routing solution obtained by a conventional crosstalk optimizer.

Publication: IEICE TRANSACTIONS on Information Vol.E87-D No.6 pp.1575-1581

Publication Date: 2004/06/01

Publicized

Online ISSN

DOI

Type of Manuscript: LETTER

Category: Computer Components

Cite this

Copy

Shih-Hsu HUANG, Yi-Siang HSU, Chiu-Cheng LIN, "A Timing Driven Crosstalk Optimizer for Gridded Channel Routing" in IEICE TRANSACTIONS on Information, vol. E87-D, no. 6, pp. 1575-1581, June 2004, doi: .
Abstract: The relative window method provides quantitative crosstalk delay degradation for the post-layout timing analysis in deep sub-micron VLSI design. However, to the best of our knowledge, the relative window method has not been applied to the crosstalk minimization in gridded channel routing problem. Most conventional crosstalk optimizers only use the coupling length to estimate the crosstalk. In this paper, we present a post-layout timing driven crosstalk optimizer based on the relative window method. According to the relative signal arrival time and the coupling length, we define a delay degradation graph to describe the crosstalks between nets in a routing solution. Our optimization goal is to maximize the time slack by iteratively improving the delay degradation graph without increasing the channel height. Benchmark data consistently show that our post-layout timing driven crosstalk optimizer can further improve the routing solution obtained by a conventional crosstalk optimizer.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e87-d_6_1575/_p

Copy

@ARTICLE{e87-d_6_1575,
author={Shih-Hsu HUANG, Yi-Siang HSU, Chiu-Cheng LIN, },
journal={IEICE TRANSACTIONS on Information},
title={A Timing Driven Crosstalk Optimizer for Gridded Channel Routing},
year={2004},
volume={E87-D},
number={6},
pages={1575-1581},
abstract={The relative window method provides quantitative crosstalk delay degradation for the post-layout timing analysis in deep sub-micron VLSI design. However, to the best of our knowledge, the relative window method has not been applied to the crosstalk minimization in gridded channel routing problem. Most conventional crosstalk optimizers only use the coupling length to estimate the crosstalk. In this paper, we present a post-layout timing driven crosstalk optimizer based on the relative window method. According to the relative signal arrival time and the coupling length, we define a delay degradation graph to describe the crosstalks between nets in a routing solution. Our optimization goal is to maximize the time slack by iteratively improving the delay degradation graph without increasing the channel height. Benchmark data consistently show that our post-layout timing driven crosstalk optimizer can further improve the routing solution obtained by a conventional crosstalk optimizer.},
keywords={},
doi={},
ISSN={},
month={June},}

Copy

TY - JOUR
TI - A Timing Driven Crosstalk Optimizer for Gridded Channel Routing
T2 - IEICE TRANSACTIONS on Information
SP - 1575
EP - 1581
AU - Shih-Hsu HUANG
AU - Yi-Siang HSU
AU - Chiu-Cheng LIN
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E87-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2004
AB - The relative window method provides quantitative crosstalk delay degradation for the post-layout timing analysis in deep sub-micron VLSI design. However, to the best of our knowledge, the relative window method has not been applied to the crosstalk minimization in gridded channel routing problem. Most conventional crosstalk optimizers only use the coupling length to estimate the crosstalk. In this paper, we present a post-layout timing driven crosstalk optimizer based on the relative window method. According to the relative signal arrival time and the coupling length, we define a delay degradation graph to describe the crosstalks between nets in a routing solution. Our optimization goal is to maximize the time slack by iteratively improving the delay degradation graph without increasing the channel height. Benchmark data consistently show that our post-layout timing driven crosstalk optimizer can further improve the routing solution obtained by a conventional crosstalk optimizer.
ER -