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-based ems (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-ems algorithms trading off the latency against the performance by heaping messages twice. Numerical results show that the H-ems algorithm has 2.74-9.52 times lower latency than the ems algorithm with a negligible performance degradation over a wide range of code rates, whereas the hi-ems algorithm has 1.20-1.62 times lower latency than the I-ems algorithm. Furthermore, the proposed algorithms may be employed regardless of the decoding schedules.
暂无评论