Title :
On implementation of min-sum algorithm and its modifications for decoding low-density Parity-check (LDPC) codes
Author :
Zhao, Jianguang ; Zarkeshvari, Farhad ; Banihashemi, Amir H.
Author_Institution :
Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada
fDate :
4/1/2005 12:00:00 AM
Abstract :
The effects of clipping and quantization on the performance of the min-sum algorithm for the decoding of low-density parity-check (LDPC) codes at short and intermediate block lengths are studied. It is shown that in many cases, only four quantization bits suffice to obtain close to ideal performance over a wide range of signal-to-noise ratios. Moreover, we propose modifications to the min-sum algorithm that improve the performance by a few tenths of a decibel with just a small increase in decoding complexity. A quantized version of these modified algorithms is also studied. It is shown that, when optimized, modified quantized min-sum algorithms perform very close to, and in some cases even slightly outperform, the ideal belief-propagation algorithm at observed error rates.
Keywords :
decoding; error statistics; optimisation; parity check codes; belief-propagation algorithm; decoding complexity; intermediate block length; low-density parity-check code; min-sum algorithm; signal-to-noise ratio; AWGN; Additive white noise; Broadband communication; Iterative algorithms; Iterative decoding; Parity check codes; Quantization; Signal to noise ratio; Systems engineering and theory; Wireless communication; Clipping; iterative decoding algorithms; low-density parity-check (LDPC) codes; max-product algorithm; max-sum algorithm; min-sum algorithm; modified min-sum algorithms; quantization;
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOMM.2004.836563