66
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

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

, , &
Pages 1363-1372 | Received 07 Feb 2003, Published online: 12 May 2010
 

Abstract

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 n ) to O(1), where m is the number of operands and n is the number of bits.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.