RU2739335C1 - Telemetering information transmission method - Google Patents

Abstract

FIELD: data transmission systems.SUBSTANCE: code sequences filling time gaps allocated for transmission of initial bits of transmitted information are formed as consisting of components represented by code segments, which by their position in the measurement word are lower (amni) and upper (asni) half of words. Then, from two semi-words amniand amnj, belonging to code words-measurements Wiand Wjof two different SVPs with indices i and j, which require the same polling frequency, constitute a new transmission codeword Wmnij= <amni, amnj>2, which is transmitted at a frequency fotri(mn). Similarly, their upper half of words Wsnij= <asni, asnj>2are combined into a new word Wsnijof the same bit width, which is accepted in the modernized on-board telemetry system (BRTS), but is transmitted with a lower sampling frequency fotri(sn)= fotri(mn)/k, where k is the accepted coefficient of its division.EFFECT: technical result is to provide noise-immune coding of slowly varying parameters (SVP) with simultaneous reduction of redundancy of transmitted data.3 cl, 5 tbl, 1 dwg

Description

The invention relates to systems for transmitting telemetric information (TMI), distorted during transmission by interference of natural and artificial origin. It is aimed at introducing into the existing practice of transmitting TMI new algorithms for structural and algorithmic transformations (SAP) of telemeasurement data, designed to provide compressed noise-immune coding of transmitted messages. At the same time, the requirement to ensure adaptation to the data presentation structures that are used in the existing onboard telemetry systems (BRTS) acts as a limitation.

A group of inventions is known, in which additional economical noise-immune coding is used to achieve high noise immunity of measurement data. It includes: [1], "Method of transferring information", patent RU No. 2609747, priority from 13.08.2017; [2] "Method of transferring information and a system for its implementation", patent RU No. 2586833, priority 15.08.2015, the essential characteristics of which are associated with economical non-redundant noise-immune coding, and [3], "Method of transferring information and a system for its implementation ", Patent RU No. 2586605, priority dated 03/22/2013), requiring, in the general case, one additional bit to represent the results of additional low-redundant noise-immune coding of data by their residual images b _{1 j} and b _{3 j} obtained as a result of comparing them initial values X _j represented by N = 2 n - bit binary positional code using optimally selected comparison modules m ₁ = 2 ⁿ - 1 and m ₃ . = 2 ⁿ + 1

When using these methods, the possibilities of additional economical non-redundant noise-immune coding of the transmitted information are provided based on the formation of an internal structure of data representation (S _int ), which, in terms of bit width ( N ) of binary words used for information transmission, coincides with the existing structure of representation of measurement words and data packets ... The latter is an external structure of data presentation (S _external ), which is used in the existing BRTS as telemetry frames, bit representation of telemetry data and synchronization signals. In the most general case, the external data structure (S _external ) may include other data that is referred to as ancillary data. These include: address information, check symbols of redundant error-correcting codes, protective symbols between words used to increase the accuracy of the synchronization system, as well as check symbols for checking the "parity" of the number of symbols "1" ([4], "Modern telemetry in theory and in practice / Training course ", St. Petersburg: Science and Technology, 2007. - 672s, p. 465).

The essential characteristics of the proposed method are that the introduction of SAP algorithms [1-3] would not require going beyond the restrictions determined by the existing rules for presenting data in the BRTS, which are currently used. This would make it possible to use the existing receiving and recording stations (PRS) and the ground telemetry complex, in general, without expensive hardware modifications, and all introduced innovations and changes would be implemented at the expense of software tools and the development of an updated software.

When using methods [1] and [2], the width of the N source binary words that determine the external structure of the data representation (S _ext ) always exactly coincides with the width of the data ( N ), which are the results of additional noise-immune coding and form the external structure of the data representation (S _int ). With the method [3] the missing rank for the internal structure (S _ext) data forming compensate mainly due to the additional binary symbol "Parity bit" present in the original external data structure (S _ext) digital baseband signals (CHS).

Additional economical little-redundant noise-immune coding [3] is also considered as a structural-algorithmic transformation of the first stage (SAP-1), which has two interdependent types: direct structural-algorithmic transformation (PSAP-1), which determines the information coding operation and the reverse structural-algorithmic transformation ( OSAP-1), which is a decoding operation.

At the same time, additional economical non-redundant error-correcting coding [1,2] is presented as a structural-algorithmic transformation of the first stage, which is equivalent in relation to SAP-1 and is designated as SAP-1 (E), PSAP-1 (E) and OSAP- 1 (E), respectively. Therefore, in the future, when considering general issues, the main (first) row of designations will be used.

In contrast to similar mathematical analogues, known, for example, as direct and inverse Fourier transforms (PPF and OPF) [4], the inverse structural-algorithmic transformation (OSAP-1) has two types: universal OSAP-1 (UOSAP-1), identified with the concept of "hard" decoding, and private OSAP-1 (CHOSAP-1), which is defined as "soft" decoding of the received and processed information. In this case, the "hard" decoding algorithm is always applicable, regardless of the properties of the transmitted information, but at the same time, in accordance with the laws of Nature, "you have to pay for universality with losses of efficiency", which manifests itself in the practical absence of the possibility of detecting and correcting data transmission errors. The CHOSAP-1 ("soft" decoding) algorithm allows using the natural redundancy of transmitted digital data to detect and correct errors in the transmission of information during its reception and processing. The natural redundancy of digital data is a consequence of the application of the V.A. Kotelnikov sampling theorem, according to which the intervals ( ΔT ) between interrogations of an analog parameter or signal X _{j are} determined as the inverse relation to the value of the doubled spectral component of the highest frequency (2 F _max ) X _j [4]:

. (1) ΔT =

... (one)

Since the probability of the occurrence of the frequency component F _max at a sufficiently small time interval Δτ ≥ 3 ΔT is insignificant in magnitude, the selected value of the intervals ΔT for other spectral components F _{i of the} spectrum of the parameter or signal turns out to be small, which manifests itself in the correlation relationship of adjacent values of messages or measurement words ( X _{j -1} , X _j and X _{j +1} ). In telemetry, this component of internal redundancy is, on average, 90%. When transmitting other types of information, for example, speech, acoustic, streaming video or navigation, it is also significant. Simultaneous use of two modes of decoding of the received digital signals UOSAP-1 and CHOSAP-1 is assumed. In this case, the CHOSAP-1 detector operates under the control of the UOSAP-1. The UOSAP-1 detector, based on the received sequence of encoded data, represented by an N -bit binary code, determines the presence of their correlation relationship, and if it detects its presence for three or more consecutive messages, then connects them for processing, carried out in order to detect and correct transmission errors, detector CHOSAP-1. The introduction of numbers denoting the stages (i) of distributed structural and algorithmic transformations (SAP-i) also becomes mandatory to determine the information section (i) in the existing data generation and transmission paths, in which additional coding of the transmitted information is provided.

