Complexity of basic boolean operators for digital circuit design

TL;DR

This paper surveys the complexity bounds of basic boolean operators used in digital circuit design and discusses efficient synthesis methods for simple functions like counters and adders.

Contribution

It provides a comprehensive overview of circuit complexity bounds and synthesis techniques for fundamental boolean functions in digital circuits.

Findings

Summarizes complexity bounds for basic boolean operators.

Discusses efficient synthesis methods for simple digital functions.

Explores applications to specific operation implementations.

Abstract

This article provides a survey of circuit complexity bounds for basic boolean transforms exploited in digital circuit design and efficient methods for synthesizing such circuits. The exposition covers structurally simple functions and operators, such as counters, adders, encoders, and multiplexors, and excludes more complex algebraic operations with numbers, polynomials, and matrices. Several applications to implementing more specific operations are also discussed.