Simultaneous shield insertion and net ordering under explicit RLC noise constraint

  • Authors:
  • Kevin M. Lepak;Irwan Luwandi;Lei He

  • Affiliations:
  • Electrical and Computer Engineering Department, University of Wisconsin, Madison, WI;Electrical and Computer Engineering Department, University of Wisconsin, Madison, WI;Electrical and Computer Engineering Department, University of Wisconsin, Madison, WI

  • Venue:
  • Proceedings of the 38th annual Design Automation Conference
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

For multiple coupled RLC nets, we formulate the min-area simultaneous shield insertion and net ordering SINO/NB-&ngr; problem to satisfy the given noise bound. We develop an efficient and conservative model to compute the peak noise, and apply the noise model to a simulated-annealing (SA) based algorithm for the SINO/NB-&ngr; problem. Extensive and accurate experiments show that the SA-based algorithm is efficient, 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.