Patent US5142490A successfully refreshed from Google Patents.
US5142490A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multiplication circuit with storing means
Assignee: Mitsubishi Electric Corp
•
Filing: 1990-11-19
•
Granted: 1992-08-25
•
Expires: 2010-11-19
Abstract
Abstract The multiplication circuit is formed in such a manner that the intermediate sums of partial products are divided into a lower places group and a higher places group and the operations for obtaining the products of the lower places group alone of the intermediate sums already found are carried out parallel to the processing for obtaining the higher places group of the intermediate sums to obtain the higher products thereafter, noting to the fact that the intermediate sums of partial products are found sequentially from lower places to higher places. By adopting such an arrangement, the operations for obtaining the higher places group of the intermediate sums can be processed in parallel with the operations for obtaining the products of the lower places group of the intermediate sums already found, and the higher products are found thereafter. Therefore, the time required for the former-stage processing and that required for the latter-stage processing can be made more uniform.
Inventors
- 👤 Yoshiki Tsujihashi
- 👤 Kazuhiro Sakashita
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 18:24
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/52; G06F7/523; G06F7/53; G06F7/5306; G06F7/5312; G06F2207/00; G06F2207/38; G06F2207/3804; G06F2207/386; G06F2207/3884
Claims Analysis
Total Claims: 4
Claim 1
Independent Claim
223 words
A circuit for improving calculation distribution in a pipelined multiplication circuit, the multiplication circuit producing a plurality of intermediate sums from a plurality of partial products generated from a first number and a second number to be multiplied together, with a sum of the plurality of partial products producing a value representative of a product of the first and second number, the circuit comprising: a first adding circuit for stepwise addition of a plurality of partial products disposed in columns to calculate a plurality of intermediate sums; a second adding circuit, having a first part, coupled to said first adding circuit, for forming a bit-area of a final product from a low-order group of said plurality of intermediate sums and a carry out of said bit-area, and a second part for forming a final product of the first and the second number from said plurality of intermediate sums; and a storing circuit coupled to said first and said second adding circuits, for receiving said bit-area and said carry-out from said first part of said second adding circuit and a high-order group of said plurality of intermediate sums from said first adding circuit, said high-order group not including intermediate sums from said low-order group, and for providing said bit-area, said carry-out and said high-order group to said second part of said second adding circuit.
Claim 2
Dependent Claim
223 words
A circuit for improving calculation distribution in a pipelined multiplication circuit, the multiplication circuit producing a plurality of intermediate sums from a plurality of partial products generated from a first number and a second number to be multiplied together, with a sum of the plurality of partial products producing a value representative of a product of the first and second number, the circuit comprising: a first adding circuit for stepwise addition of a plurality of partial products disposed in columns to calculate a plurality of intermediate sums; a second adding circuit, having a first part, coupled to said first adding circuit, for forming a bit-area of a final product from a low-order group of said plurality of intermediate sums and a carry out of said bit-area, and a second part for forming a final product of the first and the second number from said plurality of intermediate sums; and a storing circuit coupled to said first and said second adding circuits, for receiving said bit-area and said carry-out from said first part of said second adding circuit and a high-order group of said plurality of intermediate sums from said first adding circuit, said high-order group not including intermediate sums from said low-order group, and for providing said bit-area, said carry-out and said high-order group to said second part of said second adding circuit.
Claim 3
Dependent Claim
25 words
The circuit as set forth in claim 1, wherein a pipeline processing is carried out with said first adding circuit and said second adding circuit.
Claim 4
Dependent Claim
21 words
The circuit as set forth in claim 1, wherein said first and second adding circuits comprise a secondary Booth's multiplication circuit.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-08-25 | 1996-02-24 | 1996-08-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-08-25 | 2000-02-24 | 2000-08-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-08-25 | 2004-02-24 | 2004-08-25 | $7700.00 | Window Closed / Lapsed |