Plural-bit recoding multiplier

Claim 2

A multiplier for multiplying an N bit multiplicand A by an M bit multiplier B comprising: input means for receiving said multiplicand A and multiplier B; recoding means for recoding two-bit groups B m+1 ; B m of said multiplier B received by said input means and a carryin C m-1 to a recoded group multiplier b m and carryout C m+1 for all bit pairs of unsigned multiplier B and all but the most significant bit pair of a negative two's complement multiplier B as follows: ______________________________________ B.sub.m+1 B.sub.m C.sub.m-1 b.sub.m C.sub.m+1 ______________________________________ 0 0 0 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 2 0 1 0 0 2 0 1 0 1 -1 1 1 1 0 -1 1 1 1 1 0 1 ______________________________________ and the most significant bit pair of a negative two's complement multiplier B as follows: ______________________________________ B.sub.M-1 B.sub.M-2 C.sub.M-3 b.sub.M-2 C.sub.M-1 ______________________________________ 0 0 0 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 2 0 1 0 0 2 -1 1 0 1 -1 0 1 1 0 -1 0 1 1 1 0 0 ______________________________________ partial product means for forming partial products P m =b m ×A×2 m for each recoded multiplier b m and carry partial product P c C M-1 ×A×2 M for carryout of the most significant recoded bit; sign extension means for providing sign extension for negative partial products; and add means for receiving, aligning and adding said partial products P m and P c and said sign extension to produce a final product.

Claim 3

A multiplier according to claim 1 wherein said sign extension means provides a single sign extension word, for all negative partial products, as a plurality of negative bits, beginning with a sign bit of a first negative partial product and extending to a 2 M+M-1 bit, except for positive sign bits for sign bits of subsequent negative partial products.

Claim 4

A multiplier according to claim 1 wherein said sign extension means forms said single sign extension word as a two's complement of collection of sign bits of said partial products.

Claim 5

A multiplier for multiplying an N bit multiplicand A by an M bit multiplier B comprising: input means for receiving said multiplicand A and multiplier B; recoding means for recoding two-bit groups B m+1 ;B m of said multiplier B received by said input means and a carryin C m-1 to a recoded group multiplier b m and carryout C m+1 as follows: ______________________________________ B.sub.m+1 B.sub.m C.sub.m-1 b.sub.m C.sub.m+1 ______________________________________ 0 0 0 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 -2 1 1 0 0 -2 1 1 0 1 -1 1 1 1 0 -1 1 1 1 1 0 1 ______________________________________ except no carryout is produced for the most significant bit pair of a negative two's complement multiplier B; partial product means for forming partial products P m =b m ×A×2 m for each recoded multiplier b m and carry partial product P c =C M-1 ×A×2 M for carryout of the most significant recoded bit; sign extension means for providing sign extension for negative partial products; and add means for receiving, aligning and adding said partial products P m and P c and said sign extension to produce a final product.

Claim 6

A multiplier for multiplying an N bit multiplicand A by an M bit multiplier B comprising: input means for receiving said multiplicand A and multiplier B; recoding means for recoding two-bit groups B m+1 ;B m of said multiplier B received by said input means and a carryin C m-1 to a recoded group multiplier b m and carryout C m+1 as follows: ______________________________________ B.sub.m+1 B.sub.m C.sub.m-1 b.sub.m C.sub.m+1 ______________________________________ 0 0 0 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 -2 1 1 0 0 -2 1 1 0 1 -1 1 1 1 0 -1 1 1 1 1 0 1 ______________________________________ except no carryout is produced for the most significant bit pair of a negative two's complement multiplier B; partial product means for forming partial products P m =b m ×A×2 m for each recoded multiplier b m and carry partial product P c =C M-1 ×A×2 M for carryout of the most significant recoded bit; sign extension means for providing sign extension for negative partial products; and add means for receiving, aligning and adding said partial products P m and P c and said sign extension to produce a final product.

Claim 7

