Turbo decoders for Markov channels

We present a decoder for parallel concatenated codes that incorporates a binary-input binary-output Markov channel model, thereby allowing the receiver to utilize the statistical structure of the channel during the decoding process. These decoders can enable reliable communication at rates which are above the capacity of a memoryless channel with the same stationary bit error probability as the Markov channel, and therefore outperform systems based on the traditional approach of using a channel interleaver to create a channel which is assumed to be memoryless.