Evaluation of Error Probability of Iterative Schemes for Channels with Memory

The common technique to perform decoding in channels with memory is to use interleaving, which increases both complexity and delay at the receiver. To overcome these limitations, coding scheme adaptation approaches might be used. One of the approaches is the optimization of long error-correcting codes and the modification of the decoder, taking into account the existence of error bursts. Another traditional approach to coding scheme adaptation that combats error bursts is using product codes under an iterative decoding scheme. The component codes themselves are not able to correct error bursts, but the two-dimensional structure and iterative decoding allow for correcting grouping errors. In this paper, we investigate and compare the performance of the described approaches.