Synthesis of combinational circuits by means of bi-decomposition of Boolean functions
The problem of combinational circuits synthesis in the basis of two-input gates is considered. Those gates are AND, OR, NAND and NOR. A method for solving this problem by means of Boolean functions bi-decomposition is suggested. The method reduces the problem to the search for a weighted two-block c...
| Опубликовано в: : | Прикладная дискретная математика № 60. P. 95-105 |
|---|---|
| Главный автор: | |
| Формат: | Статья в журнале |
| Язык: | English |
| Предметы: | |
| Online-ссылка: | http://vital.lib.tsu.ru/vital/access/manager/Repository/koha:001003091 Перейти в каталог НБ ТГУ |
| LEADER | 02547nab a2200349 c 4500 | ||
|---|---|---|---|
| 001 | koha001003091 | ||
| 005 | 20230614170001.0 | ||
| 007 | cr | | ||
| 008 | 230607|2023 ru s a eng d | ||
| 024 | 7 | |a 10.17223/20710410/60/8 |2 doi | |
| 035 | |a koha001003091 | ||
| 040 | |a RU-ToGU |b rus |c RU-ToGU | ||
| 100 | 1 | |a Pottosin, Yu. V. |9 408299 | |
| 245 | 1 | 0 | |a Synthesis of combinational circuits by means of bi-decomposition of Boolean functions |c Yu. V. Pottosin |
| 246 | 1 | 1 | |a Синтез комбинационных схем путем алгебраической декомпозиции булевых функций |
| 336 | |a Текст | ||
| 337 | |a электронный | ||
| 504 | |a Библиогр.: 11 назв. | ||
| 520 | 3 | |a The problem of combinational circuits synthesis in the basis of two-input gates is considered. Those gates are AND, OR, NAND and NOR. A method for solving this problem by means of Boolean functions bi-decomposition is suggested. The method reduces the problem to the search for a weighted two-block cover of the orthogonality graph of ternary matrice rows representing the given Boolean function by complete bipartite subgraphs (bi-cliques). Each bi-clique in the obtained cover is assigned in a certain way with a set of variables that are the arguments of the function. This set is the weight of the bi-clique. Each of those bi-cliques defines a Boolean function whose arguments are the variables assigned to it. The functions obtained in such a way constitute the required decomposition. The process of combinational circuit synthesis consists in successively applying bi-decomposition to the functions obtained. The method for two-block covering the orthogonality graph of ternary matrice rows is described. | |
| 653 | |a синтез комбиниционных схем | ||
| 653 | |a булевы функции | ||
| 653 | |a декомпозиция булевых функций | ||
| 653 | |a троичная матрица | ||
| 653 | |a полные двудольные подграфы | ||
| 655 | 4 | |a статьи в журналах |9 888211 | |
| 773 | 0 | |t Прикладная дискретная математика |d 2023 |g № 60. P. 95-105 |x 2071-0410 |w 0210-48760 | |
| 852 | 4 | |a RU-ToGU | |
| 856 | 4 | |u http://vital.lib.tsu.ru/vital/access/manager/Repository/koha:001003091 | |
| 856 | |y Перейти в каталог НБ ТГУ |u https://koha.lib.tsu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=1003091 | ||
| 908 | |a статья | ||
| 999 | |c 1003091 |d 1003091 | ||
| 039 | |b 100 | ||