|
Decomposition of Systems of Completely Specified Boolean
Functions Using Their Compact Table Representation
Yury Pottosin , Eugeny Shestakov
Institute of Engineering Cybernetics of the NAS of Belarus
220012 Minsk, Belarus; e-mail: pott@newman.bas-net.by
Abstract
A technique for representation of a system of completely specified Boolean functions in the
form of a table similar to the Karnaugh map but more compact is described. Two methods for
decomposition based on this form are suggested. Experimental results on benchmarks are given.
|
