Bounds on the Tradeoff Between Decoding Complexity and Rate for Sparse-Graph Codes
Grover, P.
Univ. of California at Berkeley, Berkeley;
This paper appears in: Information Theory Workshop, 2007. ITW '07. IEEE
Publication Date: 2-6 Sept. 2007
On page(s): 196-201
Location: Tahoe City, CA,
ISBN: 1-4244-1564-0
INSPEC Accession Number: 9827067
Digital Object Identifier: 10.1109/ITW.2007.4313073
Current Version Published: 2007-09-24
Abstract
Khandekar and McEliece suggested the problem of per bit decoding complexity for capacity achieving sparse-graph codes as a function of their gap from the channel capacity. We consider the problem for the case of the binary symmetric channel. We derive a lower bound on this complexity for some codes on graphs for Belief Propagation decoding. For bounded degree LDPC and LDGM codes, any concatenation of the two, and punctured bounded-degree LDPC codes, this reduces to a lower bound of O (log (1/isin-)). The proof of this result leads to an interesting necessary condition on the code structures which could achieve capacity with bounded decoding complexity over BSC: the average edge-degree must converge to infinity while the average node-degree must be bounded. That is, one of the node degree distributions must have a finite mean and an infinite variance.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