The main disadvantage of all the known classical methods of redundant error-correcting coding and information security is that the specific features of the transmitted information are not taken into account. Therefore, their efficiency in the context of extremely rapid growth in the volume of transmitted information and transmission rates does not meet the expectations of customers and developers of data transmission systems (DTS).

Method [1] differs from other analogs, for example, [2] and [3] by the possibility of the simplest technical implementation of non-redundant noise-immune coding, due to which it turns out to be the most preferable for the transmission of high-speed information due to high requirements related to the efficiency of the implementation of structural-algorithmic transformations (SAP-i), first of all, PSAP-i, since reverse SAP-i (OSAP-i) can be implemented not in real, but in delayed time, for example, when organizing data processing, including when implementing methods primary data processing ([5], patent RU No. 2658795 "Method of primary information processing with detection and correction of transmission errors", priority from 05/30/2017 and [6], patent RU No. 2672392 "Method of primary information processing using adaptive nonlinear filtering measurement data ", priority from 27.06.2017).

The method [1], selected as a prototype, consists in the fact that on the transmitting side, signals from message sources are collected, converted into a binary code, and synchronized with the formed measurement words presentedN - bit binary code, and form from them a compressed digital baseband signal to be transmitted over communication channels, and the received sequence of transmitted binary code symbols is received on the receiving side. This method differs from its closest analogs [2] and [3] in that on the transmitting side the code structures formed at the first stage of encoding measurement words or messages with a traditional positional binary code (PSAP-1 (E)) are divided into half words with an equal number of binary digits or into other parts that have a different number of digits when they are represented by a binary code, which are then rearranged in places while maintaining the same bit representation of measurement words or messages, but with their new values \ u200b \ u200bthe formed measurement words or messages are placed in compressed baseband signal in a certain sequence with respect to the synchronization signals, the thus generated compressed baseband signal is subjected to subsequent modulation and transmission, and on the receiving side the received sequence of transmitted binary code symbols is received, a reconstructed sequence of measurement words or messages is formed, parallel their decoding using "hard" (UOSAP-1 (E)), and "soft" (CHOSAP-1 (E)) decoders, while as a result of the "soft" decoding operation, graphic fragments encoded on the basis of permutation of components or code segments of the initial values of telemetry parameters, enclosed between adjacent maximum values of absolute differencesΔC _j ^{(1 (E))} = |C _j - C _{( j +1} | ≥ 0.8 × 2 ^N andΔC _{( j + s )} ^{(1 (E))} = |C _{( j + s )} - C _{( j + s ) +1} | ≥ 0.8 × 2 ^N ) equal to or greater than 0.8 × 2 ^N whereC _j -the result of additional non-redundant error-correcting codingj -Togo according to the accepted order of counting of a measurement word or messageX _j ;FROM _{j M} = | C _j - C _{j +1} |and ΔC _{( j + s )} ^{(1 (E))} = | C _{( j + s )} - C _{( j + s ) +1} | -adjacent maximum values of absolute differences between the results of additional non-redundant error-correcting coding of measurement words or messagesC _j ,C _{j +1} ,defining the beginning of the graphic fragment, andC _{( j + s )} , C _{( j + s ) +1} defining the end of the graphic fragment, which includess samples encoded on the basis of permutation of constituent parts of the values of telemetry parameters, andN - the number of digits that are used to represent measurement words or messagesX _j ensure the detection and correction of errors in the transmission of the values of telemetry parameters based on the "group properties of equi-sufficiency", which must be constant in the absence of errors in the transmission of information in the selected graphic fragments of the telemetry parameter, converted with additional noise-immune coding on the transmitting side, and as a result of the operation decoding, restore the original telemeasurement results without correcting errors by inverse permutation of the components, the bit width of which is known on the receiving side, perform smoothing or filtering of the data recovered as a result of "hard" decoding, and in relation to the calculated neighboring telemeasurements values determine their differences, which, when performing operations "Soft" decoding, taking into account the allowed positions for the values of the received non-redundant error-correcting code, are used as tolerances when choosing the most suitable, conditional values of the recovered telemetry data, determined in accordance with the accepted reliability criterion, repeat "hard" decoding of telemeasurement data corrected as a result of "soft" decoding operations, smoothed or filtered data obtained during the first "hard" decoding operation are compared with synchronous, coinciding by the polling time, by the values obtained as a result of the second operation of "hard" decoding, the comparison results are used to evaluate the achieved technical effect in the form of estimates of the increase in the reliability of the received information, as well as to compare the results obtained and adjust the smoothing or filtering values of telemetry data obtained at the first "hard" decoding, their proximity to other allowed positions of the noise-immune code formed as a result of structural and algorithmic transformations of the values of the telemetry parameter on the the traveling side, as a result of which they implement advanced capabilities used to control the reliability of the obtained telemetry results and information support for decision-making.

The initial representation of the message value X _j , expressed using the residual images b _{1 j} , b _{3 j} , is determined by the following system of equations:

X _j = m _one l _one + b _{one j}

X _j = m ₃ l ₃ + b _{3 j} , (1)

Wherem _one =2 ⁿ -one andm ₃ =2 ⁿ +one-optimal comparison modules;

l ₁ , l ₃ - incomplete quotients obtained from division of X _j by divisors (modules of comparisons m ₁ and m ₃ ).

When passing to the system of comparisons, which is equivalent to representation (1):

X _j ≡ b _{one j} (mod m _one )

X _j ≡ b _{3 j} (mod m ₃ ) (2)

we obtain a condensed mathematical form of representation of the message value X _j . It is compressed because in the system of comparisons (2) there are no values of incomplete quotients l ₁ and l ₃ .

From the presentation of the result of additional coding in the following two versions:

C _j ^(one) = <<b _{one j} > ₂ , <b _{3 j} > ₂ > ₂ ,(3)

C _j ^(one)* = <<b _{3 j} > ₂ , <b _{one j} > ₂ > ₂ ,(4)

