Hard decision iterative decoding method for packet Markov superposition coding

Abstract

The invention discloses a hard decision iterative decoding method for packet Markov superposition coding, and belongs to the fields of digital communication and digital storage. The hard decision iterative decoding method is used for recovering superposition-coded L groups of binary information sequences (as shown in the original PDF) with kB lengths from (L+m) hard decision vectors (as shown in the original PDF) with nB lengths corresponding to packet Markov superposition coding with a memory of m, which is constructed by a binary component code coder with a k-length input and an n-length output and for a hard decision iterative decoding method with a decoding delay as d, only {0, 1, e} is used as iterative information, wherein the e represents a state ''delete'', and a receiving end receives groups (as shown in the original PDF) of hard decision vectors and then starts decoding, so that estimation (as shown in the original PDF) of transmission information (as shown in the original PDF) is acquired. The invention further provides processing methods for each node processor in the hard decision iterative decoding method. The hard decision iterative decoding method for the packet Markov superposition coding, provided by the invention, has excellent performances, low complexity and simpleness in implementation, and can be applied to communication systems, such as optical fiber communication and the like, with the low bit error rate and low decoding time delay requirements.

Description

technical field [0001] The invention belongs to the field of digital communication and digital storage, in particular to a hard decision iterative decoding method of group Markov superposition coding. Background technique [0002] In optical communication systems, the hard-decision iterative decoding method is generally applied to concatenation / product error correction coding with high code rate (generally higher than 0.8) to obtain high information transmission rate, low delay and extremely low bit error rate (bit error rate, BER) (generally 10 -10 to 10 -15 Magnitude). For example, in the standard G.975.1 of the International Telegraph UnionTelecommunication 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 codinggain, 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 sa...

AI Technical Summary

Problems solved by technology

For the current optical communication system, the soft information iterative decoding method has high complexity and does not meet the low-latency performance requirements of the optical communication system.

Images