RU2553068C2 - Method of transmitting information using noiseless coding - Google Patents

Abstract

FIELD: physics, communications.

SUBSTANCE: invention relates to data encoding and transmission and can be used in automated space rocket preparation and launching systems. The method comprises steps where all transmitted messages are protected from distortions by cyclic coding and the same noise-immunity is provided for all transmitted messages; wherein vital messages, distortion of which can lead to dangerous consequences, are transmitted in two consecutive cyclic code combinations, wherein the information part of the first code combination contains an odd number of units, and the information part of the second code combination is an inverse of the information part of the first code combination.

EFFECT: high reliability of transmitting messages over communication channels.

Description

The invention relates to astronautics and can be used for data transmission in automated systems for the preparation and launch of space rockets (ILV).

Many methods of error-correcting coding are known. Immunity-correcting, or correcting, codes are called codes that allow one to detect, detect, and correct errors in code combinations (Tutevich VN Telemechanika. - M.: Energia, 1973, p. 56). In telemechanical systems, binary uniform codes are most widely used. Of the many known systematic codes, cyclic codes are the most advanced. These codes are well adapted to detect and correct errors and are easily implemented (Bleikhut R. Theory and Practice of Error Correcting Codes / Ed. By K.Sh. Zigangirova. - M.: Mir, 1986, p. 112).

The disadvantage of cyclic codes, as well as other block systematic codes, is the same protection against distortion of all transmitted messages. All messages are transmitted with the same noise immunity. In automated systems for the preparation and launch of ILV, there are especially important messages whose distortions can lead to disruption of ILV preparation schedules, accidents and disasters.

The prototype of the proposed method is a method of cyclic coding (Werner M., Fundamentals of coding. - M .: Technosphere, 2006, p. 177).

The aim of the invention is to increase the reliability of the transmission of certain messages in the communication channels of automated systems for the preparation and launch of ILV. The proposed method will allow to build a system of information transfer, providing greater noise immunity to messages, the distortion of which can lead to dangerous consequences.

The essence of the invention lies in the fact that among all transmitted messages there are especially important ones, that is, those whose distortions can lead to disruption of ILV preparation schedules, accidents and disasters. All transmitted messages are protected, for example, by a cyclic code. Especially important messages to prevent their occurrence on the receiving side of the information transmission system in the absence of their transmission on the transmitting side are protected as follows. Each transmitted especially important message is transmitted by two consecutive code combinations of the error-correcting code, for example, cyclic. In addition, a particularly important message, which is the information part of the first code combination, must contain an odd number of units, and the information part of the second code combination is an inversion with respect to the information part of the first code combination. By inversion is meant the conversion of zero to one, and units to zero. That is, when transmitting a particularly important message, the information part of the second code combination is formed on the transmitting side according to the inverse coding algorithm (Tutevich VN Telemechanics. - M: Energy, 1973, p. 61) with respect to the information part of the first code combination. For uniform binary codes, the number of all possible code combinations is determined from the expression:

N = 2 ⁿ -1; n is the number of elements in combination.

For example, 10 bits will transmit 1023 messages. Suppose 1000 of them are of a technological nature, then, for example, 10 especially important messages can be sent in double sending according to the above principle.

Thus, in order to distort a particularly important message and transform it into another especially important message, a sequential repetition of the following events is necessary: two messages are distorted so that the new pair corresponds in all categories to another especially important message, and the probability of this event is practically zero. A technological message also practically cannot degenerate into a particularly important one, since for this it is necessary that the message following it also degenerates into a pair corresponding to a particularly important message.

The fundamental difference is the use of uneven protection of messages transmitted over a single communication channel. Particularly important messages make up a small fraction of all transmitted information; system performance remains within tolerance.

Achievable technical result is to increase the reliability of the transmission of particularly important messages transmitted over a single communication channel with technological messages. Thus, the construction of an additional communication channel is not required, and since especially important messages make up a small fraction of all transmitted information, the system performance remains within tolerance.

Claims (1)

A method for transmitting information using error-correcting coding, in which all transmitted messages protect against distortion by a cyclic code and provide the same noise immunity to all transmitted messages; characterized in that especially important messages, the distortions of which can lead to dangerous consequences, are transmitted by two successive cyclic code combinations, while the information part of the first code combination contains an odd number of units, and the information part of the second code combination is an inversion with respect to to the information part of the first code combination.