SU1383506A1 - Converter of position code to subtraction by modulus - Google Patents

Abstract

The invention relates to computing and can be used in modular and conjugation control devices. The aim of the invention is to expand the scope of use due to the possibility of working on an arbitrary base of the positional number system. The goal is achieved by the fact that the converter of the positional code into a modulo deduction, containing the shift register 1, the group of elements I 3, the register. 4, the multiplication unit 5, modulo, accumulating the modulator adder 7, contains the decoder 2 and the multiplication unit 6 modulo with the appropriate links. 2 Il.

Description

ate

Od 00 UAE O1

"Ve /

The invention relates to computing and can be used to derive residues of a system of residual classes from numbers with a q-m base in modular and conjugation control devices.

The aim of the invention is to expand the scope of application due to the possibility of working according to p; E to arbitrary positioning of the number system. FIG. 1 shows the scheme of converting the position code to modulo deduction; in fig. 2 is a decoder circuit. 15

The converter (FIG. 1) contains - a shift register 1, a decoder 2, a group of IZ elements, a register 4, multiply moduloe blocks 5 AND 6 accumulating modulo 7 adder 7, an output 8 of the pre-20 generator, a base input 9 numbering system of the converter, information input 10 of the converter.

The decoder (Fig. 2) contains the elements OR 11-13 and the element AND 14 (for the case of a pyramidal base of the positioning system).

Shift Register 1 performs a shift towards the lower order bits of K bits and 30 rows.

,

where - the nearest integer, less than- (equal to

The decoder 2 converts the value code q; base positional number system in the code number

bits needed to represent it.

Calculation of the deduction systems of residual classes modulo P from the position number A occur in the converter according to the following form.

mule:

((p; m q;) modP) raodP,,.,. J

(-1) y

where is 3j ..

A, - the digit bit of the number Aj m - the size of the digit A;

rl; (G; P-qi.

The converter works as follows

In the initial state in the register 1

35

45

mod P, / rear 1 / qmo.dP;

50

its output 2, in its output in accordance with its turn-out code, opens the corresponding IZ elements, and multiplied modulo at one input of the module. The code of the lower digit A, the number A is present, and at the other input - the code of the number 1 output block 6 multiply by module. At the output of multiplication unit 5, the value of the younger group A:,. At the first stage of conversion, the accumulating adder 7 modulates the value A modulo, and in register 1 the information is shifted by the corresponding number of bits B. Register 4 records the value ImodP from the output of block 6. At the same time, the contents of register 4 are multiplied modulo P by qj in block 6 and is fed, on the one hand, to the input of register 4 and, on the other hand, to one input of multiplication unit 5 modulo, on the other input of which the value code is the product of these values (AjQiOmodP is present at the output of multiplication unit 5 modulo).

0

five

five

0

At the second stage, the modulo code 7 records the magnitude code ((A,., Q;) modP + A) modP, and the next shift of information occurs in register 1. In the future, the conversion process continues in a similar way.

Claims (1)

Invention Formula The position code converter. Modulo deduction, containing the shift register, the first unit of multiplication modulo accumulating the modulo adder, the register and the group of elements AND, and the information input of the converter is connected to the inputs of the bits of the shift register, the leading of the first unit multiplied modulo is connected with the input of the accumulating adder on the MODULE; The bypass of which is the output of the converter is about the fact that, in order to expand the scope of application due to the possibility of working on an arbitrary base positional system The convertible number A is written, in re -,: numeric, - it contains the second block bit 4 is the inverse multiplicative multiplication modulo and the decoder, the value of 1 / q; riodP: that accumulates at the input of the base positional adder 7 modulo zero, numerical system npeo6pa3orjaTenH with input 9 is the code for the base q ;. Ditch is connected to the input of the decoder on the input of the first multiplier of the second multiplication modulo unit, the output of which is connected to the input of the first multiplier of the first multiplication unit modulo and the register input, the output of which is connected to the input of the second multiplier of the second multiplication unit modulo outputs the decoder is connected to the first inputs of the corresponding 2 2 eleven / i Log. / elements AND groups, the second inputs of which are connected to the outputs of the corresponding lower ones: shift register bits, inputs of the shift magnitudes of which are connected to the outputs of the decoder, outputs of the AND group elements are connected to the inputs of the bits of the second multiplier of the first multiplication unit. H with; / J  2 -five FIG. 2