Accelerating SAT-based boolean matching for heterogeneous FPGAS using one-hot encoding and CEGAR technique

Research output: Contribution to journalArticle

Abstract

This paper describes two speed-up techniques for Boolean matching of LUT-based circuits. One is one-hot encoding technique for variables representing input assignments. Though it requires more variables than existing binary encoding technique, almost all added clauses using one-hot encoding are binary clauses, which are suitable for efficient Boolean constraint propagation. The other is CEGAR (counter example guided abstraction refinement) technique which reduces the CPU time significantly. With both techniques, we can solve Boolean matching problem with 9 input function in 20 milliseconds on average, which is faster than the existing algorithms more than one order of magnitude.

Original languageEnglish
Pages (from-to)1374-1380
Number of pages7
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE99A
Issue number7
DOIs
Publication statusPublished - Jul 1 2016

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Accelerating SAT-based boolean matching for heterogeneous FPGAS using one-hot encoding and CEGAR technique'. Together they form a unique fingerprint.

  • Cite this