Using BDDs to Verify Multipliers

Abstract

Bryant’s Binary Decision Diagrams (BDDs) [6] have been successfully used for verifying combinational circuits [12, 18]. However, multiplier circuits are difficult to verify using BDDs since the size of the BDD representing multiplication grows exponentially in the number of input bits [6, 7]. This paper presents a method for using BDDs to verify multipliers… (More)
DOI: 10.1145/127601.127703

2 Figures and Tables

Topics

Statistics

051015'93'96'99'02'05'08'11'14'17
Citations per Year

fewer than 50 Citations

Semantic Scholar estimates that this publication has 50 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics