Advanced

Iterative receivers with channel estimation for multi-user MIMO-OFDM: complexity and performance

Hammarberg, Peter LU ; Rusek, Fredrik LU and Edfors, Ove LU (2012) In Eurasip Journal on Wireless Communications and Networking p.1-17
Abstract (Swedish)
Abstract in Undetermined

A family of iterative receivers is evaluated in terms of complexity and performance for the case of an uplink multi-user (MU) multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) system. The transmission over block fading channels is considered. The analyzed class of receivers is performing channel estimation inside the iterative detection loop, which has been shown to improve estimation performance. As part of our results we illustrate the ability of this type of receiver to reduce the required amount of pilot symbols. A remaining question to ask is which combinations of estimation and detection algorithms that provide the best trade-off between performance and... (More)
Abstract in Undetermined

A family of iterative receivers is evaluated in terms of complexity and performance for the case of an uplink multi-user (MU) multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) system. The transmission over block fading channels is considered. The analyzed class of receivers is performing channel estimation inside the iterative detection loop, which has been shown to improve estimation performance. As part of our results we illustrate the ability of this type of receiver to reduce the required amount of pilot symbols. A remaining question to ask is which combinations of estimation and detection algorithms that provide the best trade-off between performance and complexity. We address this issue by considering MU detectors and channel estimators, with varying algorithm complexity. For MU detection, two algorithms based on parallel interference cancellation (PIC) are considered and compared with the optimal symbol-wise maximum a-posteriori probability (MAP) detector. For channel estimation, an algorithm performing joint minimum-mean-square-error (MMSE) estimation is considered along with a low complexity replica making use of a Krylov subspace method. An estimator based on the space alternating generalized expectation-maximization (SAGE) algorithm is also considered. Our results show that low-complexity algorithms provide the best tradeoff, even though more receiver iterations are needed to reach a desired performance. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
MIMO, OFDM, multi-user detection, iterative receiver, complexity, channel estimation
in
Eurasip Journal on Wireless Communications and Networking
pages
1 - 17
publisher
Hindawi Publishing Corporation
external identifiers
  • wos:000302899100001
  • scopus:84872873674
ISSN
1687-1472
DOI
10.1186/1687-1499-2012-75
project
Radiosystem: NORDITE/WILATI - WIreless LANs with high Throughput in Interference-limited environments (VINNOVA, AM/FT/OE)
language
English
LU publication?
yes
id
b6260fa6-1505-4b59-afd4-7d7dc746d30a (old id 2293945)
date added to LUP
2012-01-20 12:31:57
date last changed
2017-11-12 03:06:14
@article{b6260fa6-1505-4b59-afd4-7d7dc746d30a,
  abstract     = {<b>Abstract in Undetermined</b><br/><br>
A family of iterative receivers is evaluated in terms of complexity and performance for the case of an uplink multi-user (MU) multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) system. The transmission over block fading channels is considered. The analyzed class of receivers is performing channel estimation inside the iterative detection loop, which has been shown to improve estimation performance. As part of our results we illustrate the ability of this type of receiver to reduce the required amount of pilot symbols. A remaining question to ask is which combinations of estimation and detection algorithms that provide the best trade-off between performance and complexity. We address this issue by considering MU detectors and channel estimators, with varying algorithm complexity. For MU detection, two algorithms based on parallel interference cancellation (PIC) are considered and compared with the optimal symbol-wise maximum a-posteriori probability (MAP) detector. For channel estimation, an algorithm performing joint minimum-mean-square-error (MMSE) estimation is considered along with a low complexity replica making use of a Krylov subspace method. An estimator based on the space alternating generalized expectation-maximization (SAGE) algorithm is also considered. Our results show that low-complexity algorithms provide the best tradeoff, even though more receiver iterations are needed to reach a desired performance.},
  author       = {Hammarberg, Peter and Rusek, Fredrik and Edfors, Ove},
  issn         = {1687-1472},
  keyword      = {MIMO,OFDM,multi-user detection,iterative receiver,complexity,channel estimation},
  language     = {eng},
  pages        = {1--17},
  publisher    = {Hindawi Publishing Corporation},
  series       = {Eurasip Journal on Wireless Communications and Networking},
  title        = {Iterative receivers with channel estimation for multi-user MIMO-OFDM: complexity and performance},
  url          = {http://dx.doi.org/10.1186/1687-1499-2012-75},
  year         = {2012},
}