Programmable-logic-directed multiplier mapping

1. Multiplier circuitry on an integrated circuit device, the multiplier circuitry comprising:

first input circuitry configured to receive a first input;

second input circuitry configured to receive a second input;

first combinatorial circuitry coupled to the first input circuitry and the second input circuitry and configured to generate, based at least in part on the first input and the second input, a first subset of two or more partial products, wherein the first combinatorial circuitry is configured to perform a combinatorial function to generate the first subset based at least in part on redundant form arithmetic; and

carry chain circuitry, comprising:

second combinatorial circuitry coupled to the first input circuitry and the second input circuitry and configured to generate, based at least in part on the first input and the second input, a second subset of the two or more partial products; and

one or more binary ripple-carry adders coupled to the second combinatorial circuitry, wherein the one or more binary ripple-carry adders are configured to generate a product based at least in part on the first subset and the second subset;

wherein one or both of the second combinatorial circuitry or the one or more binary ripple-carry adders are configured to receive the first subset from the first combinatorial circuitry.

2. The multiplier circuitry of claim 1 , wherein the combinatorial function comprises one or both of an exclusive OR function or a majority function.

3. The multiplier circuitry of claim 1 , wherein the second combinatorial circuitry is configured to receive the first subset, wherein the second combinatorial circuitry is configured to generate the second subset based at least in part on the first input, the second input, and the first subset.

4. The multiplier circuitry of claim 1 , wherein one or both of the first combinatorial circuitry or the second combinatorial circuitry comprise a look up table.

5. The multiplier circuitry of claim 1 , wherein the one or more binary ripple-carry adders are configured to sum the first subset with the second subset, wherein summing the first subset and the second subset provides a result equivalent to a ternary addition.

6. The multiplier circuitry of claim 1 , wherein the first combinatorial circuitry is configured to perform one or both of 2:2 compression or 3:2 compression.

7. The multiplier circuitry of claim 1 , wherein the first combinatorial circuitry is configured to introduce an arithmetic zero in one or more bit positions of the first subset.

8. The multiplier circuitry of claim 1 , wherein the first combinatorial circuitry is out of band with the carry chain circuitry.

9. The multiplier circuitry of claim 1 , wherein the second combinatorial circuitry is configured to generate the second subset using a second combinatorial function based at least in part on the redundant form arithmetic.

10. The multiplier circuitry of claim 1 , wherein the multiplier circuitry comprises a soft multiplier.

11. The multiplier circuitry of claim 1 , wherein at least one of the two or more partial products comprises a sum of a first partial product and a second partial product.

12. The multiplier circuitry of claim 1 , wherein the integrated circuit device comprises a field-programmable gate array.

13. Multiplier circuitry on an integrated circuit device, the multiplier circuitry comprising:

first input circuitry configured to receive a first input having a first number of bits;

second input circuitry configured to receive a second input having a second number of bits;

first combinatorial circuitry coupled to the first input circuitry and the second input circuitry and configured to generate, based at least in part on the first input and the second input, a first subset of two or more partial products, wherein each of the two or more partial products comprises a respective product of bitwise multiplication of a respective bit of the second number of bits with each of the first number of bits, wherein the first combinatorial circuitry is configured to perform a combinatorial function to generate the first subset based at least in part on redundant form arithmetic; and

carry chain circuitry, comprising:

second combinatorial circuitry coupled to the first input circuitry and the second input circuitry and configured to generate, based at least in part on the first input and the second input, a second subset of the two or more partial products; and

one or more binary adders coupled to the second combinatorial circuitry, wherein the one or more binary adders are configured to generate a product based at least in part on a sum of the first subset and the second subset;

wherein one or both of the second combinatorial circuitry or the one or more binary adders are configured to receive the first subset from the first combinatorial circuitry.

14. The multiplier circuitry of claim 13 , wherein the sum of the first subset and the second subset comprises a partial product, wherein the one or more binary adders are configured to sum the partial product with an additional partial product to generate the product.

15. The multiplier circuitry of claim 14 , comprising third combinatorial circuitry, wherein the third combinatorial circuitry is configured to generate the additional partial product based at least on a compression of an additional two or more partial products.

16. The multiplier circuitry of claim 13 , wherein the one or more binary adders comprise one or more ripple-carry binary adders.

17. The multiplier circuitry of claim 13 , comprising routing circuitry, wherein:

the two or more partial products comprise two partial products; and

the routing circuitry is configured to route a least significant bit of a first partial product of the two partial products to bypass the carry chain circuitry.

18. A tangible, non-transitory, machine-readable medium, comprising machine-readable instructions to construct multiplier circuitry that, when executed by one or more processors, cause the one or more processors to:

configure first combinatorial circuitry to perform a combinatorial function, based at least in part on redundant form arithmetic, to generate a first subset of two or more partial products, wherein the two or more partial products are based at least in part on a first input to the multiplier circuitry and a second input to the multiplier circuitry;

configure second combinatorial circuitry of a carry chain in the multiplier circuitry to generate a second subset of the two or more partial products based at least in part on the first input and the second input; and

configure one or more binary ripple-carry adders of the carry chain to generate a product of the multiplier circuitry based at least in part on a sum of the two or more partial products.

19. The tangible, non-transitory, machine-readable medium of claim 18 , wherein the machine-readable instructions, when executed by the one or more processors, cause the one or more processors to:

route one or more bits of the first input and one or more bits of the second input to one or both of first combinatorial circuitry or the second combinatorial circuitry to minimize a number of partial products included in the two or more partial products.

20. The tangible, non-transitory, machine-readable medium of claim 18 , wherein the machine-readable instructions, when executed by the one or more processors, cause the one or more processors to:

determine the product based at least in part on a result generated by the multiplier circuitry in response to receiving the first input and the second input.