# Modulo adder-accumulator

FIELD: information technology.

SUBSTANCE: device has an n-bit adder, an (n+1)-bit adder, a multiplexer and a register.

EFFECT: broader functional capabilities due to introduction of the modulo addition operation.

1 dwg

The invention relates to computer technology and can be used in digital computing devices, and devices digital signal processing and cryptographic applications.

Known for accumulating adder (Tarabrin BV Reference integrated circuits / BV Tarabrin, S. Jakubowski, N.A. Barkanov, etc. Ed. BV Tarabrina. - 2nd ed., Rev. and supplementary): Energy, 1981., Fig.5-250, str)containing 3 adder and 3 of the register.

The disadvantage of this adder is limited functionality, namely the absence of the accumulation operation for the module.

The closest to the technical nature of the claimed invention is a cumulative adder, containing the register and the adder (Naumkin L.G. Digital circuitry. Abstract of lectures on discipline "Circuitry" - M: "Mountain book". Publishing house of Moscow state mining University, 2008, RIS, str).

The disadvantage of this device is limited functionality, namely the absence of the accumulation operation for the module.

The purpose of the invention is the extension of the functionality of the device due to the introduction of the accumulation operation for the module.

To achieve this goal in the accumulating adder module containing n-bit adder n-bit p is gistr, and second information inputs of the adder are information input device, and an information output registers are informational outputs of the device and connected with the first information input n-bit adder, a clock input of the register is clocked by the input device, the input to the reset register is input reset of the device, and the carry-in input n-bit adder is a carry-in input device, put (n+1)-bit adder n-bit multiplexer, and 1...n information outputs n-bit adder is connected with the first 1...n information inputs (n+1)-bit adder and the second 1...n information inputs of the multiplexer, the output of transfer n-bit adder connected to the first (n+1) informational log (n+1)-bit adder, the second 1...n+1 information inputs which are the inputs of the module code in inverted form to the input of the transfer (n+1)-bit adder is supplied logical unit, the output transfer (n+1)-bit adder is connected with the control input of the multiplexer, and 1...n information outputs are connected with the first 1...n information inputs of the multiplexer, the information outputs of which are connected with the inputs of the register entries.

The invention consists in the implementation of the following method, the cumulative summation of isel And_{
i}modulo R. at the input of accumulating adder integers A_{i}(i=1,2,3,...), 0≤A_{i}<P, potuckova added up the numbers written in his memory at the previous time step. Before the first beat of the memory device reset. The result of summing A_{i}+A_{i-1}given modulo P as follows. If (S=A_{i}+A_{i-1})<P, is the usual sum S=A_{i}+A_{i-1}and this sum S is the result. If (S=A_{i}+A_{i-1})≥P, and the initial condition for the sum of S cannot exceed 2P-2, then the sum S is subtracted the value of R and the result is the sum of (A_{i}+A_{i-1}) mod P. the result is written to the device memory and on the next cycle is used as the value of A_{i-1}.

Figure 1 presents the scheme of the accumulating adder module.

Accumulating adder module contains 2 adder 1 and 2, and the adder 1 is n-bit, and the adder 2 is (n+1)-bit multiplexer 3 and the case 4. Input 5 sequentially, synchronously with a clock pulse applied to the input 9, is supplied sequence of integers And_{i}on input 6 is fed a zero signal to the input 7 is supplied code module in inverted form to the input 8 is supplied to a logic unit, input 10 is used to reset the accumulating adder before you begin. The outlet 11 is closed the house device.
The outputs of the register 4 is connected to the output 11 of the device and with the first inputs of the adder 1, the outputs of the adder 1 is connected with the first inputs of the adder 2 and the second inputs of the multiplexer 3. Information outputs of the adder 2 is connected with the first inputs of the multiplexer 3, and the output of the transfer of the adder 2 - with the control input of the multiplexer 3. The outputs of the multiplexer 3 is connected to the inputs of register entries 4. Inputs 5 supply code number of the device connected with the second information input of the adder 1.