it also follows that in addition to the values of incomplete quotientsl _one andl ₃ the values of the comparison modules are not transmitted to the communication channelm _one andm ₃ -they are part of the key data that the parties exchange with each other before starting work.

When comparing views of the valueX _j using the system of equations (1) and the system of comparisons (2), it follows that in the results of additional coding there is an implicit effect of syntactic data compression. Incomplete privatel _one andl ₃ ... with an appropriate choice of comparison modulesm _one andm ₃ , can be reconstructed on the receiving side based on the received residual imagesb _{one j} , b _{3 j} using algorithms of remainder theorems known aschinese remainder theorem (KITO) [10] orconstructive remainder theorem (CTTO) used in the patent [3]). Therefore, they are not transmitted, although they represent, in addition to images-remnantsb _{one j} , b _{3 j} , a piece of information about the value of the transmitted messageX _j (one). This is the fundamental theoretical provisions of data compression and increasing their noise immunity in the case of non-traditional representation of data by remnant images.

In the patent [1], selected as a prototype, a different additional coding algorithm is used, which is equivalent to the basic theoretical representation of the message value X _{j by} images-residues b _{1 j} , b _{3 j} . in terms of improving the performance of information transmission noise immunity, but differs in ease of implementation.

Its essence in a simplified version for interpretation lies in the fact that in the original code 2 n -bit binary word X _j the senior ( a _{st j} ) and the lowest ( a _{ml j} ) half-words are distinguished:

X _j = <<u _{st j> 2, <ml} and _{j> 2> 2} (5)

which are then rearranged with the formation of an additionally encoded message С _j ^{(1 (E))} :

FROM _j ^{(1 (E))} = <<a _{ml j} > ₂ , <a _{st j} > ₂ > ₂ ,(6)

With such a representation, it becomes necessary to use the comparison module m ₂ = 2 ⁿ . If the number ( N ) of digits required to represent the values of the monitored parameter is odd, equal, for example, N = 9, then the following representation has the greatest preference: a _{ml j with} five digits, and _{st j} with four digits. Other options for dividing the original codeword W into code segments a _{ml j} and a _{st j} are also possible . Their complete set for the case of a 10-bit source codeword W is determined by Table 1. The choice of the most suitable option from the source table, for example, Table 1, is determined by the need to comply with the requirements that are specified for this TMS. As requirements, the options for the formation of external structures for presenting data S _ext .

Also, algorithms for representation (5) and additional coding (6) are used on the receiving side, after decoding, which consists in primary processing of the received information with detection and correction of transmission errors ([5], Method of primary information processing with detection and correction of transmission errors, patent RU No. 2658795, priority dated May 30, 2017). In this case, the operation of comparing the numbers obtained during processing by the comparison modules ( m ₂ ), determined from the series of numbers 2 ⁿ : m ₂ = 2 ^{n, is used} .

The next feature to be used in the fission source codeword code segments _<ml and _j> and ₂ <u _{st j> 2} is to provide the required detection index (t _o) and error correction (t _s) when receiving information. It is known from the theory of error-correcting coding ([7], Bleihut R. Theory and practice of error control codes. - M .: Mir, 1986. - 576p.) That the correcting ability is determined by the value of the minimum code distance d _min and the satisfaction of the following inequality:

d _min ≥ 2 t _and +1 (7)

Table 1 - Table of the dependence of the minimum code distance d _min on the combination of permutation of half-words ( a _{st j} and a _{ml j} ), where the least significant code

segmentsa _{ml j} of different bit depths from 1 (No. 1) to degenerate value 10 (No. 10) are shown in red, and the senior code segmentsa _{st j} - green, while the case under No. 10 is degenerate, since undera _{ml j} all 10 bits of the source codeword

Also in accordance with the properties of the low halfword binary _<ml and _{j> 2} is an image-residue <b _{2 j> 2,} obtained by dividing X _j for comparison module m ₂ = 2 ^n. This allows the use of lower half-word <a _{ml j> 2} for further processing and control recoverable reliability information at its reception, including, and when used structurally algorithmic transformation of the first phase (SAP-1), wherein the base further encoding constitute residual images b _{1 j} , b _{2 j} and b _{3 j .} Thus, the additional coding of the message С _j ^{(1 (E))} is equivalent to SAP-1 and is denoted as SAP-1 (E).

However, in accordance with the theory of system analysis, when replacing SAP-1 operations with SAP-1 (E) operations, it is necessary to sacrifice some other additional capabilities of SAP-1, related, for example, to information reliability control.

Therefore, in the future, when presenting the essence of the invention, we will use these two types of structural and algorithmic transformations SAP-1 and SAP-1 (E) as initial ones.

In the future, to clarify the sequence of the main operations of the proposed method, it is necessary to select the type of existing BRTS in which the proposed method should be implemented. As an example, we will choose the onboard equipment (BA) "ORBITA-IVMO" [4]. In accordance with the ORBITA-IVMO BA operation manual, the following channel types are used for transmission, selection during reception and recording of analog, temperature and rapidly changing parameters (BMP), presented in Table 2.

From Table 2, it can be concluded that the main problem of telemetry data transmission, in combined telemetry systems (TMS), is represented by a digital code. The concept of "combined TMS" appeared in connection with the need for simultaneous digital transmission of both slowly varying parameters (MMP) and rapidly changing parameters (BMP) [4].

Table 2 - Types of channels of BA "ORBITA-IVMO", channel designations and numbers of bits of the binary code in the telemetry word occupied by the channel

Characteristic of the input monitored parameter (channel) Accepted designation Type (T) input word Number of words per channel Number of bits in the channel Channel number in the word "P" and the numbers of the bits of the binary code in the telemetry word occupied by the channels Analog, continuous, on a scale of 0-6.2 V
(analog) ANP T01 one 9 (8) 01 (from 2nd to 10th) - 9 bits of binary code Analog, continuous, on a scale of 0-6.2 mV
(temperature) TMP T01 one ten 01 (2nd to 11th) - 10 bits of binary code Analog, broadband
(fast changing) BMP T21 one 8 01 (2nd to 9th) T22 2 6 01 (from 2 to 6) - the first channel of the BMP
02 (7,8,9,11,12,1 categories) - second channel of BMP T23 3 4 01 (2,3,4,1) - the first channel of the BMP
02 (8,9,11,10) - second channel of BMP
03 (5,6,7,12) - the third channel of the BMP

