New sequences of capacity achieving LDPC code ensembles over the binary erasure channel
In this paper, we introduce new sequences (λn, ρnλ) of capacity achieving low-density parity-check (LDPC) code ensembles over the binary erasure channel (BEC). These sequences include the existing sequences by Shokrollahi as a special case. For a fixed code rate R, in the set of proposed sequences, Shokrollahi's sequences are superior to the rest of the set in that for any given value of n, their threshold is closer to the capacity upper bound 1-R. For any given δ, 0 < δ < 1-R, however, there are infinitely many sequences in the set that are superior to Shokrollahi's sequences in that for each of them, there exists an integer number n0, such that for any n > n0, the sequence (λn, ρn) requires a smaller maximum variable node degree as well as a smaller number of constituent variable node degrees to achieve a threshold within δ-neighborhood of the capacity upper bound 1-R. Moreover, we prove that the check-regular subset of the proposed sequences are asymptotically quasioptimal, i.e., their decoding complexity per iteration increases only logarithmically with the relative increase of the threshold. A stronger result on asymptotic optimality of some of the proposed sequences is also established.
|2008 IEEE International Symposium on Information Theory, ISIT 2008|
|Organisation||Department of Systems and Computer Engineering|
Saeedi, H. (Hamid), & Banihashemi, A. (2008). New sequences of capacity achieving LDPC code ensembles over the binary erasure channel. In IEEE International Symposium on Information Theory - Proceedings (pp. 797–801). doi:10.1109/ISIT.2008.4595096