Thedecomposition problem for a system of incompletely specified Boolean functions is considered. The concept of function dependence on some arguments is introduced for appreciating the complexity of decomposition components. A method for series parallel decomposition of a system of incompletely specified Boolean functions is suggested. The peculiarity of the method is that the arguments of components are not given and are found in the process of decomposition.
Download file
Counter downloads: 73
- Title SERIES PARALLEL DECOMPOSITION OF A SYSTEM OF INCOMPLETELY SPECIFIED BOOLEAN FUNCTIONS
- Headline SERIES PARALLEL DECOMPOSITION OF A SYSTEM OF INCOMPLETELY SPECIFIED BOOLEAN FUNCTIONS
- Publesher
Tomsk State University - Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 4(10)
- Date:
- DOI
Keywords
decomposition, system of incompletely specified Boolean functions, декомпозиция, система не полностью определенных булевых функцийAuthors
References
Закревский А. Д., Поттосин Ю. В., Черемисинова Л. Д. Логические основы проектирования дискретных устройств. М.: Физматлит, 2007. 592 с. Закревский А. Д. Логический синтез каскадных схем. М.: Наука, 1981. 414с.
Поттосин Ю. В., Шестаков Е. А. Табличные методы декомпозиции систем полностью определенных булевых функций. Минск: Белорус. наука, 2006. 327 с.
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.
SERIES PARALLEL DECOMPOSITION OF A SYSTEM OF INCOMPLETELY SPECIFIED BOOLEAN FUNCTIONS | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2010. № 4(10).
Download full-text version
Download fileCounter downloads: 175