Design of A Parallel Decoding Method for LDPC Code Generated via Primitive Polynomial

• Main Authors: Zhe Zhang, Liang Zhou, Zhi Heng Zhou
• Format: Article
• Language: English
• Published: MDPI AG 2021-02-01
• Series: Electronics
• Subjects: LDPC; parallel decoding; belief propagation; short cycles
• Online Access: https://www.mdpi.com/2079-9292/10/4/425

An effective way of improving decoding performance of an LDPC code is to extend the single-decoder decoding method to a parallel decoding method with multiple sub-decoders. To this end, this paper proposes a parallel decoding method for the LDPC codes constructed by m-sequence. In this method, the sub-decoders have two types. The first one contains only one decoding module using the original parity-check constraints to implement a belief propagation (BP) algorithm. The second one consists of a pre-decode module and a decoding module. The parity-check matrices for pre-decode modules are generated by the parity-check constraints of the sub-sequences sampled from an m-sequence. Then, the number of iterations of the BP process in each pre-decode module is set as half of the girth of the parity-check matrix, resulting in the elimination of the impact of short cycles. Using maximum a posterior (MAP), the least metric selector (LMS) finally picks out a codeword from the outputs of sub-decoders. Our simulation results show that the performance gain of the proposed parallel decoding method with five sub-decoders is about 0.4 dB, compared to the single-decoder decoding method at the bit error rate (BER) of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mn>10</mn><mrow><mo>−</mo><mn>5</mn></mrow></msup></semantics></math></inline-formula> .