Abstract
A disjoint cube-based method for fast computation of Karpovsky's functional complexity measure is presented. A modification to the method for generating a disjoint sum of cube representations for a combinational system is also presented, which results in improved speed performance in the generation of disjoint sum of cubes. The proposed algorithms are tested on several benchmark circuits. The results obtained demonstrate the efficiency of the proposed algorithms.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
