Saeid Taghavi Afshord - Computer EngineeringDepartment, Shabestar Branch, Islamic Azad University, Shabestar, Iran
Yuri Pottosin - United Institute of Engineering Cybernetics, National Academy of Sciences of Belarus,Minsk, Belarus

The problem of series two-block disjoint decomposition of completely specifiedBoolean functions is considered. Analysis and investigation of such systems are veryimportant in logical design context. Recently, a good method for solving thisproblem was suggested which has been based on the ternary matrix cover approach.Using this method a computer program was developed. This paper is focused ondecomposability of a system of Boolean functions. The experiments were done ongenerated systems and standard benchmarks. In decomposable systems, the totalnumber of solutions and the time elapsed to achieve them are inspected. The totalnumber of solutions among all partitions for investigated systems, ranged between3% and 87% in generated systems and also, 1% and 96% in standard benchmarks

Boolean functions, Decomposition, Cover map, Compact table, Logic synthesis