A multiplier for multiplying an N bit multiplicand A by an M bit multiplier B comprising: input means for receiving said multiplicand A and multiplier B; recoding means for recoding three bit groups B m+2 ; B m+1 ;B m of said multiplier B received by said input means and carryin C m-1 to two recoded multipliers X m ; Y m and carryout C m+2 as follows: ______________________________________ B.sub.m+2 B.sub.m+1 B.sub.m C.sub.m-1 X.sub.m Y.sub.m C.sub.m+2 ______________________________________ 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 0 1 0 0 0 1 1 0 2 0 0 1 0 0 4 -2 0 0 1 0 1 4 -1 0 0 1 1 0 4 -1 0 0 1 1 1 4 0 0 1 0 0 0 4 0 0 1 0 0 1 4 1 0 1 0 1 0 4 1 0 1 0 1 1 4 2 0 1 1 0 0 0 -2 1 1 1 0 1 0 -1 1 1 1 1 0 0 -1 1 1 1 1 1 0 0 1 ______________________________________ except no carryout is produced for the most significant bits of a negative two's complement multiplier B; partial product means for forming partial products P m for each recoded multiplier X m and Y m and carry partial product P c for carryout of the most significant recoded bit group; sign extension means for providing sign extension for negative partial products; and add means for receiving, aligning and adding said partial products P m and P c and said sign extension to produce a final product.

Claim 8

A multiplier for multiplying an N bit multiplicand A by an M bit multiplier B comprising: input means for receiving said multiplicand A and multiplier B; recoding means for recoding three bit groups B m+2 ; B m+1 ;B m of said multiplier B received by said input means and carryin C m-1 to two recoded multipliers X m ; Y m and carryout C m+2 as follows: ______________________________________ B.sub.m+2 B.sub.m+1 B.sub.m C.sub.m-1 X.sub.m Y.sub.m C.sub.m+2 ______________________________________ 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 0 1 0 0 0 1 1 0 2 0 0 1 0 0 4 -2 0 0 1 0 1 4 -1 0 0 1 1 0 4 -1 0 0 1 1 1 4 0 0 1 0 0 0 4 0 0 1 0 0 1 4 1 0 1 0 1 0 4 1 0 1 0 1 1 4 2 0 1 1 0 0 0 -2 1 1 1 0 1 0 -1 1 1 1 1 0 0 -1 1 1 1 1 1 0 0 1 ______________________________________ except no carryout is produced for the most significant bits of a negative two's complement multiplier B; partial product means for forming partial products P m for each recoded multiplier X m and Y m and carry partial product P c for carryout of the most significant recoded bit group; sign extension means for providing sign extension for negative partial products; and add means for receiving, aligning and adding said partial products P m and P c and said sign extension to produce a final product.

Claim 9

A multiplier for multiplying an N bit multiplicand by an M bit multiplier B comprising: input means for receiving said multiplicand A and multiplier B; recoding means for recoding four-bit groups B m+3 ; B m+2 ; B m+1 ; B m of multiplier B received by said input means and a carryin C m-1 to a two bit recoded group multiplier X m , Y m and carryout C m+3 as follows: __________________________________________________________________________ B.sub.m+3 B.sub.m+2 B.sub.m+1 B.sub.m C.sub.m-1 X.sub.m Y.sub.m C.sub.m+3 C.sub.m-1 X.sub.m Y.sub.m C.sub.m+3 __________________________________________________________________________ 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 1 0 0 1 0 1 0 2 0 0 0 1 0 0 4 -2 0 1 4 -1 0 0 0 1 1 0 4 -1 0 1 4 0 0 0 1 0 0 0 4 0 0 1 4 1 0 0 1 0 1 0 4 1 0 1 4 2 0 0 1 1 0 0 8 -2 0 1 8 -1 0 0 1 1 1 0 8 -1 0 1 8 0 0 1 0 0 0 0 8 0 0 1 8 1 0 1 0 0 1 0 8 1 0 1 8 2 0 1 0 1 0 0 -4 - 2 1 1 -4 -1 1 1 0 1 1 0 -4 -1 1 1 -4 0 1 1 1 0 0 0 -4 0 1 1 -4 1 1 1 1 0 1 0 -4 1 1 1 -4 2 1 1 1 1 0 0 0 -2 1 1 0 -1 1 1 1 1 1 0 0 -1 1 1 0 0 1 __________________________________________________________________________ except no carryout is produced for the most significant bits of a negative two's complement multiplier B; partial product means for forming partial products P m for each recoded multiplier X m and Y m and carry partial product P c for carryout of the most significant recoded bit group; sign extension means for providing sign extension for negative partial products; and add means for receiving, aligning and adding said partial products P m and P c and said sign extension to produce a final product.

Claim 10

