| DC Field | Value | Language |
|---|
| dc.contributor.author | Taghavi Afshord, S. | - |
| dc.contributor.author | Pottosin, Y. | - |
| dc.date.accessioned | 2017-10-24T09:01:04Z | - |
| dc.date.available | 2017-10-24T09:01:04Z | - |
| dc.date.issued | 2013 | - |
| dc.identifier.citation | Taghavi Afshord, S. Suboptimal Decomposition of Boolean Functions / S. Taghavi Afshord, Y. Pottosin //Информационные технологии и системы 2013 (ИТС 2013) : материалы международной научной конференции, БГУИР, Минск, Беларусь, 23 октября 2013 г. = Information Technologies and Systems 2013 (ITS 2013) : Proceeding of The International Conference, BSUIR, Minsk, 24th October 2013 / редкол.: Л. Ю. Шилин [и др.]. - Минск : БГУИР, 2013. – С. 110–111. | ru_RU |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/27107 | - |
| dc.description.abstract | Decomposition of Boolean functions is an effective technique to obtain the most com,pact circuits. The ternary matrix cover approach is a powerful method in two-block disjoint decomposition. Before constructing the desired superposition, this method needs to encode a table. To find a better solution, it is important to use a particular approach for encoding, because its result has a direct influence on the obtained functions. We present an efficient algorithm to encode this table. It uses the approach connected with the assembling Boolean hyper cube method. The benefits and impacts of the suggested technique are discussed. | ru_RU |
| dc.language.iso | en | ru_RU |
| dc.publisher | БГУИР | ru_RU |
| dc.subject | субоптимальное разложение булевых функций | ru_RU |
| dc.subject | материалы конференций | ru_RU |
| dc.subject | булевы функции | ru_RU |
| dc.title | Suboptimal Decomposition of Boolean Functions | ru_RU |
| dc.type | Статья | ru_RU |
| Appears in Collections: | ИТС 2013
|
