Residue BDD and Its Application to the Verification of Arithmetic Circuits
暂无分享,去创建一个
The paper describes a verification method for arithmetic circuits based on residue arithmetic. In the verification, a residue module is attached to the specification and the implementation, and these outputs are compared by constructing BDD's. For the BDD construction without node explosion, we introduce a residue BDD whose width is less than or equal to a modulus. The method is useful for multipliers including C6288.
[1] Randal E. Bryant,et al. Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.
[2] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[3] R. Bryant,et al. Verification of Arithmetic Functions with Binary Moment Diagrams , 1994 .
[4] Jerry R. Burch,et al. Using bdds to verify multipliers , 1991, 28th ACM/IEEE Design Automation Conference.