Therefore, without the compression of telemetry data, the problem of transition to telemetry systems (TMS) with primary signs of adaptation to permitted data presentation structures (S _external ) and to changing conditions of telemetry cannot be solved.

Most clearly the proposed data compression process with the proposed error-correcting coding can be demonstrated by the example of using the SAP-1 (E) algorithms, the essence of which is determined by the representations of the analytical representations (5) and (6). To do this, in a 2 n- bit binary word X _j , the senior ( a _{st j} ) and the lowest ( a _{ml j} ) half-words are distinguished:

X _j = <<u _{st j> 2, <ml} and _{j> 2> 2} (5 ^/)

which, to implement the operations of detecting and correcting telemetry errors during reception, must be rearranged in places with the formation of an additionally encoded message C _j ^{(1 (E))} :

FROM _j ^{(1 (E))} = <<a _{ml j} > ₂ , <a _{st j} > ₂ > ₂ ,(6^/)

With this representation, when restoring, it becomes necessary to use the comparison module m ₂ = 2 ⁿ .

, где ΔT _j - временной интервал между соседними отсчётами (1). В данном изобретении старшие полуслова <а _{ст j} > ₂ и младшие полуслова <а _{мл j} > ₂ разных слов ТМП объединяют в искусственно образованное слово W_и прежней разрядности. При этом младшие полуслова <а _{мл j} > ₂ объединяются в одном искусственно образованном слове W_{и мл} , имеющем в соответствии с заданной исходной внешней структурой (S_внеш) требуемое 12-тиразрядное представление слов W двоичным кодом. Частота его передачи будет определяться требованиями, предъявляемыми к формированию внешней структуры (S_внеш), и равна значению частоты опроса f _оп контролируемого параметра или соответствующего типа группы данных телеизмерений. Второе искусственно образованное слово W_{и ст} будет состоять из старших полуслов <а _{ст j} > ₂ . Оно будет передаваться в канал связи с меньшей частотой опроса (f _опУ ), значение которой будет соответствовать реальной динамике его изменения.The essence of the subsequent operation of transferring measurement words is that under conditions of natural redundancy, which is inherent in telemetry data, the dynamics of change in the values of the least significant half-word <a _{ml j} > ₂ significantly higher compared to the corresponding indicator, which is observed in the upper half-word <a _{st j} > ₂ ... And this is one of the most effective approaches to finding methods of solving the problem formulated above that are acceptable for existing practice. However, in the existing practice of telemetry, when a whole telemeasurement word is transmitted, the polling frequency of the senior <a _{st j} > ₂ and the least significant word <a _{ml j} > ₂ coincide and are equal to the selected sampling rate of the monitored parameter values:f _{def j} =

whereΔT _j - time interval between adjacent samples (1). In this invention, the major half-words <a _{st j} > ₂ and lower halfwords <a _{ml j} > ₂ different words TMP are combined into an artificially formed word W_and old bit depth. Moreover, the least significant half-words <a _{ml j} > ₂ are combined in one artificially formed word W_{and ml} having, in accordance with the given initial external structure (S_out) the required 12-bit binary representation of the words W. The frequency of its transmission will be determined by the requirements for the formation of the external structure (S_out), and is equal to the value of the sampling ratef _op monitored parameter or the corresponding type of telemetry data group. The second artificially formed word W_{and st} will consist of major half-words <a _{st j} > ₂ ... It will be transmitted to the communication channel with a lower sampling rate (f _opu ), the value of which will correspond to the real dynamics of its change.

The proposed distribution of the transmission frequencies of artificially formed words W _{and st} and W _{and ml of the} previous digit capacity for BRTS "ORBITA-IVMO" is shown in Table 3.

As a result of this transformation, the placement of compressed MMF values in the standard frame of the ORBIT IV MO BRTS should be reduced to one of the options that meets the requirements for the formation of the external structure (S _ext ).

Table 3 - Proposed allocation of transmission frequencies

artificially formed words W _{and st} and W _{and ml of the} previous word length for BRTS "ORBITA-IVMO"

N / a Frequency
polling (W) of the original group of parameters, Hz Polling rate (W _{and st} )
senior half-words,
Hz Polling rate (W _{and ml} )
minor words,
Hz one 4 one 4 2 8 one 8 3 16 2 16 4 32 4 32 5 64 8 64 6 128 16 128 7 256 32 256 8 512 64 512

In this case, all service information remains unchanged.

In one of the simplest versions of data compression, instead of one of the allowed 12-bit source words (W), of which 10 information bits, it is proposed to transmit:

- two compressed analog parameter (hereinafter - ANPM), each of which contains the 5-tirazryadnymi half words younger _(<ml and _{j> 2);}

- two compressed or temperature parameter (hereinafter - TMPM), each of which also contains the lower-order 5-tirazryadnymi half words _(<ml and _{j> 2).}

When played back from a memory device, the words TMPM T11P02 and ANPM T11P02 lose their least significant bit and become five-digit, before the reverse transformation, it is necessary to supplement the words with the sixth (least significant) digit with the value "0".

Table 5 shows the proposed scheme for the redistribution of the bits required for the transmission of the higher ( a _{st j} ) and lower ( a _{ml j} ) code segments of the original codeword (W).

Table 5 - Table of bit redistribution required for the transmission of the higher ( a _{st j} ) and lower ( a _{ml j} ) code segments of the original codeword (W)

Input signal characteristic Designation Input type (T) number number Channel number in the word, "P" (bit numbers in (channel) the words channels in a word bits per channel word occupied by the channel) Analog, continuous, on a scale of 0-6.2 V
(analog) ANP T01 one 9 (8) 01 (from 2nd to 10th in the existing version, 9th bit - "bit parity") ANPM T11 2 5 01 (2nd to 6th)
02 (7th to 11th) Analog, continuous, on a scale of 0-6.2 mV
(temperature) TMP T01 one ten 01 (2nd to 11th) Tmpm T31 2 5 01 (2nd to 6th)
02 (7th to 11th)

Table 6 shows the transmitted service information in the corresponding bits of the formed words (W _{and ml} ) and (W _{and st} ).

Table 6 - The presence of service information markers in the corresponding bits of the formed words (W _{and ml} ) and (W _{and st} )

