Simultaneous Shield Insertion and Net Ordering under Explicit RLC Noise Constraint

DMCA

Simultaneous Shield Insertion and Net Ordering under Explicit RLC Noise Constraint (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Kevin M. Lepak , Irwan Luwandi , Lei He

Citations:

10 - 1 self

BibTeX

@MISC{Lepak01simultaneousshield,
    author = {Kevin M. Lepak and Irwan Luwandi and Lei He},
    title = {Simultaneous Shield Insertion and Net Ordering under Explicit RLC Noise Constraint},
    year = {2001}
}

OpenURL

Abstract

For multiple coupled RLC nets, we formulate the min-area simultaneous shield insertion and net ordering (SINO/NB- v) problem to satisfy the given noise bound. We develop an e#cient and conservative model to compute the peak noise, and apply the noise model to a simulated-annealing (SA) based algorithm for the SINO/NB-v problem. Extensive and accurate experiments show that the SA-based algorithm is e#cient, and always achieves solutions satisfying the given noise bound. It uses up to 71% and 30% fewer shields when compared to a greedy based shield insertion algorithm and a separated shield insertion and net ordering algorithm, respectively. To the best of our knowledge, it is the first work that presents an in-depth study on the min-area SINO problem under an explicit noise constraint.

Keyphrases

net ordering simultaneous shield insertion explicit rlc noise constraint noise bound min-area simultaneous shield insertion multiple coupled rlc net accurate experiment sino nb sino nb-v problem achieves solution peak noise first work explicit noise constraint sa-based algorithm shield insertion algorithm separated shield insertion noise model in-depth study conservative model min-area sino problem

DMCA