← Back to Patent Explorer
US4879677A Expired / Lapsed US ⏱️ 0.0 years remaining

Parallel adder circuit with sign bit decoder for multiplier

Assignee: Toshiba Corp
•
Filing: 1988-03-21
•
Granted: 1989-11-07
•
Expires: 2008-03-21
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A parallel adder circuit includes a partial product adding circuit for adding one-bit partial products together in order total to a plurality of partial products, and sign bit decoder circuit for decoding sign bits of a given bit number to provide a total sum of the sign bits, and supply this total sum to the partial product adding circuit at given bits. In a multiplier utilizing Booth's algorithm, a decoder circuit is used for decoding sign bits of the partial product to provide the total sum of all the sign bits, and a decoded output is supplied to the partial product adding circuit. Therefore, the number of higher bit inputs can be reduced and the number of full adders in the partial product adding circuit can be decreased.

Inventors

  • 👤 Mikio Shiraishi

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-05 00:40
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/40; G06F7/44; G06F7/48; G06F7/52; G06F7/523; G06F7/53; G06F7/5318; G06F7/499; G06F7/49994; G06F7/533; G06F7/5334; G06F7/5336; G06F7/5338

Claims Analysis

Total Claims: 18
Claim 1
Independent Claim 176 words
In a multiplier for determining the product of a multiplier and a multiplicand using Booth's algorithm and for producing a series of partial products in 2's complement format, each of the partial products containing a sign bit, a parallel adder circuit comprising: sign bit decoder means, connected to receive said sign bits of at least two of said partial products, for generating outputs; and partial product adding means, coupled to receive said partial products and the output of said sign bit decoder means, for producing the product of said multiplier and multiplicand, said partial product means including a plurality of bit adding means for producing different bits of said product, each of said bit adding means being coupled to receive corresponding bits of said partial products, and selected ones of said bit adding means being coupled to receive at least one of the outputs of said sign decoding means, wherein said sign bit decoder means is connected to receive two sign bits A and B and produce two single bit outputs S (=A⊕B) and N (=A+B).
Claim 2
Dependent Claim 176 words
In a multiplier for determining the product of a multiplier and a multiplicand using Booth's algorithm and for producing a series of partial products in 2's complement format, each of the partial products containing a sign bit, a parallel adder circuit comprising: sign bit decoder means, connected to receive said sign bits of at least two of said partial products, for generating outputs; and partial product adding means, coupled to receive said partial products and the output of said sign bit decoder means, for producing the product of said multiplier and multiplicand, said partial product means including a plurality of bit adding means for producing different bits of said product, each of said bit adding means being coupled to receive corresponding bits of said partial products, and selected ones of said bit adding means being coupled to receive at least one of the outputs of said sign decoding means, wherein said sign bit decoder means is connected to receive two sign bits A and B and produce two single bit outputs S (=A⊕B) and N (=A+B).
Claim 3
Dependent Claim 52 words
A parallel adder circuit according to claim 1, wherein said sign bit decoder means includes first logic means for receiving two sign bits A and B to produce first bit output S (=A⊕B) and second logic means for receiving two sign bits A and B to produce second bit output N (=A+B).
Claim 4
Dependent Claim 64 words
A parallel adder circuit according to claim 1, wherein said sign bit decoder means includes an exclusive-OR gate connected to respectively receive sign bits A and B at first and second input terminals, and produce first bit output S, and an OR gate connected to respectively receive sign bits A and B at first and second input terminals, and produce second bit output N.
Claim 5
Dependent Claim 115 words
A parallel adder circuit according to claim 1, wherein said sign bit decoder means includes a first NAND gate connected to respectively receive sign bit A and an inverted signal of sign bit B at first and second input terminals, a second NAND gate connected to respectively receive an inverted signal of sign bit A and sign bit B at first and second input terminals, a third NAND gate connected to receive outputs of said first and second NAND gates, and produce first bit output S, and a fourth NAND gate connected to respectively receive inverted signals of sign bits A and B at first and second input terminals, and produce second bit output N.
Claim 6
Dependent Claim 112 words
A parallel adder circuit according to claim 1, wherein said sign bit decoder means includes an AND gate connected to respectively receive sign bits A and B at first and second input terminals, a first NOR gate connected to respectively receive sign bits A and B at first and second input terminals, a second NOR gate connected to receive outputs of said AND gate and first NOR gate, and produce first bit output S, a third NOR gate connected to respectively receive sign bits A and B at first and second input terminals, and an inverter connected to invert an output of said third NOR gate, and produce second bit output N.
Claim 7
Dependent Claim 179 words
In a multiplier for determining the product of a multiplier and a multiplicand using Booth's algorithm and for producing a series of partial products in 2's complement format, each of the partial products containing a sign bit, a parallel adder circuit comprising: sign bit decoder means, connected to receive said sign bits of at least two of said partial products, for generating outputs: and partial product adding means, coupled to receive said partial products and the output of said sign bit decoder means, for producing the product of said multiplier and multiplicand, said partial product means including a plurality of bit adding means for producing different bits of said product, each of said bit adding means being coupled to receive corresponding bits of said partial products, and selected ones of said bit adding means being coupled to receive at least one of the outputs of said sign decoding means, wherein said sign bit decoder means is connected to receive three sign bits A, B and C, and produce three single bit outputs S (=A⊕B⊕C), M [(=A×B)+(B×C)+C×A)] and N (=A+B+C).
Claim 8
Dependent Claim 179 words
In a multiplier for determining the product of a multiplier and a multiplicand using Booth's algorithm and for producing a series of partial products in 2's complement format, each of the partial products containing a sign bit, a parallel adder circuit comprising: sign bit decoder means, connected to receive said sign bits of at least two of said partial products, for generating outputs: and partial product adding means, coupled to receive said partial products and the output of said sign bit decoder means, for producing the product of said multiplier and multiplicand, said partial product means including a plurality of bit adding means for producing different bits of said product, each of said bit adding means being coupled to receive corresponding bits of said partial products, and selected ones of said bit adding means being coupled to receive at least one of the outputs of said sign decoding means, wherein said sign bit decoder means is connected to receive three sign bits A, B and C, and produce three single bit outputs S (=A⊕B⊕C), M [(=A×B)+(B×C)+C×A)] and N (=A+B+C).
Claim 9
Dependent Claim 73 words
A parallel adder circuit according to claim 6, wherein said sign bit decoder means includes first logic means for receiving three sign bits A, B and C to produce first bit output S (=A⊕B⊕C), second logic means for receiving three sign bits A, B and C to produce second bit output M [=(A×B)+(B×C)+(C×A), and third logic means for receiving three sign bits A, B and C to produce third bit output N (=A+B+C).
Claim 10
Dependent Claim 180 words
A parallel adder circuit according to claim 7, wherein said sign bit decoder means includes a first exclusive-OR gate connected to respectively receive sign bits A and B at first and second input terminals, a second exclusive-OR gate connected to respectively receive output of said first exclusive-OR gate and sign bit C at first and second input terminals, and produce first bit output S, a first AND gate connected to respectively receive an inverted signal of sign bit A and sign bit B at first and second input terminals, a second AND gate connected to respectively receive an inverted signal of sign bits B and sign bit C at first and second input terminals, a third AND gate connected to respectively receive an inverted signal of sign bit C and sign bit A at first and second input terminals, a first OR gate connected to receive outputs of said first to third AND gates, and produce second bit output M, and a second OR gate connected to receive sign bits A, B and C, and produce third bit output N.
Claim 11
Dependent Claim 269 words
A parallel adder circuit according to claim 6, wherein said sign bit decoder means includes a first OR gate connected to respectively receive sign bits A and B at first and second input terminals, a first NAND gate connected to respectively receive sign bits A and B at first and second input terminals, a second NAND gate connected to receive outputs of said first OR gate and first NAND gate, a second OR gate connected to respectively receive an output of said second NAND gate and sign bit C at first and second input terminals, a third NAND gate connected to respectively receive an output of said second NAND gate and sign bit C at first and second input terminals, a fourth NAND gate connected to receive outputs of said second OR gate and third NAND gate, and produce first bit output S, a fifth NAND gate connected to respectively receive an inverted signal of sign bit A and sign bit B at first and second input terminals, a sixth NAND gate connected to respectively receive an inverted signal of sign bit B and sign bit C at first and second input terminals, a seventh NAND gate connected to respectively receive an inverted signal of sign bit C and sign bit A at first and second input terminals, an eighth NAND gate connected to receive outputs of said fifth to seventh NAND gates, and produce second bit output M, and a ninth NAND gate connected to respectively receive inverted signals of sign bits A, B and C at first to third input terminals, and produce third bit output N.
Claim 12
Dependent Claim 299 words
A parallel adder circuit according to claim 6, wherein said sign bit decoder means includes a first AND gate connected to respectively receive sign bits A and B at first and second input terminals, a first NOR gate connected to respectively receive sign bits A and B at first and second input terminals, a second NOR gate connected to respectively receive outputs of said first AND gate and first NOR gate at first and second input terminals, a second AND gate connected to respectively receive an output of said second NOR gate and sign bit C at first and second input terminals, a third NOR gate connected to respectively receive an output of said second NOR gate and sign bit C at first and second input terminals, a fourth NOR gate connected to receive outputs of said second AND gate and third NOR gate and produce first bit output S, a fifth NOR gate connected to respectively receive sign bit A and an inverted signal of sign bit B at first and second input terminals, a sixth NOR gate connected to respectively receive sign bit B and an inverted signal of sign bit C at first and second input terminals, a seventh NOR gate connected to respectively receive sign bit C and an inverted signal of sign bit A at first and second input terminals, an eighth NOR gate connected to receive outputs of said fifth to seventh NOR gates, a first inverter connected to invert an output of said eighth NOR gate, and produce second bit output M, a ninth NOR gate connected to respectively receive sign bits A, B and C at first to third input terminals, and a second inverter connected to invert an output of said ninth NOR gate, and produce third bit output N.
Claim 13
Dependent Claim 229 words
A parallel adder circuit according to claim 6, wherein said sign bit decoder means includes a first NAND gate connected to respectively receive an inverted signal of sign bit A, an inverted signal of sign bit B and sign bit C at first to third input terminals, a second NAND gate connected to respectively receive sign bit A, an inverted signal of sign bit B and an inverted signal of sign bit C at first to third input terminals, a third NAND gate connected to respectively receive an inverted signal of sign bit A, sign bit B and an inverted signal of sign bit C at first to third input terminals, a fourth NAND gate connected to respectively receive sign bits C, B and A at first to third input terminals, a fifth NAND gate connected to respectively receive inverted signals of sign bits C, B and A at first to third input terminals, and produce third bit output N, a sixth NAND gate connected to respectively receive outputs of said first to fourth NAND gates at first to fourth input terminals, and produce first bit output S, a seventh NAND gate connected to respectively receive outputs of said fourth and fifth NAND gates, at first and second input terminals, and an inverter connected to invert an output of said seventh NAND gate, and produce second bit output M.
Claim 14
Dependent Claim 180 words
In a multiplier for determining the product of a multiplier and a multiplicand using Booth's algorithm and for producing a series of partial in 2's complement format, each of the partial products containing a sing bit, a parallel adder circuit comprising: sign bit decoder means, connected to receive said sign bits of at least two of said partial products, for generating outputs; and partial product adding means, coupled to receive said partial products and the output of said sign bit decoder means, for producing the product of said multiplier and multiplicand, said partial product means including a plurality of bit adding means for producing different bits of said product, each of said bit adding means being coupled to receive corresponding bits of said partial products, and selected ones of said bit adding means being coupled to receive at least one of the outputs of said sign decoding means, wherein said sign bit decoder means is connected to receive four sign bits A, B, C and D, and produce three single bit outputs S (=A⊕B⊕C⊕D), M [=(A×B×C)+(A×B×D) +(A×C×D)+(B×A×C)+(B×A×D)+(B×C.times.D)+(C×A×B)+(C×A×D)+(C×B×D)+(D.times.A×B)+(D×A×C)+(D×B×C)] and N (=A+B+C+D).
Claim 15
Dependent Claim 180 words
In a multiplier for determining the product of a multiplier and a multiplicand using Booth's algorithm and for producing a series of partial in 2's complement format, each of the partial products containing a sing bit, a parallel adder circuit comprising: sign bit decoder means, connected to receive said sign bits of at least two of said partial products, for generating outputs; and partial product adding means, coupled to receive said partial products and the output of said sign bit decoder means, for producing the product of said multiplier and multiplicand, said partial product means including a plurality of bit adding means for producing different bits of said product, each of said bit adding means being coupled to receive corresponding bits of said partial products, and selected ones of said bit adding means being coupled to receive at least one of the outputs of said sign decoding means, wherein said sign bit decoder means is connected to receive four sign bits A, B, C and D, and produce three single bit outputs S (=A⊕B⊕C⊕D), M [=(A×B×C)+(A×B×D) +(A×C×D)+(B×A×C)+(B×A×D)+(B×C.times.D)+(C×A×B)+(C×A×D)+(C×B×D)+(D.times.A×B)+(D×A×C)+(D×B×C)] and N (=A+B+C+D).
Claim 16
Dependent Claim 76 words
A parallel adder circuit according to claim 12, wherein said sign bit decoder means includes first logic means for receiving four sign bits A, B, C and D to produce first bit output S (=A⊕B⊕C⊕D), second logic means for receiving four sign bits A, B, C and D to produce second bit output M [=(A×B×C)+(A×B×D)+(A×C×D)+(B×A.times.C)+(B×A×D)+(B×C×D)+(C×A×B)+(C.times.A×D)+(D×A×B)+(D×A×C)+(D×B×C)], and third logic means for receiving four sign bits A, B, C and D to produce third bit output N (=A+B+C+D).
Claim 17
Dependent Claim 240 words
A parallel adder circuit according to claim 12, wherein said sign bit decoder includes a first exclusive-OR gate connected to respectively receive sign bits A and B at first and second input terminals, a second exclusive-OR gate connected to respectively receive an output of said first exclusive-OR gate and sign bit C at first and second input terminals, a third exclusive-OR gate connected to respectively receive an output of said second exclusive-OR gate and sign bit D at first and second input terminals, and produce first bit output S, a first NAND gate connected to respectively receive sign bits A, B and C at first to third input terminals, a second NAND gate connected to respectively receive sign bits B, C and D at first to third input terminals, a third NAND gate connected to respectively receive sign bits C, D and A at first to third input terminals, a fourth NAND gate connected to respectively receive sign bits D, A and B at first to third input terminals, a fifth NAND gate connected to respectively receive inverted signals of sign bits A, B, C and D at first to fourth input terminals, and produce third bit output N, a sixth NAND gate connected to respectively receive outputs of said first to fifth NAND gates at first to fifth input terminals, and an inverter connected to invert an output of said sixth NAND gate, and produce second bit output M.
Claim 18
Dependent Claim 245 words
A parallel adder circuit according to claim 13, wherein said sign bit decoder means includes a first exclusive-OR gate connected to respectively receive sign bits A and B at first and second input terminals, a second exclusive-OR gate connected to respectively receive an output of said first exclusive-OR gate and sign bit C at first and second input terminals, a third exclusive-OR gate connected to respectively receive an output of said second exclusive OR gate and sign bit D at first and second input terminals, a first NOR gate connected to respectively receive sign bits A, B, C and D at first to fourth input terminals, a second NOR gate connected to respectively receive inverted signals of sign bits A, B and C at first to third input terminals, a third NOR gate connected to respectively receive inverted signals of sign bits B, C and D at first to third input terminals, a fourth NOR gate connected to respectively receive inverted signals of sign bit C, D and A at first to third input terminals, a fifth NOR gate connected to respectively receive inverted signals of sign bits D, A and B at first to third input terminals, a sixth NOR gate connected to respectively receive outputs of said first to fifth NOR gates at first to fifth input terminals, and produce second bit output M, and an inverter connected to invert an output of said first NOR gate and produce third bit output N.

References Cited (Backward Citations)

US4748584A Cited
US4575812A Cited
US4748582A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-11-06 1993-05-08 1993-11-07 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-11-06 1997-05-08 1997-11-07 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-11-06 2001-05-08 2001-11-07 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag