2011 IEEE International High Level Design Validation and Test Workshop 2011
DOI: 10.1109/hldvt.2011.6114160
|View full text |Cite
|
Sign up to set email alerts
|

Modular equivalence verification of polynomial datapaths with multiple word-length operands

Abstract: In this paper, we extend Modular Horner Expansion Diagram (Modular-HED) as a canonical polynomial representation to verify polynomial functions with multiple bit-width operands from nd n n Z Z Z 2 2 2 ... 2 1 × × to n Z 2 . Our contributions are mostly in efficient implementation of [1] with a canonical decision diagram in such a way that both verification and synthesis of large arithmetic circuits can be more efficient. The experimental results show the effectiveness of our approach in comparison with other d… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 26 publications
(50 reference statements)
0
2
0
Order By: Relevance
“…Floating point modeling is still beyond the capabilities of the TED. Another representation trying to improve the performance of modeling is the Horner expansion diagram (HED) and its modular version, the M-HED [27,28]. These representations, though powerful, are not capable of modeling floating points.…”
Section: Related Workmentioning
confidence: 99%
“…Floating point modeling is still beyond the capabilities of the TED. Another representation trying to improve the performance of modeling is the Horner expansion diagram (HED) and its modular version, the M-HED [27,28]. These representations, though powerful, are not capable of modeling floating points.…”
Section: Related Workmentioning
confidence: 99%
“…This approach is efficient for arithmetic circuits with only word-level arithmetic constraints. There are also other approaches to represent computer algebra constraints with so called Horner Expansion Diagrams [13]. Also this approach is working on the word-level and can handle word-level arithmetic constraints only.…”
Section: Introductionmentioning
confidence: 99%