Discharge The presence of service information markers one All service information (SAL), except for the marker (MCH), is present in the first bit of the first word of each phrase. 2 absent 3 absent 4 absent 5 absent 6 absent 7 absent 8 absent nine absent ten absent eleven In the words reproduced from the memory device, for any type of channels, there are bits of the reproduction service information that have the designation "SLZHVI" 12 Frequency marker (MF) - is present in every word. MCH is equal to "1" with an even number of "1" in the word from 2 to 11 digits. It is not transmitted in rapidly changing parameters (BMP) and words written to the memory device.

Also taken into account in the proposed method and other specific features of the transfer of compressed volumes of information. They are as follows:

1) if the periods of polling of the upper and lower half-words coincide, the upper half-word is transmitted as part of the frame;

2) the least significant half-word, immediately following the older one, is formed simultaneously with it.

The essential characteristics of the proposed method also consist in the possibility of taking into account other proposals for the modernization of existing BRTS.

Its use in BRTS "ORBITA-IVMO", with the system's information content unchanged, makes it possible to increase the efficiency of information and telemetry support for testing aircraft, which manifests itself in the following new capabilities:

- doubling the number of transmitted analog and temperature parameters;

- in the simultaneous transmission in a telemetric frame, if necessary, of both "compressed" and not "compressed" telemetry data, while ensuring the required indicators of the system's adaptability to customer requirements;

- in providing an additional possibility of detecting and correcting errors in the transmission of telemeasurement results during reception, as well as during primary data processing [5,6].

The developed method of transformation and noise-immune transmission of compressed data has no fundamental features, both when they are represented by images-residues, and when using equivalent SAP (SAP-1 (E)). It is applicable when focusing on any information content of the "ORBITA-IVMO" BA, which have designations from "M01" to "M16".

To recover information on the receiving side and when using methods of primary processing of telemetry data [5,6], two algorithms for decoding the values of code words (W) are used, which are called “hard” and “soft” [1-3,5,6]. Moreover, the "hard" decoding algorithm is universal. Its use ensures the restoration of the transmitted information even in the absence of correlation properties of the transmitted neighboring values of the message source. However, this does not provide the ability to detect and correct data transmission errors. The algorithm of "soft" decoding is private and its use begins after the results of the previous mode of "hard" decoding have established the presence of a correlation relationship for more than three consecutive values of telemetry data. For TMI, which is characterized by the presence of large internal redundancy, this condition is usually met.

It is also necessary to take into account the following features of the application of the two noted recovery modes for transferred data. The algorithm of "soft" decoding remains unchanged regardless of the used method of compression of telemetry data: based on SAP-1 when presenting telemetry data with residual images and using the equivalent SAP-1 (E). The difference appears only in setting the value of the minimum code distance d _min .

The algorithms used for this "hard" decoding of telemetry data are different. It is the simplest when using the SAP-1 (E) mode. In this case, to perform the "hard" data decoding operation, it is necessary to return the senior ( a _{st j} ) and low ( a _{ml j} ) code segments to their original places in the positional code word (W), which are rearranged on the transmitting side during additional coding. When using unconventional representation of the values of codewords (W) by residual images for data compression, when implementing the mode of "hard" decoding of telemeasurement results, it is necessary to use the adaptive algorithm of the constructive residual theorem (CTTO) [1-3,5,6,8]. It is also presented in the claims: "Method for determining the distance to an object with a source of radiation of signals with different frequencies", patent RU No. 2607639, publ. 07/27/2016, bul. No. 21 (14) [9].

The adaptability of this algorithm is determined by the divisibility conditions of the type n / Δ and n / ( km _i ± Δ ), which determine: 1) the choice of the required link in the parallel algorithm for recovering the original data based on CTTO; 2) the possibility of simplifying the recovery algorithm by appropriately choosing the comparison modules m ₁ and m ₂ (for n = 1, the recovery algorithm is limited to only two links of the CTTO, with n = 2 and with a subsequent sequential increase in the absolute difference between the comparison modules, the number of formula links increases by one) ...

(8)

(8)

и n/Δ - читаются, как Δ не делится на n без остатка и Δ делится на n без остатка, соответственно. Обозначение n/(km _i ± Δ) означает, что (km _i ± Δ) делится на n без остатка.Wherem _i - comparison modules,b _i - images-remnants,n = | m _one - m ₂ | - absolute difference between comparison modules,Δ = (b _one - b ₂ ) is the difference between the residuals, at which the first is the remainder by the lower modulus of comparison fromm _i (i = 1,2), notation

andn/Δ - read likeΔ not divisible byn without a remainder andΔ divided byn without a remainder, respectively. Designationn/ (km _i ± Δ) means that (km _i ± Δ) divided byn without a remainder.

The above description allows you to go to the description of the claims.

