Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Future Computer and Communication

Selecting error patters based on symbol reliability for OSD algorithm

Dong Zi-jian, Qiao Guo-lei

Published Jan 1, 2010• 1 citation
Publisher

Abstract

A new scheme of selecting error pattern is proposed. OSD algorithm processes certain MRIPs of a received sequence, performs bits flip among MRIPs, forms error patterns, and then generates candidate codeword. The bits flip is equal probability among MRIPs in OSD algorithms, which leads to too many candidates generated, and seriously affects the implement of algorithm. This paper proposes an improved algorithm which adopts unequal probability strategy utilizing the reliability of received symbols. The simulation results show that the proposed algorithm is effective. With little performance degradation, the computational complexity of algorithm can be reduced by 60% or more for one class of LDPC codes.

DOI
10.1109/icfcc.2010.5497428

Related papers

Parallel Decoding Scheme Based on OSD and KNIH Algorithms

Guo Lei Qiao

In this contribution, KNIH algorithm and Ordered Statistic Decoding (OSD) algorithm are investigated, based on which, a novel KNIH-OSD parallel decoding scheme for LDPC codes is proposed. KNIH decoding algorithm processes certain LRPs of a received sequence, while OSD algorithm processes certain MRIPs of a received sequence. If there are too many errors in MRIPs, the OSD algorithm will fail, on the contrary, if there are too many errors in LRPs, the KNIH algorithm will fail. This contribution proposes a parallel decoding scheme based on the complementary characteristic of these two algorithms. Simulation results show that the proposed scheme is feasible and effective. Compared with OSD and KNIH algorithm, the decoding performance is improved.

Advanced materials research•Jan 3, 2012•1 citation

Lowering Error Floor of LDPC Codes Using an Improved Parallel WBF Algorithm

Kexiang Ma, Yongzhao Li, Caizhi Zhu +2 more

In weighted bit-flipping-based algorithms for low-density parity-check (LDPC) codes, due to the existence of overconfident incorrectly received bits, the metric values of the corresponding bits will always be wrong in the decoding process. Since these bits cannot be flipped, decoding failure results. To solve this problem, an improved parallel weighted bit flipping algorithm is proposed. Specifically, a reliability-saturation strategy is adopted to increase the flipping probability of the overconfident incorrectly received bits. Simulation results show that the error floor of LDPC codes is greatly lowered.

ETRI Journal•Jan 29, 2014•4 citations

Reliability-based syndrome decoding of LDPC codes

Guangwen Li, Guangzeng Feng

Aiming at bridge gap between maximum likelihood decoding (MLD) and belief propagation (BP) decoding for short or medium LDPC codes, we present one modified ordered statistics decoding (OSD) reprocessing method, which is serially concatenated with standard BP. Meanwhile, two novel points in implementation are addressed. For one thing, the new definition of bit reliability proposed enhances error-correcting performance via centralizing more decoding errors of standard BP within the scope of order-p OSD where p ≤ 2. For another, one way of reducing computational complexity is put forward in selecting optimal error pattern among all candidates. Simulation results demonstrate our approach could achieve good tradeoff between reprocessing performance and computational complexity. Techniques on further improvement are also discussed briefly. Reliability-based syndrome decoding of LDPC codes 1 I.

•Jan 1, 2007•0 citations

Parallel Maximum Likelihood Decoding Algorithm for RM Codes

Qiao Guo-lei

According to the error-correcting capability complementarity of Chase decoding algorithm and Ordered Statistic Decoding(OSD) algorithm,a new Chase-OSD parallel decoding algorithm for RM codes is proposed,in which,OSD algorithm processes certain MRIPs of a received sequence,while Chase-type decoding algorithm processes certain LRPs of a received sequence.If there are at least i+1 MRIPs of the ordered received sequence in error,OSD algorithm will fail.On the other hand,if the number of errors in the LRPs is large,the Chase-type algorithm will fail.A parallel decoding algorithm based on complementary characteristic is proposed.Simulation experimental results show this algorithm can achieve better decoding performance.

Jisuanji gongcheng•Jan 1, 2009•0 citations

Parallel complementary decoding based on OSD and Chase

Zijian Dong

Ordered Statistic Decoding(OSD) algorithm and Chase algorithm are investigated in this paper,based on which,a new Chase-OSD parallel decoding algorithm for medium and short lengths Low Density Parity-Check(LDPC) codes is proposed.Chasetype decoding algorithm is based on processing certain LRPs of a received sequence,while OSD algorithm is based on processing certain MRIPs of a received sequence.If there are too many errors in MRIPs,the OSD algorithm will fail,while there are too much errors in LRPs,the Chase-type algorithm will fail.A parallel concatenation decoding algorithm is proposed based on that complementary characteristic.The simulation results show that the proposed algorithm is effective.The decoding performance is improved compared with BP-OSD and BP-Chase algorithm.

Computer Engineering and Applications Journal•Jan 1, 2009•0 citations

