Abstract: An adder circuitry for adding two floating-point operands is provided. The first operand includes a first exponent and a first mantissa, the second operand includes a second exponent and a second mantissa. The adder circuitry includes a least significant bit (LSB) handler, an exponent subtractor, a near-path logic circuit, a far-path logic circuit, and a selection logic circuit. The LSB handler generates an LSB result to reflect whether LSBs of the first and second exponent are identical. The exponent subtractor computing an exponent difference between the first and second exponent. The near-path logic circuit computes a near-path result according to the first and second mantissa. The far-path logic circuit computes a far-path result according to the exponent difference, the first mantissa and the second mantissa. The selection logic circuit selects one of the near-path result and the far-path result according to the exponent difference.

Abstract: In a novel computation device, a plurality of partial product generators is communicatively coupled to a binary number multiplier. The binary number is partitioned in the computation device into non-overlapping subsets of binary bits and each subset is coupled to one of the plurality of partial product generators. Each partial product generator, upon receiving a subset of binary bits representing a number, generates a multiplication product of the number and a predetermined constant. The multiplication products from all partial product generators are summed to generate the final product between the predetermined constant and the binary number. The partial product generators are constructed by logic gates and wires connected the logic gates including a AND gate. The partial product generators are free of memory elements.

Abstract: In a novel computation device, a plurality of partial product generators is communicatively coupled to a binary number multiplier. The binary number is partitioned in the computation device into non-overlapping subsets of binary bits and each subset is coupled to one of the plurality of partial product generators. Each partial product generator, upon receiving, a subset of binary bits representing a number, generates a multiplication product of the number and a predetermined constant. The multiplication products from all partial product generators are summed to generate the final, product between the predetermined constant and the binary number. The partial product generators are constructed by logic gates and wires connected the logic gates including a AND gate. The partial product generators are free of memory elements.

Abstract: In a novel computation device, a plurality of partial product generators is communicatively coupled to a random number. The random number is partitioned in the computation device into non-overlapping subsets of binary bits and each subset is coupled to one of the plurality of partial product generators. Each partial product generator, upon receiving a subset of binary bits representing a number, generates a multiplication product of the number and a predetermined constant. The multiplication products from all partial product generators are summed to generate the final product between the predetermined constant and the random number.