Application of the ternary matrix cover technique to search for a partition of the argument set in decomposition of Boolean functions | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2011. № 3(16).

HomeIssuesApplication of the ternary matrix cover technique to search for a partition of the argument set in decomposition of Boolean functions | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2011. № 3(16).

Application of the ternary matrix cover technique to search for a partition of the argument set in decomposition of Boolean functions

The problem of a series two-block disjoint decomposition of a system of completely specifiedBoolean functions is considered. A method to search for a partition of the set of arguments intosubsets of bound and free arguments is suggested. The method is based on using the ternary matrixcover approach.

Download file
Counter downloads: 289

Keywords

декомпозиция булевых функций, компактная таблица, покрытие троичной матрицы, Decomposition of Boolean functions, compact table, ternary matrix cover

Authors

NameOrganizationE-mail
Pottosin Yury V.United Institute of Informatics Problems NAS of Belarus (Minsk)pott@newman.bas-net.by
Shestakov Evgeniy A.
Всего: 2

References

Perkowski M.A., Grygiel S. A survey of literature on functional decomposition. Version IV (Technical report). - Portland (USA): Portland State University, Department of Electrical Engineering, 1995. 188 p.
Закревский А.Д., Поттосин Ю.В., Черемисинова Л.Д. Логические основы проектирования дискретных устройств. М.: Физматлит, 2007. 592 с.
Joźwiak L., Chojnacki A. An effective and efficient method for functional decomposition of Boolean functions based on information relationship measures // Design and Diagnostics of Electronic Circuits and Systems: Proc. of 3rd DDECS Workshop Smolenice castle, Slovakia, April 5 - 7, 2000. - Bratislava: Institute of Informatics, Slovak Academy of Sciences, 2000. P. 242−249.
Закревский А.Д. Декомпозиция частичных булевых функций - проверка на разделимость по заданному разбиению // Информатика. 2007. № 1(13). С. 16−21.
Бибило, П.Н. Декомпозиция булевых функций на основе решения логических уравнений. Минск: Беларус. навука, 2009. 211 с.
Поттосин Ю.В., Шестаков Е.А. Табличные методы декомпозиции систем полностью определенных булевых функций. Минск: Белорус. наука, 2006. 327 с.
Application of the ternary matrix cover technique to search for a partition of the argument set in decomposition of Boolean functions | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2011. № 3(16).

Application of the ternary matrix cover technique to search for a partition of the argument set in decomposition of Boolean functions | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2011. № 3(16).

Download file