US4796219A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Serial two's complement multiplier
Assignee: Motorola Solutions Inc
•
Filing: 1987-06-01
•
Granted: 1989-01-03
•
Expires: 2007-06-01
Abstract
Abstract A pipelined multiplier which serially receives a signed input multiplicand and a signed multiplier to generate a signed serial output product is provided. The multiplier utilizes a technique which simplifies the addition of partial product bits by creating a uniform partial product array. Columns of partial product bits are sequentially added in a pipelined structure. Carry bits which are generated during the column addition of partial product bits are delayed in the pipeline and coupled back to the input of the pipeline at the appropriate time for another addition of column bits as product bits are serially outputted. By minimizing delays in the pipeline, multiplication of signed operands of large bit length may be quickly performed.
Inventors
- 👤 Tim A. Williams
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 16:46
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/52; G06F7/523; G06F7/525; G06F2207/00; G06F2207/38; G06F2207/3804; G06F2207/386; G06F2207/3884; G06F7/499; G06F7/49994
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
274 words
A high speed serial data multiplier, comprising: first clocked data storage means for receiving a first signed input operand and serially storing a sign bit and magnitude bits of the frst input operand in a predetermined order in response to a clock signal; second clocked data storage means having predtermined register locations for receiving a second signed input operand having a sign bit and magnitude bits and serially clocking the magnitude bits and sign bit in response to the clock signal thru the second clocked data storage means until the second clocked data storage means contains the sign bit of the second operand in all the predetermined register locations; logic means coupled to the first and second clocked data storage means, for successively forming groups of predetermined partial product bits of positive value in response to receiving clocked bits from the first and second clocked data storage means; and sum means coupled to the logic means for successively receiving groups of predetermined partial product bits serially from the logic means and adding the partial product bits with one or more input carry bits to provide an output product bit and one or more output carry bits for each receipt of partial product bits, said sum means having a delay portion for delaying outputting of said output carry bit or bits generated from the addition of partial product bits before coupling said output carry bit or bits to an input of the sum means as an input carry bit for a successive output product bit generation, said delay portion further providing a correction input bit for use during an initial addition of partial product bits.
Claim 2
Dependent Claim
274 words
A high speed serial data multiplier, comprising: first clocked data storage means for receiving a first signed input operand and serially storing a sign bit and magnitude bits of the frst input operand in a predetermined order in response to a clock signal; second clocked data storage means having predtermined register locations for receiving a second signed input operand having a sign bit and magnitude bits and serially clocking the magnitude bits and sign bit in response to the clock signal thru the second clocked data storage means until the second clocked data storage means contains the sign bit of the second operand in all the predetermined register locations; logic means coupled to the first and second clocked data storage means, for successively forming groups of predetermined partial product bits of positive value in response to receiving clocked bits from the first and second clocked data storage means; and sum means coupled to the logic means for successively receiving groups of predetermined partial product bits serially from the logic means and adding the partial product bits with one or more input carry bits to provide an output product bit and one or more output carry bits for each receipt of partial product bits, said sum means having a delay portion for delaying outputting of said output carry bit or bits generated from the addition of partial product bits before coupling said output carry bit or bits to an input of the sum means as an input carry bit for a successive output product bit generation, said delay portion further providing a correction input bit for use during an initial addition of partial product bits.
Claim 3
Dependent Claim
114 words
The high speed serial data multiplier of claim 1 wherein the sum means further comprise: first adder means for receiving the partial product bits and input carry bit or bits and simultaneously adding the partial product bits and input carry bit or bits to provide first intermediate carry bits and sum bits; second adder means coupled to the first adder means for receiving the sum bits and adding the sum bits to provide the output product bits and a second intermediate carry bit; and third adder means coupled to the first and second adder means for receiving and adding the first and second intermediate carry bits to provide said output carry bit or bits.
Claim 4
Dependent Claim
31 words
The high speed serial data multiplier of claim 1 wherein the first clocked data storage means is a stack register and the second clocked data storage means is a shift register.
Claim 5
Dependent Claim
27 words
The high speed serial data multiplier of claim 1 wherein the first and second clocked data storage means have substantially the same number of register storage locations.
Claim 6
Independent Claim
188 words
A method of serially multiplying a first and a second input operand, comprising the steps of: receiving the first signed input operand and serially storing a sign bit and magnitude bits of the first input operand in a first storage device in a predetermined order in response to a clock signal; receiving the second signed input operand and serially clocking magnitude bits and a sign bit of the second input operand thru a predetermined portion of a second storage device until the second storage device contains the sign bit of the second operand in all storage locations of the predetermined portion of the second storage device; successively forming groups of predetermined partial product bits of positive value during, and in response to, receipt of bits by the first and second storage devices; successively adding the groups of predetermined partial product bits with one or more input carry bits to provide output product bits and output carry bits; and selectively delaying outputting the carry bits generated from the addition of partial product bits before utilizing the carry bits as input carry bits for a successive output product bit generation.
Claim 7
Independent Claim
188 words
A method of serially multiplying a first and a second input operand, comprising the steps of: receiving the first signed input operand and serially storing a sign bit and magnitude bits of the first input operand in a first storage device in a predetermined order in response to a clock signal; receiving the second signed input operand and serially clocking magnitude bits and a sign bit of the second input operand thru a predetermined portion of a second storage device until the second storage device contains the sign bit of the second operand in all storage locations of the predetermined portion of the second storage device; successively forming groups of predetermined partial product bits of positive value during, and in response to, receipt of bits by the first and second storage devices; successively adding the groups of predetermined partial product bits with one or more input carry bits to provide output product bits and output carry bits; and selectively delaying outputting the carry bits generated from the addition of partial product bits before utilizing the carry bits as input carry bits for a successive output product bit generation.
Claim 8
Dependent Claim
32 words
The method of claim 5 further comprising the step of: providing a correction input bit of predetermined value to the adding means for use during an initial addition of partial product bits.
Claim 9
Dependent Claim
216 words
A high serial data multiplier, comprising: a shift register for receiving a first signed input operand and serially storing a sign bit and magnitude bits of the first input operand in a predetermined order in response to a clock signal; a stack register for receiving a second signed input operand having a sign bit and magnitude bits and serially clocking the magnitude bits and sign bit thru the stack register in response to the clock signal until the stack register contains the sign bit of the second operand in all storage locations of the stack register; a plurality of logic gates coupled to the shift register and the stack register, for successively forming groups of predetermined partial product bits of positive value in response to receiving bits from the shift register and stack register in a predetermined order; and means coupled to the plurality of logic gates for adding the groups of predetermined partial product bits with one or more carry input bits to provide an output product bit and one or more output carry bits for each receipt of partial product bits, said means selectively coupling the one or more output carry bits to an input of the means for use as a carry input bit or bits in a successive output product bit generation.
Claim 10
Dependent Claim
216 words
A high serial data multiplier, comprising: a shift register for receiving a first signed input operand and serially storing a sign bit and magnitude bits of the first input operand in a predetermined order in response to a clock signal; a stack register for receiving a second signed input operand having a sign bit and magnitude bits and serially clocking the magnitude bits and sign bit thru the stack register in response to the clock signal until the stack register contains the sign bit of the second operand in all storage locations of the stack register; a plurality of logic gates coupled to the shift register and the stack register, for successively forming groups of predetermined partial product bits of positive value in response to receiving bits from the shift register and stack register in a predetermined order; and means coupled to the plurality of logic gates for adding the groups of predetermined partial product bits with one or more carry input bits to provide an output product bit and one or more output carry bits for each receipt of partial product bits, said means selectively coupling the one or more output carry bits to an input of the means for use as a carry input bit or bits in a successive output product bit generation.
Claim 11
Dependent Claim
67 words
The high speed serial data multiplier of claim 7 wherein the means further comprise a delay portion for delaying outputting said output carry bit or bits generated from the addition of partial product bits before coupling the output carry bit or bits to the input of the means, said delay portion further providing a correction input bit for use during an initial addition of partial product bits.
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) | 1992-01-03 | 1992-07-04 | 1993-01-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-01-03 | 1996-07-04 | 1997-01-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-01-03 | 2000-07-04 | 2001-01-03 | $7700.00 | Window Closed / Lapsed |