Functional complexity estimation for large combinational circuits

A disjoint cube-based method for the fast computation of M.G. Karpovsky´s (1976, 1977) functional complexity measure is presented. A modification to the method for generating a disjoint sum-of-cubes representation for a combinational system is also presented, which results in improved speed performance in the generation of disjoint sums of cubes. The proposed algorithms are tested on several benchmark circuits. The results obtained demonstrate the efficiency of the proposed algorithms