Symbol Flipping Decoding Algorithms Based on Prediction for Non-Binary LDPC Codes

Shuai Wang, Qin Huang, Zulin Wang

This paper constructs an objective function for symbol flipping decoding algorithms, considering not only soft reliability, but also hard reliability. The maximization of this objective function indicates that the flipping metric should involve both the information before and after symbol flipping, while the existing algorithms consider the information before symbol flipping. Theoretical analysis shows that such prediction mechanism, together with hard reliability, can significantly improve the error performance of symbol flipping algorithms. Simulation results show that the proposed algorithms provide effective tradeoff between error performance and complexity for decoding non-binary LDPC codes.

IEEE Transactions on Communications•Mar 2, 2017•21 citations
A new scheme of selecting error pattern is proposed. OSD algorithm processes certain MRIPs of a received sequence, performs bits flip among MRIPs, forms error patterns, and then generates candidate codeword. The bits flip is equal probability among MRIPs in OSD algorithms, which leads to too many candidates generated, and seriously affects the implement of algorithm. This paper proposes an improved algorithm which adopts unequal probability strategy utilizing the reliability of received symbols. The simulation results show that the proposed algorithm is effective. With little performance degradation, the computational complexity of algorithm can be reduced by 60% or more for one class of LDPC codes.
In this contribution, KNIH algorithm and Ordered Statistic Decoding (OSD) algorithm are investigated, based on which, a novel KNIH-OSD parallel decoding scheme for LDPC codes is proposed. KNIH decoding algorithm processes certain LRPs of a received sequence, while OSD algorithm processes certain MRIPs of a received sequence. If there are too many errors in MRIPs, the OSD algorithm will fail, on the contrary, if there are too many errors in LRPs, the KNIH algorithm will fail. This contribution proposes a parallel decoding scheme based on the complementary characteristic of these two algorithms. Simulation results show that the proposed scheme is feasible and effective. Compared with OSD and KNIH algorithm, the decoding performance is improved.
In weighted bit-flipping-based algorithms for low-density parity-check (LDPC) codes, due to the existence of overconfident incorrectly received bits, the metric values of the corresponding bits will always be wrong in the decoding process. Since these bits cannot be flipped, decoding failure results. To solve this problem, an improved parallel weighted bit flipping algorithm is proposed. Specifically, a reliability-saturation strategy is adopted to increase the flipping probability of the overconfident incorrectly received bits. Simulation results show that the error floor of LDPC codes is greatly lowered.
Aiming at bridge gap between maximum likelihood decoding (MLD) and belief propagation (BP) decoding for short or medium LDPC codes, we present one modified ordered statistics decoding (OSD) reprocessing method, which is serially concatenated with standard BP. Meanwhile, two novel points in implementation are addressed. For one thing, the new definition of bit reliability proposed enhances error-correcting performance via centralizing more decoding errors of standard BP within the scope of order-p OSD where p ≤ 2. For another, one way of reducing computational complexity is put forward in selecting optimal error pattern among all candidates. Simulation results demonstrate our approach could achieve good tradeoff between reprocessing performance and computational complexity. Techniques on further improvement are also discussed briefly. Reliability-based syndrome decoding of LDPC codes 1 I.
According to the error-correcting capability complementarity of Chase decoding algorithm and Ordered Statistic Decoding(OSD) algorithm,a new Chase-OSD parallel decoding algorithm for RM codes is proposed,in which,OSD algorithm processes certain MRIPs of a received sequence,while Chase-type decoding algorithm processes certain LRPs of a received sequence.If there are at least i+1 MRIPs of the ordered received sequence in error,OSD algorithm will fail.On the other hand,if the number of errors in the LRPs is large,the Chase-type algorithm will fail.A parallel decoding algorithm based on complementary characteristic is proposed.Simulation experimental results show this algorithm can achieve better decoding performance.
Ordered Statistic Decoding(OSD) algorithm and Chase algorithm are investigated in this paper,based on which,a new Chase-OSD parallel decoding algorithm for medium and short lengths Low Density Parity-Check(LDPC) codes is proposed.Chasetype decoding algorithm is based on processing certain LRPs of a received sequence,while OSD algorithm is based on processing certain MRIPs of a received sequence.If there are too many errors in MRIPs,the OSD algorithm will fail,while there are too much errors in LRPs,the Chase-type algorithm will fail.A parallel concatenation decoding algorithm is proposed based on that complementary characteristic.The simulation results show that the proposed algorithm is effective.The decoding performance is improved compared with BP-OSD and BP-Chase algorithm.
This paper constructs an objective function for symbol flipping decoding algorithms, considering not only soft reliability, but also hard reliability. The maximization of this objective function indicates that the flipping metric should involve both the information before and after symbol flipping, while the existing algorithms consider the information before symbol flipping. Theoretical analysis shows that such prediction mechanism, together with hard reliability, can significantly improve the error performance of symbol flipping algorithms. Simulation results show that the proposed algorithms provide effective tradeoff between error performance and complexity for decoding non-binary LDPC codes.