1995
DOI: 10.21236/ada294842
|View full text |Cite
|
Sign up to set email alerts
|

Bit-Level Analysis of an SRT Divider Circuit.

Abstract: Abstract-It is impractical to verify multiplier or divider circuits entirely at the bit-level using ordered Binary Decision Diagrams (BDDs), because the BDD representations for these functions grow exponentially with the word size. It is possible, however, to analyze individual stages of these circuits using BDDs. Such analysis can be helpful when implementing complex arithmetic algorithms. As a demonstration, we show that Intel could have used BDDs to detect erroneous lookup table entries in the Pentium(TM) f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

1996
1996
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…From a verification point of view, one of the most difficult parts in such complicated designs is arithmetic datapaths and their components, such as multipliers and dividers. Most of hardware verification tools are based on bitlevel methods like Binary Decision Diagrams (BDDs) or Satisfiability (SAT) solvers that are not scalable because they suffer from space and time explosion problems when dealing with large arithmetic circuits [1] [2]. To alleviate this problem, word-level Decision Diagrams like Binary Moment Diagrams (BMDs), *BMDs and K*BMDs have been proposed [3].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…From a verification point of view, one of the most difficult parts in such complicated designs is arithmetic datapaths and their components, such as multipliers and dividers. Most of hardware verification tools are based on bitlevel methods like Binary Decision Diagrams (BDDs) or Satisfiability (SAT) solvers that are not scalable because they suffer from space and time explosion problems when dealing with large arithmetic circuits [1] [2]. To alleviate this problem, word-level Decision Diagrams like Binary Moment Diagrams (BMDs), *BMDs and K*BMDs have been proposed [3].…”
Section: Introductionmentioning
confidence: 99%
“…In addition to the above-mentioned methods, there are many methods for verification of dividers specially SRT dividers [1][17] [18] [19]. In general most of them cannot support optimization techniques and in some cases the run time is very high.…”
Section: Introductionmentioning
confidence: 99%