Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra

This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapath-oriented designs that implement polynomial computations over fixed-size bit-vectors. When the size (m) of the entire datapath is kept constant, fixed-size bit-vector arithmetic manifests itself...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:ICCAD-2005 : International Conference on Computer Aided Design, November 6-10, 2005, DoubleTree Hotel, San Jose, CA s. 291 - 296
Hlavní autoři: Shekhar, N., Kalla, P., Enescu, F., Gopalakrishnan, S.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: Washington, DC, USA IEEE Computer Society 31.05.2005
IEEE
ACM
Edice:ACM Conferences
Témata:
Applied sciences
Electric, optical and optoelectronic circuits
Electronics
Exact sciences and technology
Mathematics of computing
Mathematics of computing > Mathematical analysis
Mathematics of computing > Mathematical analysis > Numerical analysis
Mathematics of computing > Mathematical analysis > Numerical analysis > Computations on polynomials
Theoretical study. Circuits analysis and design
Performance evaluation
Algorithmics
Register transfer level
Modulo calculus
Canonical form
ISBN:078039254X, 9780780392540
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapath-oriented designs that implement polynomial computations over fixed-size bit-vectors. When the size (m) of the entire datapath is kept constant, fixed-size bit-vector arithmetic manifests itself as polynomial algebra over finite integer rings of residue classes Z/sub 2//sup m/. The verification problem then reduces to that of checking equivalence of multi-variate polynomials over Z/sub 2//sup m/. This paper exploits the concepts of polynomial reducibility over Z/sub 2//sup m/ and derives an algorithmic procedure to transform a given polynomial into a unique canonical form modulo 2/sup m/. Equivalence testing is then carried out by coefficient matching. Experiments demonstrate the effectiveness of our approach over contemporary techniques.
Bibliografie:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:078039254X
9780780392540
DOI:10.5555/1129601.1129644