Circuit level decomposition of networks with nullors for symbolic analysis

Abstract

Studies have shown that the efficiency of symbolic circuit analysis can be improved by a composition and decomposition strategy. However, most of the proposed strategies are applied to their corresponding mathematical models which lack physical meaning, or they are designed for the sequence of expression format instead of the expanded format. In this paper, a new circuit level decomposition strategy for the expanded format is presented. Taking advantage of the characteristics of nullors, computing efforts are further reduced by exploring valid and invalid decomposed subcircuits. Also, a new way of representing circuit functions is given where both the numerator and denominator of a transfer function have related network determinants. Examples are presented.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>