Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Verification of arithmetic circuits with binary moment diagrams
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
ACV: an arithmetic circuit verifier
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Computer arithmetic: algorithms and hardware designs
Computer arithmetic: algorithms and hardware designs
Computer Arithmetic Algorithms
Computer Arithmetic Algorithms
Advanced Formal Verification
Some properties of Gröbner-bases for polynomial ideals
ACM SIGSAM Bulletin
Formal Design of Arithmetic Circuits Based on Arithmetic Description Language
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
| Hi-index | 0.00 |
This paper presents a formal approach to verify arithmetic circuits using symbolic computer algebra. Our method describes arithmetic circuits directly with high-level mathematical objects based on weighted number systems and arithmetic formulae. Such circuit description can be effectively verified by polynomial reduction techniques using Gröbner Bases. In this paper, we describe how the symbolic computer algebra can be used to describe and verify arithmetic circuits. The advantageous effects of the proposed approach are demonstrated through experimental verification of some arithmetic circuits such as multiply-accumulator and FIR filter. The result shows that the proposed approach has a definite possibility of verifying practical arithmetic circuits.