Complexity of basic boolean operators for digital circuit design
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908913298833408 |
|---|---|
| author | Sergeev, Igor S. |
| author_facet | Sergeev, Igor S. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_24319 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Complexity of basic boolean operators for digital circuit design Sergeev, Igor S. Data Structures and Algorithms 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. |
| title | Complexity of basic boolean operators for digital circuit design |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2603.24319 |