A multiplier for multiplying an N bit multiplicand by an M bit multiplier B comprising: input means for receiving said multiplicand A and multiplier B; recoding means for recoding four-bit groups B m+3 ; B m+2 ; B m+1 ; B m of multiplier B received by said input means and a carryin C m-1 to a two bit recoded group multiplier X m , Y m and carryout C m+3 as follows: __________________________________________________________________________ B.sub.m+3 B.sub.m+2 B.sub.m+1 B.sub.m C.sub.m-1 X.sub.m Y.sub.m C.sub.m+3 C.sub.m-1 X.sub.m Y.sub.m C.sub.m+3 __________________________________________________________________________ 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 1 0 0 1 0 1 0 2 0 0 0 1 0 0 4 -2 0 1 4 -1 0 0 0 1 1 0 4 -1 0 1 4 0 0 0 1 0 0 0 4 0 0 1 4 1 0 0 1 0 1 0 4 1 0 1 4 2 0 0 1 1 0 0 8 -2 0 1 8 -1 0 0 1 1 1 0 8 -1 0 1 8 0 0 1 0 0 0 0 8 0 0 1 8 1 0 1 0 0 1 0 8 1 0 1 8 2 0 1 0 1 0 0 -4 - 2 1 1 -4 -1 1 1 0 1 1 0 -4 -1 1 1 -4 0 1 1 1 0 0 0 -4 0 1 1 -4 1 1 1 1 0 1 0 -4 1 1 1 -4 2 1 1 1 1 0 0 0 -2 1 1 0 -1 1 1 1 1 1 0 0 -1 1 1 0 0 1 __________________________________________________________________________ except no carryout is produced for the most significant bits of a negative two's complement multiplier B; partial product means for forming partial products P m for each recoded multiplier X m and Y m and carry partial product P c for carryout of the most significant recoded bit group; sign extension means for providing sign extension for negative partial products; and add means for receiving, aligning and adding said partial products P m and P c and said sign extension to produce a final product.

Claim 11

A multiplier according to claim 6 wherein said partial product means includes a multiplexer for each partial product, and said sign extension means includes a multiplexer for forming a single sign extension word.

Claim 12

A multiplier for multiplying an N bit multiplicand A by an M bit multiplier B comprising: input means for receiving said multiplicand A and multiplier B; recoding means for recoding K bit groups B M+K-1 . . . B M+1 ; B m of said multiplier B received by said input means, where K is greater than 2, into L recoded multipliers stages J 1 and carryout C M+K-1 where L=K/2 for K even and (K+1)/2 for K odd and i is odd from 1 to 2L-1 as follows: a) recoded multiplier stage J 1 has the following repeating pattern ______________________________________ B.sub.m+1 B.sub.m C.sub.m-1 J.sub.1 ______________________________________ 0 0 0 0 0 0 1 1 0 1 0 1 0 1 1 2 1 0 0 -2 1 0 1 -1 1 1 0 -1 1 1 1 0 ______________________________________ b) recoded multiplier stages J 3 through J K-1 for K even and J 3 through K K-3 for K odd has the following repeating pattern 0 for 2 1 1 for 2 1 2 for 2 1 -1 for 2 1 0 for 2 1 except the less significant and most significant set of zeros which have a length of 2 2 +2 4 . . . 2 i-1 for the less significant set of zeros and a length of 2 2 +2 3 +2 5 . . . 2 i-1 for the most significant set of zeros c) recoded multiplier stage J K-1 for K odd has the following pattern 0 for 2 2 +2 4 +2 i-1 0 for 2 i 0 for 2 2 +2 3 +2 5 -2 i-2 d) generate a carryout C M+K-1 for recoded pattern positions greater than 2 2 +2 4 . . . 2 K for K even and 2 2 +2 4 . . . 2 K-1 +2 K for K odd except no carryout is generated for the most significant bit group of a negative two's complement multiplier B; partial product means for forming partial products P m for each recoded multiplier X m and Y m and carry partial product P c for carryout of the most significant recoded bit group; sign extension means for providing sign extension for negative partial products; and add means for receiving, aligning and adding said partial products P m and P c and said sign extension to produce a final product.

Claim 13

