We propose using layered update rule in decoding nonbinary LDPC codes. Only 10-15 iterations suffice for good performance. Also, for the same BER performance, it increases throughput by twofold compared to conventional flooding update rule.
In this paper, we present a reduced-latency nonbinary low-density parity-check (LDPC) coded modulation scheme suitable for high-speed optical fiber communication featuring the layered LDPC decoding algorithm. The use of the layered decoder in place of the conventional flooding decoder helps reduce by half the number of iterations taken in decoding. This in turn reduces the decoding latency, increases the decoding throughput, and significantly lowers the power consumption at the receiving ends of optical transport networks. We show by using the experimental data collected from a 4-ary rate-0.8 LDPC-coded NRZ-DQPSK modulation system that layered decoding indeed halves the required number of decoding iterations. We also show that, in the back-to-back configuration, even with a single iteration of layered decoding, one can attain a 7 dB gain in performance at the bit error ratio (BER) of 10-5when compared to using only the maximum a posteriori probability detector output based on the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm.
Low density parity check (LDPC) decoding process is known as compute intensive. This kind of digital communication applications was recently implemented onto graphic processing unit (GPU) devices for LDPC code performance estimation and/or for real-time measurements. Overall previous studies about LDPC decoding on GPU were based on the implementation of the flooding-based decoding algorithm that provides massive computation parallelism. More efficient layered schedules were proposed in literature because decoder iteration can be split into sublayer iterations. These schedules seem to badly fit onto GPU devices due to restricted computation parallelism and complex memory access patterns. However, the layered schedules enable the decoding convergence to speed up by two. In this letter, we show that: 1) layered schedule can be efficiently implemented onto a GPU device; and 2) this approach—implemented onto a low-cost GPU device—provides higher throughputs with identical correction performances (BER) compared to previously published results.
In this paper, we propose an extended layered decoding approach for low density parity check (LDPC) codes. Compared to conventional layered decoding algorithms, the proposed approach has no constraint in the column weight of each layer. Hence, it enables more flexibility in high-throughput LDPC decoder design with layered decoding. Simulations on structured and random LDPC codes show that the proposed decoding method achieves significantly faster convergence and slightly better error correction performance than the conventional two phase massage passing sum-product algorithm. We also propose an efficient highly parallel decoder architecture for generic quasi-cyclic LDPC codes to facilitate the practical application of the proposed decoding scheme.
Compared to binary Low-Density Parity-Check (LDPC) codes, nonbinary LDPC (NB-LDPC) codes have better error correction performance under short-to-moderate block lengths or high-order modulations. Traditional min-sum-based soft decoding algorithms for NB-LDPC codes suffer from large computational complexity, which leads to inefficient hardware implementations. The Multiple-symbol-reliability weighted Bit-Reliability-Based (MwBRB) hard decoding algorithm achieves a good tradeoff between error correction performance and decoding complexity. However, efficient hardware implementations based on the MwBRB algorithm have not been investigated. In this brief, an improved layered MwBRB algorithm is first proposed, which results in faster convergence rate than the MwBRB algorithm. Then, an ultra-high-throughput low-complexity decoder architecture with an efficient partially parallel processing schedule is also presented. Finally, the proposed architecture is coded with RTL and synthesized under the TSMC 90-nm CMOS technology. The synthesis results demonstrate that the proposed decoder for a (837, 726) quasi-cyclic NB-LDPC code over GF(25) achieves a throughput of 21.66 Gbps and an area efficiency of 4.77 Gbps/M-gates under the TSMC 90-nm CMOS technology. The proposed decoder reaches a throughput more than 20 Gbps for the first time among the prior NB-LDPC decoders, and the area efficiency is far beyond the state-of-the-art designs.
In this paper, we present a layered decoding algorithm for non-binary LDPC codes. Differing from the flooding message-passing schedule in conventional designs, the proposed scheme updates check node messages in serial. Furthermore, since fully serial decoding will lead to long latency, the locally-parallel globally-serial schedule is adopted. Basically the check nodes can be divided into several groups, i.e. layers. The layers are processed one by one while the check nodes in each layer are processed in parallel. Simulation results show that the proposed algorithm not only brings some improvement in error correcting performance but also gives some advantage in VLSI implementation of efficient partially parallel decoders.
In optical communication systems, channel coding is required to exhibit high code rates, superior performance, high throughput, and low complexity. While LDPC codes, adopted as the channel coding standard for 5G, deliver commendable performance, they often struggle to simultaneously achieve high code rates and low bit error rates. In contrast, DGLDPC codes, as an extension of LDPC codes, have been demonstrated to maintain excellent performance even at high code rates. This paper investigates a type of DGLDPC code and integrates it with layered scheduling decoding which is a technique originally developed for LDPC codes. The aim is to leverage their shared advantages: high error-correcting performance, strong structural regularity, and rapid convergence speed.