Mod2OBDDs—A data structure that generalizes EXORsumofproducts and ordered binary decision diagrams
 Jordan Gergov,
 Christoph Meinel
 … show all 2 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
We present a data structure for Boolean manipulationthe Mod2OBDDsthat considerably extends ESOPs (EXORsumofproducts) as well as OBDDs (ordered binary decision diagrams). There are Boolean functions of practical interest which have exponential size optimal ESOPs (even multilevel EXORexpressions) and/or OBDDs that can be represented by (low degree) polynomial size Mod2OBDDs.
We show that Boolean manipulation tasks such as apply operation, quantification, composition can be performed with Mod2OBDDs at least as efficient as with OBDDs. Indeed, since the size of a minimal Mod2OBDDrepresentation of a Boolean function is, in general, smaller (sometimes even exponentially smaller) than the size of an optimal OBDDrepresentation, the increase in efficiency is considerable. Moreover, EXORoperations as well as complementations can be performed in constant timeO (1).
However, the price of constant time EXORapply operations is the canonicity of the Mod2OBDDrepresentation. In order to allow in spite of this fact efficient analysis of Mod2OBDDs we present a fast probabilistic equivalence test with onesided error probability for Mod2OBDDs (and, hence, for ESOPs) which performs only linear many arithmetic operations.
 M. Ajtai, L. Babai, P. Hajnal, J. Komlos, P. Pudlak, V. Rödl, E. Szemeredi, and G. Turan, “Two lower bounds for branching programs,”Proc. 18th ACM STOC, 1986, pp. 30–38.
 B. Becker, “Synthesis for testability: Binary decision diagrams,”Proc. of 9th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, February 1992, Vol 577, pp. 501–512.
 B. Becker and R. Drechsler,On the Computational Power of Functional Decision Diagrams, Interner Bericht 5/93, Universität Frankfurt, 1993.
 M.Blum, A.K.Chandra, and M.N.Wegman, “Equivalence of free boolean graphs can be decided probabilistically in polynomial time,”IPL 10, Vol. 2, pp. 80–82, 1980.
 S.D. Brown, R.J. Francis, J. Rose, and Z.G. Vranesic,FieldProgrammable Gate Arrays, Kluwer Academic Publisher, 1992.
 R.E.Bryant, “Graphbased algorithms for boolean function manipulation,”IEEE Trans. Comput. C35, Vol. 6, pp. 677–691, August 1986.
 R.E.Bryan, “On the complexity of VLSI implementations and graph representations of boolean functions with applications to integer multiplication”,IEEE Trans. Comput. 40, Vol. 2, pp. 205–213, February 1991. CrossRef
 R.E.Bryant, “Symbolic boolean manipulation with ordered binary decision diagrams,”ACM Computing Surveys, Vol. 24, No. 3, pp. 293–318, September 1992. CrossRef
 J.R. Burch, E.M. Clarke, K.L. McMillan, and D.L. Dill, “Sequential circuit verification using symbolic model checking,”Proc. of 27th ACM/IEEE Design Automation Conference, Orlando, June 1990, pp. 46–51.
 O. Coudert, J.C. Madre, and C. Berthet, “Verifying temporal properties of sequential machines without building their state diagrams”,Proc. of ComputerAided Verification, Rutgers, N.J., June 1990, pp. 75–84.
 R. Drechsler and B. Becker,Rapid Prototyping of Fully Testable MultiLevel AND/EXOR Networks, Interner Bericht 4/93, Universität Frankfurt, 1993.
 H.Eveking,Verifikation digitaler Systeme, Teubner, Stuttgart, 1991.
 J. Gergov and Ch. Meinel, “Frontiers of feasible and probabilistic feasible boolean manipulation with branching programs,”Proc. of 10th Annual Symposium on Theoretical Aspects of Computer Science, (February), Lecture Notes in Computer Science, Vol. 665, 1993, pp. 576–585.
 J. Gergov and Ch. Meinel, “Efficient analysis and manipulation of OBDDs can be extended to FBDDs”,IEEE Transactions on Computers, Vol. 43, No. 10, 1994.
 J.Jain, J.Bitner, D.S.Fussell, and J.Abraham, “Probabilistic verification of Boolean functions,”Formal Methods in System Design, Vol. 1, pp. 63–117, 1992. CrossRef
 U. Kebschull, E. Shubert, and W. Rosenstiel, “Multilevel logic synthesis based on functional decision diagrams”,Proc. EDAC'92, 1992, pp. 43–47.
 R. Lidl and H. Niederreiter,Introduction to Finite Fields and Their Applications, Cambridge University Press, 1986.
 S. Malik, A. Wang, and R.K. Brayton, “A. SangiovanniVincentelli: Logic verification using binary decision diagrams in a logic synthesis environment”,Proc. IEEE International Conference on ComputerAided Design, Santa Clara, Calif., November 1988, pp. 6–9.
 Ch. Meinel,Modified Branching Programs and Their Computational Power, Springer Verlag, LNCS 370, 1989.
 H. Minato, N. Ishiura, and S. Yajima, “Shared binary decision diagrams with attributed edges for efficient boolean function manipulation”,Proc. 27th ACM/IEEE Design Automation Conference, Orlando, June 1990, pp. 52–57.
 D.E.Muller, “Application of Boolean algebra to switching circuit design and to error correction,”IRE Trans. Electr. Comp., Vol. 3, No. 3, pp. 6–12, September 1954.
 M.A. Perkowski, L. Csansky, A. Sarabi, and I. Schäfer, “Fast minimization of mixed polarity AND/XOR canonical networks”,Proceedings of ICCD'92, 1992, pp. 33–36.
 A.A. Razborov, “A lower bound on the size of bounded depth networks over a complete basis with logical addition”,Mat. Zametki, Vol. 41, No. 4, pp. 598–607, 1987 (in Russian); English translation in:Math. Notes, Vol. 41, No. 4, pp. 333–338, 1987.
 S.M.Reddy, “Easily testable realizations for logical functions,”IEEE Trans. Comput., Vol. C21, pp. 1183–1188, November 1972.
 I.S.Reed, “A class of multipleerrorcorrecting codes and their decoding scheme,”IRE Trans. Inf. Theory, Vol. PGIT4, pp. 38–49, 1954. CrossRef
 T.Sasao and Ph.W.Besslich, “On the Complexity of Mod2 Sum PLAs,”IEEE Trans. Comput., Vol. 39, No. 2, pp. 269–266, February 1990. CrossRef
 T. Sasao, ”Optimization of multivalued ANDEXOR expressions using multipleplace decision diagrams”,Proceedings of the 22nd Int. Symp. of MultiValued Logic, 1992, pp. 451–458.
 J.M. Saul, “Logic synthesis for arithmetic circuits using ReedMuller representation”,Proc. EDAC'92, March 1992.
 Title
 Mod2OBDDs—A data structure that generalizes EXORsumofproducts and ordered binary decision diagrams
 Journal

Formal Methods in System Design
Volume 8, Issue 3 , pp 273282
 Cover Date
 19960501
 DOI
 10.1007/BF00709139
 Print ISSN
 09259856
 Online ISSN
 15728102
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 data structures for Boolean functions
 BDDs
 verification
 EXOR expressions
 Industry Sectors
 Authors

 Jordan Gergov ^{(1)}
 Christoph Meinel ^{(2)}
 Author Affiliations

 1. MaxPlanckInstitut für Informatik, Im Stadtwald, D66123, Saarbrücken, Germany
 2. Fachbereich IVInformatik, Universität Trier, D54286, Trier, Germany