A multiplier for multiplying an N bit multiplicand A by an M bit multiplier B comprising: input means for receiving said multiplicand A and multiplier B; recoding means for recoding K bit groups B M+K-1 . . . B M+1 ; B m of said multiplier B received by said input means, where K is greater than 2, into L recoded multipliers stages J 1 and carryout C M+K-1 where L=K/2 for K even and (K+1)/2 for K odd and i is odd from 1 to 2L-1 as follows: a) recoded multiplier stage J 1 has the following repeating pattern ______________________________________ B.sub.m+1 B.sub.m C.sub.m-1 J.sub.1 ______________________________________ 0 0 0 0 0 0 1 1 0 1 0 1 0 1 1 2 1 0 0 -2 1 0 1 -1 1 1 0 -1 1 1 1 0 ______________________________________ b) recoded multiplier stages J 3 through J K-1 for K even and J 3 through K K-3 for K odd has the following repeating pattern 0 for 2 1 1 for 2 1 2 for 2 1 -1 for 2 1 0 for 2 1 except the less significant and most significant set of zeros which have a length of 2 2 +2 4 . . . 2 i-1 for the less significant set of zeros and a length of 2 2 +2 3 +2 5 . . . 2 i-1 for the most significant set of zeros c) recoded multiplier stage J K-1 for K odd has the following pattern 0 for 2 2 +2 4 +2 i-1 0 for 2 i 0 for 2 2 +2 3 +2 5 -2 i-2 d) generate a carryout C M+K-1 for recoded pattern positions greater than 2 2 +2 4 . . . 2 K for K even and 2 2 +2 4 . . . 2 K-1 +2 K for K odd except no carryout is generated for the most significant bit group of a negative two's complement multiplier B; partial product means for forming partial products P m for each recoded multiplier X m and Y m and carry partial product P c for carryout of the most significant recoded bit group; sign extension means for providing sign extension for negative partial products; and add means for receiving, aligning and adding said partial products P m and P c and said sign extension to produce a final product.

Claim 14

A multiplier for multiplying an N bit multiplicand A by an M bit multiplier B wherein A and B are coded or recoded unsigned or two's complement numbers, comprising: input means for receiving said multiplicand A and multiplier B; partial product means for forming a plurality of partial products P m =A×B m ×2 m of said multiplicand A and multiplier B received by said input means; sign extension means, operating in parallel with said partial product means for providing a single sign extension word SEW as a function of said multiplicand A and multiplier B received by said input means; and add means for receiving, aligning and adding said plurality of partial products P m and said sign extension word SEW to produce a final product.

Claim 15

A multiplier for multiplying an N bit multiplicand A by an M bit multiplier B wherein A and B are coded or recoded unsigned or two's complement numbers, comprising: input means for receiving said multiplicand A and multiplier B; partial product means for forming a plurality of partial products P m =A×B m ×2 m of said multiplicand A and multiplier B received by said input means; sign extension means, operating in parallel with said partial product means for providing a single sign extension word SEW as a function of said multiplicand A and multiplier B received by said input means; and add means for receiving, aligning and adding said plurality of partial products P m and said sign extension word SEW to produce a final product.

Claim 16

A multiplier according to claim 9 wherein said sign extension means forms said sign extension word SEW as a plurality of negative sign bits, beginning with a sign bit of a first negative partial product and extending to a 2 M+M-1 bit, except for positive sign bits for sign bits of subsequent negative partial products.

Claim 17

A multiplier according to claim 10 wherein said sign extension means includes: collecting means for determining and collecting sign bits of said partial products as a sign word; and a first complementing means for forming said sign extension word SEW as a two's complement of said sign word.

Claim 18

A multiplier according to claim 11 wherein said first complementing means adds one to a one's complement of said sign word.

Claim 19

A multiplier according to claim 10 wherein said sign extension means uses the sign of the coded or recoded multiplicand, the sign of the coded or recoded multiplier, and the law of signs to determine the sign of partial products, except that a coded or recoded multiplier of zero is considered a positive partial product.

Claim 20

A multiplier according to claim 9 wherein said sign extension means includes: collecting means for determining and collecting sign bits of said partial products as a sign word; and a first complementing means for forming said sign extension word SEW as a two's complement of said sign word.

Claim 21

A multiplier according to claim 14 wherein said first complementing means adds one to a one's complement of said sign word.

Claim 22

