Topology oriented symbolic circuit analysis based on limit variables

This paper describes a novel approach to exact symbolic network analysis in nested form. The method is entirely topology oriented because it operates directly with circuit description. The proposed procedure extracts the network function by setting circuit admittances to limit values, zero or infinity, in a sequential order. Analytic expressions of the network function are described by a tree-like graph named Topology Decision Diagram (TDD). In this paper we consider analytic expressions construction for different types of network functions in symbolic.