Determinant Decision Diagrams

Abstract

Symbolic analysis traditionally suffers circuit size problems as the number of symbolic terms generated can grow exponentially with the circuit size. This problem has been partially mitigated by a graph-based approach, called determinant decision diagram (DDDs), where the symbolic terms are implicitly represented in a graph, which inspired by the success of binary decision diagram (BDDs) as an enabling technology for industrial use of symbolic analysis and formal verification in digital logic design. DDD-based symbolic analysis enable the exact symbolic analysis of many analog circuits substantially larger than the previous methods and open new applications for symbolic analysis. DDD-based symbolic analysis still remains the most efficient symbolic analysis technique.