Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
247 words
A digital multiplication circuit comprising: a Booth recoder means for recoding a multiplier into N Booth operation sets where N is a positive integer that equals one half the number of bits in the multiplier; a plurality of N partial product selector means having inputs and outputs connected in cascade arrangement from output to input with the Nth output being an intermediate output of the digital multiplication circuit, the cascade arrangement being N multiplicand sets of M bits in length and each member of the plurality of N partial product selector means being connected to a member of the N operation sets for implementing the recoded Booth operation set on a multiplicand set and where M is a positive integer; summation means for summing the contents of the plurality of N partial product selector means the summation means including a second plurality of summing means with predetermined members of the second plurality of summing means being located between predetermined members of the plurality of N partial product selector means; and a domino means, operatively connected to the plurality of partial product selector means, for generating a plurality of evaluation pulses with each single evaluation pulse of the plurality of evaluation pulses being generated to represented a worse case signal propagation time delay through a predetermined partial product selector means and connected to evaluate the predetermined member of the plurality of partial product selector means to provide outputs therefrom of each single partial product selector means when evaluated.
Claim 2
Dependent Claim
247 words
A digital multiplication circuit comprising: a Booth recoder means for recoding a multiplier into N Booth operation sets where N is a positive integer that equals one half the number of bits in the multiplier; a plurality of N partial product selector means having inputs and outputs connected in cascade arrangement from output to input with the Nth output being an intermediate output of the digital multiplication circuit, the cascade arrangement being N multiplicand sets of M bits in length and each member of the plurality of N partial product selector means being connected to a member of the N operation sets for implementing the recoded Booth operation set on a multiplicand set and where M is a positive integer; summation means for summing the contents of the plurality of N partial product selector means the summation means including a second plurality of summing means with predetermined members of the second plurality of summing means being located between predetermined members of the plurality of N partial product selector means; and a domino means, operatively connected to the plurality of partial product selector means, for generating a plurality of evaluation pulses with each single evaluation pulse of the plurality of evaluation pulses being generated to represented a worse case signal propagation time delay through a predetermined partial product selector means and connected to evaluate the predetermined member of the plurality of partial product selector means to provide outputs therefrom of each single partial product selector means when evaluated.
Claim 3
Dependent Claim
46 words
The digital multiplication circuit to claim 1 wherein the domino means comprises: a clock means for providing a precharge signal; a plurality of dummy load means wherein each dummy load means includes; a partial product stage means for converting the precharge signal to an evaluation pulse.
Claim 4
Dependent Claim
59 words
The digital multiplication circuit according to claim 2 wherein the summation means comprises: a plurality of summation circuits connected to a preselected dummy load means for providing an evaluation pulse to each member of plurality of N partial product selector means at the completion of the booth operation set that is connected to the corresponding partial product selector means.
Claim 5
Dependent Claim
35 words
The digital multiplication circuit according to claim 1 wherein the second plurality of summing means comprises; a plurality of full adder circuit means for combining a first input, a second input, and a third input.
Claim 6
Dependent Claim
37 words
The digital multiplication circuit according to claim 1 wherein each single summing means of the second plurality of summing means comprises: a full adder circuit means having a first input, a second input, and a third input.
Claim 7
Dependent Claim
65 words
The digital multiplication circuit according to claim 1 wherein the second plurality of summing means comprises: a first plurality of full adder circuits connected to sum the output of a first multiplicand set from a preselected partial product selector means, a second multiplicand set from a second preselected partial product selector means and a third multiplicand set from a third preselected partial product selector means.
Claim 8
Dependent Claim
53 words
The digital multiplication circuit according to claim 6 wherein the second plurality of summing means further comprises: a second set of full adder circuit means for combining the output of the first set of full adder means with the output of a fourth multiplicand set from a fourth preselected partial product selector means.
Claim 9
Dependent Claim
51 words
The digital multiplication circuit according to claim 7 wherein the second plurality of summing means further comprises: a third set of full adder circuit means connected to combine the output of the second set of full adders means with a fifth multiplicand set from a fifth preselected partial product selector means.
Claim 10
Dependent Claim
49 words
The digital multiplication circuit according to claim 8 wherein the second plurality of summing means further comprises: a fourth set of full adder means for combining the output of the third set of full adder means with a sixth multiplicand set from a sixth preselected partial product selector means.
Claim 11
Dependent Claim
20 words
The digital multiplication circuit according to claim 1 further comprising: an intermediate set of registers for storing the intermediate output.
Claim 12
Dependent Claim
36 words
The digital multiplication circuit according to claim 10 further comprising: a second summation circuit means for selectively combining the outputs of the intermediate set of registers to obtain a product of the multiplicand and the multiplier.
Claim 13
Dependent Claim
26 words
The digital multiplication circuit according to claim 11 further comprising: a plurality of storage register means for storing the product of the multiplier and the multiplicand.
Claim 14
Independent Claim
208 words
A method of performing digital multiplication comprising: decoding a multiplier into N Booth operation sets where N is a positive integer that equals one half the number of bits in the multiplier; implementing a decoded Booth operation set on a multiplicand sets of M bits in length with a plurality of N partial product selector means having inputs and outputs connected in cascade arrangement from output to input with the nth output being an intermediate output of the the multiplication and each member of the plurality of N partial product selector means being connected to receive a member of the N Booth operation sets; summing the contents of the plurality of N partial product selector means with a summation means including a second plurality of summing means with predetermined members of the second plurality of summing means being located between predetermined members of the plurality of N partial product registers; and generating a plurality of evaluation pulses with each single evaluation pulse being generated to represent a worse case single propagation time delay through a predetermined partial product selector means of the plurality of partial product selector means and connected to evaluate the predetermined member of the plurality of partial product selector means to provide an output thereby.
Claim 15
Independent Claim
208 words
A method of performing digital multiplication comprising: decoding a multiplier into N Booth operation sets where N is a positive integer that equals one half the number of bits in the multiplier; implementing a decoded Booth operation set on a multiplicand sets of M bits in length with a plurality of N partial product selector means having inputs and outputs connected in cascade arrangement from output to input with the nth output being an intermediate output of the the multiplication and each member of the plurality of N partial product selector means being connected to receive a member of the N Booth operation sets; summing the contents of the plurality of N partial product selector means with a summation means including a second plurality of summing means with predetermined members of the second plurality of summing means being located between predetermined members of the plurality of N partial product registers; and generating a plurality of evaluation pulses with each single evaluation pulse being generated to represent a worse case single propagation time delay through a predetermined partial product selector means of the plurality of partial product selector means and connected to evaluate the predetermined member of the plurality of partial product selector means to provide an output thereby.
Claim 16
Dependent Claim
35 words
The method according to claim 13 wherein the step of generating each single evaluation pulse of the plurality of evaluation pulses comprises: providing a precharge signal; and converting the precharge signal to an evaluation pulse.