Results 1 
5 of
5
Efficient DDDbased Symbolic Analysis of Large Linear Analog Circuits
, 2001
"... A new technique for generating approximate symbolic expressions for network functions in linear(ized) analog circuits is presented. It is based on the compact determinant decision diagram (DDD) representation of the circuit. An implementation of a term generation algorithm is given and its performan ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
A new technique for generating approximate symbolic expressions for network functions in linear(ized) analog circuits is presented. It is based on the compact determinant decision diagram (DDD) representation of the circuit. An implementation of a term generation algorithm is given and its performance is compared to a matroidbased algorithm. Experimental results indicate that our approach is the fastest reported algorithm so far for this application.
A Hierarchical Approach for the Symbolic Analysis of Large Analog Integrated Circuits
 Proc. IEEE Design Automation and Test in Europe, 2000
, 2000
"... This paper introduces a new hierarchical analysis methodology which incorporates approximation strategies during the analysis process. Consequently, the circuit sizes that can be analyzed increase dramatically, without suffering from the combinatorial explosion of expression complexity. Moreover, th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper introduces a new hierarchical analysis methodology which incorporates approximation strategies during the analysis process. Consequently, the circuit sizes that can be analyzed increase dramatically, without suffering from the combinatorial explosion of expression complexity. Moreover, the interpretability and usability in practical applications is enabled by providing analytical models that keep complexity at a minimum with the prescribed accuracy.
Anticommutative Tutte Functions and Unimodular Oriented Matroids
, 2005
"... ... Tree and forest enumeration expressions for electrical resistance are generalized. We also demonstrate how the coranknullity polynomial, basis expansions with activities, and a geometric lattice expansion generalize to ported Tutte functions of oriented matroids. The ported Tutte functions are ..."
Abstract
 Add to MetaCart
... Tree and forest enumeration expressions for electrical resistance are generalized. We also demonstrate how the coranknullity polynomial, basis expansions with activities, and a geometric lattice expansion generalize to ported Tutte functions of oriented matroids. The ported Tutte functions are parametrized, which raises the problem of how to generalize known characterizations of parameterized nonported Tutte functions.
Ported Tutte Functions of Extensors and Oriented Matroids
, 2006
"... The Tutte equations are ported (or setpointed) when the equations F(N) = geF(N/e) + reF(N \ e) are omitted for elements e in a distinguished set called ports. The solutions F, called ported Tutte functions, can distinguish different orientations of the same matroid. A ported extensor with ground se ..."
Abstract
 Add to MetaCart
The Tutte equations are ported (or setpointed) when the equations F(N) = geF(N/e) + reF(N \ e) are omitted for elements e in a distinguished set called ports. The solutions F, called ported Tutte functions, can distinguish different orientations of the same matroid. A ported extensor with ground set is a (fully) decomposable element in the exterior algebra (of antisymmetric tensors) over a vector space with a given basis, called the ground set, containing a distinguished subset called ports. A ported extensor is one way to present a linearly representable ported matroid or oriented matroid. There are extensor operations corresponding to oriented matroid dualization, and to deletions and contractions. We define a ported extensor function by means of dualization, port element renaming, exterior multiplication, and then contraction of all nonport elements. The main result is that this function satisfies a signcorrected variant of the Tutte equations in which deletion and contraction are extensor operations, and addition and the anticommutative multiplication belong to an exterior algebra rather than
2C2 A Graph Reduction Approach to Symbolic Circuit Analysis
"... Abstract — A new graph reduction approach to symbolic circuit analysis is developed in this paper. A Binary Decision Diagram (BDD) mechanism is formulated, together with a specially designed graph reduction process and a recursive sign determination algorithm. A symbolic analog circuit simulator is ..."
Abstract
 Add to MetaCart
Abstract — A new graph reduction approach to symbolic circuit analysis is developed in this paper. A Binary Decision Diagram (BDD) mechanism is formulated, together with a specially designed graph reduction process and a recursive sign determination algorithm. A symbolic analog circuit simulator is developed using a combination of these techniques. The simulator is able to analyze large analog circuits in the frequency domain. Experimental results are reported. I.