Block Markov Superposition Coding Method and Decoding Method Using Binary bch Codes as Component Codes

Abstract

The invention belongs to the field of digital communication and digital storage, and discloses a packet Markov superposition coding method by taking a binary BCH code as a component code, and a decoding method. The binary BCH code having the code length of n, the information bit length of k and the error correcting capability of tmin is used as the component code; and a binary information sequence (u)u( / u) having the length of K=kBL is coded into a code (u)c( / u) having the length of N=nB(L+m). The invention further provides a soft iteration decoding method applicable to the packet Markov superposition coding method by taking the binary BCH code as the component code. The soft iteration decoding method comprises the following steps of: generating a turnover pattern according to a tree structure, judging whether a test process is ended or not and whether soft information output is calculated or not by using the lower bound of the unreliability of a potential legal error pattern, etc. According to the packet Markov superposition coding method and the decoding method thereof provided by the invention, the value of the coding memory length m is {1,2,3}; the net coding gain, which is greater than 10 dB, is provided at the bit error rate performance, which is as low as 10-10 to 10-15; and thus, the packet Markov superposition coding method and the decoding method thereof provided by the invention can be applied to a communication system having low bit error rate requirements, such as optical fibre communication.

Description

technical field [0001] The invention belongs to the field of digital communication and digital storage, and in particular relates to a block Markov superposition coding method and a decoding method using binary BCH codes as component codes. Background technique [0002] In optical communication systems, BCH codes with high code rates (generally higher than 0.8) are commonly used as component codes of concatenation / product error correction codes to obtain high information transmission rates and extremely low bit error rates (BER) (usually 10 -10 to 10 -15 Magnitude). For example, in the standard G.975.1 of the International Telegraph Union Telecommunication Standardization Sector (ITU-T), the BCH-BCH product code with an overhead of 6.7% can output a bit error rate of 10 -15 Provides a net coding gain (net coding gain, NCG) of 9.24dB at . Under the condition of using the same overhead, the staircase code (staircase code) can obtain a net coding gain of 9.41dB at the same ...

AI Technical Summary

Problems solved by technology

The lattice-based decoding method is an optimal method, which can establish state transition according to the structure of the binary BCH code and obtain soft information output through the BCJR algorithm, but this method is only suitable for short codes with small error correction capabilities. The general binary BCH code is too complex and not suitable for practical systems

Images