US5798956A — Parallel multiplier

Claim 1

Independent Claim 157 words

A parallel multiplier comprising: N×M AND-gates each for ANDing a multiplier bit ranging from a least significant bit to a most significant bit with a multiplicand bit and outputting an intermediate value when multiplying "N" multiplicand bits and "M" multiplier bits, wherein said N×M AND-gates perform a partial multiplication and output a least significant bit of a result of said multiplication; and a plurality of input-bits dividers, having 2-, 3-, and 4-input-bits dividers, wherein each of said plurality of input-bits dividers receives said intermediate value from at least one corresponding AND-gate of said N×M AND-gates and outputs a bit of said result between a least significant bit and a most significant bit of said result, wherein said each of said plurality of input-bits dividers outputs at least one quotient bit and exactly one remainder bit, wherein said plurality of remainder bits are said bits between said least significant bit and said most significant bit of said result.

Claim 2

Dependent Claim 157 words

A parallel multiplier comprising: N×M AND-gates each for ANDing a multiplier bit ranging from a least significant bit to a most significant bit with a multiplicand bit and outputting an intermediate value when multiplying "N" multiplicand bits and "M" multiplier bits, wherein said N×M AND-gates perform a partial multiplication and output a least significant bit of a result of said multiplication; and a plurality of input-bits dividers, having 2-, 3-, and 4-input-bits dividers, wherein each of said plurality of input-bits dividers receives said intermediate value from at least one corresponding AND-gate of said N×M AND-gates and outputs a bit of said result between a least significant bit and a most significant bit of said result, wherein said each of said plurality of input-bits dividers outputs at least one quotient bit and exactly one remainder bit, wherein said plurality of remainder bits are said bits between said least significant bit and said most significant bit of said result.

Claim 3

Dependent Claim 50 words

The multiplier of claim 1, wherein said each of said plurality of input-bits dividers are coupled in series and divides a number of input bits by two (2) to output said at least one quotient bit, and one of said input-bits dividers outputs a most significant bit of said result.

Claim 4

Dependent Claim 43 words

The multiplier of claim 1, wherein each of said plurality of input-bits divider divides a number of "1" bits in said number of input bits by two to output said at least one quotient bit, and said division remainder as said remainder bit.

Claim 5

Dependent Claim 70 words

The multiplier of claim 1, wherein said 4-input-bits divider includes an input bit detector for detecting whether a number of "1" bits contained in four input bits is two or more and for outputting a first quotient bit; an AND-gate for ANDing said four input bits and for outputting a second quotient bit; and an exclusive OR-gate for exclusively ORing said four input bits and for outputting said remainder bit.

Claim 6

Dependent Claim 112 words

The multiplier of claim 4, wherein said input bit detector includes: "0" detector, with a first side connected to an electric power source, for detecting whether the number of "0" bits contained in said four input bits is more than two; "1" detector, with a second side connected to a second side of said "0" detector, and a first side of said "1" detector is connected to a ground, for detecting whether the number of "1" bits contained in said four input bits is more than one; and an inverter having its input terminal commonly connected to the second side of the "0" detector and said second side of said "1" detector.

Claim 7

Dependent Claim 42 words

The multiplier of claim 5, wherein said "0" detector includes serially connected PMOS transistors, wherein at least one of said serially connected PMOS transistors is turned on when the number of "0" contained in said four input bits is more than two.

Claim 8

Dependent Claim 35 words

The multiplier of claim 5, wherein said "1" detector includes pairs of NMOS transistors, at least one of which is turned on when the number of "1" contained in input bits is more than one.

Claim 9

Dependent Claim 44 words

The multiplier of claim 1, wherein a 5-input-bits divider in said input-bits dividers includes: said 4-input-bits divider; and an exclusive OR-gate for exclusively ORing said remainder bit outputted from said 4-input-bits divider and a fifth input bit to output a 5-input-bits divider remainder bit.

Claim 10

Dependent Claim 70 words

The multiplier of claim 1, wherein an input-bits divider having at least six input bits includes: a 2-input-bits divider having the same function as a half adder that outputs a first remaining bit; a 3-input-bits divider having the same function as a full adder that outputs a second remaining bit; and a logic operation unit coupling said input-bits dividers to output a desired quotient bit and a desired remaining bit.

Claim 11

Dependent Claim 73 words

The multiplier of claim 9, wherein said logic operation unit includes: an exclusive OR-gate for exclusively ORing the first and second remainder bits outputted from two input-bits dividers and for outputting said desired remaining bit; an AND gate for ANDing said first and second remainder bits respectively outputted from said input-bits dividers; and an OR-gate for ORing a quotient bit outputted from one of said input-bits dividers and the output of the AND-gate.

