Computer Science – Information Theory
Scientific paper
2007-09-05
Computer Science
Information Theory
Submitted to the IEEE Trans. on Information Theory. This is an extended version of previous versions posted before
Scientific paper
This paper provides some universal information-theoretic bounds related to capacity-approaching ensembles of low-density parity-check (LDPC) codes. These bounds refer to the behavior of the degree distributions of such ensembles, and also to the graphical complexity and the fundamental system of cycles associated with the Tanner graphs of LDPC ensembles. The transmission of these ensembles is assumed to take place over an arbitrary memoryless binary-input output-symmetric (MBIOS) channel. The universality of the bounds derived in this paper stems from the fact that they do not depend on the full characterization of the LDPC ensembles but rather depend on the achievable gap between the channel capacity and the design rate of the ensemble, and also on the required bit error (or erasure) probability at the end of the decoding process. Some of these bounds hold under maximum-likelihood decoding (and hence, they also hold under any sub-optimal decoding algorithm) whereas the others hold particularly under the sum-product iterative decoding algorithm. The tightness of some of these bounds is exemplified numerically for capacity-approaching LDPC ensembles under sum-product decoding; the bounds are reasonably tight for general MBIOS channels, and are tightened for the binary erasure channel.
No associations
LandOfFree
On Universal Properties of Capacity-Approaching LDPC Ensembles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Universal Properties of Capacity-Approaching LDPC Ensembles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Universal Properties of Capacity-Approaching LDPC Ensembles will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-470194