A new theorem in threshold logic and its application to multioperand binary adders

We present a new theorem in Threshold Logic which is a generalization of Mezei's theorem. We demonstrate one of its applications, i.e., the optimization of the size of depth-2 Multioperand Binary Adders. By applying this theorem, the weight complexity of the gates in the second layer of a previous construction is reduced from O(m·2 ⁿ ) to O(1), where m is the number of operands and n is the number of bits.