Adders With Removed Dependencies
Original Publication Date: 1988-Mar-01
Included in the Prior Art Database: 2005-Feb-15
The following study proposes new recursive formulas, the implementation of which shortens the longest paths in the design of a binary adder and thus improves the execution time with respect to the traditional formulas for the addition. Let N indicate the natural numbers and V the exclusive OR. Let a quantity to be undefined, if such a quantity, or any logical operation involved with such a quantity, have no meaning, i.e., have no value attribute. Assume that the symbol used for undefined is . Let an expression or term that is represented as F(.) mean that F is determined by variables not explicitly stated. Suppose that bit positions are labeled 0 for the most significant bit and r for the least significant bit such that r B 0, i.e., the subscripts run from high order to low.