论文信息 - Low-complexity decoding of LDPC codes

Low-complexity decoding of LDPC codes

The offset BP-based algorithm is a reduced-complexity derivative of the belief-propagation algorithm for decoding of low-density parity- check codes. It uses a constant offset term to simplify decoding, but at the cost of performance. A method to obtain a 'variable' offset parameter is presented here, to improve the performance of the algorithm.

Bahram Honary | Nishit Pandya | B. Honary | N. Pandya

[1] Ajay Dholakia,et al. Reduced-complexity decoding algorithm for low-density parity-check codes , 2001 .

[2] Ali N. Akansu,et al. Density evolution for low-density parity-check codes under Max-Log-MAP decoding , 2001 .

[3] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[4] Hideki Imai,et al. Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..

[5] Ajay Dholakia,et al. Reduced-complexity decoding of LDPC codes , 2005, IEEE Transactions on Communications.

[6] David J. C. MacKay,et al. Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[7] Jinghu Chen,et al. Density evolution for two improved BP-Based decoding algorithms of LDPC codes , 2002, IEEE Communications Letters.