Generating sparse partial inductance matrices with guaranteed stability

  • Authors:
  • Byron Krauter;Lawrence T. Pileggi

  • Affiliations:
  • IBM Corp., 11400 Burnet Road, Austin, TX;Dept. of Computer and Electrical Engineering, The University of Texas at Austin, Austin, TX and Carnegie Mellon University, Dept. of ECE, Pittsburgh, PA

  • Venue:
  • ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a definition of magnetic vector potential that can be used to evaluate sparse partial inductance matrices. Unlike the commonly applied procedure of discarding the smallest matrix terms, the proposed approach maintains accuracy at middle and high frequencies and is guaranteed to be positive definite for any degree of sparsity (thereby producing stable circuit solutions). While the proposed technique is strictly based upon potential theory (i.e. the invariance of potential differences on the zero potential reference choice), the technique is, nevertheless, presented and discussed in both circuit and magnetic terms. The conventional and the proposed sparse formulation techniques are contrasted in terms of eigenvalues and circuit simulation results on practical examples.