Efficient Functional Decomposition Algorithm Based on Indexed Partition Calculus

This paper presents an efficient functional decomposition method based on the indexed partition calculus. The computational efficiency of indexed partition manipulation procedures allows performing multilevel logic synthesis for multi-output, not fully specified Boolean functions of large number of input variables. The presented results prove that the proposed approach can generate results of high quality.