TY - GEN
T1 - Equalization Algorithms for MIMO Communication Systems Based on Factor Graphs
AU - Etzlinger, Bernhard
AU - Haselmayr, Werner
AU - Springer, Andreas
PY - 2011/6
Y1 - 2011/6
N2 - 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.
AB - 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.
UR - https://ieeexplore.ieee.org/document/5963102
U2 - 10.1109/icc.2011.5963102
DO - 10.1109/icc.2011.5963102
M3 - Conference proceedings
SN - 978-1-61284-232-5
T3 - IEEE International Conference on Communications
SP - 1
EP - 5
BT - Proc. of the IEEE International Conference on Communications (ICC 2011)
ER -