US5150322A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Mixed-radix serial/parallel multipliers
Assignee: Philips Semiconductors Inc
•
Filing: 1990-06-05
•
Granted: 1992-09-22
•
Expires: 2010-06-05
Abstract
Abstract A serial/parallel multiplier for the multiplication of a coefficient word with a data word of which the bits are broadcast n at a time where n is at least three. The structure comprises a plurality of pipes which where n is even each consists of a radix-4 encoder receiving two bits of the cluster and driving a partial product generator coupled to a respective carry-save array which forms the required two bits of the product by shifting and accumulation. For n equal to an odd number, the final sub-pipe consists of a radix-2 sub-pipe rather than a radix-4 sub-pipe and provides a single bit of the output, which consists of a cluster of n bits.
Inventors
- 👤 Stewart G. Smith
- 👤 Ralph W. Morgan
- 👤 Julian G. Payne
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-10 02:30
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/52; G06F7/523; G06F7/527; G06F7/5272; G06F7/5275; G06F2207/00; G06F2207/38; G06F2207/3804; G06F2207/386; G06F2207/3884
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
177 words
A serial/parallel multiplier for the formation of a multiplicative product of a multiplicand having a multiplicity of bits and a multiplier having a plurality of coefficient bits, comprising: means for receiving the bits of the multiplicand in clusters of n bits wherein n is greater than two, said receiving means having a plurality of groups of inputs wherein each group consists of not more than two; and for each of the said groups: a respective radix-N encoder wherein N is equal to two when the respective group consists of one bit and is equal to four when the respective group consists of two bits; a radix-N partial product generator coupled to the respective radix-N encoder and to receive a respective coefficient bit; and a shift-accumulate sub-pipe coupled to receive partial products from the respective partial product generator and to provide a group of bits of the said product, the number of bits in this group being unity where N is two and two where N is four, the sub-pipes being interconnected and constituting together a processing pipe.
Claim 2
Dependent Claim
177 words
A serial/parallel multiplier for the formation of a multiplicative product of a multiplicand having a multiplicity of bits and a multiplier having a plurality of coefficient bits, comprising: means for receiving the bits of the multiplicand in clusters of n bits wherein n is greater than two, said receiving means having a plurality of groups of inputs wherein each group consists of not more than two; and for each of the said groups: a respective radix-N encoder wherein N is equal to two when the respective group consists of one bit and is equal to four when the respective group consists of two bits; a radix-N partial product generator coupled to the respective radix-N encoder and to receive a respective coefficient bit; and a shift-accumulate sub-pipe coupled to receive partial products from the respective partial product generator and to provide a group of bits of the said product, the number of bits in this group being unity where N is two and two where N is four, the sub-pipes being interconnected and constituting together a processing pipe.
Claim 3
Dependent Claim
33 words
A multiplier as set forth in claim 1 wherein n is greater than 3 and even, the said groups all consist of two bits and for each group N is equal to four.
Claim 4
Dependent Claim
51 words
A multiplier as set forth in claim 1 wherein n is greater than three and odd, all but one of the said groups consist of two bits and the one group consists of one bit, and there being a plurality of radix-4 encoders and one radix-2 encoder for the said groups.
Claim 5
Dependent Claim
18 words
A multiplier as set forth in claim 1 wherein each shift-accumulate sub-pipe comprises an array of full adders.
Claim 6
Dependent Claim
140 words
A serial/parallel multiplier for the formation of a multiplicative product of a multiplicand having a multiplicity of bits and a multiplier having a plurality of coefficient bits, comprising: means for receiving the bits of the multiplicand in clusters of n bits wherein n is greater than two and even, the receiving means having a plurality of groups of two inputs; for each of the said groups: a respective radix-4 encoder; a radix-4 partial product generator coupled to the respective radix-4 encoder and to receive a respective coefficient bit; and a shift-accumulate sub-pipe coupled to receive partial products from the respective partial product generator and to provide two bits of the output product simultaneously with the provision of the respective bits from the other sub-pipes, the sub-pipes being interconnected and constituting together a processing pipe; and feedforward connections between the subpipes.
Claim 7
Dependent Claim
140 words
A serial/parallel multiplier for the formation of a multiplicative product of a multiplicand having a multiplicity of bits and a multiplier having a plurality of coefficient bits, comprising: means for receiving the bits of the multiplicand in clusters of n bits wherein n is greater than two and even, the receiving means having a plurality of groups of two inputs; for each of the said groups: a respective radix-4 encoder; a radix-4 partial product generator coupled to the respective radix-4 encoder and to receive a respective coefficient bit; and a shift-accumulate sub-pipe coupled to receive partial products from the respective partial product generator and to provide two bits of the output product simultaneously with the provision of the respective bits from the other sub-pipes, the sub-pipes being interconnected and constituting together a processing pipe; and feedforward connections between the subpipes.
Claim 8
Dependent Claim
180 words
A serial/parallel multiplier for the formation of a multiplicative product of a multiplicand having a multiplicity of bits and a multiplier having a plurality of coefficient bits, comprising: means for receiving the bits of the multiplicand in clusters of n bits wherein n is odd and greater than two, said receiving means having a plurality of groups of two inputs and a group consisting of a single bit input; and for each of the said groups: a respective radix-N encoder wherein N is equal to two when the respective group consists of one bit and is equal to four when the respective group consists of two bits; a radix-N partial product generator coupled to the respective radix-N encoder and to receive a respective coefficient bit; and a shift-accumulate sub-pipe coupled to receive partial products from the respective partial product generator and to provide a group of bits of the said product, the number of bits in this group being unity where N is two and two where N is four, the sub-pipes being interconnected and constituting together a processing pipe.
Claim 9
Dependent Claim
180 words
A serial/parallel multiplier for the formation of a multiplicative product of a multiplicand having a multiplicity of bits and a multiplier having a plurality of coefficient bits, comprising: means for receiving the bits of the multiplicand in clusters of n bits wherein n is odd and greater than two, said receiving means having a plurality of groups of two inputs and a group consisting of a single bit input; and for each of the said groups: a respective radix-N encoder wherein N is equal to two when the respective group consists of one bit and is equal to four when the respective group consists of two bits; a radix-N partial product generator coupled to the respective radix-N encoder and to receive a respective coefficient bit; and a shift-accumulate sub-pipe coupled to receive partial products from the respective partial product generator and to provide a group of bits of the said product, the number of bits in this group being unity where N is two and two where N is four, the sub-pipes being interconnected and constituting together a processing pipe.
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-09-22 | 1996-03-23 | 1996-09-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-09-22 | 2000-03-23 | 2000-09-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-09-22 | 2004-03-23 | 2004-09-22 | $7700.00 | Window Closed / Lapsed |