OPTIMIZATION PROBLEM FOR NUMBER OF LOGIC GATES NEEDED TO IMPLEMENT MULTIPLE BOOLEAN FUNCTIONS USING DECODER
Abstract. Background. Computer circuits enable almost every piece of electronics to function. An opportunity for their optimization was found in one of the ways to implement a circuit, which involves a decoder. Decoders are basic circuit components whose behavior makes it easy to implement multiple...
Saved in:
Main Authors: | M. Onai, H. Skopyk |
---|---|
Format: | Article |
Language: | English |
Published: |
Odessa National Academy of Food Technologies
2024-12-01
|
Series: | Автоматизация технологических и бизнес-процессов |
Subjects: | |
Online Access: | https://journals.ontu.edu.ua/index.php/atbp/article/view/3018 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Synthesis of combinational circuits by means of bi-decomposition of Boolean functions
by: Yu. V. Pottosin
Published: (2022-03-01) -
Gelfand theorem implies Stone representation theorem of Boolean rings
by: Parfeny P. Saworotnow
Published: (1995-01-01) -
Algorithms for partitioning logical circuits into subcircuits
by: N. A. Kirienko
Published: (2020-09-01) -
Binary decision diagram‐based synthesis technique for improved mapping of Boolean functions inside memristive crossbar‐slices
by: Anindita Chakraborty, et al.
Published: (2021-03-01) -
DECODING OF STRUCTURALLY AND LOGICAL CODES
by: Yu. D. Ivanov, et al.
Published: (2016-07-01)