In this paper, we focus on the suboptimality of iterative decoding on graphs with cycles, through examining the use of a reliability-based decoding algorithm for some concatenated codes with an interleaver, known as t...
详细信息
In this paper, we focus on the suboptimality of iterative decoding on graphs with cycles, through examining the use of a reliability-based decoding algorithm for some concatenated codes with an interleaver, known as turbo-like codes. The a posteriori probabilities delivered by the iterative decoding are regarded as reliability information, and an efficient algorithm for the overall linear block code is applied at certain iterations. Simulation results show that the suboptimality of iterative decoding due to cycles can be at least partially compensated by this approach. Some insights about the potential additional coding gains achievable are investigated based on the characteristics of the constituent decoders. These characteristics are related to the nature of suboptimality in the overall iterative decoding. The effects of some code parameters and channel conditions on the behavior of iterative decoding are also studied for a better understanding of its suboptimality.
We propose a soft-decision Reed-Solomon (RS) decoding algorithm, which uses the combined approaches of the Chase and the generalized minimum distance (CMD) algorithms and exploits the recursive property of interpolati...
详细信息
ISBN:
(纸本)9781424420742
We propose a soft-decision Reed-Solomon (RS) decoding algorithm, which uses the combined approaches of the Chase and the generalized minimum distance (CMD) algorithms and exploits the recursive property of interpolation-based RS decoding algorithms. We evaluate the performance of this Chase-CMD type algorithm on perpendicular magnetic recording systems, and present simulation results that show that we can achieve better performance with fairly short latency and lower decoding complexity than the current state-of-art algorithms.
In the weighted bit-reliabilitybased (wBRB) Non-binary LDPC 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-reliabilitybased (wBRB) Non-binary LDPC 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-binary LDPC 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 LDPC codes constructed by different methods and shows better robustness.
暂无评论