Comparison of several decoding algorithms for LDPC
Pei Bao-chen
Abstract
Pei Bao-chen
Abstract
The performance and application future of the channel coding is determined by the decoding algorithms.The advantage of the LDPC is the decoding algorithm. This paper introduces several decoding algorithms for LDPC including Log-BP algorithm,Min-Sum algorithm and modified Min-Sum algorithm. Simulations are done for the decoding algorithms which is sent through additive white Gaussian noise (AWGN) channel. The analysis of the Bit Error Performance and the complexity for decoding algorithms is shown that Modified Min-Sum algorithm is the best algorithm which fits for the application of the hardware.
A significance statement is not available in the OpenAlex record.
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.
The performance and application future of the channel coding is determined by the decoding algorithms.The advantage of the LDPC is the decoding algorithm. This paper introduces several decoding algorithms for LDPC including Log-BP algorithm,Min-Sum algorithm and modified Min-Sum algorithm. Simulations are done for the decoding algorithms which is sent through additive white Gaussian noise (AWGN) channel. The analysis of the Bit Error Performance and the complexity for decoding algorithms is shown that Modified Min-Sum algorithm is the best algorithm which fits for the application of the hardware.
Key concepts: Algorithm, Decoding methods, Low-density parity-check code, Berlekamp–Welch algorithm, Additive white Gaussian noise, List decoding, Sequential decoding, Computer science