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

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn 2005, Issue , 2005, Pages 291-296

  Shekhar, Namrata ^a   Kalla, Priyank ^a   Enescu, Florian ^b   Gopalakrishnan, Sivaram ^a  

^a University of Utah   (United States)

^b GEORGIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COEFFICIENT MATCHING; CONTEMPORARY TECHNIQUES; FIXED SIZE BIT VECTORS; POLYNOMIAL DATAPATHS;

ALGORITHMS; COMPUTATION THEORY; EQUIVALENCE CLASSES; INTEGER PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; VECTORS;

POLYNOMIAL APPROXIMATION;

EID: 33751415634     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2005.1560081     Document Type: Conference Paper

References (29)

1. I. A. Groute and Keane. K, "M(vh)dl: A Matlab to Vhdl Conversion Toolbox for Digital Control", in IFAC Symp. on Computer-Aided Control System Design, Sept., 2000.
2. A. Peymandoust and G. DeMicheli, "Application of Symbolic Computer Algebra in High-Level Data-Flow Synthesis", IEEE Trans. CAD, vol. 22, pp. 1154-11656, 2003.
3. A. K. Verma and P. Ienne, "Improved use of the Carry-save Representation for the Synthesis of Complex Arithmetic Circuits", in Proceedings of the International Conference on Computer Aided Design, 2004.
4. R. E. Bryant, "Graph Based Algorithms for Boolean Function Manipulation", IEEE Trans. on Computers, vol. C-35, pp. 677-691, August 1986.
5. R. E. Bryant and Y-A. Chen, "Verification of Arithmetic Functions with Binary Moment Diagrams", in DAC, 95.
6. R. Dreschler, B. Becker, and S. Ruppertz, "The K*BMD: A Verification Data Structure", IEEE Design & Test, pp. 51-59, 1997.
7. M. Ciesielski, P. Kalla, Z. Zheng, and B. Rouzyere, "Taylor Expansion Diagrams: A Compact Canonical Representation with Applications to Symbolic Verification", in Proc. Design Automation and Test in Europe, DATE'02, Mar 2002.
8. D. Cyrluk, O. Moller, and H. Ruess, "An Efficient Procedure for the Theory of Fixed-Size Bitvectors", in LCNS, CAV, vol. 1254, 1997.
9. C. W. Barlett, D. L. Dill, and J. R. Levitt, "A Decision Procedure for bit-Vector Arithmetic", in DAC, June 1998.
10. C.-Y. Huang and K.-T. Cheng, "Using Word-Level ATPG and Modular Arithmetic Constraint Solving Techniques for Assertion Property Checking", IEEE Trans. CAD, vol. 20, pp. 381-391, 2001.
11. R. Brinkmann and R. Drechsler, "RTL-Datapath Verification using Integer Linear Programming", in Proc. ASP-DAC, 2002.
12. Z. Zhou and W. Burleson, "Equivalence Checking of Datapaths Based on Canonical Arithmetic Expressions", in DAC, 95.
13. Maple,", http://www.maplesoft.com.
14. G. M. Greuel, G. Pfister, and H. Schonemann, "SINGULAR 2.0", A Computer Algebra System for Polynomial Computations, Centre for Computer Algebra, University of Kaiserslautern, 2001, http://www.singular.uni-kl.de.
15. E. Kaltofen, "Polynomial Factorization 1987-1991", in Proc. LATIN'92 of Lect. Notes Comput. Sci., pp. 294-313, 1992.
16. E. Kaltofen, "Polynomial Factorization 1982-1986", in Computers in Mathematics of Lect. Notes in Pure and Applied Mathematics, pp. 285-309, 1990.
17. T. Becker and V. Weispfenning, Grobner Bases: A Computational Approach to Commutative Algebra, Springer-Verlag, 1993.
18. F. Chabaud and R. Larcier, "A toolbox for fast computation in finite extension over finite rings", http://zenfact.sourceforge.net/.
19. V. Shoup, "Ntl: A library for doing number theory", http://shoup.net/ntl/.
20. O. H. Ibarra and S. Moran, "Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs", Journal of the Association for Computing Machinery, vol. 30, pp. 217-228, Jan. 1983.
21. D. Singmaster, "On Polynomial Functions (mod m)", J. Number Theory, vol. 6, pp. 345-352, 1974.
22. N. Hungerbuhler and E. Specker, "A Generalization of the Smarandache Function to Several Variables", To appear in: Smarandache Notions Journal, vol. 15.
23. F. Smarandache, "A function in number theory", Analele Univ. Timisoara, Fascicle 1, vol. XVII, pp. 79-88, 1980.
24. N. Shekhar, P. Kalla, F. Enescu, and S. Gopalakrishnan, "Exploiting vanishing polynomials for equivalence verification of fixed-size arithmetic datapaths", in (to appear) ICCD, 2005.
25. Universite' de Bretagne Sud LESTER, "Gaut, Architectural Synthesis Tool", http://lester.univ-ubs.fr:8080, vol., 2004.
26. V. J. Mathews and G. L. Sicuranza, Polynomial Signal Processing, Wiley-Interscience, 2000.
27. M. R. Guthaus, J. S. Ringenberg, D. Ernst, T. M. Austin, T. Mudge, and R. B. Brown, "Mibench: A Free, Commercially Representative Embedded Benchmark Suite", in IEEE 4th Annual Workshop on Workload Characterization, Dec 2001.
28. R. K. Brayton, G. D. Hachtel, A. Sangiovanni-Vencentelli, F. Somenzi, A. Aziz, S-T. Cheng, S. Edwards, S. Khatri, Y. Kukimoto, A. Pardo, S. Qadeer, R. Ranjan, S. Sarwary, G. Shiple, S. Swamy, and T. Villa, "VIS: A System for Verification and Synthesis", in Computer aided Verification, 1996.
29. M. Moskewicz, C. Madigan, L. Zhao, and S. Malik, "CHAFF: Engineering and Efficient SAT Solver", in In Proc. Design Automation Conference, pp. 530-535, June 2001.