Bayesian Equalization for LDPC Channel Decoding Articles uri icon

authors

  • Salamanca, Luis
  • MURILLO FUENTES, JUAN JOSE
  • PEREZ CRUZ, FERNANDO

publication date

  • May 2012

start page

  • 2672

end page

  • 2676

issue

  • 5

volume

  • 60

international standard serial number (ISSN)

  • 1053-587X

electronic international standard serial number (EISSN)

  • 1941-0476

abstract

  • We describe the channel equalization problem, and its prior estimate of the channel state information (CSI), as a joint Bayesian estimation problem to improve each symbol posterior estimates at the input of the channel decoder. Our approach takes into consideration not only the uncertainty due to the noise in the channel, but also the uncertainty in the CSI estimate. However, this solution cannot be computed in linear time, because it depends on all the transmitted symbols. Hence, we also put forward an approximation for each symbol's posterior, using the expectation propagation algorithm, which is optimal from the Kullback-Leibler divergence viewpoint and yields an equalization with a complexity identical to the BCJR algorithm. We also use a graphical model representation of the full posterior, in which the proposed approximation can be readily understood. The proposed posterior estimates are more accurate than those computed using the ML estimate for the CSI. In order to illustrate this point, we measure the error rate at the output of a low-density parity-check decoder, which needs the exact posterior for each symbol to detect the incoming word and it is sensitive to a mismatch in those posterior estimates. For example, for QPSK modulation and a channel with three taps, we can expect gains over 0.5 dB with same computational complexity as the ML receiver.

keywords

  • bayesian inference; bcjr (bahl-cocke-jelinek-raviv) algorithm; channel equalization; expectation propagation; fading channels; intersymbol interference; ldpc coding