A Simplified Min-Sum Decoding Algorithm for Non-Binary LDPC Codes

TL;DR

This paper introduces a simplified decoding algorithm for non-binary LDPC codes that reduces computational complexity and memory usage while maintaining near-optimal performance, enabling efficient hardware implementation.

Contribution

It proposes an approximation method for check node processing based on combinatorial optimization, improving efficiency over existing algorithms.

Findings

Small performance loss compared to traditional decoding under AWGN and Rayleigh fading channels.

Significant hardware savings achieved with the new reduced-complexity scheme.

Effective performance-complexity tradeoff demonstrated through simulations.

Abstract

Non-binary low-density parity-check codes are robust to various channel impairments. However, based on the existing decoding algorithms, the decoder implementations are expensive because of their excessive computational complexity and memory usage. Based on the combinatorial optimization, we present an approximation method for the check node processing. The simulation results demonstrate that our scheme has small performance loss over the additive white Gaussian noise channel and independent Rayleigh fading channel. Furthermore, the proposed reduced-complexity realization provides significant savings on hardware, so it yields a good performance-complexity tradeoff and can be efficiently implemented.