Multiplier circuit design for a programmable logic device
AssigneeXilinx, Inc.
InventorAnil L. N. Telikepalli
Life of this patent
Estimating the term…
Loading patent…
AssigneeXilinx, Inc.
InventorAnil L. N. Telikepalli
Estimating the term…
The multiplier circuit has as input signals an M bit multiplicand and an N bit multiplier and outputs a M+N bit product. The multiplier circuit includes a number of recoder circuits. The recoder circuits recode the N bit multiplier into fewer bits, thereby reducing the longest signal path through the multiplier circuit and increasing the speed of the circuit. In one embodiment, the recoder circuits perform a N to N/2 Booth recoding. The recoder circuits are combined with other circuitry to generate partial products. The partial products are combined in a three to two compression circuit. The compression circuit further reduces the longest signal path through the multiplier circuit. In one embodiment, the three to two compression circuits are configured in a Wallace Tree. In another embodiment, four to two compression circuits are used. The compression circuit outputs two addends. The two addends are then added in an adder to generate the product. The recoder circuit and the first partial product circuits are configured within a single programmable logic element of the programmable logic device. Therefore, one embodiment of the invention efficiently uses the programmable logic elements of the programmable logic device.
A multiplier circuit in a programmable logic device, the multiplier circuit has as input signals an M bit multiplicand and an N bit multiplier, the multiplier circuit has an N plus M bit output signal representing the product of the multiplier and the multiplicand, the multiplier circuit comprises:
A multiplier circuit in a programmable logic device, said programmable logic device including a plurality of programmable logic elements, said multiplier circuit having as inputs an M bit multiplicand and an N bit multiplier, said multiplier circuit for generating a product, said multiplier circuit comprising:
A multiplier circuit in a programmable logic device, said programmable logic device including a plurality of programmable logic elements, said multiplier circuit having as inputs an M bit multiplicand and an N bit multiplier, said multiplier circuit for generating a product, said multiplier circuit comprising:
A method of generating a bit of a first addend and a bit of a second addend, said first addend plus said second addend being a product of an N bit multiplicand and an M bit multiplier in a programmable logic device, said programmable logic device including a plurality of programmable logic elements, said method comprising the steps of:
An eight bit by eight bit multiplier circuit design for a programmable logic device, said multiplier including:
A multiplier circuit in a programmable logic device, said programmable logic device including a plurality of programmable logic elements, said multiplier circuit having as inputs an M bit multiplicand and an N bit multiplier, said multiplier circuit for generating a product, said multiplier circuit comprising:
A multiplier circuit in a programmable logic device, said programmable logic device including a plurality of programmable logic elements, said multiplier circuit having as inputs an M bit multiplicand and an N bit multiplier, said multiplier circuit for generating a product, said multiplier circuit comprising:
A multiplier circuit in a programmable logic device, said programmable logic device including a plurality of programmable logic elements, said multiplier circuit having as inputs an M bit multiplicand and an N bit multiplier, said multiplier circuit for generating a product, said multiplier circuit comprising:
Dependencies are inferred from the claim text.