Pruning Path Min-Sum Decoding Algorithm for High-Rate Non-Binary LDPC Codes

The fixed path Min-Sum (FMS) algorithm efficiently decodes non-binary LDPC codes with low/moderate code rates, but suffers significant performance degradation for high code rates. This paper enhances its check node (CN) update by selecting deviation paths of high reliability according to their correct probabilities and positions over the trellis of a CN. Moreover, a path pruning strategy is introduced during the CN update to reduce the complexity of path search. Analysis results indicate that the proposed pruning path Min-Sum (PMS) algorithm efficiently decodes high-rate non-binary LDPC codes.