Reduced-Complexity Decoding of LDPC Codes

@article{citeulike:474284, abstract = {Various log-likelihood-ratio-based belief-propagation (LLR-BP) decoding algorithms and their reduced-complexity derivatives for low-density parity-check (LDPC) codes are presented. Numerically accurate representations of the check-node update computation used in LLR-BP decoding are described. Furthermore, approximate representations of the decoding computations are shown to achieve a reduction in complexity by simplifying the check-node update, or symbol-node update, or both. In particular, two main approaches for simplified check-node updates are presented that are based on the so-called min-sum approximation coupled with either a normalization term or an additive offset term. Density evolution is used to analyze the performance of these decoding algorithms, to determine the optimum values of the key parameters, and to evaluate finite quantization effects. Simulation results show that these reduced-complexity decoding algorithms for LDPC codes achieve a performance very close to that of the BP algorithm. The unified treatment of decoding techniques for LDPC codes presented here provides flexibility in selecting the appropriate scheme from performance, latency, computational-complexity, and memory-requirement perspectives.}, author = {Chen, J. and Dholakia, A. and Eleftheriou, E. and Fossorier, M. P. C. and Hu, X. Y. }, citeulike-article-id = {474284}, journal = {Communications, IEEE Transactions on}, number = {8}, pages = {1288--1299}, posted-at = {2006-01-21 20:04:22}, priority = {2}, title = {Reduced-Complexity Decoding of LDPC Codes}, url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1495850}, volume = {53}, year = {2005} }

TY - JOUR ID - citeulike:474284 L3 - citeulike-article-id:474284 N2 - Various log-likelihood-ratio-based belief-propagation (LLR-BP) decoding algorithms and their reduced-complexity derivatives for low-density parity-check (LDPC) codes are presented. Numerically accurate representations of the check-node update computation used in LLR-BP decoding are described. Furthermore, approximate representations of the decoding computations are shown to achieve a reduction in complexity by simplifying the check-node update, or symbol-node update, or both. In particular, two main approaches for simplified check-node updates are presented that are based on the so-called min-sum approximation coupled with either a normalization term or an additive offset term. Density evolution is used to analyze the performance of these decoding algorithms, to determine the optimum values of the key parameters, and to evaluate finite quantization effects. Simulation results show that these reduced-complexity decoding algorithms for LDPC codes achieve a performance very close to that of the BP algorithm. The unified treatment of decoding techniques for LDPC codes presented here provides flexibility in selecting the appropriate scheme from performance, latency, computational-complexity, and memory-requirement perspectives. IS - 8 JF - Communications, IEEE Transactions on EP - 1299 TI - Reduced-Complexity Decoding of LDPC Codes VL - 53 SP - 1288 AU - Chen, J AU - Dholakia, A AU - Eleftheriou, E AU - Fossorier, MPC AU - Hu, XY PY - 2005/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1495850 ER -