Prepare for shorter precision (round for reround) mode in a decimal floating-point instruction
US-2021004206-A1 · Jan 7, 2021 · US
US9632751B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9632751-B2 |
| Application number | US-201314140384-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 24, 2013 |
| Priority date | Dec 26, 2012 |
| Publication date | Apr 25, 2017 |
| Grant date | Apr 25, 2017 |
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.
According to one embodiment, an arithmetic circuit includes follows. The arithmetic unit performs an arithmetic operation including addition and multiplication to generate a first value of (n+m) bits. The rounding preprocessor performs an OR operation on lower (m−k) bits of the first value to generate a second value of 1 bit. The register stores a third value of (n+k+1) bits obtained by concatenating upper (n+k) bits of the first value and the second value. The rounding postprocessor calculates a carry bit value of 1 bit from a most significant bit of the third value and lower (k+1) bits of the third value, and adds the carry bit value to upper n bits of the third value.
Opening claim text (preview).
What is claimed is: 1. An arithmetic circuit comprising: an arithmetic unit configured to perform processing comprising an arithmetic operation including addition and multiplication to generate a first value of (n+m) bits, where n is an integer of not less than 1 and m is an integer of not less than 2; a rounding preprocessor configured to perform processing comprising compressing lower (m−1) bits of the first value generated by the arithmetic unit by performing an OR operation on the lower (m−1) bits of the first value to generate a second value of 1 bit; a register which stores a third value of (n+2) bits obtained by concatenating upper (n+1) bits of the first value and the second value; and a rounding postprocessor configured to determine an addition value of 2 bit based on a most significant bit of the third value, add the addition value to the third value to generate a fourth value, and remove lower two bits of the fourth value, wherein at least a part of the processing of the rounding preprocessor is performed in parallel with a part of the processing of the arithmetic unit.
Sticky bit · CPC title
using carry save adders · CPC title
Rounding to nearest (G06F7/49957 takes precedence) · CPC title
with simultaneous carry generation for, or propagation over, two or more stages · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.