Accumulating adder module works as follows.

Before working on the input 10 of the device is a pulse which clears the contents of register 4. Input device 9 receives clock pulses which synchronize the operation of the device. With each clock pulse on input 5 enter codes numbers And_{i}arriving at the inputs (In_{1}...In_{n}) adder 1. The bit width of the input number is equal to n. The first inputs of the adder 1 enters a code number from the output of the memory element device - register 4. On the first beat of this number is "0". From the output of the adder 1 code amount supplied to the first inputs of the adder 2 and the second input (Y_{1}...Y_{n}) multiplexer 3. On the second inputs of the adder 2 (B_{1}...B_{n+1}) gets the inverse of the code module, and the input transfer 8 - logical unit. The adder 2 performs the OPE is the situation subtracting from the code number,
coming from the output of the adder 1, the code module R coming from input 7 devices. If reducing the number greater than or equal to R, the outputs of the adder 2 (S_{1}...S_{n}appears the difference of numbers, and the output transfer R_{About}adder 2 appears logical unit, which is supplied to the control input of the multiplexer 3, under the influence of which on the output of the multiplexer are connected to the second inputs (Y_{1}...Y_{n}). If reducing the number less than R, then the output transfer R_{About}produces a zero signal, and the outputs of the multiplexer are connected to its first input (X_{1}...X_{n}). Under the influence of the clock pulse number from the output of the multiplexer is recorded in the register 4. This number on the next cycle of operation acts as a first addend And adder 1 and the result of evaluating S at this stage, arriving at the output 11 of the device. Thus, at each stage in the register is formed by the sum of all received in the previous cycles of numbers And_{i}modulo R.

Accumulating adder module containing n-bit adder n-bit register, and the second information inputs of the adder are information input device, and an information output registers are informational outputs of the device and connected with the first info is made use of inputs n-bit adder, the clock input of the register is clocked by the input device, the input to the reset register is input reset of the device, and the carry-in input n-bit adder is a carry-in input device, characterized in that it introduced the (n+1)-bit adder n-bit multiplexer, and 1...n information outputs n-bit adder is connected with the first 1...n information inputs (n+1)-bit adder and the second 1...n information inputs of the multiplexer, the output of transfer n-bit adder connected to the first (n+1) information input (n+1)-bit adder, the second 1...n+1 information inputs which are the inputs of the module code in inverted form to the input of the transfer (n+1)-bit adder is supplied logical unit, the output transfer (n+1)-bit adder is connected with the control input of the multiplexer, and 1...n information outputs are connected with the first 1...n information inputs of the multiplexer, the information outputs of which are connected to the inputs of register entries.

**Same patents:**

FIELD: information technology.

SUBSTANCE: remainder on base p_{i} of a multiplicant is concurrently recorded in matrix memory elements of the i-th multiplier; the number of units b_{i} in each column of the i-th matrix is concurrently counted; the binary number b_{1} is shifted by one bit to the right and summed with number b_{2}; the obtained sum b^{s} _{2} is shifted by one bit to the right and summed with number b_{3}. Similarly, the obtained sums are shifted and summed with subsequent numbers to obtain a sum b^{s} _{2*m-1}, wherein the least significant bit of the number b_{1} is the first multiplication bit s_{1}, the least significant bit of each obtained sum b^{s} _{i} is the i-th multiplication bit. The binary number b^{s} _{2*m-1} is shifted, the least significant bit of the obtained number is the (2*m)-th bit of the determined product s_{2*m}. If s_{i} is greater than p_{i}, the obtained product s_{i} is corrected by successive subtraction of the base p_{i} from s_{i} until s_{i} is less than p_{i}, 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

FIELD: information technology.

SUBSTANCE: invention can be used in digital computers as well as digital signal processing devices and cryptographic applications. The device has logic elements NOT, AND, OR.

EFFECT: high speed of operation of the adder due to parallel execution of the modulo addition operation.

1 dwg, 1 tbl

FIELD: information technology.

SUBSTANCE: apparatus has input registers, projection generating circuits, memory units, adders, an analysis circuit, AND logic elements, a flip-flop and a projection counter.

EFFECT: high speed of determining functional characteristics and cutting hardware costs.

1 dwg

FIELD: information technology.

SUBSTANCE: homogeneous computing environment cell has an XOR element, an AND element and two flip-flops.

EFFECT: faster operation and reliability.

3 cl, 6 dwg, 3 tbl

FIELD: information technology.

SUBSTANCE: device for generating remainder on arbitrary modulus of a number has first and second registers, a group of AND elements, a unit of half-adders and a delay element, where the device also includes (K-1) half-adders, to whose second data inputs a modulus code is transmitted, and a number code "1" is transmitted to the first data input of the first half-adder and the second data input of the group of AND elements, the output of the i-th half-adder is connected to the second data input of the group of AND elements and with shift of one bit towards the most significant bits to the first data input of the i+1 half-adder, where i=1,…,K-2, the K-1 output of the half-adder is connected to the second data input of the group of AND elements.

EFFECT: cutting the size of equipment.

2 dwg

FIELD: information technologies.

SUBSTANCE: invention may be used in digital computing devices, and also in devices to generate elements of end fields and in cryptographic applications. The device comprises summators, multipliers, inverters and multiplexors.

EFFECT: expanded range of input number values.

1 dwg

FIELD: information technologies.

SUBSTANCE: device comprises n+1 single-digit parallel summators by module, where n - number of digits of summation numbers, at the same time each single-digit summator by module comprises two single-digit summators, two logical AND elements, a logical OR element, two logical NOT elements.

EFFECT: expansion of functional capabilities of the device by introduction of a summation operation by module.

2 cl, 2 dwg, 1 tbl

FIELD: information technology.

SUBSTANCE: apparatus for generating remainder for given modulo contains T units for generating partial remainders with a data input on n bits, an input for primary remainders on (n-p-1)·(p+1) bits, an initialisation input, a synchronous input and output on (p+q) bits, respectively, two parallel (p+2)- and (p+1)-bit registers with a synchronous input, a data input and output, respectively, a multiplexer with two data inputs, a control input and output, a comparator with two inputs and an output, a subtractor with minuend and subtrahend inputs, as well as a difference output.

EFFECT: high efficiency of generating a remainder on a given modulo for a stream of numbers by piping the process of calculating partial and resultant remainders based on precalculation of values of primary remainders.

2 dwg, 1 tbl, 2 cl

FIELD: information technology.

SUBSTANCE: apparatus has an input register, a switch, a multiplexer, a correction circuit, two half adders, two registers for recording intermediate results of modulus, 2 addition and three output registers.

EFFECT: high bitness of binary codes converted in residue number systems.

1 dwg

FIELD: information technologies.

SUBSTANCE: device comprises inlet registers of dividend and divisor, unit of division with zero balance, unit for conversion of residual code into code of generalised position system, read-only memory, unit of subtractor, multiplication unit, prohibition unit, units of comparison, key, summator.

EFFECT: expanded functional capabilities of device since division operation is performed at arbitrary values of dividend and divisor, and reduced volume of equipment.

1 dwg, 1 tbl

FIELD: information technology.

SUBSTANCE: method includes steps for parallel counting of the number of units b_{i} (i=1 m) in m n-bit binary vectors, shifting the binary number b_{1} one bit to the right, summing with a number b_{2}, shifting the obtained sum b^{s} _{2} one bit to the right and summing with a number b_{3}. Similarly, the obtained sums are shifted and summed with the next numbers until a sum b^{s} _{m} is obtained. The least significant bit of the number b_{1} is the first bit s_{1} of the sum and the least significant bit of each obtained sum b^{s} _{i} is the i-th bit s_{i} of the sum. The binary number b^{s} _{m} is shifted one bit to the right and if b^{s} _{m}=0, computation is stopped, otherwise the least significant bit is the s_{m+1}-th bit of the sum; if b^{s} _{m}≠0, the binary number b^{s} _{m} is shifted and the obtained number is the value of most significant bit of the desired sum, starting from the m+1 bit.

EFFECT: faster computation.

1 dwg

FIELD: information technologies.

SUBSTANCE: homogeneous computing environment provides for parallel conveyor summation of m n-digit operands and comprises identical cells made of 2 double-input elements AND, 2 double-input elements EXCLUSIVE OR, a double-input element OR, an element NOT, 3 information triggers, at the same time the number of columns in the homogeneous computing environment is equal to p, where p=log_{2}m, and the number of cells in the j column is equal to m/2^{j}.

EFFECT: higher efficiency due to parallel-conveyor separation of bits of transfers of a digit cut of summands into the following digit cut and generation of digits of an unknown sum at every stage of device operation.

4 dwg

FIELD: information technology.

SUBSTANCE: invention can be used when designing arithmetic units and performing arithmetic procedures for summation of positional arguments of terms. In one version of the invention, the adder is constructed from logic elements NOT, OR, AND, NAND, NOR.

EFFECT: faster operation.

4 cl

FIELD: information technology.

SUBSTANCE: invention relates to computer engineering and can be used when designing arithmetic units and performing arithmetic procedures of summation of positional arguments of analogue signals of terms [n_{i}]f(2^{n}) and [m_{i}]f(2^{n}) by applying the arithmetic axiom of the ternary number system f(+1,0,-1). The functional structure is realised using logic elements AND, OR.

EFFECT: faster operation.

1 cl

FIELD: information technology.

SUBSTANCE: in one of the versions of the invention, the conditional j-th bit of the input functional structure of the adder is realised using logic elements NAND, NOR, AND, OR, NOT.

EFFECT: faster process of converting arguments in the input structure of the adder.

9 cl, 1 app

FIELD: information technology.

SUBSTANCE: in one of the versions of the invention, the conditional "j" bit of the input functional structure of the adder is realised using logic elements AND, OR, NOT, NAND, NOR.

EFFECT: faster process of converting arguments in the input structure of the adder.

9 c

FIELD: information technology.

SUBSTANCE: in one of the versions of the invention, the conditional "j" bit of the output functional structure of the adder is realised using logic elements AND, OR.

EFFECT: faster process of converting arguments in the output structure of the adder.

5 cl

FIELD: information technology.

SUBSTANCE: one version, the functional design is realised using logic elements AND, OR.

EFFECT: faster operation.

2 cl

FIELD: information technology.

SUBSTANCE: adder has eight p-type field-effect transistors, eight n-type field-effect transistors, inputs for terms A and B, a carry input CIN, three inverters, a two-input XOR logic element, high and low level voltage power leads.

EFFECT: high reliability and small size of the device.

1 dwg, 1 tbl

FIELD: information technology.

SUBSTANCE: device has n digital inverters, (n+1) adders, n inputs for bits of the reduced number, n inputs for bits of the subtracted number, a logic "1" bus and (n+1) outputs.

EFFECT: simpler device, faster operation and higher reliability.

1 dwg, 1 tbl

FIELD: computer science.

SUBSTANCE: into multilevel m-dimensional matrix adding structure, containing one-digit adding nodes of first, second and third levels, m-dimensional matrix structures for one-digit adding of second, third and fourth level are inserted, which form hierarchical multilevel adding structure of vertical arithmetic, representing a regular hierarchical logarithmical structure connected along vertical line, with inter-level links, along horizontal line - matrix structure, wherein matrix structures of previous levels, connected by links, form a matrix structure of next hierarchical level of multilevel m-dimensional matrix structure.

EFFECT: broader functional capabilities, higher speed of operation.

4 cl, 5 dwg