Abstract
The paper describes a verification method for arithmetic circuits based on residue arithmetic. In the verification, a residue module is attached to the specification and the implementation, and these outputs are compared by constructing BDD's. For the BDD construction without node explosion, we introduce a residue BDD whose width is less than or equal to a modulus. The method is useful for multipliers including C6288.
Original language | English |
---|---|
Pages (from-to) | 542-545 |
Number of pages | 4 |
Journal | Proceedings - Design Automation Conference |
DOIs | |
Publication status | Published - 1995 |
Externally published | Yes |
Event | Proceedings of the 32nd Design Automation Conference - San Francisco, CA, USA Duration: 1995 Jun 12 → 1995 Jun 16 |
ASJC Scopus subject areas
- Hardware and Architecture
- Control and Systems Engineering