Referenced Items are not available for this document.
We investigate the behavior of iteratively decoded low-density parity-check (LDPC) codes over the binary erasure channel in the so-called ldquowaterfall region.rdquo We show that the performance curves in this region follow a simple scaling law. We conjecture that essentially the same scaling behavior applies in a much more general setting and we provide some empirical evidence to support this conjecture. The scaling law, together with the error floor expressions developed previously, can be used for a fast finite-length optimization.
Published in:
Information Theory, IEEE Transactions on
(Volume:55
,
Issue:
2
)
Date of Publication: Feb. 2009
- Page(s):
- 473 - 498
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 10471107
- Digital Object Identifier :
- 10.1109/TIT.2008.2009580
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 February 2009
- Issue Date :
- Feb. 2009
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
