By Topic

Equalization Algorithms for MIMO Communication Systems Based on Factor Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bernhard Etzlinger ; Inst. for Commun. Eng. & RF-Syst., Johannes Kepler Univ., Linz, Austria ; Werner Haselmayr ; Andreas Springer

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.

Published in:

2011 IEEE International Conference on Communications (ICC)

Date of Conference:

5-9 June 2011