Communication based multilevel synthesis for multi-output Boolean functions

A multilevel logic synthesis technique for multi-output Boolean functions is presented which is based on minimizing the communication complexity. Unlike previous approaches, which in the final analysis decompose each single-output function f_i of a multi-output function f=(f₁, ..., f_m) independently of the other single-output functions f_j (j≠i), the approach presented in this paper gives special attention to the fact that there possibly exist some decomposition functions which can be used by different outputs during the decomposition of the single-output functions of f. The benchmarking results (taken from 1991 MCNC multilevel logic benchmarks) which close the paper are promising