Efficient encoding of low-density parity-check codes

by: TJ Richardson, RL Urbanke

Information Theory, IEEE Transactions on, Vol. 47, No. 2. (2001), pp. 638-656.

View FullText article

IEEE Explore

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

marcosmuller

Find related articles with these CiteULike tags

no-tag

摘要

Low-density parity-check (LDPC) codes can be considered serious competitors to turbo codes in terms of performance and complexity and they are based on a similar philosophy: constrained random code ensembles and iterative decoding algorithms. We consider the encoding problem for LDPC codes. More generally we consider the encoding problem for codes specified by sparse parity-check matrices. We show how to exploit the sparseness of the parity-check matrix to obtain efficient encoders. For the (3,6)-regular LDPC code, for example, the complexity of encoding is essentially quadratic in the block length. However, we show that the associated coefficient can be made quite small, so that encoding codes even of length n&sime;100000 is still quite practical. More importantly, we show that “optimized” codes actually admit linear time encoding

@article{citeulike:474698, abstract = {Low-density parity-check (LDPC) codes can be considered serious competitors to turbo codes in terms of performance and complexity and they are based on a similar philosophy: constrained random code ensembles and iterative decoding algorithms. We consider the encoding problem for LDPC codes. More generally we consider the encoding problem for codes specified by sparse parity-check matrices. We show how to exploit the sparseness of the parity-check matrix to obtain efficient encoders. For the (3,6)-regular LDPC code, for example, the complexity of encoding is essentially quadratic in the block length. However, we show that the associated coefficient can be made quite small, so that encoding codes even of length n\&sime;100000 is still quite practical. More importantly, we show that \“optimized\” codes actually admit linear time encoding}, author = {Richardson, T. J. and Urbanke, R. L. }, citeulike-article-id = {474698}, journal = {Information Theory, IEEE Transactions on}, number = {2}, pages = {638--656}, posted-at = {2006-01-21 23:41:41}, priority = {2}, title = {Efficient encoding of low-density parity-check codes}, url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=910579}, volume = {47}, year = {2001} }

RIS record

TY - JOUR ID - citeulike:474698 L3 - citeulike-article-id:474698 TI - Efficient encoding of low-density parity-check codes JF - Information Theory, IEEE Transactions on VL - 47 IS - 2 SP - 638 EP - 656 N2 - Low-density parity-check (LDPC) codes can be considered serious competitors to turbo codes in terms of performance and complexity and they are based on a similar philosophy: constrained random code ensembles and iterative decoding algorithms. We consider the encoding problem for LDPC codes. More generally we consider the encoding problem for codes specified by sparse parity-check matrices. We show how to exploit the sparseness of the parity-check matrix to obtain efficient encoders. For the (3,6)-regular LDPC code, for example, the complexity of encoding is essentially quadratic in the block length. However, we show that the associated coefficient can be made quite small, so that encoding codes even of length n&sime;100000 is still quite practical. More importantly, we show that “optimized” codes actually admit linear time encoding AU - Richardson, TJ AU - Urbanke, RL PY - 2001/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=910579 ER -

RIS BibTeX