In the weighted bit-reliability based (wBRB) non-binaryldpc decoding algorithm, using the minimum bit-reliability as the reliability of the entire symbol for information updating significantly decreases the decoding ...
详细信息
In the weighted bit-reliability based (wBRB) non-binaryldpc decoding algorithm, using the minimum bit-reliability as the reliability of the entire symbol for information updating significantly decreases the decoding performance in cases of a large order of Galois field or small column weight. The improved algorithm-MwBRB increases the decoding performance by introducing three kinds of extrinsic information transfer but suffers from high decoding complexity. To address these problems, a BRB non-binaryldpc decoding algorithm based on single-symbol extrinsic information modification is proposed. At the variable node V-j, using a symbol-related reliability calculation method, the maximum reliability information and its corresponding most possible Galois field symbol are obtained, and then transferred to the check node C-i;at the check node C-i, only the most possible Galois field symbol is used for extrinsic information processing, and its reliability of the extrinsic information is represented by the minimum reliability of other Galois field symbols. Finally, at the check node C-i, the extrinsic information is processed by based on the Hamming distance coefficient in terms of bits. Simulation and performance analysis show that the proposed algorithm reduces the complexity by over 50% compared to the MwBRB algorithm, and maintains consistent or slightly superior decoding performance. Additionally, the proposed algorithm exhibits similar decoding performance to ldpccodes constructed by different methods and shows better robustness.
It is well known that non-binary ldpc codes outperform the BER performance of binaryldpccodes for the same code length. The superior BER performance of non-binarycodes comes at the expense of more complex decoding ...
详细信息
ISBN:
(纸本)9781479903573
It is well known that non-binary ldpc codes outperform the BER performance of binaryldpccodes for the same code length. The superior BER performance of non-binarycodes comes at the expense of more complex decoding algorithms that demand higher computational power. In this paper, we propose parallel signal processing algorithms for performing the FFT-SPA and the corresponding decoding of non-binary ldpc codes over GF(q). The constraints imposed by the complex nature of associated subsystems and kernels, in particular the Check Nodes, present computational challenges regarding multicore systems. Experimental results obtained on GPU for a variety of GF(q) show throughputs in the order of 2 Mbps, which is far above from the minimum throughput required, for example, for real-time video applications that can benefit from such error correcting capabilities.
Low-Density Parity-Check(ldpc) Code has become one of the best coding technologies at present because of its low complexity iterative decoding algorithm and its performance with further close to the S
Low-Density Parity-Check(ldpc) Code has become one of the best coding technologies at present because of its low complexity iterative decoding algorithm and its performance with further close to the S
暂无评论