Complexity of basic boolean operators for digital circuit design

Read full text Summarise with VIRAT
Authors: I. S. Sergeev
Cited by: 0
References: 17

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

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.

Fields of Study & Subjects

VLSI and FPGA Design Techniques Complexity and Algorithms in Graphs Coding theory and cryptography

Publication details

Journal / source
arXiv (Cornell University)
Publication date
25 March 2026
Language
EN
Document type
Preprint