RU2643441C2 - Method of processing and receiver of messages of circular single-wide networks of data transmission with repetitions - Google Patents

Abstract

FIELD: radio engineering, communication.

SUBSTANCE: receiver contains a concatenated demodulator, a decoder, and an interface to represent the data, while the decoder has an additional information output that is associated with a block message accumulation, which is connected with the message storage unit, which is concatenated to a vector formation unit, a majority verification unit, and logical message generation unit. The output of the logical message generation unit is connected to the second information input of the decoder, the control output of which is connected to the control input of the vector forming unit, and the control output of the vector forming unit is connected to the control input of the logical message generation unit.

EFFECT: increase the efficiency of bringing messages in the communication channels of circular unilateral data networks with repetitions, circuit simplification of the message receiver.

9 cl, 8 dwg

Description

DESCRIPTION OF THE INVENTION

The invention relates to communication technology and can be used in receivers of circulating one-way data networks with repetitions. The prior art RADIO COMMUNICATION SYSTEM WITH NOISE-LIKE SIGNALS [application for invention of the Russian Federation No. 94002883, publ.: 04.20.1996, which includes the transmitting and receiving sides. The receiving side contains in parallel a demodulator and a pair of decision circuits that are connected to the majority element, which implements the decision rule 2 or more of 3. Signal reception is characterized by the fact that, to ensure increased reliability, the output symbols of the demodulator and decision circuits are fed to the majority element, which processes the received characters according to rule 2 or more of 3, while the decision on the adopted binary character is made at the output of the majority element.

The disadvantage of this analogue is the low efficiency of message delivery, which is due to the fact that the receiver performs a majority check of each character, regardless of the quality of the received character.

The closest in technical essence is the DEVICE FOR MAJOR DECODING AT THREE TIMES REPEAT OF THE CODE COMBINATION [application for the invention of the Russian Federation No. 95120718, publ.: 08.20.1996], which contains a quality detector, correction unit, shift register, decoder, switch, first and the second memory blocks, the majority element and the synchronization block. The operation of this device is characterized in that the symbols of the first repetition with a clock repetition rate are received in the shift register, where they are stored, and also in the decoder, where they are decoded. Under the influence of clock pulses from the third output of the block, information symbols of the first repetition from the second output of the decoder through the switch are recorded in the first shift register of the memory block. At the same time, if there is a clock pulse at the sixth output of the synchronization block, the fact of the presence or absence of errors in the received repetition (the presence or absence of a signal at the first output of the decoder) is recorded in the memory block. Upon receipt of the second repetition, the quality detector analyzes the quality of the received symbols with the issuance of an erase signal if the parameters of the symbol fall into the zone of unreliable reception. The received symbol and the corresponding erasures are sent to the correction unit, where the symbols of the first repetition stored in the shift register are also fed. In the correction block, the correction of unreliably received characters based on previously received, as of better quality, takes place. The corrected combination is written to the shift register, and also goes to the decoder. The decoding result from the first output of the decoder enters the memory block, where it is stored, and information symbols of the second repetition through the switch under the influence of clock pulses from the fourth output of the synchronization block are recorded in the shift register of the second memory block.

The disadvantage of the prototype is the low efficiency of bringing the message due to the fact that the device eliminates characters with poor reception quality and does not use them in further processing, despite the fact that the presence of errors in these symbols is probabilistic.

The technical result of the invention is to increase the efficiency of message delivery in the communication channels of circular one-way data networks with repetitions.

The specified technical result is achieved due to the fact that the method of processing messages of circular one-way data networks with repetitions, characterized by decoding message symbols, their accumulation, checking for errors in message symbols, as well as performing majority checks, characterized in that the processing method is characterized by incoming demodulation signals, by transmitting characters to the decoder, checking the decoder for errors in the character sequence of the message, and transmitting correctly received messages to the data presentation interface, while the decoder sends erroneously received messages to the accumulation unit, in which of the same characters of the indicated messages, where the specified same name is characterized by the same sequence of characters in the message, the character matrix is formed, when three error messages are accumulated, the character matrix is transmitted to a vector forming unit, which alternately generates symbol vectors from the columns of the specified matrix and sends them to the majority check block, in which carry out a majority check of the indicated vectors and transfer the results of the checks to the logical message generation unit until the vector generation unit sends the last column of the symbol matrix for verification, while the vector generation unit transmits an end mark to the logical message generation unit, after which the generation unit logical messages are transmitted to the decoder by the generated message, which, if there is an error in the specified message, eliminates it, when received in the accumulation unit of a rare erroneous message, it is added to the character matrix in a new line and the specified matrix is transferred to the vector forming unit, which sequentially for each column of combinations of its characters forms a vector, the length of which can be any odd number, starting from three, and for the next generation of vectors previously used for this combination of characters are not allowed, after receiving the end mark, the logical message generation unit transmits the generated message to the decoder input, when updated If an error occurs in the indicated message, the decoder sends a repeat mark to the vector generation unit, while the vector generation unit selects new combinations of matrix column symbols from which it forms the next sequence of vectors.

In particular, checking for errors is done by checking the parity character, which follows in the character sequence of the message through a predetermined number of characters, or by checking a cyclic redundancy code.

In particular, when a message arrives at the accumulation unit, the length of which is different from the length of previously received erroneous messages, the indicated block begins to form a new character matrix.

In particular, the logical message generation unit accumulates the results of majority checks.

In particular, majority checks shall, according to majority rules, carry out two or more of three or three or more of five or four or more of seven or five or more of nine or six or more of eleven or seven or more of thirteen.

In particular, the decoder transmits correctly received logic message to the data presentation interface.

The specified technical result is achieved due to the fact that the message receiver of the circular one-way data transmission networks with repetitions, containing a decoder, the output of which is connected to the accumulation unit and the majority check unit, characterized in that it contains a demodulator, a decoder and a data presentation interface connected in series, while the decoder has an additional information output, which is connected to the message accumulation unit, which is sequentially connected to the vector forming unit, the majoritarian unit checks and the logical message generation unit, while the output of the logical message generation unit is connected to the second information input of the decoder, the control output of which is connected to the control input of the vector generation unit, and the control output of the vector formation unit is connected to the control input of the logical message generation unit. In particular, the accumulation block, the vector formation block, the majority check block and the logical message generation block form the logical processing block.

In particular, the data presentation interface is implemented as an information user display.

Brief Description of the Drawings

In FIG. 1 is a functional diagram of a message receiver of circulating one-way data networks with repetitions.

In FIG. Figure 2 presents a table for calculating the number of different majority checks for a different number of erroneous received messages.

In FIG. 3 shows a graph of the probability-time characteristics of message delivery with the probability of error of an elementary symbol in a communication channel p ₀ = 0.1 for the prototype.

In FIG. 4 is a graph of the probabilistic-temporal characteristics of message delivery when the error probability of an elementary symbol in the communication channel is p ₀ = 0.1 for the proposed processing method.

In FIG. 5 is a graph of the probability-time characteristics of message delivery when the probability of error of an elementary symbol in a communication channel is p ₀ = 0.15 for the prototype.

In FIG. 6 is a graph of the probabilistic-temporal characteristics of message delivery when the error probability of an elementary symbol in a communication channel is p ₀ = 0.15 for the proposed processing method.

In FIG. 7 shows a graph of the probability-time characteristics of message delivery with the probability of error of an elementary symbol in a communication channel p ₀ = 0.2 for the prototype.

In FIG. 8 is a graph of the probabilistic-temporal characteristics of message delivery when the error probability of an elementary symbol in a communication channel is p ₀ = 0.2 for the proposed processing method.

The drawing indicates: 1 - demodulator, 2 - decoder, 3 - data presentation interface, 4 - logical processing unit, 5 - message accumulation unit, 6 - vector generation unit, 7 - majority check unit, 8 - logical message generation unit.

The implementation of the invention

The implementation of the invention is illustrated by the example of the device and operation of the message receiver of the circulation of one-way data transmission networks with repetitions. The receiver contains a demodulator 1, the input of which, as a rule, is connected to an antenna-feeder system with primary analog signal processing devices (not shown in the drawing), while the demodulator 1 is connected in series with decoder 2 and data presentation interface 3.

Also, the message receiver of the circulation one-way data transmission networks with repetitions contains a logical message processing unit 4, which functionally includes serially connected message accumulation unit 5, vector forming unit 6, majority check unit 7 and logical message generating unit 9, while the second information output of decoder 2 connected to the message storage unit 5, and the output of the logical message generating unit 8 is connected to the second input of the decoder 2, in addition, the control output de dera 2 is connected to the control input generation unit vectors 6, the control output of which is connected to the control input generation unit 8 logical messages.

The data presentation interface 3 can be made in the form of a user information display or in the form of a data conversion program for the purpose of further processing, for example, for accumulating them in a database.

In block 5, it is possible to carry out majority checks of the following types:

,

,

,

,

нечетное число, начиная с 3-х - основание типа мажоритарной проверки;

- знак округления до большего целого числа.where m is

odd number, starting with 3 - the basis of the type of majority control;

- A rounding mark to a larger integer.

A message receiver of circular one-way data networks with repetitions works as follows.

In general, the receiver can operate both in detection mode and in error correction mode. If there are no errors in the received message or all errors are corrected, then the message is issued on the data presentation interface 3 and is considered communicated to the user. If errors are detected in all messages from the retry cycle, as well as if errors are detected in all logical messages generated in the logical processing unit 4, the message is considered not communicated to the user.

The analog signal originally received by the antenna-feeder system is converted into analog processing chains in order to filter the signal and lower its frequency.

After that, in accordance with the modulation of the analog signal, the demodulator 1 extracts information symbols S _{i of the} message in the amount of N from the signal, generates an information vector of message symbols {S ₁ , S ₂ , ..., S _N } from them and transfers it to decoder 2.

Decoder 2 evaluates the presence of errors in the information vector and, if there are no errors, transfers it to the data presentation interface 3, which displays the received message, for example, on a user display.

Decoder 2 can evaluate the correctness of received messages by checking periodically repeating through a certain number of characters in the message parity characters or by checking the cyclic redundancy code (CRC).

Decoder 2 sends a symbol vector {S ₁ , S ₂ , ..., S _N } of 1 × N erroneously received messages to logic processing unit 4, in which the specified vector initially enters message accumulation unit 5.

In the message accumulation unit 5, messages that are mistakenly received are also decomposed upon receipt of the next symbol vector {S _1; S ₂ , ..., S _N } of the same symbols form the columns of the symbol matrix of dimension M × N, where M is the number of received vectors of dimension 1 × N. In this case, by the same character is meant the same sequence of characters in the message.

When at least 3 erroneous messages are accumulated in block 5, it transmits a 3 × N symbol matrix to the vector forming unit 6.

After that, block 6 forms from the columns of the symbol matrix of the vector {S _1i , S _2i , ..., S _3i }, where i is the serial number of the column of the matrix, and sends them one by one to the block of majority checks 7, in which the majority of vectors received at the input are checked according to rule 2 or more of 3. The result of the check is D _i, the majority check block 7 sends to the logical message generation block 8, in which the logical message vector is generated until the vector generation block 6 sends the last column the dead matrix and at the control output will not form an end mark, which it will transmit to block 8, while block 8 sends the vector of symbols of the logical message {D ₁ , D ₂ , ..., D _N } to the second input of decoder 2, which estimates the presence of errors in the received character vector. If there is no error in the indicated vector, decoder 2 transfers it to the data presentation interface 3 and filters out the vector with erroneous characters.

When the next erroneous message arrives at the accumulation unit 5, he adds it to the symbol matrix in a new line, then transfers the symbol matrix to the vector generation block 6.

Upon receipt of the extended symbol matrix, block 6 will form smaller columns from the columns of the specified matrix of the vector, the length of the indicated vectors - K may be any odd number starting from 3, while previously formed combinations of columns of the symbol matrix are not allowed for the formation of K × 1 vectors. When entering the block 6 matrices with an odd number of rows, starting from 3, block 6 will initially form the vectors {S _1i , S _2i , ..., S _Mi }, where M is the number of rows of the character matrix.

To find the number of majority checks of a specific type on a set of M accumulated messages, taking into account previously conducted checks on a set of (M-1) messages, it is necessary to subtract from the total number of majority checks existing on M the majority checks that were performed on the M-1 repeat, those.:

.

.

The calculation of the number of MP types of 2 or more of 3, 3 or more of 5, 4 and more of 7, 5 and more of 9 and 6 and more of 11 on a set of M messages, taking into account the previous majority checks, is presented in the table shown in FIG. 2.

Block 6, upon receipt of a character matrix with 4 rows, will send vectors {S _2i , S _3i , ..., S _4i } to block 7, where 2, 3 and 4 are the sequence numbers of the rows of the character matrix, i is the sequence number of a column of a 4 × matrix N. After block 6 sends the end mark to block 8 of the logical message generation unit 8, block 8 will issue a newly generated logical message to decoder 2, and if decoder 2 classifies the message as erroneous, the decoder will generate a repeat mark at the control output and send it to the formation block vectors 6, which will begin the formation of vectors from new combinations of rows of the symbol matrix, for example, {S _1i , S _3i , ..., S _4i }.

When a message of length L is received at the input, it will classify it as a category of new messages and begin to form a new character matrix.

A message is notified to the user when at least one message from a series of repetitions was received without error, or when no errors were found in at least one logical message.

We evaluate the efficiency of message delivery, taking into account the proposed method of processing messages regarding the prototype.

Let block 5 contain 12 erroneously received messages, then there are the following types of majority checks - 2/3, 3/5, 4/7, 5/9, 6/11.

We introduce the assumptions:

let the probability of error of an elementary symbol on the whole set of received messages be the same and equal to p ₀ .

Let all messages be received in an independent manner.

the lead time for majority checks is disproportionately short compared to the time it takes to wait for the next message from the communication channel.

The use of majority checks provides an increase in the reliability of the message and, accordingly, reduces the probability of error per elementary symbol. You can determine this error probability by the following expression:

,

,

where (n / m) is the type of majority check.

Therefore, these error probabilities characterize logical messages generated by majority checks. Then the probability of bringing the logical can be determined as follows:

p ^(2/3) = (1-p ₀ ^(2/3) ) ^N , p ^(3/5) = (1-p ₀ ^(3/5) ) ^N , p ^(4/7) = (1- p ₀ ^(4/7) ) ^N , p ^(5/9) = (1-p ₀ ^(5/9) ) ^N , p ^(6/11) = (1-p ₀ ^(6/11) ) ^N ,

where N is the length of the message.

Then, upon receipt of the first erroneous message, the probability of bringing it is equal to:

.

.

When receiving the second erroneous message (i.e., M = 2), using the principle of the appropriateness of the application of opposite events in probability theory, the probability of bringing the message can be found by the expression:

Upon receipt of the third error message (M = 3), in the logical processing unit 4, according to the proposed method, majority checks of two or more of three (2/3) types are implemented, therefore, applying the indicated principle of expediency, the probability of bringing the message to this will be formed in the following way:

Similarly, using the principle of the appropriateness of using opposite events in probability theory, it is possible to calculate the probabilities of delivering a message to a user in large numbers of erroneously received messages. A generalized expression that determines the probability of bringing a message to the user, with an arbitrary value of erroneously received messages - M, taking into account the presented processing method, is:

,

,

where p ^{(ni / mi)} -, C _M ^mi is the number of majority checks of a particular type.

показывают вероятности доведения сообщения с учетом предложенного способа обработки сообщений, т.е. являются вероятностно-временными характеристиками (ВВХ) доведения сообщения. По ВВХ принято оценивать оперативность доведения сообщений, при этом можно сравнить ВВХ доведения сообщения с учетом предлагаемого способа обработки и без такового. Соответствующие графики вероятностей доведения, при вероятности ошибки элементарного символа в канале связи р₀=0,1; 0,15; 0,2 представлены на фиг. 3-8.Obviously, the quantities

show the probability of bringing the message, taking into account the proposed method of processing messages, i.e. are probabilistic-temporal characteristics (VVH) of message delivery. According to the VVH, it is customary to evaluate the efficiency of message delivery, while it is possible to compare the VVH of message delivery taking into account the proposed processing method and without it. The corresponding graphs of the probabilities of bringing, with the probability of error of an elementary symbol in the communication channel p ₀ = 0.1; 0.15; 0.2 are shown in FIG. 3-8.

From the analysis of the graphs it follows that the efficiency of message delivery is increased for each value of the probability of error of an elementary symbol, therefore, the claimed technical result of the invention is achieved - increasing the efficiency of message delivery in the communication channels of circular one-way data networks with repetitions.

Claims (9)

1. A method for processing messages of circular one-way data networks with repetitions, characterized by decoding message symbols, accumulating them, checking for errors in message symbols, and performing majority checks, characterized in that the processing method is characterized by demodulation of incoming signals, transmitting symbols to a decoder, checking in the decoder for errors in the character sequence of the message and transmitting the error-free messages to the data presentation interface, when the volume of the decoder sends erroneously received messages to the accumulation unit, in which of the same characters of the indicated messages, where the specified same name is characterized by the same sequence of characters in the message, the character matrix is formed, when three error messages are accumulated, the character matrix is transferred to the vector generation unit, which is from the columns of the specified matrices alternately generates symbol vectors and sends them to the block of majority checks, in which a majority check of these vectors is performed c and transmit the results of the checks to the logical message generation unit until the vector generation unit sends the last column of the symbol matrix for verification, while the vector generation unit transmits an end mark to the logical message generation unit, after which the logical message generation unit transmits the generated a message that, if there is an error in the indicated message, sifts it, when it receives another error message in the accumulation unit, it is added to the character mat line with a new line and transmit the indicated matrix to the vector generation block, which sequentially for each column of combinations of its symbols forms a vector whose length can be any odd number, starting with three, while for the next vector formation the previously used combinations of characters are not allowed , after receiving the end mark, the logical message generation unit transmits the generated message to the decoder input, when an error is detected in the specified message, the decoder sends Lok forming vectors repeat label, thus forming unit vectors selects new combinations of columns of symbols, of which forms a regular sequence of vectors. 2. The method according to p. 1, characterized in that the check for errors is produced by controlling the parity character, which follows in the character sequence of the message through a given number of characters or by monitoring a cyclic redundancy code. 3. The method according to p. 1, characterized in that upon receipt of a message in the accumulation unit, the length of which is different from the length of previously received erroneous messages, the indicated block begins to form a new symbol matrix. 4. The method according to p. 1, characterized in that the block for generating logical messages accumulates the results of majority checks. 5. The method according to p. 1, characterized in that the majority checks are made according to majority rules two or more of three or three or more of five or four or more of seven or five or more of nine or six or more of eleven or seven and more than thirteen. 6. The method according to claim 1, characterized in that the decoder transmits correctly received logical message to the data presentation interface. 7. A message receiver of circular one-way data networks with repetitions, comprising a decoder, the output of which is connected to the accumulation unit and a majority check unit, characterized in that it contains a demodulator, a decoder and a data presentation interface connected in series, the decoder having an additional information output, which connected with a message accumulation unit, which is sequentially connected with a vector generation unit, a majority check unit and a logical message generation unit, In this case, the output of the logical message generating unit is connected to the second information input of the decoder, the control output of which is connected to the control input of the vector generating unit, and the control output of the vector generating unit is connected to the control input of the logical message generating unit. 8. The receiver according to claim 7, characterized in that the accumulation unit, the vector formation unit, the majority check unit and the logical message generation unit form a logical processing unit. 9. The receiver according to claim 7, characterized in that the data presentation interface is implemented as an information user display.

Images