US4982355A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Low-power parallel multiplier
Assignee: Lapis Semiconductor Co Ltd
•
Filing: 1989-01-20
•
Granted: 1991-01-01
•
Expires: 2009-01-20
Abstract
Abstract A parallel multiplier consists of a systolic array of AND gates and full adders organized in stages so that each stage generates a partial product, adds it to the preceding partial products, and furnishes the sum to the next stage. A control circuit is provided that disables the outputs of each stage of the array until the operation in the particular stage is completed. The disabling of outputs reduces power consumption.
Inventors
- 👤 Eiichi Nishimura
- 👤 Takao Nakamura
- 👤 Hisaki Ishida
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 13:01
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/52; G06F7/523; G06F7/53; G06F7/5306; G06F7/5312; G06F7/76; G06F7/762
Claims Analysis
Total Claims: 25
Claim 1
Independent Claim
256 words
A low-power parallel multiplier for performing a multiplication operation on a multiplicand input and a multiplier input, comprising: an array comprising stages and columns of unit circuits, each unit circuit receiving a one-bit multiplicand input, a one-bit multiplier input, a one-but sum input, and a one-bit carry input, performing bit multiplication on said multiplicand input and said multiplier input to generate a bit product, and performing bit addition on said bit product, said sum input, and said carry input to generate a one-bit sum output and a one-bit carry output, said sum output and said carry output assuming a first state and a second state to represent a binary bit, power consumption being lower in said first state than in said second state; interconnections between the sum output of each unit circuit not disposed in the first column or last stage of said array and the sum input of the unit cell in the next stage and preceding column, and interconnections between the carry output of each unit circuit not disposed in the last stage of said array and the carry input of the unit circuit in the same column in the next stage, with binary zero inputs being provided to the sum inputs and carry inputs of the unit cells in the first stage of said array; and a control circuit coupled to the unit circuits of at least one stage of said array, for keeping the sum outputs and the carry outputs of said unit circuits in said first state until a certain time.
Claim 2
Dependent Claim
256 words
A low-power parallel multiplier for performing a multiplication operation on a multiplicand input and a multiplier input, comprising: an array comprising stages and columns of unit circuits, each unit circuit receiving a one-bit multiplicand input, a one-bit multiplier input, a one-but sum input, and a one-bit carry input, performing bit multiplication on said multiplicand input and said multiplier input to generate a bit product, and performing bit addition on said bit product, said sum input, and said carry input to generate a one-bit sum output and a one-bit carry output, said sum output and said carry output assuming a first state and a second state to represent a binary bit, power consumption being lower in said first state than in said second state; interconnections between the sum output of each unit circuit not disposed in the first column or last stage of said array and the sum input of the unit cell in the next stage and preceding column, and interconnections between the carry output of each unit circuit not disposed in the last stage of said array and the carry input of the unit circuit in the same column in the next stage, with binary zero inputs being provided to the sum inputs and carry inputs of the unit cells in the first stage of said array; and a control circuit coupled to the unit circuits of at least one stage of said array, for keeping the sum outputs and the carry outputs of said unit circuits in said first state until a certain time.
Claim 3
Dependent Claim
48 words
A multiplier according to claim 1, wherein said control circuit keeps the sum outputs and the carry outputs of the unit circuits of at least one stage of said array in said first state until completion of said bit additions by the unit circuits in the same stage.
Claim 4
Dependent Claim
41 words
A multiplier according to claim 1, wherein said control circuit is coupled to provide enable signals, having active and inactive states, to one or more respective stages of said array and causes said enable signals to enter the active state sequentially.
Claim 5
Dependent Claim
29 words
A multiplier according to claim 3 wherein said sum outputs and said carry outputs are kept in said first state while said enable signal is in said inactive state.
Claim 6
Dependent Claim
116 words
A multiplier according to claim 4, wherein each of the unit circuits whose output is kept at said first state by said control circuit comprises: an AND gate for receiving said multiplicand input and said multiplier input and performing a logical AND operation thereon to generate said bit product; a full adder for receiving said sum input, said carry input, and the bit product generated by said AND gate, and performing an addition operation thereon to generate said sum output and said carry output; and an enabling means for enabling or disabling transfer of said sum output and said carry output of said adder to said sum output and said carry output of said unit circuit.
Claim 7
Dependent Claim
38 words
A multiplier according to claim 5, wherein said enabling means comprises a first AND gate for ANDing said sum output with said enable signal and a second AND gate for ANDing said carry output with said enable signal.
Claim 8
Dependent Claim
37 words
A multiplier according to claim 4, wherein said control circuit generates a separate enable signal for each stage of said array and causes said enable signals to enter the active state at short intervals in consecutive sequence.
Claim 9
Dependent Claim
71 words
A multiplier according to claim 7, wherein said control circuit comprises a plurality of delay circuits connected in series and generating as outputs said enable signals for the respective stages, a single timing signal being supplied as an input to all the delay circuits, and the output of each delay circuits except the last one in the series being supplied as an input to the next delay circuit in the series.
Claim 10
Dependent Claim
72 words
A multiplier according to claim 8, wherein a first one of said delay circuits comprises an inverter receiving the multiplication timing signal, and each of said delay circuits except said first one comprises a NAND gate receiving said multiplication timing signal and the output of the preceding delay circuit and performing a logical NAND operation thereon to generate an output, and an inverter receiving and inverting the output of the NAND gate.
Claim 11
Dependent Claim
47 words
A multiplier according to claim 9, wherein the inverter in each of said delay circuits has a driving capability low enough to provide a predetermined delay time between a change in an input to the delay circuit and a change in the output of the delay circuit.
Claim 12
Dependent Claim
43 words
A multiplier according to claim 10, wherein said enable signals are transmitted to said unit circuits by conductors having distributed capacitive loads, the time required for respective inverters in the delay circuits to charge said distributed capacitive loads constituting said predetermined delay time.
Claim 13
Dependent Claim
36 words
A multiplier according to claim 11, wherein the delay time of each of the delay circuits substantially equals the time taken by the unit circuits in each stage to complete said bit multiplication and bit addition.
Claim 14
Dependent Claim
55 words
A multiplier according to claim 1, where said array comprises blocks of stages, each block consisting of either one stage, or two or more stages adjacent to each other, and said control circuit keeps the outputs of the unit circuits in all the stages in each block in said first state until a certain time.
Claim 15
Dependent Claim
56 words
A multiplier according to claim 13, wherein each block consists of one stage, and said control circuit keeps the outputs of said unit circuits in some or all of said stages of said array in said first state until completion of said bit multiplications and said bit additions in the unit circuits in the particular stage.
Claim 16
Dependent Claim
26 words
A multiplier according to claim 13, wherein said control circuit is coupled to provide respective enable signals, having active and inactive states, to the respective blocks.
Claim 17
Dependent Claim
36 words
A multiplier according to claim 15, wherein the sum outputs and carry outputs of the unit circuits in a block are kept in said first state while the respective enable signal is in said inactive state.
Claim 18
Dependent Claim
116 words
A multiplier according to claim 16, wherein each of the unit circuits whose output is kept at said first state by said control circuit comprises: an AND gate for receiving said multiplicand input and said multiplier input and performing a logical AND operation thereon to generate said bit product; a full adder for receiving said sum input, said carry input, and the bit product generated by said AND gate, and performing an addition operation thereon to generate said sum output and said carry output; and an enabling circuit for enabling or disabling output of said sum output and said carry output from said unit circuit in response to an enable signal received from said control circuit.
Claim 19
Dependent Claim
38 words
A multiplier according to claim 17, wherein said enabling circuit comprises a first AND gate for ANDing said sum output with said enable signal and a second AND gate for ANDing said carry output with said enable signal.
Claim 20
Dependent Claim
24 words
A multiplier according to claim 18, wherein said control circuit causes said enable signals go to the active state at intervals in consecutive sequence.
Claim 21
Dependent Claim
70 words
A multiplier according to claim 19, wherein said control circuit comprises a plurality of delay circuits connected in series and generating as outputs said enable signals for the respective blocks, a single a multiplication timing signal being supplied as an input to each delay circuit, the output of each delay circuit except the last in the series being supplied as an input to the next delay circuit in the series.
Claim 22
Dependent Claim
72 words
A multiplier according to claim 20, wherein a first one of said delay circuits comprises an inverter receiving the multiplication timing signal, and each of said delay circuits except said first one comprises a NAND gate receiving said multiplication timing signal and the output of the preceding delay circuit and performing a logical NAND operation thereon to generate an output, and an inverter receiving and inverting the output of the NAND gate.
Claim 23
Dependent Claim
47 words
A multiplier according to claim 21, wherein the inverter in each of said delay circuits has a driving capability low enough to provide a predetermined delay time between a change in an input to the delay circuit and a change in the output of the delay circuit.
Claim 24
Dependent Claim
43 words
A multiplier according to claim 21, wherein said enable signals are coupled to said unit circuits by conductors having distributed capacitive loads, the time required for respective inverters in the delay circuits to charge said distributed capacitive loads constituting said predetermined delay time.
Claim 25
Dependent Claim
51 words
A multiplier according to claim 23, wherein the delay time of each delay circuit except the first delay circuit substantially equals the time taken by the unit circuits in the block preceding the block to which the delay circuit sends an enable signal to complete said bit multiplications and bit additions.
References Cited (Backward Citations)
US3900724A
Cited
US4441158A
Cited
US4369500A
Cited
US4598382A
Cited
FR2540261A1
Cited
US4748583A
Cited
US4736335A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-12-31 | 1994-07-02 | 1995-01-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-12-31 | 1998-07-02 | 1999-01-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-12-31 | 2002-07-02 | 2003-01-01 | $7700.00 | Window Closed / Lapsed |