Recently, much attention has been paid to approximate computing, a novel design paradigm
for error-tolerant applications. It can significantly reduce area, power, and delay of circuits by …

Approximate computing is an emerging design technique for error-tolerant applications,
which may improve circuit area, delay, or power consumption by trading off a circuit's …

Bi-decomposition rewrites logic functions as the composition of simpler components. It is
related to Boolean division, where a given function is rewritten as the product of a divisor …

Approximate computing is an emerging design paradigm for error-tolerant applications. eg,
signal processing and machine learning. In approximate computing, the area, delay, or …

The identification of threshold function (TF), which determines whether a Boolean function
can be represented by an linear threshold logic gate (LTG) or not, is a fundamental but …

Identification of a Threshold Function (TF) is a significant task that determines whether a
given Boolean function is a TF or not. The state-of-the-art only identifies all 8-input NP-class …

Approximate synthesis is a recent trend in logic synthesis where one changes some outputs
of a logic specification, within the error tolerance of a given application, to reduce the …

Approximate synthesis is a recent trend in logic synthesis that changes some outputs of a
logic specification to take advantage of error tolerance of some applications and reduce …

Network pruning is a technique to minimize the number of parameters of large neural
networks. Network pruning can be performed once or multiple times. One-shot network …

Resistive random access memory (RRAM) is a nonvolatile memory technology which allows
to perform computations in both digital and analog circuits. Multiply-Accumulate (MAC) is an …