This article is cited in 3 papers

Topical issue

Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram

P. N. Bibilo

United Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus

Abstract: We propose a decomposition method for systems of incompletely specified Boolean functions represented as binary decision diagrams. Minimizing the number of intermediate functions in such a decomposition is intended to improve the performance of Boolean circuits made of library elements. A characteristic feature of our method is the fact that after decomposition (cutting) of the original binary decision diagram one of two decomposition units is represented as a system of DNFs.

Presented by the member of Editorial Board: A. A. Lazarev

Received: 16.11.2013

 English version: Automation and Remote Control, 2014, 75:7, 1173–1194

Bibliographic databases:

• 
•