A Grouped Markov Superposition Coding Method Based on Double Recursion

Abstract

The invention discloses a double-recursion-based grouping Markov superposition coding method. The error correction code C[n,k] whose code length is n and information bit length is k is used as the basic code, and the length K=kL message sequence u Encoded into a codeword of length N=n(L+T) c ; Its encoding method comprises the following steps: first, the length is the information sequence of kL u Divide into L equal-length groups u =( u (0) , u (1) ,…, u (L‑1) ), the length of each packet is k; for time t=‑1,‑2,...,‑m 1 , the sequence of length n w 1 (t) set to a sequence of all zeros; for time instants t = ‑1,‑2,...,‑m 2 , the sequence of length n w 2 (t) Set as an all-zero sequence; then, at time t=0,1,...,L-1, send a sequence of length k to the encoder ENC of the basic code C[n,k] for encoding to obtain a sequence of length n and calculate the codeword by combining the feedback and c The tth subsequence of c (t) . The present invention has the advantages of simple encoding, low decoding complexity, and can approach channel capacity. Compared with the traditional block Markov superposition coding method, the present invention has a lower decoding error floor and lower decoding complexity. Spend.

Description

technical field [0001] The invention relates to the technical fields of digital communication and digital storage, in particular to a double-recursion-based grouping Markov superposition coding method. Background technique [0002] Data in communication and storage systems will be affected by noise and errors will occur, resulting in data that cannot be received or restored correctly. With the increasing demand for personal data and storage, data reliability in communication and storage systems has drawn more and more attention. In order to achieve efficient and reliable data transmission and data storage, it is necessary to design a channel code that can approach the channel capacity and has an efficient encoding and decoding algorithm. Since Shannon proposed the famous channel coding theorem in 1948, people have been devoting themselves to the research and design of good codes that can approximate the channel capacity. In 1993, Berrou et al. proposed the Turbo code, whic...

AI Technical Summary

Problems solved by technology

However, the non-recursive block Markov superposition coding method has the following problems: when the repetition code and the parity code are used as the basic code, a large coding memory length m is required to effectively approach the channel capacity, and the larger the memory length m , the greater the required decoding delay d, the higher the corresponding decoding complexity and decoding delay

Therefore, the non-recursive block Markov superposition coding method cannot be used in communication and storage systems that require extremely low latency and extremely low computational complexity

Images