He Xinhua, Gong Yunzhan, Wei Daozheng . MULTIPLE OUTPUT CIRCUIT-BASED BDD ANALYSIS AND DESIGN[J]. Journal of Electronics & Information Technology, 1997, 19(3): 356-360.
Citation:
He Xinhua, Gong Yunzhan, Wei Daozheng . MULTIPLE OUTPUT CIRCUIT-BASED BDD ANALYSIS AND DESIGN[J]. Journal of Electronics & Information Technology, 1997, 19(3): 356-360.
He Xinhua, Gong Yunzhan, Wei Daozheng . MULTIPLE OUTPUT CIRCUIT-BASED BDD ANALYSIS AND DESIGN[J]. Journal of Electronics & Information Technology, 1997, 19(3): 356-360.
Citation:
He Xinhua, Gong Yunzhan, Wei Daozheng . MULTIPLE OUTPUT CIRCUIT-BASED BDD ANALYSIS AND DESIGN[J]. Journal of Electronics & Information Technology, 1997, 19(3): 356-360.
Effective description for Binary Decision Diagram(BDD) has proven useful in many applications as data structure for Boolean function. Based on the BDD of standard gate, recursive appending from primary input to output for BDD construction is proposed. Several benchmark circuits is shown to verify this method.
Lee C. Representation of switching circuits by BDDs. Bell Sys. Tech. J., 1959, 38(7): 985-999.[2]Bryant R E. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Comput,[3]86, 635(8): 677-691.[4]Brace K S.[J].Rudell R E, Bryant R E. Efficient implementation of a BDD package. Design Autometion8.1987,:-[5]Jain J.[J].et al. IBDDs: An efficient functional representation for digital circuits. Design Autometion9.1992,:-. IBDDs: An efficient functional representation for digital circuits. Design Autometion' target='_blank'>[6]Minato S.[J].Ishiura N, Yajima S. Shared BDD with attributed edge for efficient Boolean functional manipulation, DA9.1990,:-