1. The method of transmitting telemetric information, which consists in the fact that the transmitting side collects signals from the sources of messages, converts them into a binary code, provides the synchronization of the generated source codewords (W) presentedN - a bit binary code, divided into half-words with an equal number of binary digits or into other parts having a different number of digits when represented by a binary code, which are then rearranged with preservation of the previous bit representation of measurement words or messages, but with obtaining their new values, and form from them a compressed digital baseband signal to be transmitted over communication channels, and on the receiving side receive the received sequence of transmitted symbols of the binary code, characterized in that on the transmitting side the code structures formed at the first stage of encoding the codewords (W) and contained in the results of telemeasurements with the traditional positional binary code (PSAP-1 (E)), thus formed artificial replacement code words (W_{and ml j} ), composed only of lower code segments (a _{ml j} ) and replacement codewords (W_{and st j} ), composed only of high-order code segments (a _{st j} ) or messages are placed in the compressed group signal in the sequence in relation to the synchronization signals and other service information that is received in the on-board telemetry system (BRTS) to be upgraded, the compressed group signal thus generated is subjected to subsequent modulation and transmission, and the receiving side receive the received sequence of transmitted symbols of the binary code, form a recovered sequence of replacement codewords (W_{and ml j} ) and (W_{and st j} ), from which the values of the least significant code segments (a _{ml j} ) telemetry data with a sampling frequency of the original MMF (f _op ), as well as high-order code segments (a _{st j} ) transmitted with a reduced sampling rate (f _op | k), corresponding to the assumed dynamics of changing their values, while at the moments of time corresponding to the reception of the senior and the following low-order code segments, the reference coded telemeasurement words (C _{j op} ):C _{j op} = <a _{ml j} , a _{st j} > ₂, and then to the received and allocated low-order code segments (a _{ml j} ) of telemetry data enclosed between the values (C _{j op} ), add the highlighted high code segments preceding them (a _{st j} ) with the formation of encoded telemetry data recovered on the basis of the inverse compression operation (C _j ), then their parallel decoding is carried out using "hard" and "soft" decoders, while as a result of the "soft" decoding operation, graphic fragments of the recovered encoded telemetry data (C _j ), which are enclosed between the adjacent maximum values of the absolute differencesΔC _j ^{(1 (E))} = |C _j - C _{( j +1} | ≥ 0.8 × 2 ^N andΔC _{( j + s )} ^{(1 (E))} = |C _{( j + s )} - C _{( j + s ) +1} | ≥ 0.8 × 2 ^N ) equal to or greater than 0.8 × 2 ^N whereC _j -the result of additional non-redundant error-correcting codingj -Togo according to the accepted order of counting the word-measurement or messageX _j ;FROM _{j M} = | C _j - C _{j +1} |and ΔC _{( j + s )} ^{(1 (E))} = | C _{( j + s )} - C _{( j + s ) +1} | -adjacent maximum values of absolute differences between the recovered encoded telemetry resultsC _j ,C _{j +1} , resulting in determine the beginning and end of the graphic fragment, which includess samples coded with a non-redundant error-correcting code, andN - the number of digits that are used for the initial presentation of telemetry resultsX _j , then provide the detection and correction of errors in the transmission of telemetry values based on the "group properties of equi-sufficiency", which must be constant in the absence of errors in the transmission of information in the selected graphic fragments represented by encoded telemetry resultsC _j , as a result of "hard" decoding of the data, the initial results of telemeasurements are restoredX _j with error correction of transmission, which is performed taking into account the allowed positions for the values of the received non-redundant error-correcting code, after which one proceeds to the operations of smoothing or filtering the recovered telemetry data in their original representationX _j , as a result, new possibilities of compressed error-correcting coding of transmitted telemetry information are realized.

2. The method according to claim 1, characterized in that when the information is received, "hard" decoding of the incoming and recovered data is performed, for which the initial conditions are set in the form of the used method for representing the internal structure (S_int) of the received data, which are, for example, structural and algorithmic transformations of SAP-1, which is based on the representation of messages using residual imagesb _{one j} (mod 2 ⁿ - 1) andb _{3 j} (mod 2 ⁿ + 1), the code constructions of which are combined when transmitting data into a new additionally encoded messageC _j ^(one) : FROM _j ^(one) = <b _{one j} ,b _{3 j} >₂, as well as SAP-1 (E), additional coding in which is the separation of the original code words of the messageX _j senior (a _{st j} ) and minor (a _{ml j} ) half-word:X _j = <a _{st j} ,a _{ml j} > ₂ with the subsequent rearrangement of their placesC _j ^{(1 (E))} = <a _{ml j} ,a _{st j} > ₂messages encoded in this way, as a result of their transmission through communication channels with interference, take the form:FROM _j ^(one)* =FROM _j ^(one) + ε _j ^(one) = <b _{one j} + εb _{one j} ,b _{3 j} + εb _{3 j} >₂,C _j ^{(1 (E)) *} =FROM _j ^{(1 (E))} + ε _j ^{(1 (E))} = <a _{ml j} + εа _{ml j} ,a _{st j} + εа _st > ₂, where the sign "ε " - characterizes the error that appears as a result of interference, implements the universal operation of "hard" decoding without correcting transmission errors based on the algorithm of the constructive remainder theorem, in the first case, and due to the inverse permutation of the selected code segments <a _{ml j} ^* > ₂ =<a _{ml j} + εа _{ml j} > ₂ and <a _{st j} ^* > ₂ =<a _{st j} + εа _{st j} > ₂ with the formation of the structure of the original message:X _j ^* = <a _{st j} ^* ,a _{ml j} ^* > ₂restored with an errorεХ _j ,the obtained results of the analysis of the correlation dependence of the neighboring reconstructed valuesX _{j - s} ^* ,, X _{j -one} ^* , X _j ^* , X _{j +1} ^* ,, X _{j + s} ^* , are used to determine the sequence of data in the reproduced information stream, which have local properties of the correlation dependence between adjacent message valuesX _{j - s} ^* ,, X _{j -one} ^* , X _j ^* , X _{j +1} ^* ,, X _{j + s} ^* and in the presence of more than three consecutive recovered messages for which the absoluteΔC _{j - s} ^* = |FROM _{j - s} ^* - FROM _{j - s +1} ^* |, ...,ΔC _{j -one} ^* = |FROM _{j -one} ^* - FROM _j ^* |, ΔС _j ^* = |FROM _j ^* - FROM _{j +1} ^* |, ΔХ _{j +1} ^* = |X _{j +1} ^* - X _{j +2} ^* |,..., ΔХ _{j + ( s -one)} ^* = |X _{j + ( s -one)} ^* - X _{j + s} ^* | equal to the valueskd_minwherek =1, 2, 3 ... are integers or numbers close to them, and d_min= |FROM _j ^* - FROM _{j +1} ^* |- set for SAP-1 and SAP-1 (E) equivalent minimum code distance between adjacent values, for example, betweenFROM _j ^* andFROM _{j +1} ^* use a soft decoding algorithm to detect and correct errors.

3. The method according to claim 1, characterized in that when implementing the "soft" decoding algorithm, the difference of which when using SAP-1 and its equivalent version of SAP-1 (E) consists only in the used value of the minimum code distance d_min: in the first case d_min= 2 ⁿ +1, and in the second - d_min= 2 ⁿ wheren =N/ 2, andN - bit representation of original messagesX _j . by binary code, are found based on the fulfillment of the following inequality:ΔC _{s -one} ^* = |FROM _{s -one} ^* - FROM _s ^* | <0.8 × 2 ^N andΔC _s ^* = |FROM _s ^* - FROM _{s +1} ^* | <0.8 × 2 ^N , neighboring (s -1) and (s) breaks for encoded valuesFROM _j , defining the boundaries within which the group property of equi-sufficiency is fulfilled, which is associated with the fact that any of the valuesFROM _j , received without errors, when divided by the minimum code distance d_min will give the same remainder ζ, then for the general case, oriented to the presence of transmission errors, a histogram of the distribution of their values is plotted, statistical sample consisting of residuals ζ^*containing errorsεζ: ζ^* = ζ +εζ, the most common value is the mode of the Mo histogram (ζ^*), while all other values of the residuals that do not coincide with the value of the found invariant in the form of the mode value of the histogram Mo (ζ^*), which is a technical standard of the transmitted information, is used to detect transmission errors, which are corrected by substituting data insteadFROM _j ^(and) , the reliability of which is confirmed by the fact that when divided by the minimum code distance d_min give the value of the remainder ζ ^(and) , equal to the invariant in the form of the found value of the Mo (ζ^*), after detecting and correcting errors during reproduction of the converted information, the second stage of "hard" decoding of messages is implementedFROM _j ^(and) , recovered and corrected during playback, after which the recovered corrected messages are received in their original formX _j ^(and) which are used as an updated copy of the information with a reduced number of errors.