A multiplier according to claim 14 wherein said first complementing means adds a first complementing carry to a one's complement of said sign word; wherein said partial product means includes a second complementing means for adding a second complementing carry to one's complement of said multiplicand A as negative partial products P m ; and including pre-adder means for determining the position of said first complementing carry and the occurrence of a second complementing carry for the last partial product and for adding said first complementing carry and said last partial product complementing carry to said multiplicand A as a partial product.

Claim 23

A multiplier according to claim 16 wherein said first complementing carry and said last partial products complementing carry as a 1.

Claim 24

A multiplier according to claim 16 wherein said pre-adder means adds said complementing carries to said multiplicand A as said last partial product.

Claim 25

A multiplier according to claim 16 including recoded means for recoding said multiplier B; and wherein said pre-adder means determines the position of said first complement carry from the last significant bit of said recoded multiplier and occurrence of a second complementing carry from the sign of said multiplier B and necessity of an extra partial product as said last partial product.

Claim 26

A multiplier according to claim 19 wherein said partial product means and said pre-adder means operate in parallel.

Claim 27

A multiplier according to claim 9 wherein said partial product means and said sign extension means operate in parallel.

Claim 28

A multiplier according to claim 14 wherein said sign extension means uses the sign of the coded or recoded multiplicand, the sign of the coded or recoded multiplier, and the law of signs to determine the sign of partial products, except that a coded or recoded multiplier of zero is considered a positive partial product.

Claim 29

A multiplier/accumulator for an N bit multiplicand A and an M bit multiplier B comprising: input means for receiving said multiplicand A and multiplier B; partial product means for forming a plurality of partial products P m of said multiplicand A and multiplier B received by said input means; accumulator register means having a capacity of R bits where R is greater than Q where Q=M+N; array means for adding said plurality of partial products and the least significant bits from the accumulator register means and providing a sum S and a carry C of N bits each, product sign extension means operating in parallel with said partial product means and array means for providing a product sign extension word PSEW as a function of said multiplicand A and multiplier B to extend said sum S and carry C to R bits; and final adder means for receiving, aligning and adding said sum S, carry C, product sign extension word PSEW and most significant bits X R-1 . . . X q of said accumulator register means.

Claim 30

A multiplier/accumulator for an N bit multiplicand A and an M bit multiplier B comprising: input means for receiving said multiplicand A and multiplier B; partial product means for forming a plurality of partial products P m of said multiplicand A and multiplier B received by said input means; accumulator register means having a capacity of R bits where R is greater than Q where Q=M+N; array means for adding said plurality of partial products and the least significant bits from the accumulator register means and providing a sum S and a carry C of N bits each, product sign extension means operating in parallel with said partial product means and array means for providing a product sign extension word PSEW as a function of said multiplicand A and multiplier B to extend said sum S and carry C to R bits; and final adder means for receiving, aligning and adding said sum S, carry C, product sign extension word PSEW and most significant bits X R-1 . . . X q of said accumulator register means.

Claim 31

A multiplier/accumulator according to claim 23 wherein said final adder means includes merging means for merging said sum S, carry C, product sign extension word PSEW and most significant bits X R-1 . . . X q into two merged words of R bits and simple adder means for adding said two merged words.

Claim 32

A multiplier/accumulator according to claim 24 wherein said product sign extension means, for a product sign extension having a least significant bit of 1, provides a product sign extension word PSEW= X.sub.R-1 . . . X.sub.R-2 ; and said merging means produces the following two merged words: ______________________________________ .sup.--X.sub.R-1 .sup.--X.sub.R-2 . . . .sup.--X.sub.Q+1 .sup.--X.sub.Q S.sub.Q-1 S.sub.Q-2 . . . S.sub.1 S.sub.0 X.sub.R-2 X.sub.R-3 . . . X.sub.Q C.sub.Q-1 C.sub.Q-2 C.sub.Q-3 . . . C.sub.0 0 ______________________________________

Claim 33

A multiplier/accumulator according to claim 24 wherein said product sign extension means, for a product sign extension having a least significant bit of 1, provides a product extension word PSEW=C Q-1 . . . C Q-1 ; and said merging means produces the following two merged words: ______________________________________ .sup.--C.sub.Q-1 .sup.--C.sub.Q-1 .sup.--C.sub.Q-1 .sup.--C.sub.Q-1 S.sub.Q-1 S.sub.Q-2 . . . S.sub.1 S.sub.0 X.sub.R-1 X.sub.R-2 . . . X.sub.Q+1 X.sub.Q C.sub.Q-2 C.sub.Q-3 . . . C.sub.0. ______________________________________

