Method and apparatus for fast multiplication including conversion of operand format

Claim 2

A fast-multiplication digital system comprising at least one multiplier for multiplying two binary numbers each number comprised of a plurality of digits having differing significance and weights, each multiplier comprising means for converting each of the two binary numbers into a first amplitude number having a sign, each of said first amplitude numbers comprising the most significant digits of said binary number, the first digit being the most significant non-zero digit of said binary number, and into a second shift number having an amplitude indicative of a weight shift of the binary number before and after conversion to a predetermined format and a sign indicative of a direction of said weight shift, the system further comprising means for multiplying the first amplitude numbers of the two binary numbers and for producing a first resultant number corresponding to the multiplication of said first amplitude numbers, means for algebraically adding the second shift numbers of the two binary numbers and for producing a second resultant number corresponding to the addition of said second shift numbers, and means for shifting said first resultant number in response to said second resultant number.

Claim 3

A system according to claim 1, wherein said means for converting said binary numbers comprises a router means, and a detector means for determining by comparison the weight of the most significant non-zero digit of each of the binary numbers thereby controlling said router so that at the output thereof said weight represents the highest weight of the converted binary number, said detector means and said router means being adapted to receive said binary numbers simultaneously.

Claim 4

A system according to claim 1 characterized in that said means for converting each of the two binary numbers into a first amplitude number and said means for shifting said first resultant number comprises a shift register.

Claim 5

A system according to claim 1 characterized in that said means for converting each of the two binary numbers into a first amplitude number and said means for shifting said first resultant number comprises a multiplexer.

Claim 6

A system as defined in claim 1 where each multiplier multiplies two binary numbers A i and y i where i denotes an integer between 1 and n, n being the number of multipliers; and an adder means for performing a summation ##EQU1## of the various products A i .sup.. y i produced by said multipliers.

Claim 7

A system as defined in claim 5 receiving signal samples of amplitude x O reaching said adder means at a fixed frequency of period T, said adder means producing an output value, y O , given by: ##EQU2## in which the binary number A i are coefficients and the binary numbers y i are the values of y O at instants of time t = -iT, the system further comprising a plurality of delay means, the system output value y O being fed back in a loop to an input of each separate multiplier via one of said plurality of delay means, the system further comprising conversion means in said loop common to all the y i values.

Claim 8

A system according to claim 5 comprising additional means for shifting numbers introduced into the adder whereby in the case of numbers exceeding the adder format length the lowest weight of such excessive format length corresponds to a weight greater than the units weight of such numbers, whereas in the case of numbers not exceeding the format length the lowest weight corresponds to the same weight as the lowest weight of the numbers which do exceed the format length.

Claim 9

A system according to claim 7, characterized in that in the case of numbers representing the result of the multiplication available at the output of the multipliers, the additional shift means comprises a means for shifting such multipliers.

Claim 10

A system according to claim 7 wherein the additional shift means are coupled for providing the same shifts.

Claim 11

Apparatus for multiplying binary numbers each representable by a plurality of bits, said apparatus having at least one multiplier and each multiplier comprising: a. means for converting each of said binary numbers into a composite code, said converting means comprising means responsive to said binary numbers for detecting the most significant non-zero bit of said binary numbers, b. said converting means providing for each of said binary numbers a first coded output indicative of the magnitude of the most significant non-zero bit and at least some lower significant bits, c. said converting means providing for each of said binary numbers a second coded output indicative of the weight of said most significant non-zero bit, said composite code comprising said first and second coded outputs, d. multiplying means for multiplying together corresponding first coded outputs associated with one and another of said binary numbers to form a product code, e. adding means for adding together corresponding second coded outputs associated with said one and said another of said binary numbers to form a sum code, and f. shifting means for shifting said product code by a number of bits equal to said sum code to provide a resultant code output indicative of the product of one and another of said binary numbers.

Claim 12

Apparatus for multiplying binary numbers each representable by a plurality of bits, said apparatus having at least one multiplier and each multiplier comprising: a. means for converting each of said binary numbers into a composite code, said converting means comprising means responsive to said binary numbers for detecting the most significant non-zero bit of said binary numbers, b. said converting means providing for each of said binary numbers a first coded output indicative of the magnitude of the most significant non-zero bit and at least some lower significant bits, c. said converting means providing for each of said binary numbers a second coded output indicative of the weight of said most significant non-zero bit, said composite code comprising said first and second coded outputs, d. multiplying means for multiplying together corresponding first coded outputs associated with one and another of said binary numbers to form a product code, e. adding means for adding together corresponding second coded outputs associated with said one and said another of said binary numbers to form a sum code, and f. shifting means for shifting said product code by a number of bits equal to said sum code to provide a resultant code output indicative of the product of one and another of said binary numbers.

Claim 13

Apparatus as recited in claim 10 wherein said second coded output comprises a sign bit indicative of the direction of shift associated with the weight of said most significant non-zero bit and said means for shifting comprises means for shifting towards higher and lower weights in accordance with the sign of said sum code.

Claim 14

Apparatus as recited in claim 10 wherein said means for shifting said product code comprises a shift register.

Claim 15

Apparatus as recited in claim 10 wherein said means for shifting said product code comprises a multiplexer.

Claim 16

Apparatus as recited in claim 10 comprising a plurality of said multipliers each having an output, and an additional adding means having multiple inputs, said multiple inputs being connected to outputs of said multipliers.

Claim 17

Apparatus as recited in claim 14 further comprising additional converting means and additional detecting means wherein said additional adding means provides an output binary number code to said additional converting means and to said additional detecting means for providing an additional composite code associated with said output binary number code from said additional adding means.

Claim 18

Apparatus as recited in claim 15 further comprising a plurality of storage means for storing binary numbers for feeding to said multiplying and adding means, and wherein first connecting means feed said additional composite code to a first shift register for connection to one of said storage means.

Claim 19

Apparatus as recited in claim 16 further comprising another shift register, wherein the output of said first shift register is fed to said other shift register for connection to another storage means, whereby said apparatus operates as a digital frequency filter.

Claim 20

Apparatus as recited in claim 16 wherein said converting means comprises first and second storage means for storing respective first and second binary representations corresponding to one and another of said binary numbers, and third and fourth storage means for storing composite code binary representations corresponding respectively to said composite codes of said one and another of said binary numbers.

Claim 21

Apparatus as recited in claim 18 wherein said converting means further comprises first router means for routing said most significant non-zero bit and at least some lower significant bits from said first storage means to said third storage means for said one binary number.

Claim 22

Apparatus as recited in claim 19 wherein said converting means further comprises second router means for routing said most significant non-zero bit and at least some lower significant bits from said second storage to said fourth storage means for said another binary number.

Claim 23

Apparatus as recited in claim 20 wherein said first and second router means comprise shift registers.

Claim 24

Apparatus as recited in claim 20 wherein said first and second router means comprise multiplexers.