Transistor network minimization is an important step in designing new standard cells.
Existing methods for minimizing transistor networks all rely on some heuristic techniques …

In this paper, a novel method to synthesize circuits based on threshold logic gates (TLG) is
proposed. Synthesis considering TLGs is quite relevant, since threshold logic has been …

This work presents functional composition (FC) as a new paradigm for combinational logic
synthesis. FC is a bottom-up approach to synthesize Boolean functions, being able to …

Efficient exact factoring algorithms are limited to read-once functions, in which each variable
appears once in the final Boolean equation. However, those algorithms present two main …

CMOS technology scaling is reaching its physical limits, and new nanometric devices are
being considered. Some of these technologies, such as quantum cellular automata (QCA) …

The paper focuses on logic synthesis of minimum-size circuits for small Boolean functions
using structural enumeration. Known results for completely-specified functions up to five …

The problem of factoring and decomposing Boolean functions is Σ-complete𝑃2 for general
functions. Efficient and exact algorithms can be created for an existing class of functions …

The advances in semiconductor industry over the last decades have been strongly based on
continuous scaling down of dimensions in manufactured CMOS devices. The use of CMOS …