Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach
Abstract
The paper is focused on the tradeoff between performance and decoding complexity per iteration for LDPC codes in terms of their gap (in rate) to capacity. The study of this tradeoff is done via information-theoretic bounds which also enable to get an indication on the sub-optimality of message-passing iterative decoding algorithms (as compared to optimal ML decoding). The bounds are generalized for parallel channels, and are applied to ensembles of punctured LDPC codes where both intentional and random puncturing are addressed. This work suggests an improvement in the tightness of some information-theoretic bounds which were previously derived by Burshtein et al. and by Sason and Urbanke.
Cite
@article{arxiv.cs/0512075,
title = {Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach},
author = {Igal Sason and Gil Wiechman},
journal= {arXiv preprint arXiv:cs/0512075},
year = {2007}
}
Comments
Accepted for presentation in the Fourth International Symposium on Turbo Codes and Related Topics, Munich, Germany, 3--7 April, 2006