An Equivalence Method for Verifying the Combinational Circuits Based on BDD
Shao Li
Abstract
Shao Li
Abstract
This paper analyzes equivalence checking methods of combinational circuits based on binary decision diagram.The methods to structure the BDDs of outputs are discussed,and two different kinds of algorithms dealing with the boolean operations between BDDs are discussed.Then we present a equivalence method for verifying the combinational circuits based on BDD.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper analyzes equivalence checking methods of combinational circuits based on binary decision diagram.The methods to structure the BDDs of outputs are discussed,and two different kinds of algorithms dealing with the boolean operations between BDDs are discussed.Then we present a equivalence method for verifying the combinational circuits based on BDD.
Key concepts: Binary decision diagram, Formal equivalence checking, Combinational logic, Computer science, Equivalence (formal languages), Boolean function, Boolean circuit, Algorithm