This paper addresses theoretical aspects of arithmetic circuit verification based on algebraic
rewriting. Its goal is to advance the understanding of algebraic techniques for arithmetic …

This paper presents an algebraic approach to functional verification of gate-level, integer
arithmetic circuits. It is based on extracting a unique bit-level polynomial function computed …

Optimized and custom arithmetic circuits are widely used in embedded systems such as
multimedia applications, cryptography systems, signal processing and console games …

Optimized and custom arithmetic circuits are widely used in embedded systems such as
multimedia applications, cryptography systems, signal processing and console games …

Symbolic algebra is a promising approach to verify large and complex arithmetic circuits.
Existing algebraic-based verification methods generate a remainder to indicate buggy …

Many applications are inherently error tolerant. Approximate Computing is an emerging
design paradigm, which gives the opportunity to make use of this error tolerance, by trading …

Several circuit components can induce bit errors at high-speed wireline interfaces. Hence,
accurate identification and correction of error points in various circuits using straightforward …

If verification of a digital circuit fails, then debugging and fixing become the major
subsequent tasks. Arithmetic units are among the most challenging circuits for debugging …

In recent years, significant effort has been put into developing formal verification approaches
by both academic and industrial research. In practice, these techniques often give satisfying …

Galois field (GF) arithmetic is used to implement critical arithmetic components in
communication and security-related hardware, and verification of such components is of …