DeepAI AI Chat
Log In Sign Up

Simulation-Guided Boolean Resubstitution

by   Siang-Yun Lee, et al.

This paper proposes a new logic optimization paradigm based on circuit simulation, which reduces the need for Boolean computations such as SAT-solving or constructing BDDs. The paper develops a Boolean resubstitution framework to demonstrate the effectiveness of the proposed approach. Methods to generate highly expressive simulation patterns are developed, and the generated patterns are used in resubstitution for efficient filtering of potential resubstitution candidates to reduce the need for SAT validation. Experimental results show that improvements in circuit size reduction were achieved by up to 74 compared to a state-of-the-art resubstitution algorithm.


page 1

page 2

page 3

page 4


Fun-SAT: Functional Corruptibility-Guided SAT-Based Attack on Sequential Logic Encryption

The SAT attack has shown to be efficient against most combinational logi...

Boolean Equi-propagation for Optimized SAT Encoding

We present an approach to propagation based solving, Boolean equi-propag...

SAT-based Circuit Local Improvement

Finding exact circuit size is a notorious optimization problem in practi...

A Circuit-Level Amoeba-Inspired SAT Solver

AmbSAT is a biologically-inspired stochastic local search (SLS) solver t...

Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems

We present an approach to propagation-based SAT encoding of combinatoria...

REAS: Combining Numerical Optimization with SAT Solving

In this paper, we present ReaS, a technique that combines numerical opti...

A Novel Hierarchical Circuit LUT Model for SOI Technology for Rapid Prototyping

In this paper, a new look-up table (LUT) method is proposed to reduce th...

Code Repositories


Benchmarks and pattern files used in the simulation-guided Boolean resubstitution paper

view repo