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 Перейти в каталог НБ ТГУ |