CN114244476A

CN114244476A - Novel self-error-correction coding method and coding format-multiplying power code

Info

Publication number: CN114244476A
Application number: CN202111603899.2A
Authority: CN
Inventors: 秦柏林
Original assignee: Individual
Current assignee: Individual
Priority date: 2021-12-25
Filing date: 2021-12-25
Publication date: 2022-03-25
Anticipated expiration: 2041-12-25
Also published as: CN114244476B

Abstract

The multiplying power code is a novel data transmission code, the generation of a repair packet is realized by constructing an exclusive-or function equation set, source data and repair data are transmitted during data transmission, and the source data can be decoded by a receiving end as long as half of correct data is received. The method comprises the following steps that source data are grouped into two bytes, 4 bits serve as a source symbol, the source symbol calculates a repair symbol through an exclusive OR equation, the source symbol and the repair symbol are numbered from 0 to 7, 0 to 3 serve as the source symbol, 4 to 7 serve as the repair symbol, and 8 bytes are formed; the most significant bit of each byte is an odd check bit, and then 3 bits are serial numbers; a byte with a value of 0 is added as a unit interval flag. The receiving end receives 8 bytes from 0, judges whether the first four bytes are correct or not through the check value, and obtains source data without errors; if one or more of the bytes are wrong, taking out the correct bytes in the 4 bytes, wherein the total correct number is more than or equal to 4, and calculating the source data through an equation set; if the correct byte is less than 4, it cannot be decoded.

Description

Novel self-error-correction coding method and coding format-multiplying power code

Technical Field

The method is suitable for data transmission and data storage.

Background

Whether wired or wireless, efforts are constantly being made to find a method of one-way reliable communication, from the earliest hamming codes to the latest fountain codes. At present, a response retransmission mechanism which is used in a large amount in wired and wireless network communication causes extremely low data transmission efficiency under the condition of poor channel quality; the acknowledgement itself in the acknowledgement mechanism may also be lost due to transmission errors, which may result in the sender always waiting for the acknowledgement information of the receiver. In practical engineering application, we have assiduously explored and hoped to find a coding method which can be regarded as one-way reliable communication by short sight, and then turbo codes and fountain codes are born. In the practical use of both of these encoding procedures, i find too much inconvenience, such as: turbo codes bind channel quality, fountain codes do not protect serial numbers and header information, coding meta information is needed during decoding, if data are transmitted in a channel and errors occur in the data, therefore, the inventor finds a new code which can solve the defects, namely, the channel quality is irrelevant, the header information is protected, and meanwhile, a decoding end does not need any information of a coding end. It is known that the error probability of 0,1 of binary data, whether in wired transmission or wireless transmission, is always 50%, the basic error rate does not exceed 50%, and therefore, the data amount of 50% is redundant, and it is guaranteed that decoding can be performed under the condition that the error rate is not greater than 50%, and the error rate of the existing communication equipment is lower than 50% (higher than 50%, the transceiving rate is reduced), and therefore, the communication equipment is similar to reliable unidirectional transmission.

Disclosure of Invention

Mathematical theory of encoding and decoding

The xor-algebra is known to have the following characteristics:

A XOR B=D A=D XOR B

data needs to be transmitted by 2 bytes per cell, and one cell is divided into 4 source symbols, each with 4 bits. The source symbol we denote as AB C D to construct an algebraic equation

X1∧X2∧X3∧X4=R1

X1∧X3∧X4=R2

X1∧X2∧X4=R3

X2∧X3∧X4=R4

Solving the equation to obtain

X1=R1∧R4

X2=R1∧R2

X3=R1∧R3

X4=R2∧R3∧R4

The number of source symbols at a transmitting end is i =4, the number of repair symbols is j =4, and at a receiving end, the necessary condition that the decoding can be carried out is (i + j) > =4, and two extreme cases are considered firstly:

1、i=0,j=4

the source code may be decoded using the following equation:

X1=R1∧R4

X2=R1∧R2

X3=R1∧R3

