US3795880A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Partial product array multiplier
Assignee: International Business Machines Corp
•
Filing: 1972-06-19
•
Granted: 1974-03-05
•
Expires: 1992-06-19
Abstract
Abstract A multiplier comprising a partial product array means for receiving an m-bit multiplier and an n-bit multiplicand for generating a partial product array of numbers in a plurality of columns. Each of the columns is connected to a multi-operand adder capable of simultaneously adding m-bits.
Inventors
- 👤 S Singh
- 👤 R Waxman
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 21:10
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/52; G06F7/523; G06F7/53; G06F7/5318
Claims Analysis
Total Claims: 5
Claim 1
Independent Claim
198 words
A multiplier advantageously adaptable for implementation with large scale integrated circuits comprising: a. a multiplicand storage means for storing n multiplicand bits of data, and a multiplier storage means for storing m multiplier bits of data, b. a partial product storage means for generating a partial product including no more than m + n-1 storage columns, said partial product storage means being connected to said multiplicand storage means in one coordinate direction associated with said partial product storage means, and also being connected to said multiplier storage means in the other coordinate direction associated with said partial product storage means, c. p (m + n-1)/k multi-operand adders connected to said storage array, where k is an integer equal to or greater than log2 (m-1), and where m + n-1/k is an integer greater than or equal to (m + n-1)/k, d. said partial product storage means being selectively responsive to said m and n bits of data for generating a partial product, and e. said p multi-operand adders being responsive to said generated partial product, independent of said m and n bits of data initially stored in said multiplier and multiplicand storage means, for generating a final product.
Claim 2
Dependent Claim
198 words
A multiplier advantageously adaptable for implementation with large scale integrated circuits comprising: a. a multiplicand storage means for storing n multiplicand bits of data, and a multiplier storage means for storing m multiplier bits of data, b. a partial product storage means for generating a partial product including no more than m + n-1 storage columns, said partial product storage means being connected to said multiplicand storage means in one coordinate direction associated with said partial product storage means, and also being connected to said multiplier storage means in the other coordinate direction associated with said partial product storage means, c. p (m + n-1)/k multi-operand adders connected to said storage array, where k is an integer equal to or greater than log2 (m-1), and where m + n-1/k is an integer greater than or equal to (m + n-1)/k, d. said partial product storage means being selectively responsive to said m and n bits of data for generating a partial product, and e. said p multi-operand adders being responsive to said generated partial product, independent of said m and n bits of data initially stored in said multiplier and multiplicand storage means, for generating a final product.
Claim 3
Dependent Claim
127 words
A multiplier advantageously adaptable for implementation with large scale integrated circuits as in claim 1 wherein said partial product storage means further includes: a. a plurality of first gating means connected to said storage columns, each of said plurality of first gating means including a first input terminal, a second input terminal, and an output terminal, a plurality of said first terminals being connected to said multiplicand storage means and a plurality of said second terminals being connected to said multiplier storage means, and a plurality of said output terminals being connected to predetermined ones of said storage columns, and b. said plurality of first gating means being selectively responsive to said m and n bits of data for storing a partial product in said storage array.
Claim 4
Dependent Claim
243 words
A multiplier advantageously adaptable for implementation with large scale integrated circuits as in claim 1 wherein: a. said partial product storage means is limited to p storage columns, each one of said p storage columns having a plurality of storage locations and being responsive to said n multiplicand bits of data for storing an initial predetermined skewed pattern of said n multiplicand bits of data, b. said partial product storage means further include means for interconnecting selected storage positions between said storage columns and being responsive to the transfer of data on said means for interconnecting for successively generating predetermined altered skewed patterns of data independent of said n bits of data initially stored in said multiplicand storage means, and a plurality of gating means connected to predetermined storage positions and to said multiplier storage means, said plurality of gating means being responsive to said m multiplier bits of data and serially responsive firstly to said initial predetermined skewed pattern of said n multiplicand bits of data, and then to said predetermined altered skewed patterns of data independent of said n bits of data initially stored in said multiplicand storage means, for generating a plurality of reduced partial product patterns of data, and c. said p multi-operand adders being selectively responsive only to said reduced partial product patterns of data, independent of said m and n bits of data initially stored in said multiplier and multiplicand storage means, for generating a final product.
Claim 5
Dependent Claim
81 words
A multiplier advantageously adaptable for implementation with large scale integrated circuits as in Claim 3 wherein: a. said storage positions comprise a plurality of shift register locations distributed among said p storage columns, and b. said means for interconnecting selected storage positions further comprise shifting means connected between predetermined ones of said shift register locations for selectively transferring data between said p storage columns for generating said predetermined altered skewed patterns of data from said initial predetermined skewed pattern of data.
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) | 1977-03-04 | 1977-09-03 | 1978-03-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1981-03-04 | 1981-09-03 | 1982-03-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1985-03-04 | 1985-09-03 | 1986-03-05 | $7700.00 | Window Closed / Lapsed |