Logic Debugging of Arithmetic Circuits
Authors:
- Samaneh GhandaliSGSamaneh Ghandali
- Cunxi YuCYCunxi Yu
- Duo LiuDLDuo Liu
- Walter BrownWBWalter Brown
- Maciej CiesielskiMCMaciej Ciesielski
- 1 July 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21593469,p. 113-118
Abstract
This paper presents a novel diagnosis and logic debugging method for gate-level arithmetic circuits. It detects logic bugs in a synthesized circuit caused by using a wrong gate ("gate replacement" error), which change the functionality of the circuit. The method is based on modeling the circuit in an algebraic domain and computing its algebraic "signature". The location and type of the bug is determined by comparing signatures computed in both directions, using forward (PI to PO) and backward (PO to PI) rewriting. It will also perform automatic correction for the detected bugs. The approach is demonstrated and tested on a set of integer combinational arithmetic circuits.Keywords
This publication has 19 references indexed in Scilit:
- Path-Directed Abstraction and Refinement for SAT-Based Design DebuggingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2013
- A two-mode debugging system for VLSI designs using Xilinx FPGA2012
- Path directed abstraction and refinement in SAT-based design debugging2012
- Automated Design Debugging With Maximum SatisfiabilityIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2010
- Bounded Model DebuggingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2010
- Improved Design Debugging Using Maximum Satisfiability2007
- Automating Logic Rectification by Approximate SPFDs2007
- Efficient BMC for Multi-Clock Systems with Clocked Specifications2007
- A new RTL debugging methodology in FPGA-based verification platform2004
- Debug methodology for arithmetic circuits on FPGAs2003