SU1587640A1 - Device for convolution of binary code to module code - Google Patents

Abstract

The invention relates to computing and can be used in a binary error prevention system during its transmission, processing and storage. The aim of the invention is to expand the field of application by forming a modular code other than zero for a zero binary code. A device for convolving a binary code into a code modulo contains a group of inputs 1 of a device, an output 2 of a device, a comparison circuit 3 with a constant, a unit 4 for group modulo together, a group of EXCLUSIVE OR elements with corresponding links. 1 tab., 2 Il.

Description

ate

00

Oi 4ib

1

The invention relates to automation: and computing technology and can be used in a system for preventing from errors of binary information during its transmission, processing and storage,

The aim of the invention is to expand the field of application by forming a modular code for a null binary core that is not null l.

i On. FIG. 1 is a diagram of a device for convolving a binary code into a modular code; Fig. 2 is a block diagram of group summation by module.

I The device (Fig. 1) contains a group of inputs I of the device, an output 2 of the device, a comparison circuit 3 with a confidential unit 4 of group summing {modulo, a group of elements of the IS-C SHARING OR 5.

The unit 4 of group summation modulo (FIG. 2) contains groups 6.1 - 6.1k of adders 7. 1-7.g (, m n.

the value of the module, g g 1, n is the bit dHoicTb of the group of inputs 1 of the device), wins | turns 8.1-8.k of the output bits of block 4 of the group summation by mod. Moreover, the first input of the adder 7, ii () of the group 6.j (j l-k) is connected with the output of the sum of the adder 7. (1-1)

be implemented through the element.

The device works as follows.

The adders of the 7 groups, using the information of the group of inputs 1, calculate the bit values of the check part of the code word. Scheme 3 Comparison with Constant

10 analyzes the information part of the word. In the case of a null combination, it generates a single signal, as a result, the EXCLUSIVE OR 5 elements change the zero values of the signals generated by the adders 7 to the opposite ones, providing single signals) to output 2. Otherwise, the comparison circuit 3 with the constant generates a zero signal.

20 The signals generated by the adders 7 through the elements EXCLUSIVE OR 5, without change, arrive at output 2..

The specific version of the device and

25 we consider its work on the example of the formation of code words of a code when the information part and the module are large. In this case, the device has a structure represented by

20 in Figures 1 and 2, without taking into account discontinuities in connection with x (the last input of group 1 is absent) The operation of the device in this case is described by the data of the table in which the codes are presented.

the same group, the second input summabino signals at the outputs of the nodes

Pa 7.1 group 6.J connected to the output device. the transfer of the adder 7. (D-) group

6. (j-l), the third input of the adder 7.1. Thus, the device to the frmiru (1 2-g-1) of the group 6.J is connected to the input modular code, the test part

the house of the j-ro bit of the (1 + 2) -th input of 1 d-code words of which is taken by the sign groups, the third input of the adder of the 7.g. from the set 1 ,, .., t. Wherein

group 6.J is connected to the output of the pass-zero binary word according to the adder of group 7 of group 6. (j-1), the test part is included. The sequences of the adder 7.1 of the group 6.J connect, and the circumstance allows detecting, respectively, with the inputs j-x, the characteristic catastrophic

a series of first, second, and third errors leading to transformation

code word to zero binary word.

inputs of group 1, outputs of the sum of adders 7.d are outputs 8.d of the corresponding output bits of block 4

group sum modulo.

The unit 4 of group summation modulo generates the signals of the test part p of the code word calculated as the remainder of dividing the number of the information part modulo (1 is a positive integer).

Scheme 3 Comparison with constant translates into comparison with zero and can

transformation errors

code word to zero binary word.

Claims (1)

Invention Formula A device for convolving a binary code into a modular code comprising a modulo group summing unit and a comparison circuit with a constant, wherein the group of inputs of the device is connected to the group of inputs of the modular group summing unit, characterized in that Formation for a zero binary code of a modular code other than zero, it contains a group of EXCLUSIVE OR elements, and a group of device inputs are connected respectively to the inputs of a comparison circuit with a constant whose output is connected A SINTER OR. Groups, the second inputs of which are connected to the outputs of the corresponding output bits of the group modulo unit, the outputs of the EXCLUSIVE OR elements of the group are the outputs of the corresponding device output bits.