Dual recursion based block Markov superposition encoding method

Abstract

The invention discloses a dual recursion based block Markov superposition encoding method. The method includes the following steps: taking an error correction code C[n, k] of which the code length isn and the information bit length is k as a basic code, and encoding an information sequence u of which the length is K=kL into a codeword c of which the length is N=n(L+T); the encoding method furtherincludes the following steps: firstly, dividing the information sequence u of which the length is kL into L equal-length packets u, that is expressed as u=(u(0), u(1),..., u(L-1)), wherein the lengthof each packet is k; for the time t=-1, -2, ..., -m1, setting a sequence w1(t) of which the length is n to a full-zero sequence; for the time t=-1, -2, ..., -m2, setting a sequence w2(t) of which thelength is n to the full-zero sequence; and then, at the time t=0, 1, ..., L-1, transmitting the sequence formula 1 (as shown in the original document) of which the length is k to an encoder ENC of the basic code C[n, k] for encoding, further obtaining a sequence formula 2 (as shown in the original document) of which the length is n, and combining a formula 3 and a formula 4 (as shown in the original document) that are fed back to calculate the t-th sub-sequence c(t) of the codeword c. The scheme of the invention has the advantages of simple encoding, low decoding complexity, channel capacityapproximability and the like, and compared with a traditional block Markov superposition encoding method, the scheme of the invention has a lower decoding error floor and lower decoding complexity.

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