Unified design of iterative receivers using factor graphs
Iterative algorithms are an attractive approach to approximating optimal, but high-complexity, joint channel estimation and decoding receivers fur communication systems. We present a unified approach based on factor graphs for deriving iterative message-passing receiver algorithms for channel estimation and decoding. For many common channels, it is easy to find simple graphical models that lead directly to implementable algorithms. Canonical distributions provide a new, general framework for handling continuous variables. Example receiver designs for Rayleigh fading channels with block or Markov memory, and multipath fading channels with fixed unknown coefficients illustrate the effectiveness of our approach.
channel estimation fading channels iterative decoding low-density parity-check (ldpc) codes