Threshold Saturation on Channels with Memory via Spatial Coupling
arXiv:1102.0406
Abstract
We consider spatially coupled code ensembles. A particular instance are convolutional LDPC ensembles. It was recently shown that, for transmission over the memoryless binary erasure channel, this coupling increases the belief propagation threshold of the ensemble to the maximum a-posteriori threshold of the underlying component ensemble. This paved the way for a new class of capacity achieving low-density parity check codes. It was also shown empirically that the same threshold saturation occurs when we consider transmission over general binary input memoryless channels. In this work, we report on empirical evidence which suggests that the same phenomenon also occurs when transmission takes place over a class of channels with memory. This is confirmed both by simulations as well as by computing EXIT curves.
Submitted to ISIT 2011
Cited by in corpus (8)
- Spatially Coupled LDPC Codes Constructed from Protographs
- Spatially Coupled Ensembles Universally Achieve Capacity under Belief Propagation
- Memory Efficient Decoders using Spatially Coupled Quasi-Cyclic LDPC Codes
- Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding
- Spatially Coupled LDPC Codes for Decode-and-Forward in Erasure Relay Channel
- Spatially Coupled Codes over the Multiple Access Channel
- Windowed Decoding of Spatially Coupled Codes
- Spatially-Coupled MacKay-Neal Codes Universally Achieve the Symmetric Information Rate of Arbitrary Generalized Erasure Channels with Memory