A Unified Framework for Equivalence Verification of Datapath Oriented Applications

In this paper, we introduce a unified framework based on a canonical decision diagram called Horner Expansion Diagram (HED) [1] for the purpose of equivalence checking of datapath oriented hardware designs in various design stages from an algorithmic description to the gate-level implementation. The HED is not only able to represent and manipulate algorithmic specifications in terms of polynomial expressions with modulo equivalence but also express bit level adder (BLA) description of gate-level implementations. Our HED can support modular arithmetic operations over integer rings of the form Z2n. The proposed techniques have successfully been applied to equivalence checking on industrial benchmarks. The experimental results on different applications have shown the significant advantages over existing bit-level and also word-level equivalence checking techniques.

[1]  Markus Wedler,et al.  A Normalization Method for Arithmetic Data-Path Verification , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Norbert Hungerbühler,et al.  A GENERALIZATION OF THE SMARANDACHE FUNCTION TO SEVERAL VARIABLES , 2006 .

[3]  Rolf Drechsler,et al.  RTL-datapath verification using integer linear programming , 2002, Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design.

[4]  Masahiro Fujita,et al.  LTED : A Canonical and Compact Hybrid Word-Boolean Representation as a Formal Model for Hardware / Software Co-designs , 2007 .

[5]  Lorenz Halbeisen.  Powers and Polynomials in Zm , 1999 .

[6]  Rolf Drechsler,et al.  The K*BMD: A Verification Data Structure , 1997, IEEE Des. Test Comput..

[7]  Masahiro Fujita,et al.  Automatic Merge-Point Detection for Sequential Equivalence Checking of System-Level and RTL Descriptions , 2007, ATVA.

[8]  R. Drechsler,et al.  Formal verification of word-level specifications , 1999, Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078).

[9]  Priyank Kalla,et al.  Taylor Expansion Diagrams: A Canonical Representation for Verification of Data Flow Designs , 2006, IEEE Transactions on Computers.

[10]  Masahiro Fujita,et al.  Arithmetic Circuits Verification without Looking for Internal Equivalences , 2008, 2008 6th ACM/IEEE International Conference on Formal Methods and Models for Co-Design.

[11]  Florian Enescu,et al.  Equivalence Verification of Polynomial Datapaths Using Ideal Membership Testing , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[13]  Lorenz Halbeisen,et al.  Powers and Polynomials in ${\Bbb Z}_m$RID="*"ID="*" Dedicated to the memory of Prof. Hans Läuchli , 1999 .

[14]  NORBERT HUNGERB.  Powers and Polynomials in Z M , .

[15]  K. Keane,et al.  A MATLAB to VHDL Conversion Toolbox for Digital Control , 2000 .

[16]  Kwang-Ting Cheng,et al.  Using word-level ATPG and modular arithmetic constraint-solvingtechniques for assertion property checking , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..