LDPC codes over channels with memory
Giulio Colavolpe · 2004
In this paper, the problem of detection and decoding of low-density parity-check (LDPC) codes transmitted over channels with memory is addressed. A general method to build a factor graph which takes into account both the code constraints and the channel behavior is described and the a posteriori probabilities of the transmitted symbols are derived by using the sum-product algorithm. A noncoherent channel and a flat fading channel are considered as examples of application.