A new two‐stage decoding scheme with unreliable path search to lower the error‐floor for low‐density parity‐check codes. Issue 14 (27th September 2017)

• Record Type: Journal Article
• Authors: Yang, Pilwoong; Jun, Bohwan; No, Jong‐Seon; Park, Hosung
• Is Part Of: IET communications. Volume 11:Issue 14(2017)
• Page Start: 2173
• Page End: 2180
• Publication Date: 2017-09-27
• Subjects: decoding -- parity check codes -- search problems; two‐stage decoding scheme -- low‐density parity‐check codes -- belief propagation decoding algorithm -- first‐stage decoding -- log‐likelihood ratios -- LLR -- second‐stage decoding -- BP decoding algorithm -- parallel unreliable path search algorithm -- error‐floor region; Telecommunication systems -- Periodicals; Speech processing systems -- Periodicals; 621.38205
• DOI: 10.1049/iet-com.2017.0092
• Languages: English
• ISSNs: 1751-8628

Abstract

Abstract : In this study, the authors propose a new two‐stage decoding scheme for low‐density parity‐check codes to lower the error‐floor, which consists of the conventional belief propagation (BP) decoding algorithm as the first‐stage decoding and the re‐decodings with manipulated log‐likelihood ratios (LLRs) of variable nodes as the second‐stage decoding. In the first‐stage decoding, an early stopping criterion is proposed for early detection of decoding failure and the candidate set of the variable nodes are determined, which can be partly included in the small trapping sets. In the second‐stage decoding, the scores of the variable nodes in the candidate set are computed by the proposed unreliable path search algorithm and the variable nodes are sorted in ascending order by their scores for the re‐decoding trials. Each re‐decoding trial is performed by BP decoding algorithm with manipulated LLR of a selected variable node in the candidate set one at a time with the second early stopping criterion. The parallel unreliable path search algorithm is also proposed for practical application of the proposed algorithm. Numerical results show that the proposed early stopping criteria and the proposed decoding algorithms for the second‐stage decoding can correct most of the unsuccessfully decoded codewords by the first‐stage decoding in the error‐floor region.