Claim 12

Dependent Claim 51 words

The multiplier of claim 9, wherein an 8-input-bits divider having 8 input bits among said input-bits dividers includes: a pair of 4-input-bits divider; and a logic operation unit for outputting said desired remaining bit and said desired quotient bit of said 8-input bits divider by connecting said pair of 4-input-bits dividers.

Claim 13

Dependent Claim 97 words

The multiplier of claim 9, wherein an 8-input-bits divider having 8 input bits among said input-bits dividers includes: a pair of 4-input-bits dividers; an exclusive OR-gate for exclusively ORing remainder bits outputted from said 4-input-bits dividers and to output said desired remaining bit of said 8-input-bits divider; a first AND-gate for ANDing the remainder bits outputted from said 4-input-bits dividers; an OR-gate for ORing second quotient bits outputted from said pair of 4-input-bits dividers with the output of said first AND-gate; and a second AND-gate for ANDing the second quotient bits to output a predetermined quotient bit.

Claim 14

Dependent Claim 46 words

The multiplier of claim 9, wherein a 16-input-bits divider among said input-bits dividers includes: a pair of 8-input-bits dividers; and a logic operation unit for determining said desired remaining bit of said 16-input-bits divider and said desired quotient bit by connecting said pair of 8-input-bits dividers.

Claim 15

Dependent Claim 93 words

The multiplier of claim 9, wherein a 15-input-bits divider among said input-bits dividers includes: a 3-input-bits divider; a 4-input-bits divider; an 8-input-bits divider; a first logic operation unit for outputting a first desired quotient bit and an intermediate remainder bit by connecting said 8-input-bits divider and said 4-input-bits divider; and a second logic operation unit for outputting a second desired quotient bit and said desired remaining bit of said 15-input-bits divider by logically connecting the intermediate remaining bit outputted from said first logic operation unit and the output bits of the 3-input-bits divider.

Claim 16

Dependent Claim 138 words

A parallel multiplier comprising: N×M logic-gates, each of said N×M logic-gates performing a logical operation on a multiplier bit ranging from a least significant bit to a most significant bit with a multiplicand bit to output an intermediate value when multiplying "N" multiplicand bits and "M" multiplier bits; and a plurality of input-bits dividers, wherein each of said plurality of input-bits dividers receives said intermediate value from at least one corresponding logic-gate of said N×M logic-gates and outputs a bit of said result between a least significant bit and a most significant bit of said result, wherein said each of said plurality of input-bits dividers outputs at least one quotient bit and exactly one remainder bit, wherein said plurality of remainder bits are said bits between said least significant bit and said most significant bit of said result.

Claim 17

Dependent Claim 138 words

A parallel multiplier comprising: N×M logic-gates, each of said N×M logic-gates performing a logical operation on a multiplier bit ranging from a least significant bit to a most significant bit with a multiplicand bit to output an intermediate value when multiplying "N" multiplicand bits and "M" multiplier bits; and a plurality of input-bits dividers, wherein each of said plurality of input-bits dividers receives said intermediate value from at least one corresponding logic-gate of said N×M logic-gates and outputs a bit of said result between a least significant bit and a most significant bit of said result, wherein said each of said plurality of input-bits dividers outputs at least one quotient bit and exactly one remainder bit, wherein said plurality of remainder bits are said bits between said least significant bit and said most significant bit of said result.

Claim 18

Dependent Claim 89 words

The parallel multiplier of claim 15, wherein said plurality of input-bits dividers are in order from a first input-bits divider to a last input-bits divider, and wherein said each of said plurality of input-bits dividers exclusive of said first input-bits divider further receives said at least one quotient bit from a preceding input-bits divider, and wherein said quotient bit of said last input-bits divider is the most significant bit of said result, and wherein said least significant bit of a result is output by one of said N×M logic-gates.

Claim 19

Dependent Claim 30 words

The parallel multiplier of claim 15, wherein said input-bits divider performs a dividing function on said intermediate value to determine said at least one quotient bit and said remainder bit.

Claim 20

Dependent Claim 30 words

The parallel multiplier of claim 17, wherein said input-bits dividers divide a number of "1" bits among a number of input bits to output said at least one quotient bit.

Claim 21

Dependent Claim 36 words

The parallel multiplier of claim 17, wherein said input-bits dividers divide a number of "1" bits among a number of input bits to output a remainder of the division operation as said exactly one remainder bit.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	2001-08-24	2002-02-23	2002-08-25	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2005-08-24	2006-02-23	2006-08-25	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2009-08-24	2010-02-23	2010-08-25	$7700.00	Window Closed / Lapsed

Parallel multiplier

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag