Two operand binary adders with threshold logic

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: s=2n, w_max=2ⁿ, f_max=2n+1. Depth 3 adder: s=4n-2[n/[√n]], w_max =2[n/[√n]], f_max=2[n/[√n]]+1. Depth d adder (asymptotic behavior): s=O(n), w_max=O(2^d-1√n), f_max=O(^d-1√n). If the weights are bounded by w_max:n_max=O(log^d-1 w_max), d _min=O(log n/log(log w_max))