Synthesis of combinational circuits by means of bi-decomposition of Boolean functions
O b j e c t i v e s . The problem of synthesis of combinational circuits in the basis of two-input gates is considered. Those gates are AND, OR, NAND and NOR. The objective of the paper is to investigate the possibilities of application of bi-decomposition of Boolean functions to the synthesis of co...
Saved in:
Main Author: | Yu. V. Pottosin |
---|---|
Format: | Article |
Language: | Russian |
Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2022-03-01
|
Series: | Informatika |
Subjects: | |
Online Access: | https://inf.grid.by/jour/article/view/1182 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Technology independent optimization when implementing sparse systems of disjunctive normal forms of Boolean functions in ASIC
by: P. N. Bibilo, et al.
Published: (2024-03-01) -
The Boolean zeta function
by: Algirdas Javtokas
Published: (2005-12-01) -
Further constructions of bent functions and their duals
by: Yanjun Li, et al.
Published: (2021-01-01) -
Algorithms for partitioning logical circuits into subcircuits
by: N. A. Kirienko
Published: (2020-09-01) -
Theoretical understanding of gradients of spike functions as boolean functions
by: DongHyung Yoo, et al.
Published: (2024-11-01)