Joint iterative decoding of LDPC codes for channels with memory and erasure noise
Published
Conference Paper
This paper investigates the joint iterative decoding of low-density parity-check (LDPC) codes and channels with memory. Sequences of irregular LDPC codes are presented that achieve, under joint iterative decoding, the symmetric information rate of a class of channels with memory and erasure noise. This gives proof, for the first time, that joint iterative decoding can be information rate lossless with respect to maximum-likelihood decoding. These results build on previous capacity-achieving code constructions for the binary erasure channel. A two state intersymbol-interference channel with erasure noise, known as the dicode erasure channel, is used as a concrete example throughout the paper. © 2008 IEEE.
Full Text
Duke Authors
Cited Authors
- Pfister, HD; Siegel, PH
Published Date
- February 1, 2008
Published In
Volume / Issue
- 26 / 2
Start / End Page
- 320 - 337
International Standard Serial Number (ISSN)
- 0733-8716
Digital Object Identifier (DOI)
- 10.1109/JSAC.2008.080209
Citation Source
- Scopus