The binary decision diagrams （BDDs） can give canonical representation to Boolean functions; they have wide applications in the design and verification of digital systems. A new method based on cultural algorithms fo...The binary decision diagrams （BDDs） can give canonical representation to Boolean functions; they have wide applications in the design and verification of digital systems. A new method based on cultural algorithms for minimizing the size of BDDs is presented in this paper. First of all, the coding of an individual representing a BDDs is given, and the fitness of an individual is defined. The population is built by a set of the individuals. Second, the implementations based on cultural algorithms for the minimization of BDDs, i.e., the designs of belief space and population space, and the designs of acceptance function and influence function, are given in detail. Third, the fault detection approaches using BDDs for digital circuits are studied. A new method for the detection of crosstalk faults by using BDDs is presented. Experimental results on a number of digital circuits show that the BDDs with small number of nodes can be obtained by the method proposed in this paper, and all test vectors of a fault in digital circuits can also be produced.展开更多
The properties of the paths in an ROBDD representation of a Boolean function are presented and proved in the present paper, and the applications of ROBDD in calculating signal probability are also discussed. By this m...The properties of the paths in an ROBDD representation of a Boolean function are presented and proved in the present paper, and the applications of ROBDD in calculating signal probability are also discussed. By this method, the troublesome calculation of the correlation among the nodes, which is caused by the re-convergent fan-out in digital system, can be avoided and power estimation can be faster than simulation-based method in [1].展开更多
This paper describes a new BDD(Binary Decision Diagram) that use SCOAP value for its path. Based on analysis of BDD and input variables, variable ordering and reducing algorithms for BDD operation that are constructed...This paper describes a new BDD(Binary Decision Diagram) that use SCOAP value for its path. Based on analysis of BDD and input variables, variable ordering and reducing algorithms for BDD operation that are constructed by circuits description of netlist are proposed. Further, several bench nark circuits are shown to verify the efficient methods.展开更多
基金supported by Natural Science Foundation of Guangdong Provincial of China (No.7005833)
文摘The binary decision diagrams （BDDs） can give canonical representation to Boolean functions; they have wide applications in the design and verification of digital systems. A new method based on cultural algorithms for minimizing the size of BDDs is presented in this paper. First of all, the coding of an individual representing a BDDs is given, and the fitness of an individual is defined. The population is built by a set of the individuals. Second, the implementations based on cultural algorithms for the minimization of BDDs, i.e., the designs of belief space and population space, and the designs of acceptance function and influence function, are given in detail. Third, the fault detection approaches using BDDs for digital circuits are studied. A new method for the detection of crosstalk faults by using BDDs is presented. Experimental results on a number of digital circuits show that the BDDs with small number of nodes can be obtained by the method proposed in this paper, and all test vectors of a fault in digital circuits can also be produced.
文摘The properties of the paths in an ROBDD representation of a Boolean function are presented and proved in the present paper, and the applications of ROBDD in calculating signal probability are also discussed. By this method, the troublesome calculation of the correlation among the nodes, which is caused by the re-convergent fan-out in digital system, can be avoided and power estimation can be faster than simulation-based method in [1].
基金Supported by National 8th five-year plan of China(Project No.867030203)
文摘This paper describes a new BDD(Binary Decision Diagram) that use SCOAP value for its path. Based on analysis of BDD and input variables, variable ordering and reducing algorithms for BDD operation that are constructed by circuits description of netlist are proposed. Further, several bench nark circuits are shown to verify the efficient methods.