FIG. 1 shows the model of the telemetry frame structure. Suppose that the telemetry parameters (TMP) presented in the frame areX _one ,X ₂ ,X ₃ , ...X _k , in accordance with the theorem of V.A. Kotelnikov on the sampling of the process, should be interrogated with a frequencyf _op = 128Hz (Fig. 1 (A)). When implementing the proposed method with such a frequency, only artificially formed TMFs consisting of junior (a _ml3 anda _ml1 ) half-words of the two original TMP, for example, the third and the first:X _31ml = <a _ml3 , a _ml1 > ₂... At the same time, another artificially formed word for telemetry:X _13st = <a _st1 , a _st3 > ₂, composed of their most significant half-words of the first and third initial TMP, will be interrogated with a reduced frequency, for example,f _op ^st = 16 Hz (Fig. 1 (B)). Such a difference will be determined by the fact that the dynamics of changes in the values of the upper half-words of the MMP will be significantly less than the same indicator for their lower half-words (in our case, by 8 times). As a result of such a redistribution of polling frequencies, it becomes possible to transmit a larger amount of telemetry data. In this case, it is not required to make structural changes to the structure of the formation of telemetry data, called (S_out). However, in this case, an internal structure of telemetry data appears (S_int). The need for its appearance is also dictated by the issues of ensuring the protection of the transmitted TMI from unauthorized access (NSD). All existing information security systems assume only the protection of semantic content with an open and known (S_out), which is their main disadvantage. In the proposed invention, the internal structure of telemetry data (S_int) is formed during transmission on the basis of additional key information, as a result, its additional protection from tampering is provided.

The proposed method is distinguished by the lowest costs that are necessary for the implementation of innovative information technologies for telemetry. This effect is associated with the possibility of upgrading existing BRTS, which have many disadvantages, without modifying its hardware and firmware. Only the structure of the representation of the original codewords is changed by replacing them with artificially generated equivalents that have unchanged representation width ( N ) and selected values of the polling frequencies ( f _{op i} ) of telemetry data.

Literature sources

1. Method of transferring information, patent RU No. 2609747, priority from 13.08.2017

2. A method of transferring information and a system for its implementation, patent RU No. 2586833, priority 15.08.2015

3. Method of information transmission and the system for its implementation, patent RU No. 2586605, priority from 22.03.2013

4. Modern telemetry in theory and practice / Training course ", St. Petersburg: Science and Technology, 2007. - 672s, p. 465).

5. Method of primary processing of information with detection and correction of transmission errors, patent RU No. 2658795, priority dated May 30, 2017

6. A method of primary information processing using adaptive nonlinear filtering of measurement data, patent RU No. 2672392, priority dated 06/27/2017).

7. Bleihut R. Theory and practice of error control codes. - M .: Mir, 1986 .-- 576p.

8. Kukushkin S.S. Finite field theory and informatics: In 2v. - v.1: Methods and algorithms, classical and non-traditional, based on the use of the constructive remainder theorem. - M .: MO RF, 2003 .-- 284p.

9. A method for determining the distance to an object with a source of radiation signals with different frequencies, patent RU No. 2607639, publ. July 27, 2016, bul. No. 21.

Claims (3)