X4=R2∧R3∧R4

2、i=4,j=0

directly obtaining source data without decoding

In addition to the two extremes, there remains a common case where (i + j) > =4, i >0, j <4

The number of source symbols to be solved is 4-i, the number of unknown repair symbols is 4-j, for an equation containing the unknown repair symbols, a left known arbitrary source symbol value is exchanged with the right unknown repair symbols to obtain a reduced equation set, and all error or lost source symbols can be obtained through a elimination method. Therefore, the source symbol can be decoded from 8 symbols transmitted by us as long as any 4 symbols are correctly received. For practical application, the data to be transmitted is encoded in 2-byte packets, and many encoded data are grouped into large data packets to be transmitted.

Description of coding formats

The encoding format is shown in fig. 1, two bytes of source data are encoded into 9 bytes, the first byte is 0, which is used to identify the data unit header, and if an error occurs in the middle, the decoding end is used to find the data start position again. The next 4 bytes are source symbols and the last 4 bytes are repair symbols. The byte structure of the source symbol and repair symbol is: the first bit is odd parity, the last 7 is odd 1's and 0's, and the even 1's are 0's, so the source and repair symbol bytes will never be 0's. Bits 2 through 4 are numbered 0-7 to identify the corresponding equation, and the last 4 are the source symbol or repair symbol. The purpose of this design is to identify the source symbol and the repair symbol and their corresponding equations, and at the same time, to determine whether the source symbol or the repair symbol is transmitted correctly, discard the error, decode with the correct part, when the sum of the source symbol and the repair symbol is greater than or equal to 4, then decode can be performed, otherwise, not decode and discard.

Overview of practical applications of encoding and decoding

As shown in fig. 2, the data of the transmission buffer queue is taken out and coded, and the coded data forms an MCS transmission size and is sent to a sending device, wherein the sending device may be a wireless modulator or a network communication sending device; the receiving device receives the data, judges the initial position of the decoded data by checking whether the first byte is 0, reads 8 bytes from the first byte which is 0 for decoding, puts the decoded data into a receiving buffer, and gives the decoded data to an upper layer communication protocol for processing.

Drawings

Fig. 1 shows the detailed format and description of the codec, and please refer to [0004] description of the encoding format.

Fig. 2 is a flow of actual codec usage, and details of the encoding and decoding flow section of [0005 ].

Claims

1. The multiplying power code is a novel data transmission coding method, a repair packet is generated by constructing an exclusive or function equation set, source data and repair data are transmitted during data transmission, and the source data can be decoded by a receiving end as long as half of correct data is received; the method comprises the following steps that source data are grouped into two bytes, 4 bits serve as a source symbol, the source symbol calculates a repair symbol through an exclusive OR equation, the source symbol and the repair symbol are numbered from 0 to 7, 0 to 3 serve as the source symbol, 4 to 7 serve as the repair symbol, and 8 bytes are formed; the most significant bit of each byte is an odd check bit, and then 3 bits are serial numbers; adding a byte with a value of 0 as a unit interval identifier; the receiving end receives 8 bytes from 0, judges whether the first four bytes are correct or not through the check value, and obtains source data without errors; if one or more of the bytes are wrong, taking out the correct bytes in the 4 bytes, wherein the total correct number is more than or equal to 4, and calculating the source data through an equation set; if the correct byte is less than 4, then the set of data is discarded.

2. As described in fig. 1, the encoding method and format can approximately realize one-way reliable data transmission, and can be widely used in the fields of computer communication, wireless communication, and the like.

3. The encoding method and format, as described in 1, is characterized by a uniquely constructed function equation by which source data can be solved as long as the repair symbols plus the total number of source symbols is greater than or equal to 4.

4. As described in fig. 1, the encoding method has extremely fast speed, constant and extremely low time complexity and space complexity, so that good encoding and decoding performance can be obtained in embedded devices.

5. This encoding method and format, as described in 1, can be used in data storage devices to read data even if some blocks of the storage device are corrupted or erroneous, as long as there is 50% total correct.