Algorithms for partitioning logical circuits into subcircuits
The problem of partitioning a logical circuit into subcircuits is considered. It is of great importance when performing optimization transformations in the process of circuit synthesis. The brief review of partitioning methods and algorithms is given, and two groups of algorithms are identified: con...
Saved in:
| Main Author: | N. A. Kirienko |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2020-09-01
|
| Series: | Informatika |
| Subjects: | |
| Online Access: | https://inf.grid.by/jour/article/view/1073 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Logical optimization the multilevel representations of systems of Boolean functions based on partitioning into blocksand Shannon decomposition
by: P. N. Bibilo, et al.
Published: (2018-09-01) -
Logical optimization of Boolean nets using Shannon expansion
by: P. N. Bibilo, et al.
Published: (2019-06-01) -
Quantum Circuit Synthesis Using Fuzzy-Logic-Assisted Genetic Algorithms
by: Ishraq Islam, et al.
Published: (2025-03-01) -
Terahertz All-Optical Logic Gates Based on a Graphene Nanoribbon Rectangular Ring Resonator
by: Wei Su, et al.
Published: (2018-01-01) -
Efficient design of 15:4 counter using a novel 5:3 counter for high‐speed multiplication
by: Hemanth Krishna L., et al.
Published: (2021-01-01)