Determinant Decision Diagrams

  • Guoyong Shi
  • Sheldon X.-D. Tan
  • Esteban Tlelo Cuautle
Chapter
First Online:

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.

Keywords

Short Path Product Term Label Scheme Logic Circuit Binary Decision Diagram 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Guoyong Shi
    • 1
  • Sheldon X.-D. Tan
    • 2
  • Esteban Tlelo Cuautle
    • 3
  1. 1.School of MicroelectronicsShanghai Jiao Tong UniversityShanghaiChina
  2. 2.Department of Electrical EngineeringUniversity of CaliforniaRiversideUSA
  3. 3.INAOETonantzintlaMexico

Personalised recommendations