Methods and apparatuses for calculating fp (full precision) and pp (partial precision) values
US-2018373535-A1 · Dec 27, 2018 · US
US10929101B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10929101-B2 |
| Application number | US-201816056115-A |
| Country | US |
| Kind code | B2 |
| Filing date | Aug 6, 2018 |
| Priority date | Aug 23, 2013 |
| Publication date | Feb 23, 2021 |
| Grant date | Feb 23, 2021 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A processor includes a carry save array multiplier. The carry save array multiplier includes an array of cascaded partial product generators. The array of cascaded partial product generators is configured to generate an output value as a product of two operands presented at inputs of the multiplier. The array of cascaded partial product generators is also configured to generate an output value as a sum of two operands presented at inputs of the multiplier.
Opening claim text (preview).
What is claimed is: 1. A processor, comprising: a multiplier having a first input, a second input, and an output; an arithmetic logic unit (ALJ) having: an adder having a first input, a second input, a third input, and an output, the adder configured to receive a first operand at the first input of the adder and a second operand at the second input of the adder; a carry register having an input and an output, the input of the carry register coupled to the output of the adder; and a multiplexer having a first input, a second input, a third input, and an output, the first input of the multiplexer coupled to the output of the carry register and the output of the multiplexer coupled to the third input of the adder; a first register having an input and output, the input of the first register coupled to the output of the multiplier and the output of the adder, the output of the first register coupled to the first input of the multiplier, the first input of the adder, and the second input of the multiplexer; a second register having an input and an output, the input of the second register coupled to the output of the multiplier and the output of the adder, the output of the second register coupled to the second input of the multiplier, the second input of the adder, and the third input of the multiplexer; and a sequencing logic coupled to control the multiplier, the ALU, the first register and the second register. 2. The processor of claim 1 , wherein the adder has a second output, and the second output of the adder is configured to output a sum value. 3. The processor of claim 2 , wherein the second output of the adder is configured to output a single-precision sum value at a first execution cycle and a double-precision sum value at a second execution cycle. 4. The processor of claim 1 , wherein the first output of the adder is configured to output a carry out value. 5. The processor of claim 1 , wherein the sequencing logic is configured to control the ALU to selectably perform addition or subtraction, and is configured to control the multiplier and the ALU to selectably perform a single precision multiply and accumulate (MAC) or a double precision MAC.
partitioned, i.e. using repetitively a smaller parallel parallel multiplier or using an array of such smaller multipliers · CPC title
Adding; Subtracting {(G06F7/405 takes precedence)} · CPC title
Multiplying; Dividing {(G06F7/405 takes precedence)} · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.