1. The method of transmitting telemetric information, which consists in the fact that the transmitting side collects signals from the sources of messages, converts them into a binary code, provides the synchronization of the generated source codewords (W) presentedN-bit binary code, divided into half-words with an equal number of binary digits or into other parts that have a different number of digits when represented by a binary code, which are then rearranged in places while maintaining the same bit representation of measurement words or messages, but with obtaining their new values, and form from them a compressed digital baseband signal to be transmitted over communication channels, and on the receiving side receive the received sequence of transmitted symbols of the binary code, characterized in that on the transmitting side the code structures formed at the first stage of encoding the codewords (W) and contained in the results of telemeasurements with the traditional positional binary code (PSAP-1 (E)), thus generated artificial replacement code words (W_{and ml j} ), composed only of lower code segments (a _{ml j} ) and replacement codewords (W_{and st j} ), composed only of high-order code segments (a _{st j} ), or the messages are placed in the compressed group signal in the sequence in relation to the synchronization signals and other service information that is received in the on-board telemetry system (BRTS) to be upgraded, the compressed group signal formed in this way is subjected to subsequent modulation and transmission, and on the receiving side receive the received sequence of transmitted symbols of the binary code, form a recovered sequence of replacement codewords (W_{and ml j} ) and (W_{and st j} ), from which the values of the least significant code segments (a _{ml j} ) telemetry data with a sampling frequency of the original MMF (f _op ), as well as high-order code segments (a _{st j} ) transmitted with a reduced sampling rate (f _op | k(C _{j op} ):C _{j op} = <a _{ml j} , a _{st j} > ₂, and then to the received and allocated low-order code segments (a _{ml j} ) of telemetry data enclosed between the values (C _{j op} ), add the highlighted high code segments preceding them (a _{st j} ) with the formation of encoded telemetry data recovered on the basis of the inverse compression operation (C _j ), then their parallel decoding is carried out using "hard" and "soft" decoders, while as a result of the "soft" decoding operation, graphic fragments of the recovered encoded telemetry data (C _j ), which are enclosed between neighboring maximum values of absolute differences ΔFROM _j ^{(1 (E))} = |C _j - C _{( j +1} | ≥ 0.8 × 2 ^N , and ΔFROM _{( j + s )} ^{(1 (E))} = |C _{( j + s )} - C _{( j + s ) +1} | ≥ 0.8 × 2 ^N ) equal to or greater than 0.8 × 2 ^N whereC _j - the result of additional non-redundant error-correcting codingjth according to the accepted order of counting the word-measurement or messageX _j ;FROM _{j M} =| C _j - C _{j +1} | and ΔFROM _{( j + s )} ^{(1 (E))} =| C _{( j + s )} - C _{( j + s ) +1} | - adjacent maximum values of absolute differences between the recovered encoded telemetry resultsC _j ,C _{j +1} , resulting in determine the beginning and end of the graphic fragment, which includess samples coded with a non-redundant error-correcting code, andN - the number of digits that are used for the initial presentation of telemetry resultsX _j , then provide the detection and correction of errors in the transmission of telemetry values based on the "group properties of equi-sufficiency", which must be constant in the absence of errors in the transmission of information in the selected graphic fragments represented by encoded telemetry resultsC _j , as a result of "hard" decoding of the data, the initial results of telemeasurements are restoredX _j with error correction transmission, which is performed taking into account the allowed positions for the values of the received non-redundant error-correcting code, after which they proceed to smoothing or filtering the recovered telemetry data in their original representationX _j , as a result of which new possibilities of compressed error-correcting coding of transmitted telemetry information are realized. 2. The method according to claim 1, characterized in that when the information is received, "hard" decoding of the incoming and recovered data is performed, for which the initial conditions are set in the form of the used method for representing the internal structure (S_int) of the received data, which are, for example, structural and algorithmic transformations of SAP-1, which is based on the representation of messages using residual imagesb _{one j} (mod 2 ⁿ - 1) andb _{3 j} (mod 2 ⁿ + 1), the code constructions of which are combined when transmitting data into a new additionally encoded messageC _j ^(one) : FROM _j ^(one) = <b _{one j} ,b _{3 j} >₂, as well as SAP-1 (E), additional coding, which consists in the separation of the original code words of the messageX _j senior (a _{st j} ) and minor (a _{ml j} ) half-word:X _j = <a _{st j} ,a _{ml j} > ₂ with the subsequent rearrangement of their placesC _j ^{(1 (E))} = <a _{ml j} ,a _{st j} > ₂messages encoded in this way, as a result of their transmission through communication channels with interference, take the form:FROM _j ^(one)* =FROM _j ^(one) + ε _j ^(one) = <b _{one j} + εb _{one j} ,b _{3 j} + εb _{3 j} >₂,C _j ^{(1 (E)) *} =FROM _j ^{(1 (E))} + ε _j ^{(1 (E))} = <a _{ml j} + εа _{ml j} ,a _{st j} + εа _st > ₂, where the sign "ε " - characterizes the error that appears as a result of interference, implements the universal operation of "hard" decoding without correcting transmission errors based on the algorithm of the constructive remainder theorem, in the first case, and due to the inverse permutation of the selected code segments <a _{ml j} ^* > ₂ =<a _{ml j} + εа _{ml j} > ₂ and <a _{st j} ^* > ₂ =<a _{st j} + εа _{st j} > ₂ with the formation of the structure of the original message:X _j ^* = <a _{st j} ^* ,a _{ml j} ^* > ₂restored with an errorεХ _j , the results of the analysis of the correlation dependence of the neighboring reconstructed valuesX _{j - s} ^* , ..., X _{j -one} ^* , X _j ^* , X _{j +1} ^* , ..., X _{j + s} ^* , are used to determine the sequence of data in the reproduced information stream, which have local properties of the correlation dependence between adjacent message valuesX _{j - s} ^* ,, X _{j -one} ^* , X _j ^* , X _{j +1} ^* ,, X _{j + s} ^* and in the presence of more than three consecutive restored messages, for which absolute ΔFROM _{j - s} ^* = |FROM _{j - s} ^* - FROM _{j - s +1} ^* |, ..., ΔFROM _{j -one} ^* = |FROM _{j -one} ^* - FROM _j ^* |,ΔFROM _j ^* = |FROM _j ^* - FROM _{j +1} ^* |,ΔX _{j +1} ^* = |X _{j +1} ^* - X _{j +2} ^* |,...,ΔX _{j + ( s -one)} ^* = |X _{j + ( s -one)} ^* - X _{j + s} ^* | equal to the valueskd_minwherek =1, 2, 3 ... are integers or numbers close to them, and d_min= |FROM _j ^* - FROM _{j +1} ^* | - established for SAP-1 and SAP-1 (E) equivalent minimum code distance between adjacent values, for example, betweenFROM _j ^* andFROM _{j +1} ^* use a soft decoding algorithm to detect and correct errors. 3. The method according to claim 1, characterized in that when implementing the "soft" decoding algorithm, the difference of which when using SAP-1 and its equivalent version of SAP-1 (E) consists only in the used value of the minimum code distance d_min: in the first case d_min= 2 ⁿ +1, and in the second - d_min= 2 ⁿ wheren =N/ 2, andN - bit representation of original messagesX _j binary code, are found based on the fulfillment of the conditions of the following inequality: ΔFROM _{s -one} ^* = |FROM _{s -one} ^* - FROM _s ^* | <0.8 × 2 ^N and ΔFROM _s ^* = |FROM _s ^* - FROM _{s +1} ^* | <0.8 × 2 ^N , neighboring (s -1) and (s) breaks for encoded valuesFROM _j , defining the boundaries within which the group property of equi-sufficiency is fulfilled, which is associated with the fact that any of the valuesFROM _j , received without errors, when divided by the minimum code distance d_min will give the same remainder ζ, then for the general case, oriented to the presence of transmission errors, a histogram of the distribution of their values is plotted, statistical sample consisting of residuals ζ^*containing errorsεζ: ζ^* = ζ +εζ, the most common value is the mode of the Mo histogram (ζ^*), while all other values of the residuals that do not coincide with the value of the found invariant in the form of the mode value of the histogram Mo (ζ^*), which is a technical standard of the transmitted information, is used to detect transmission errors, which are corrected by substituting data insteadFROM _j ^(and) , the reliability of which is confirmed by the fact that when divided by the minimum code distance d_min give the value of the remainder ζ ^(and) , equal to the invariant in the form of the found value of the Mo (ζ^*), after detecting and correcting errors during reproduction of the converted information, the second stage of "hard" decoding of messages is implementedFROM _j ^(and) , recovered and corrected during playback, after which the recovered corrected messages are received in their original formX _j ^(and) which are used as an updated copy of the information with a reduced number of errors.

Images