The extended min-sum (ems) and improved ems (I-ems) algorithms for non-binary low-density parity-check codes over GF(q) significantly reduce the decoding complexity with an acceptable performance degradation, but they...
详细信息
The extended min-sum (ems) and improved ems (I-ems) algorithms for non-binary low-density parity-check codes over GF(q) significantly reduce the decoding complexity with an acceptable performance degradation, but they suffer from high latency because of many serial computations, including a sorting process. On the other hand, the trellis-based ems algorithm can greatly reduce the latency, but it does not solve the complexity problem in high-order fields (q >= 64). To improve the latency problem with low-complexity advantages, the authors propose heap-basedems (H-ems) and heap-based I-ems (HI-ems) algorithms that are modifications of the ems and I-emsalgorithms, respectively. The authors also propose double H-ems and double HI-emsalgorithms trading off the latency against the performance by heaping messages twice. Numerical results show that the H-emsalgorithm has 2.74-9.52 times lower latency than the emsalgorithm with a negligible performance degradation over a wide range of code rates, whereas the HI-emsalgorithm has 1.20-1.62 times lower latency than the I-emsalgorithm. Furthermore, the proposed algorithms may be employed regardless of the decoding schedules.
In this study, the authors propose a parallel concatenated decoding (PCD) scheme for short non-binary low-density-parity-check (NB-LDPC) codes. It consists of a reduced trellis extended min-sum (R-Tems) algorithm whic...
详细信息
In this study, the authors propose a parallel concatenated decoding (PCD) scheme for short non-binary low-density-parity-check (NB-LDPC) codes. It consists of a reduced trellis extended min-sum (R-Tems) algorithm which efficiently reduces the check node updating complexity over high-order Galois fields and a low complexity ordered statistic decoding aided by partial cyclic redundancy check bits. The R-Temsalgorithm has a negligible performance loss and noticeable reduction in decoding complexity with respect to the trellis-basedems (Tems) algorithm. Besides, the PCD shows a close error-correction performance when compared with other concatenated decoding schemes for NB-LDPC codes. It achieves a coding gain about 0.5 dB with reasonable complexity contrasted with the Q-ary sum-product algorithm for high-rate short NB-LDPC codes over GF(256).
暂无评论