Xuanxiang Huang
ABSTRACT
A recently proposed canonical representation called Bi-Kronecker Functional Decision Diagrams (BKFDDs) utilizes the classical decompositions (the Shannon and Davio decompositions) and their biconditional variants, and hence can be seen as a generalization of some existing decision diagrams: BDDs, FDDs, KFDDs and BBDDs. However, the size of BKFDDs for a Boolean function is very sensitive to variable orders with decomposition types (ODTs). Therefore, identifying a good ODT is of paramount importance for BKFDDs. In this paper, we propose four dynamic minimization algorithms for BKFDDs, which encapsulate smart strategies to search for a good ODT in a dynamic way. The experiments have been carried out on four influential benchmarks: ISCAS89, MCNC, ITC99 and EPFL, and the experimental results show that the proposed group sifting algorithms for BKFDDs are very effective and can produce BKFDDs with smaller size than state-of-the-art packages of DDs.
- Luca Amarú, Pierre-Emmanuel Gaillardon, and Giovanni De Micheli. 2014. Biconditional Binary Decision Diagrams: A Novel Canonical Logic Representation Form. IEEE Journal on Emerging and Selected Topics in Circuits and Systems 4, 4 (2014), 487--500.Google Scholar
Cross Ref
- Luca G. Amarù, Eleonora Testa, Miguel Couceiro, Odysseas Zografos, Giovanni De Micheli, and Mathias Soeken. 2018. Majority Logic Synthesis. In Proceedings of 2018 International Conference on Computer-Aided Design (ICCAD-2018). 79:1--79:6.Google ScholarDigital Library
- Bernd Becker and Rolf Drechsler. 1995. On the Relation between BDDs and FDDs. Information and Computation 123, 2 (1995), 185--197.Google ScholarDigital Library
- Bernd Becker, Rolf Drechsler, and Michael Theobald. 1993. On the implementation of a package for efficient representation and manipulation of functional decision diagrams. In Proceedings of IFIP WG 10.5 Workshop Applications of the Reed-Muller Expansion in Circuit Design. 162--169.Google Scholar
- Dirk Beyer, Claus Lewerentz, and Andreas Noack. 2003. Rabbit: A Tool for BDD-Based Verification of Real-Time Systems. In Proceedings of the Fifteenth International Conference on Computer Aided Verification (CAV-2003) (Lecture Notes in Computer Science, Vol. 2725). Springer, 122--125.Google ScholarCross Ref
- Beate Bollig and Ingo Wegener. 1996. Improving the Variable Ordering of OBDDs Is NP-complete. IEEE Trans. Comput. 45, 9 (1996), 993--1002.Google ScholarDigital Library
- George Boole. 1854. An Investigation of the Laws of Thought on Which are Founded the Mathematical Theories of Logic and Probabilities. Dover Publications.Google Scholar
- Randal E. Bryant. 1986. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. Comput. 35, 8 (1986), 677--691.Google ScholarDigital Library
- Rolf Drechsler and Bernd Becker. 1998. Ordered Kronecker Functional Decision Diagrams - A Data Structure for Representation and Manipulation of Boolean Functions. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 17, 10 (1998), 965--973.Google ScholarDigital Library
- Görschwin Fey, Junhao Shi, and Rolf Drechsler. 2004. BDD Circuit Optimization for Path Delay Fault Testability. In Proceedings of the Seventh Euromicro Symposium on Digital Systems Design (DSD-2004). 168--172.Google ScholarCross Ref
- Masahiro Fujita, Yusuke Matsunaga, and Taeko Kakuda. 1991. On Variable Ordering of Binary Decision Diagrams for the Application of Multi-level Logic Synthesis. In Proceedings of 1991 Conference on European Design Automation (EURO-DAC-1991). 50--54.Google ScholarCross Ref
- Xuanxiang Huang, Kehang Fang, Liangda Fang, Qingliang Chen, Zhao-Rong Lai, and Linfeng Wei. 2019. Bi-Kronecker Functional Decision Diagrams: A Novel Canonical Representation of Boolean Functions. In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-2019). 2867--2875.Google ScholarCross Ref
- Nagisa Ishiura, Hiroshi Sawada, and Shuzo Yajima. 1991. Minimazation of Binary Decision Diagrams Based on Exchanges of Variables. In Proceedings of 1991 IEEE/ACM International Conference on Computer-Aided Design (ICCAD-1991). 472--475.Google Scholar
- U. Kebschull, E. Schubert, and W. Rosenstiel. 1992. Multilevel Logic Synthesis Based on Functional Decision Diagrams. In Proceedings of the Third European Conference on Design Automation (EDAC-1992). 43--47.Google Scholar
- Guanfeng Lv, Kaile Su, and Yanyan Xu. 2013. CacBDD: A BDD Package with Dynamic Cache Management. In Proceedings of the Twenty-Fifth International Conference on Computer Aided Verification (CAV-2013) (Lecture Notes in Computer Science, Vol. 8044). Springer, 229--234.Google ScholarCross Ref
- David E. Muller. 1954. Application of Boolean Algebra to Switching Circuit Design and to Error Detection. Transactions of the IRE Professional Group on Electronic Computers 3, 3 (1954), 6--12.Google ScholarCross Ref
- Shipra Panda and Fabio Somenzi. 1995. Who Are the Variables in Your Neighborhood. In Proceedings of 1995 IEEE/ACM International Conference on Computer-Aided Design (ICCAD-1995). 74--77.Google ScholarDigital Library
- Shipra Panda, Fabio Somenzi, and Bernard F. Plessier. 1994. Symmetry Detection and Dynamic Variable Ordering of Decision Diagrams. In Proceedings of 1994 IEEE/ACM International Conference on Computer-Aided Design (ICCAD-1994). 628--631.Google Scholar
- Irving S. Reed. 1954. A class of multiple-error-correcting codes and their decoding scheme. Transactions of the IRE Professional Group on Information Theory 4, 4 (1954), 38--49.Google ScholarCross Ref
- Richard Rudell. 1993. Dynamic Variable Ordering for Ordered Binary Decision Diagrams. In Proceedings of 1993 IEEE/ACM International Conference on Computer-Aided Design (ICCAD-1993). 42--47.Google ScholarCross Ref
- Debashis Sahoo, Subramanian K. Iyer, Jawahar Jain, Christian Stangier, Amit Narayan, David L. Dill, and E. Allen Emerson. 2004. A Partitioning Methodology for BDD-Based Verification. In Proceedings of the Fifth International Conference on Formal Methods in Computer-Aided Design (FMCAD-2004) (Lecture Notes in Computer Science, Vol. 3312). Springer, 399--413.Google Scholar
- Claude E. Shannon. 1938. A Symbolic Analysis of Relay and Switching Circuits. Transactions of the American Institute of Electrical Engineers 57, 12 (1938), 713--723.Google ScholarCross Ref
- Navin Vemuri, Priyank Kalla, and Russell Tessier. 2002. BDD-based logic synthesis for LUT-based FPGAs. ACM Transactions on Design Automation of Electronic Systems 7, 4 (2002), 501--525.Google ScholarDigital Library
- Congguang Yang and Maciej J. Ciesielski. 2002. BDS: a BDD-based logic optimization system. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 21, 7 (2002), 866--876.Google ScholarDigital Library
Index Terms
- Dynamic minimization of bi-kronecker functional decision diagrams
Recommendations
How many decomposition types do we need? [decision diagrams]
EDTC '95: Proceedings of the 1995 European conference on Design and TestDecision Diagrams (DDs) are used in many applications in CAD. Various types of DDs, e.g. BDDs, FDDs, KFDDs, differ by their decomposition types. In this paper we investigate the different decomposition types and prove that there are only three that ...
Circuit Design from Kronecker Galois Field Decision Diagrams for Multiple-Valued Functions
ISMVL '97: Proceedings of the 27th International Symposium on Multiple-Valued LogicIn this paper we define the Kronecker Galois Field Decision Diagrams (KGFDDs), a generalization of Kronecker Decision Diagrams (KDDs) to the representation of Multiple-Valued (MV) functions. Starting from the Multi-place Decision Diagrams (MDDs) and ...
Complex spectral decision diagrams
ISMVL '96: Proceedings of the 26th International Symposium on Multiple-Valued LogicDifferent decision diagrams for representations of binary and multiple-valued functions in the form of Complex Hadamard Transforms and Spectra are introduced in this paper. Since Complex Hadamard Transform matrix can be recursively expanded through ...
Comments