Thumbnail
Access Restriction
Subscribed

Author Jo, S. ♦ Matsumoto, T. ♦ Fujita, M.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2012
Language English
Subject Domain (in DDC) Technology ♦ Engineering & allied operations ♦ Applied physics
Subject Keyword Table lookup ♦ Debugging ♦ Logic gates ♦ Combinational circuits ♦ Circuit faults ♦ Field programmable gate arrays ♦ Logic functions ♦ satisfiability ♦ rectification ♦ debugging ♦ look-up table
Abstract 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.
ISBN 9781467345552
ISSN 10817735
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2012-11-19
Publisher Place Japan
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
e-ISBN 9780769548760
Size (in Bytes) 242.13 kB
Page Count 6
Starting Page 19
Ending Page 24


Source: IEEE Xplore Digital Library