Claim 34

A multiplier/accumulator according to claim 24 wherein: said product sign extension means, for a product sign extension having a least significant bit of 0, provides a product sign extension word PSEW=1 R-1 1 R-2 -1 Q-1 0 Q ; and said merging means produces the follow two merged words: __________________________________________________________________________ .sup.--X.sub.R-1 .sup.--X.sub.R-2 . . . .sup.--X.sub.Q+2 .sup.--X.sub.Q1 X.sub.Q S.sub.Q-1 S.sub.Q-2 . . . S.sub.1 S.sub.0 X.sub.R-2 X.sub.R-3 . . . X.sub.Q+1 X.sub.Q C.sub.Q-1 C.sub.Q-2 C.sub.Q-3 . . . C.sub.0 0. __________________________________________________________________________

Claim 35

A multiplier/accumulator according to claim 23 wherein said product sign extension means determines a product sign extension PSEW having a least significant bit of 0 for a) a negative two's complement multiplicand A and an unsigned multiplier B whose most significant bit group using bit group coding produces a carry; and b) a positive multiplicand A and a negative two's complement multiplier B whose most significant bit group using bit group coding produces a carry.

Claim 36

A multiplier for multiplying an N bit multiplicand A by an M bit multiplier B wherein A and B are coded or recoded unsigned and two's complement numbers comprising: input means receiving said multiplicand A and multiplier B; partial product means for forming a plurality of partial products P m=A ×B m ×2 m of multiplicand A and multiplier B received by said input means; first complementing means for adding a complementing carry of a one's complement of the least significant bit of multiplicand A to the second least significant bit of a one's complement of all bits of A except the least significant bit of A which is uncomplemented as follows: ##EQU14## to form a two's complement of A for a negative partial product; and adder means for receiving, aligning and adding said plurality of partial products to produce a final product.

Claim 37

A multiplier for multiplying an N bit multiplicand A by an M bit multiplier B wherein A and B are coded or recoded unsigned and two's complement numbers comprising: input means receiving said multiplicand A and multiplier B; partial product means for forming a plurality of partial products P m=A ×B m ×2 m of multiplicand A and multiplier B received by said input means; first complementing means for adding a complementing carry of a one's complement of the least significant bit of multiplicand A to the second least significant bit of a one's complement of all bits of A except the least significant bit of A which is uncomplemented as follows: ##EQU14## to form a two's complement of A for a negative partial product; and adder means for receiving, aligning and adding said plurality of partial products to produce a final product.

Claim 38

A multiplier according to claim 29 including: second complementing means for adding a complementing carry of one to the least significant bit of a one's complement of all bits of multiplicand A; and selections means for selecting said first or said second complementing means to form two's complement of A for a negative partial product.

Claim 39

A multiplier according to claim 30 wherein said selection means selects said first complementing means to form a two's complement of said multiplicand A for a coded or recoded multiplier bit of -1 and selects said second complementing means to form a two's complement of said multiplicand A for a coded or recoded multiplier bit of -2.

Claim 40

A multiplier according to claim 30 wherein said selection means selects said first or second complementing means such that the complementing carry is always added to the second least significant bit of said partial product P m .

Claim 41

A multiplier according to claim 30 including: a multiplicand register; and sign-magnitude means for controlling said multiplier to perform multiplication of said multiplicand A and multiplier B as unsigned or two's complement numbers by separately processing a sign bit and absolute value bits of a sign magnitude multiplicand A or multiplier B.

Claim 42

A multiplier according to claim 33 wherein said sign-magnitude means, for a multiplicand A having a negative sign, stores one's complement of said absolute value bits of said multiplicand A in said multiplicand register and controls said selection means to select said first or second complementing means to form two's complement of A for positive partial products.

Claim 43

A multiplier according to claim 34 wherein said selection means selects said first complementing means to form a two's complement of said multiplicand A for a coded or recoded multiplier bit of +1 and selects said second complementing means to form a two's complement of said multiplicand A for a coded or recoded multiplier bit of +2.

Claim 44

A multiplier according to claim 34 including a recoding means for recoding said multiplier B; and wherein said recoding means and said sign-magnitude means operate in parallel.

Claim 45

A multiplier according to claim 36 wherein said sign-magnitude means, for a multiplier B having a negative sign, forms one's complement B of absolute value bits of said multiplier B and adds one to B's least significant bit during recoding.

