Simulation Bounds for Equivalence Verification of Polynomial Datapaths Using Finite Ring Algebra


This paper addresses simulation-based verification of high-level [algorithmic, behavioral, or register-transfer level (RTL)] descriptions of arithmetic datapaths that perform polynomial computations over finite word-length operands. Such designs are typically found in digital signal processing (DSP) for audio/video and multimedia applications; where the… (More)
DOI: 10.1109/TVLSI.2008.917409


6 Figures and Tables

Slides referencing similar topics