Recursive grouping Markov superposition coding method based on partial superposition

Abstract

The invention discloses a recursive grouping Markov superposition coding method based on partial superposition. A code C [n, k] with the code length is n and the information being the length k servesas a basic code, an information sequence u with the length being kL is encoded into a code word c with the length being n (L + T), L is the coupling length and represents the number of equal-length groups with the length being k, and T is the ending length; wherein L and T are integers with non-negative values. An encoding method comprises the following steps that an information sequence u with the length of kL is divided into L equal-length groups u = (u (0), u (1to u (L-1)), and the length of each group is k; for the moment t =-1,-2to-m, the sequence w (t) with the length of n is initializedand set as an all-zero sequence; when t is equal to 0, 1to L-1, the sequence with the length of k is sent to an encoder ENC of a basic code to be encoded, an encoded sequence with the length of n isobtained, and the tth sub-sequence c (t) of the codeword c is calculated in combination with the sequences w (t-1), w (t-2)to w (t-m); the block Markov superposition coding method has the advantages of being simple in coding, low in decoding complexity, flexible in construction, capable of approximating channel capacity and the like, and compared with a traditional block Markov superposition coding method, the block Markov superposition coding method is suitable for basic codes with good performance and has lower coding and decoding complexity.

Description

technical field [0001] The invention relates to the research field of digital communication and digital storage, in particular to a recursive packet Markov superposition coding method based on partial superposition. Background technique [0002] With the advent of the era of big data, individuals' needs for data transmission and data storage are increasing day by day. As equipment components have entered the ten-nanometer era, the uncertainty of transmission links and storage media is increasing, and the error rate is also increasing. Channel coding is one of the important means to ensure the data reliability of these information systems. Therefore, it is of great practical significance to design high-performance error correction coding technology. Shannon proposed channel capacity in 1948 and proved the channel coding theorem. Since then, researchers have been working on constructing good codes that can approximate the channel capacity. In 1993, Berrou et al. proposed t...

AI Technical Summary

Problems solved by technology

The recursive group Markov superposition coding method using full superposition has the following problems: when the basic code is a code with better performance, the performance of the recursive group Markov superposition coding method using full superposition is poor, and it cannot bring performance gain. It also increases the complexity of encoding and decoding

Images