The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—A new Boolean function representation scheme, the Indexed Binary Decision Diagram (IBDD), is proposed to provide a compact representation for functions whose Ordered Binary Decision Diagram (OBDD) representation is intractably large. We explain properties of IBDDs and present algorithms for constructing IBDDs from a given circuit. Practical and effective algorithms for satisfiability testing and equivalence checking of IBDDs, as well as their implementation results, are also presented. The results show that many functions, such as multipliers and the hidden-weighted-bit function, whose analysis is intractable using OBDDs, can be efficiently accomplished using IBDDs. We report efficient verification of Booth multipliers, as well as a practical strategy for polynomial time verification of some classes of unsigned array multipliers.</p>
Boolean functions, BDDs, canonical representations, free BDDs, graph representations, IBDDs, OBDDs, satisfiability, verification.

D. S. Fussell, J. A. Abraham, J. Bitner, J. Jain and M. S. Abadir, "Indexed BDDs: Algorithmic Advances in Techniques to Represent and Verify Boolean Functions," in IEEE Transactions on Computers, vol. 46, no. , pp. 1230-1245, 1997.
85 ms
(Ver 3.3 (11022016))