Abstract
In this chapter we mainly discuss the issues involved with the implementation of Determinant Decision Diagram and an investigation on its complexity. It turns out that the performance of a DDD implementation is mainly determined by several factors that interact to each other; the key factors among them are how the matrix elements are ordered and how a hash tableHash table is designed. A variable order determines the ultimate DDD size while the hash table design determines the efficiency during the course of construction. Working together, these two components determine dominantly how much time and memory are consumed by one construction cycle. One may easily create some benchmark problems which can be solved by some implementations while not by some other implementations because of the limited memory on a given computer.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this chapter
Cite this chapter
Shi, G., Tan, S.XD., Tlelo Cuautle, E. (2014). DDD Implementation. In: Advanced Symbolic Analysis for VLSI Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-1103-5_5
Download citation
DOI: https://doi.org/10.1007/978-1-4939-1103-5_5
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-1102-8
Online ISBN: 978-1-4939-1103-5
eBook Packages: EngineeringEngineering (R0)