Symbolic Circuit Analysis

Konczykowska, A.

doi:10.1002/047134608x.w2531

Cited by 1 publication

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first aim is realised by generation of symbolic network function in the cancellation-free expanded format as the ratio of two polynomials and/or by producing the symbolic expressions for the poles and zeros. Due to the exponential growth of the number of product terms in the symbolic functions when the circuit size grows, symbolic function must be approximated during or after computation [1,2]. However, in the case of repetitive numerical calculations, we need an exact symbolic expression with as few arithmetic operations as possible.…”

Section: Introductionmentioning

confidence: 99%

Generation of sequential symbolic network functions for large-scale networks by circuit reduction to two-port

Pierzchala¹,

Rodanski

2001

IEEE Trans. Circuits Syst. I

View full text Add to dashboard Cite

The major stumbling block in symbolic analysis of large-scale circuits is the exponential growth of expression complexity with the circuit size. Sequential techniques, introduced more than a decade ago, reduced that growth to quasi-linear. The fundamental assumption in all sequential methods developed so far was that the circuit must be decomposed in order to reduce the complexity of the final expression. In this paper we will show conclusively that this is not the case. We describe a new algebraic approach to symbolic analysis of large-scale networks, based on the reduction of the compacted modified node admittance matrix to a two-port matrix. No circuit partitioning is required. Internal variables are suppressed one by one using Gaussian elimination. To minimise the number of symbolic operations we employ a locally optimal pivoting strategy. Formula complexity is estimated to grow quasi-linearly with circuit size. The technique is conceptually very simple and produces sequential formulae of significantly lesser complexity than any exact method published to date.

show abstract

Section: Introductionmentioning

confidence: 99%