A modified Offset Min-Sum decoding algorithm for LDPC codes
Meng Xu, Jianhui Wu, Meng Zhang
Abstract
Meng Xu, Jianhui Wu, Meng Zhang
Abstract
In this paper a modified Offset Min-Sum decoding algorithm for Low-Density Parity Check Codes is presented. In this modified algorithm, the offset factor in the original Offset Min-Sum algorithm is adjusted iteratively with the assistance of the check-node computation outputs of the Normalized Min-Sum algorithm. As a result, the offset factor in our modified algorithm can be calculated adaptively and more efficiently according to the previous decoding procedure, which can minimize the decoding degradation compared with the Belief Propagation decoding algorithm. The simulation results show that, compared with the original Offset Min-Sum decoding algorithm, our modified algorithm can achieve noticeable performance improvement with minor extra hardware complexity. For example, when BER is 10−5, our algorithm can achieve 0.1dB and 0.2dB decoding gain over Offset Min-Sum algorithm for regular and irregular LDPC codes respectively.
OpenAlex reports 26 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper a modified Offset Min-Sum decoding algorithm for Low-Density Parity Check Codes is presented. In this modified algorithm, the offset factor in the original Offset Min-Sum algorithm is adjusted iteratively with the assistance of the check-node computation outputs of the Normalized Min-Sum algorithm. As a result, the offset factor in our modified algorithm can be calculated adaptively and more efficiently according to the previous decoding procedure, which can minimize the decoding degradation compared with the Belief Propagation decoding algorithm. The simulation results show that, compared with the original Offset Min-Sum decoding algorithm, our modified algorithm can achieve noticeable performance improvement with minor extra hardware complexity. For example, when BER is 10−5, our algorithm can achieve 0.1dB and 0.2dB decoding gain over Offset Min-Sum algorithm for regular and irregular LDPC codes respectively.
Key concepts: Decoding methods, Algorithm, Offset (computer science), Berlekamp–Welch algorithm, Low-density parity-check code, List decoding, Sequential decoding, Computer science