Claim 46

A multiplier according to claim 36 wherein said sign-magnitude means, for a multiplicand A have negative sign, provides as a partial product P m for negative partial products, a one's complement of said multiplicand A in said multiplicand register.

Claim 47

A multiplier for multiplying an N bit multiplicand A and an M bit multiplier B, to produce an N+M bit product P wherein coded or recoded A and B and P are two's complement, sign-magnitude or unsigned format numbers comprising: multiplicand register means for storing a multiplicand A multiplier register means for storing a recoded multiplier B; format means for determining the formats of the multiplicand A, multiplier B and product P and storing multiplicand A or a ones complement A of multiplicand A in said multiplicand register means as a function of the determined formats; partial product means for forming a plurality of partial products P m =A×B m ×2 m ; complementing means for forming two's complement of said multiplicand A, which is in said multiplicand register means, as negative partial products and for forming two's complement of said multiplicand A, which is in said multiplicand register means, as positive partial products; and adder means for adding said plurality of partial products to produce a product P.

Claim 48

A multiplier for multiplying an N bit multiplicand A and an M bit multiplier B, to produce an N+M bit product P wherein coded or recoded A and B and P are two's complement, sign-magnitude or unsigned format numbers comprising: multiplicand register means for storing a multiplicand A multiplier register means for storing a recoded multiplier B; format means for determining the formats of the multiplicand A, multiplier B and product P and storing multiplicand A or a ones complement A of multiplicand A in said multiplicand register means as a function of the determined formats; partial product means for forming a plurality of partial products P m =A×B m ×2 m ; complementing means for forming two's complement of said multiplicand A, which is in said multiplicand register means, as negative partial products and for forming two's complement of said multiplicand A, which is in said multiplicand register means, as positive partial products; and adder means for adding said plurality of partial products to produce a product P.

Claim 49

A multiplier according to claim 39 including a recoding means for recoding said multiplier B.

Claim 50

A multiplier according to claim 40 wherein said format means, for a multiplier B having a negative sign, forms one's complement B of absolute value bits of said multiplier B and adds one to B's least significant bit during recording.

Claim 51

A multiplier according to claim 37 wherein said format means, for a multiplicand A having a negative sign, stores the absolute value bits of A or a one's complement A of said multiplicand A in said multiplicand register means.

Claim 52

A multiplier according to claim 37 wherein said format means, for a multiplicand A, multiplier B and product P in sign-magnitude format, provides the absolute value bits of the multiplicand A and recoded multiplier B to their respective register means and affixes a sign to the product using the law of signs.

Claim 53

A multiplier according to claim 39 wherein said complementing means forming a one's complement of said multiplicand A, which is in said multiplicand register, as negative partial products.

Claim 54

A multiplier according to claim 39 wherein said complementing means adds a complementing carry to a one's complement of multiplicand A, which is in said multiplicand register means to form a two's complement as negative partial products and adds a complementing carry to said multiplicand A, which is in said multiplicand register means, to form a two's complement as positive partial product.

Claim 55

A multiplier according to the claim 39 wherein said format means stores a one's complement A in said multiplicand register if: SC=(S+U).sub.p [(T.sup.-).sub.A ⊕(T.sup.-).sub.B ]+T.sub.p [(S.sup.-).sub.A ⊕(S.sup.-).sub.B ] wherein T is two's complement format U is unsigned format S is sign-magnitude format subscript p is product format subscript A is multiplicand format subscript B is multiplier format superscript + is positive number superscript - is negative number.

Claim 56

A complex multiplier for (A+jB) (C+jD) comprising: first and second multiplicand register means for storing A and B respectively; first and second multiplier register means for storing reduced C and D respectively; first partial product means for forming a first plurality of partial products P mAC =A×C m ×2 m ; second partial product means for forming a second plurality of partial products P mBD =-B×D m ×2 m ; third partial product means for forming a third plurality of partial products P mAD =A×D m ×2 m ; fourth partial product means for forming a fourth plurality of partial products P mBC =B×C m ×2 m first complementing means for forming two's complement of A as negative partial product P mAC ; second complementing means for forming two's complement of B as positive partial products P mBD ; third complementing means for forming a two's complement of A as a negative partial products P mAD ; fourth complementing means for forming two's complement of B as negative partial products P mBC ; first adding means for adding said first and second plurality of partial products to product a first final product P R =AC-BD; and second adding means for adding said third and fourth plurality of partial products to produce a second final product P 1 =AD+BC.

