Pre-Grant Publication Number: 20090106489
Please help the USPTO examine the application by evaluating the relevance of the publicly submitted prior art to the patent application.
Peer To Patent forwards the Top 10 most relevant prior art submissions and their annotations to the USPTO.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.

Prior Art Detail
Summary / Description
| Summary / Description | Article describing a multiply-add-fused (MAF) unit. |
Basic Information
| Type of Prior Art | Print Publication |
| Publication Title * | IBM Journal of Research and Development |
| Author | R. K. Montoye E. Hokenek S. L. Runyon |
| ISBN | |
| Page Range | 59-70 |
| Medium | Journal article |
| Publication Date * | January 1990 |
| URL | |
Notes / To Do
| Notes | Submitted on behalf of Eric Schwarz, IBM, by Diane Willis. |
Excerpt
Excerpt The key feature of the FPU (floating point unit) is a unified floating-point multiply-add-fused unit (MAF) which performs the accumulate operation (A x B) + C as an indivisible operation. This single functional unit reduces the latency for chained floating-point operations, as well as rounding errors and chip busing.
It also reduces the number of adders/normalizers by combining the addition required for fast multiplication with accumulation. The MAF unit is
made practical by a unique fast-shifter, which eases the overlap of multiplication and addition, and a leading-zero/one anticipator, which eases
overlap of normalization and addition. The accumulate instruction required by this architecture reduces the instruction path length by combining two instructions into one.
|
Relevance
Claims
1
Relevance
It seems a fused multiply-add operation is being claimed, which is similar to the IBM RS/6000 in 1990 in the reference. If what is being claimed is a fixed-point multiply-accumulator, a fixed-point multiply-accumulator is even older.
It seems a fused multiply-add operation is being claimed, which is similar to the IBM RS/6000 in 1990 in the reference. If what is being claimed is a fixed-point multiply-accumulator, a fixed-point multiply-accumulator is even older.
Claim Chart
All
2
Relevance
See Claim 1.
See Claim 1.
Claim Chart
All
5
Relevance
See Claim 1.
See Claim 1.
Claim Chart
All
7
Relevance
See Claim 1.
See Claim 1.
Claim Chart
All
0 days left








