Method and Apparatus for Performing Multiplier Regularization

2. The method of claim 1, wherein the first cell supports a shared arithmetic mode that allows the first cell to transmit a value computed by a look up table (LUT) to an input of the second cell.

3. The method of claim 1, wherein determining whether a number of inputs for the cell designated for summing the column of partial product bits exceeds the input capabilities of the cell comprises comparing a number of total inputs associated with partial product bits associated with the column with a number of inputs supported by the cell.

4. The method of claim 1, wherein configuring the first cell comprises setting a first look up table (LUT) to generate the first partial product bit for the first column, and setting a second LUT to generate the second partial product bit for the subsequent column.

5. The method of claim 1, wherein configuring the second cell comprises transmitting the second partial product bit received from the first cell to an adder on the second cell, and transmitting the value to the adder on the second cell.

6. The method of claim 1, wherein the value comprises a least significant bit of a sum of two partial product bits.

7. The method of claim 6, wherein the least significant bit of the sum of the two partial product bits is computed by XORing the two partial product bits.

8. The method of claim 6 further comprising configuring the second cell to generate a second value that represents a most significant bit of the sum of the two partial product bits.

9. The method of claim 8, wherein the most significant bit of the sum of the two partial product bits is computed by performing an AND function on the two partial product bits.

12. The multiplier of claim 11, wherein the first cell supports a shared arithmetic mode that allows the first cell to transmit a value computed by a look up table (LUT) to an input of the second cell.

13. The multiplier of claim 11, wherein the first cell calculates the first partial product bit and the second partial product bit in response to comparing a number of total inputs associated with partial product bits associated with the column with a number of inputs supported by the first cell.

14. The multiplier of claim 11, wherein a first look up table (LUT) generates the first partial product bit, and a second LUT generates the second partial product bit.

15. The multiplier of claim 11, wherein the first value comprises a least significant bit of a sum of two partial product bits, and wherein the least significant bit of the sum of the two partial product bits is computed by XORing the two partial product bits.

16. The multiplier of claim 11, wherein the first value comprises a least significant bit of a sum of two partial product bits, and wherein the second cell generates a second value that represents a most significant bit of the sum of the two partial product bits.

17. The multiplier of claim 16, wherein the most significant bit of the sum of the two partial product bits is computed by performing an AND function on the two partial product bits.

19. The method of claim 18 further comprising assigning a new cell to support the new column wherein the new cell supports a shared arithmetic mode that allows the new cell to transmit a value computed by a look up table (LUT) to an input of a subsequent cell in the chains of PLD cells.

20. The method of claim 18 further comprising determining whether a number of inputs for a second cell designated for summing a second column of partial product bits exceeds the input capabilities for the second cell.

21. The method of claim 20 further comprising in response to determining that the number of inputs for the second cell exceeds the input capabilities of the second cell, determining whether the second column of partial product bits corresponds to a second to least significant bit of the chains of PLD cells of the multiplier.

22. The method of claim 21 further comprising in response to determining that the second column of partial product bits corresponds to the second to least significant bit of the chain of PLD cells, adding a second new bit two positions prior to the least significant bit of the chain and moving one of the partial product bits from the column of partial product bits into a second new column of partial product bits that corresponds to the second new bit.

23. The method of claim 22 further comprising moving another of the partial product bits from the column of partial product bits into the new column of partial product bits that corresponds to the new bit.