A NEW TOPOLOGY ORIENTED METHOD FOR SYMBOLIC ANALYSIS OF ELECTRONIC CIRCUITS
This paper presents a new approach to symbolic network analysis. The procedure is entirely topology oriented because it operates with a netlist description of the analyzed circuit. The obtained network function has nested form. The method introduces a graph representation of the factorization process, that is constructed directly from a given circuit description. Therefore, it is named Topology Decision Diagram (TDD). This graph serves as a skeleton for network function generation. TDD construction starts from the original circuit and spreads to simplified subcircuits. Every subsequent subcircuit is obtained by replacing a circuit branch with an open or a short. The proposed procedure generates the network function in reverse order. It starts from a single circuit parameter placed as a leaf of TDD. Thereafter, the circuit function grows instantiating the other circuit parameter one by one in a sequential order. The proposed method was developed for analogue CMOS circuits and, consequently, recognizes R, L, C and g(m) as circuit components.
symbolic analysis circuit analysis topology method