SAT-based automatic rectification and debugging of combinational circuits with LUT insertions

Speaker:  Masahiro Fujita - VLSI Design & Education Center, University of Tokyo
  Friday, October 12, 2012 at 4:00 PM 3:45 pm rinfresco; 4:00 pm inizio seminario.
Introducing partial programmability in circuits by replacing some gates with look up tables (LUTs) can be an effective way to improve post-silicon or in-field rectification and debugging. Although finding configurations of LUTs that can correct the circuits can be formulated as a QBF problem, solving it by state-of-the-art QBF solvers is still a hard problem for large circuits and many LUTs. In this paper, we present a rectification and debugging method for combinational circuits with LUTs by repeatedly applying Boolean SAT solvers. Through the experimental results, we show our proposed method can quickly find LUT configurations for large circuits with many LUTs, which cannot be solved by a QBF solver.

Ca' Vignal - Piramide, Floor 0, Hall Verde

Programme Director
Giuseppe Di Guglielmo

Publication date
October 1, 2012