Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1142/S021812661000716X | JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS |
Keywords | Field | DocType |
Circuit analysis,symbolic analysis,topology method | Topology,Netlist,Computer science,Circuit extraction,Algorithm,Electronic engineering,Symbolic data analysis,Network analysis,Electronic circuit,Equivalent circuit,Topology (electrical circuits),Circuit diagram | Journal |
Volume | Issue | ISSN |
19 | 8 | 0218-1266 |
Citations | PageRank | References |
2 | 0.41 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. D. Djordjevic | 1 | 2 | 0.41 |
| Predrag M. Petkovic | 2 | 2 | 1.08 |
| Vanco B. Litovski | 3 | 26 | 8.41 |