FIELD: information technology.
SUBSTANCE: remainder on base pi of a multiplicant is concurrently recorded in matrix memory elements of the i-th multiplier; the number of units bi in each column of the i-th matrix is concurrently counted; the binary number b1 is shifted by one bit to the right and summed with number b2; the obtained sum bs 2 is shifted by one bit to the right and summed with number b3. Similarly, the obtained sums are shifted and summed with subsequent numbers to obtain a sum bs 2*m-1, wherein the least significant bit of the number b1 is the first multiplication bit s1, the least significant bit of each obtained sum bs i is the i-th multiplication bit. The binary number bs 2*m-1 is shifted, the least significant bit of the obtained number is the (2*m)-th bit of the determined product s2*m. If si is greater than pi, the obtained product si is corrected by successive subtraction of the base pi from si until si is less than pi, otherwise correction is not performed; powers of multipliers are simultaneously summed up and the resultant sum is the power of the determined product.
EFFECT: faster computation.
2 dwg
Title | Year | Author | Number |
---|---|---|---|
METHOD OF FACILITATING MULTIPLICATION OF FLOATING-POINT NUMBERS REPRESENTED IN RESIDUE NUMBER SYSTEM | 2012 |
|
RU2500018C1 |
METHOD OF EXACT DIVISION OF INTEGER BINARY NUMBERS, STARTING FROM LEAST SIGNIFICANT BIT | 2012 |
|
RU2498393C1 |
VERSIONS OF MATRIX DEVICE FOR MULTIPLYING NUMBERS | 0 |
|
SU1160398A1 |
MATRIX COMPUTING DEVICE | 0 |
|
SU1034032A1 |
MATRIX DEVICE FOR MULTIPLYING BINARY AND DECIMAL NUMBERS | 0 |
|
SU1200282A1 |
MATRIX COMPUTING DEVICE | 0 |
|
SU1541599A1 |
METHOD OF FACILITATING MULTIPLICATION OF TWO NUMBERS IN MODULAR-INDEX PRESENTATION FORMAT WITH FLOATING POINT ON UNIVERSAL MULTI-CORE PROCESSORS | 2017 |
|
RU2652460C1 |
ACCELERATED MULTIPLIER UNIT BASED ON NEURONS | 2006 |
|
RU2322688C2 |
POLYFUNCTIONAL CALCULATING DEVICE | 0 |
|
SU1293727A1 |
ARRANGEMENT FOR MULTIPLYING BY N-DIGITS OF FACTOR | 0 |
|
SU717764A1 |
Authors
Dates
2013-06-20—Published
2012-04-17—Filed