Equalization Algorithms for MIMO Communication Systems Based on Factor Graphs

Description

In this paper, we consider a bit-interleaved coded spatial multiplexing MIMO communication system over a frequency-selective MIMO channel. We present a factor-graph-based derivation of two different equalization algorithms. To this end, we propose a cycle-free factor graph representation of the equalizer, to which we apply the sum-product algorithm (SPA). By using different message representations in the SPA, it is shown that the resulting equalization algorithms correspond to the optimal MAP equalizer and the low-complexity LMMSE equalizer, respectively. Both algorithms can be used in turbo processing and we demonstrate that after 3 iterations the BER performance of the LMMSE equalizer is similar to that of the MAP equalizer.

Period	08 Jun 2011
Event title	IEEE International Conference on Communications ICC2011
Event type	Conference
Location	JapanShow on map