The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—The central topic of this paper is the implementation of binary adders with Threshold Logic using a new methodology that introduces two innovations: the use of the input and output carries of each bit for obtaining all the sum bits and a modification of the classic Carry Lookahead adder technique that allows us to obtain the expressions of the generation and propagation carries in a more appropriate way for Threshold Logic. In this way, it has been possible to systematize the process of design of a binary adder with Threshold Logic relating all its important parameters: number of bits of the operands, depth, size, maximum fan-in, and maximum weight. The results obtained are an improvement on those published to date and are summarized as follows: Depth 2 adder: <tmath>$s = 2n$</tmath>, <tmath>$w_{max} = 2^n$</tmath>, <tmath>$f_{max} = 2n + 1$</tmath>. Depth 3 adder: <tmath>$s = 4n - 2\left\lceil {{n \over {\left\lceil {\sqrt n } \right\rceil }}} \right\rceil $</tmath>, <tmath>$w_{\max } = 2^{\left\lceil {{n} \over {\left\lceil {\sqrt n } \right\rceil }}} \right\rceil } $</tmath>, <tmath>$f_{\max } = 2\left\lceil {{n \over {\left\lceil {\sqrt n } \right\rceil }}} \right\rceil + 1$</tmath>. Depth d adder (asymptotic behavior): <tmath>$s = O (n)$</tmath>, <tmath>$w_{\max } = O(2^{\root {d - 1} \of n } )$</tmath>, <tmath>$f_{\max } = O(\root {d - 1} \of n )$</tmath>. If the weights are bounded by <tmath>$w_{max}$</tmath>: <tmath>$n_{\max } = O\!\left( {\log ^{d - 1} w_{\max } } \right)$</tmath>, <tmath>$d_{\min } = O\!\left( {{{\log n} \over {\log \left( {\log w_{\max } } \right)}}} \right)$</tmath>.</p>
Threshold logic, computer arithmetic, binary adders, logic design, threshold gate, neural networks.

A. G. Bohórquez and J. F. Ramos, "Two Operand Binary Adders with Threshold Logic," in IEEE Transactions on Computers, vol. 48, no. , pp. 1324-1337, 1999.
88 ms
(Ver 3.3 (11022016))