Claim 57

A complex multiplier for (A+jB) (C+jD) comprising: first and second multiplicand register means for storing A and B respectively; first and second multiplier register means for storing reduced C and D respectively; first partial product means for forming a first plurality of partial products P mAC =A×C m ×2 m ; second partial product means for forming a second plurality of partial products P mBD =-B×D m ×2 m ; third partial product means for forming a third plurality of partial products P mAD =A×D m ×2 m ; fourth partial product means for forming a fourth plurality of partial products P mBC =B×C m ×2 m first complementing means for forming two's complement of A as negative partial product P mAC ; second complementing means for forming two's complement of B as positive partial products P mBD ; third complementing means for forming a two's complement of A as a negative partial products P mAD ; fourth complementing means for forming two's complement of B as negative partial products P mBC ; first adding means for adding said first and second plurality of partial products to product a first final product P R =AC-BD; and second adding means for adding said third and fourth plurality of partial products to produce a second final product P 1 =AD+BC.

Claim 58

A complex multiplier according to claim 47 including first and second recoding means for recoding C and D respectively before forming said pluralities of partial products.

Claim 59

A complex multiplier according to claim 47 wherein said first and second adding means each include array means for adding two pluralities of partial products and providing a sum S and a carry C; and final adder means for adding said sum S and C to produce a final product.

Claim 60

A complex multiplier according to claim 47 wherein each of said complementing means includes first complementor means for adding one's complement of the least significant bit of a multiplicand A/B to the second least significant bit of the one's complement of all bits of the multiplicand except the least significant bit of the multiplicand A/B as follows: ##EQU15## to form a two's complement of a multiplicand A/B; second complementor means for adding a complementing carry of one to the least significant bit of a one's complement of all bits of multiplicand A/B; and selections means for selecting said first or said second complementor means to form two's complement of A/B.

Claim 61

A complex multiplier according to claim 50, wherein said selection means, of said first, third and fourth complementing means, selects said first complementor means to form a two's complement of said multiplicand A/B for a multiplier bit of -1 and selects said second complementor means to form a two's complement of said multiplicand A/B for multiplier bit of -2; and wherein for said selection means, of said second complementing means, selects said first complementor means to form of two's complement of said multiplicand B for a multiplier bit of 1 and selects said second complementor means to form a two's complement of said multiplicand B for a multiplier bit of 2.

Claim 62

A complex multiplier according to claim 47 including: format means for determining the format of the multiplicands A and B, multipliers C and D and final products P R and P 1 and storing multiplicands A, B or one's complement A,B of multiplicands A, B in said first and second multiplicand register means as a function of the determined formats; said first, third and fourth complementing means forms a two's complement of A,B which is in a respective multiplicand register means as positive partial products; and said second complementing means forms a two's complement of B, which is in said second multiplicand register means, as negative partial products.

Claim 63

A complex multiplier according to claim 52, wherein said first, third and fourth complementing means forms a one's complement of said multiplicands A, B, which is in a respective multiplicand register means, as negative partial products; and said second complementing means forms a one's complement of said multiplicand B, which is in said second multiplicand register means, as positive partial product.

Claim 64

A complex multiplier according to claim 52, wherein: said first, third and fourth complementing means adds a complementing carry to a one's complement of multiplicand A, B, which is in said multiplicand register means to form a two's complement as negative partial products and adds a complementing carry to said multiplicand A,B, which is in said multiplicand register means, to form a two's complement as positive partial product; and said second complementing means adds a complementing carry to a one's complement of multiplicand B, which is in said multiplicand register means to form a two's complement as positive partial products and adds a complementing carry to said multiplicand B, which is in said multiplicand register means, to form a two's complement as negative partial product.

Claim 65

A complex multiplier according to claim 52 wherein said format means stores a one's complement A in said multiplicand register if SC=(S+U).sub.p [(T.sup.-).sub.A ⊕(T.sup.-).sub.B ]+T.sub.p [(S.sup.-1).sub.A ⊕(S.sup.-).sub.B ] wherein T is two's complement format U is unsigned format S is sign magnitude format subscript p is product format subscript A is multiplicand format subscript B is multiplier format superscript + is positive format superscript - is negative format.