Hard Bounds on the Probability of Performance With Application to Circuit Analysis

Abstract

In this paper, we address the problem of analyzing the performance of an electrical circuit in the presence of uncertainty in the network components. In particular, we consider the case when the uncertainties are known to be bounded and have probabilistic nature, and aim at evaluating the probability that a given system property holds. In contrast with the standard Monte Carlo approach, which utilizes random samples of the uncertainty to estimate ldquosoftrdquo bounds on this probability, we present a methodology that provides ldquohardrdquo (deterministic) upper and lower bounds. To this aim, we develop an iterative algorithm, based on apropertyoracle, which is shown to converge asymptotically to the true probability of property satisfaction. Construction of the property oracles for specific applications in circuit analysis is explicitly presented. In particular, we study in full detail the problems of assessing the probability that the gain of a purely resistive network does not exceed a prescribed value, and of evaluating the probability of stability of an uncertain network under parameter variations. The paper is accompanied by illustrating examples and extensive numerical simulations.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 13 citations exist upstream.