FIELD: computer technology; microelectronics. SUBSTANCE: device has modulo 2n-1 adder of two numbers (n=2,3,...), n single-digit binary adders and n half adders. N-digit complete operands X, Y and Z are applied to inputs of the device. N-digit binary code of the result is formed at outputs of the device in form of R = (± X ± Y ± Z) mod (2n-1). This operation is performed by corresponding commutation of direct and reverse codes of operands at inputs of the device. EFFECT: improved reliability of operation. 2 tbl, 1 dwg
Title | Year | Author | Number |
---|---|---|---|
DEVICE FOR MODULO N ADDITION OF THREE NUMBERS | 1992 |
|
RU2018929C1 |
MODULO 2 SUBTRACTION AND ADDITION DEVICE | 1992 |
|
RU2018923C1 |
MODULO N ADDER | 1992 |
|
RU2018926C1 |
DEVICE FOR ADDITION AND SUBTRACTION OF SIXTEEN INTEGERS BY MODULO THREE | 1992 |
|
RU2050584C1 |
DEVICE FOR ADDITION AND SUBTRACTION OF N INTEGERS BY MODULO 2-1 | 1992 |
|
RU2047897C1 |
MODULO 7 ADDER | 1992 |
|
RU2018924C1 |
DEVICE FOR MODULO N ADDING OF SEVEN NUMBERS | 1992 |
|
RU2018930C1 |
MULTIPLE-INPUT SINGLE-BIT ADDER | 1992 |
|
RU2047216C1 |
MODULO 3 ADDER | 1992 |
|
RU2018927C1 |
DEVICE FOR GENERATION OF MODULO-THREE REMAINDER | 1992 |
|
RU2045770C1 |
Authors
Dates
1994-08-30—Published
1992-03-25—Filed