Improvement of the method for uncoupled binary input-output CNN template decomposition

This paper proposes an improved method for systematic decomposition of Boolean operators into a sequence of simpler ones. The improvement has two main components: (i) a sufficient condition for decreasing the number of possible child-templates during decomposition; (ii) pointing out the template element, the elimination of which results in the possibly maximum increment of the robustness value of the template. Examples are presented to demonstrate the effectiveness of the proposed method, whose advantages and limitations are also discussed.