Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Zero-suppressed BDDs for set manipulation in combinatorial problems
DAC '93 Proceedings of the 30th international Design Automation Conference
Hierarchical approach to exact symbolic analysis of large analog circuits
Proceedings of the 41st annual Design Automation Conference
A fast symbolic computation approach to statistical analysis of mesh networks with multiple sources
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Computational complexity analysis of determinant decision diagram
IEEE Transactions on Circuits and Systems II: Express Briefs
Canonical symbolic analysis of large analog circuits with determinant decision diagrams
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hierarchical symbolic analysis of analog integrated circuits via determinant decision diagrams
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Efficient approximation of symbolic expressions for analog behavioral modeling and analysis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hierarchical exact symbolic analysis of large analog integrated circuits by symbolic stamps
Proceedings of the 16th Asia and South Pacific Design Automation Conference
A survey on binary decision diagram approaches to symbolic analysis of analog integrated circuits
Analog Integrated Circuits and Signal Processing
| Hi-index | 0.00 |
Determinant decision diagram (DDD) uses a Binary Decision Diagram (BDD) to represent the Laplace expansion of a determinant. It is used as the core computation engine in some modern symbolic circuit simulators. The traditional implementations rely on a BDD package for the common-data sharing operations in which symbol ordering plays an essential role. This paper proposes a simple implementation method which does not use any BDD package. Sharing is implemented by directly hashing minors, while the requirement on symbol ordering is weakened to an expansion ordering. The basic mechanism used is a natural formulation of layered expansion which is analogous to manual expansion of a determinant, hence it is easily understood. The simplified DDD construction method not only makes the DDD implementation straightforward, but also results in greater efficiency. A simulator developed based on this new method solves the μa725 op-amp circuit in a few seconds by flat expansion.