CIRCUIT LEVEL DECOMPOSITION OF NETWORKS WITH NULLORS FOR SYMBOLIC ANALYSIS

Studies have shown that the efficiency of symbolic circuit analysis ca n be improved by a composition and decomposition strategy. However, mo st of the proposed strategies are applied to their corresponding mathe matical models which lack physical meaning, or they are designed for t he sequence of expression format instead of the expanded format. In th is paper, a new circuit level decomposition strategy for the expanded format is presented. Taking advantage of the characteristics of nullor s, computing efforts are further reduced by exploring valid and invali d decomposed subcircuits. Also, a new way of representing circuit func tions is given where both the numerator and denominator of a transfer function have related network determinants. Examples are presented.