Advanced search
1 file | 798.12 KB

EM based channel estimation in an amplify-and-forward relaying network

Nico Aerts (UGent) , Iancu Avram (UGent) , Dieter Duyck (UGent) and Marc Moeneclaey (UGent)
Author
Organization
Abstract
Cooperative communication offers a way to obtain spatial diversity in a wireless network without increasing hardware demands. The different cooperation protocols proposed in the literature [1] are often studied under the assumption that all channel state information is available at the destination. In a practical scenario, channel estimates need to be derived from the broadcasted signals. In this paper, we study the Amplify-and-Forward protocol and use the expectation-maximization (EM) algorithm to obtain the channel estimates in an iterative way. Our results show that the performance of the system that knows the channels can be approached at the cost of an increased computational complexity. In case a small constellation is used, a low complexity approximation is proposed with a similar performance.
Keywords
EM algorithm, cooperative communication, Amplify-and-Forward, ALGORITHM, Viterbi decoding

Downloads

  • EM based Channel Estimation in an Amplify-and-Forward Relaying Network.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 798.12 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Aerts, Nico, Iancu Avram, Dieter Duyck, and Marc Moeneclaey. 2010. “EM Based Channel Estimation in an Amplify-and-forward Relaying Network.” In Personal, Indoor and Mobile Radio Communications, 21st IEEE International Symposium, Proceedings, 724–729. New York, NY, USA: IEEE.
APA
Aerts, N., Avram, I., Duyck, D., & Moeneclaey, M. (2010). EM based channel estimation in an amplify-and-forward relaying network. Personal, Indoor and Mobile Radio Communications, 21st IEEE International symposium, Proceedings (pp. 724–729). Presented at the 2010 IEEE 21st International symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2010), New York, NY, USA: IEEE.
Vancouver
1.
Aerts N, Avram I, Duyck D, Moeneclaey M. EM based channel estimation in an amplify-and-forward relaying network. Personal, Indoor and Mobile Radio Communications, 21st IEEE International symposium, Proceedings. New York, NY, USA: IEEE; 2010. p. 724–9.
MLA
Aerts, Nico, Iancu Avram, Dieter Duyck, et al. “EM Based Channel Estimation in an Amplify-and-forward Relaying Network.” Personal, Indoor and Mobile Radio Communications, 21st IEEE International Symposium, Proceedings. New York, NY, USA: IEEE, 2010. 724–729. Print.
@inproceedings{1090982,
  abstract     = {Cooperative communication offers a way to obtain spatial diversity in a wireless network without increasing hardware demands. The different cooperation protocols proposed in the literature [1] are often studied under the assumption that all channel state information is available at the destination. In a practical scenario, channel estimates need to be derived from the broadcasted signals. In this paper, we study the Amplify-and-Forward protocol and use the expectation-maximization (EM) algorithm to obtain the channel estimates in an iterative way. Our results show that the performance of the system that knows the channels can be approached at the cost of an increased computational complexity. In case a small constellation is used, a low complexity approximation is proposed with a similar performance.},
  author       = {Aerts, Nico and Avram, Iancu and Duyck, Dieter and Moeneclaey, Marc},
  booktitle    = {Personal, Indoor and Mobile Radio Communications, 21st IEEE International symposium, Proceedings},
  isbn         = {9781424480166},
  keyword      = {EM algorithm,cooperative communication,Amplify-and-Forward,ALGORITHM,Viterbi decoding},
  language     = {eng},
  location     = {Istanbul, Turkey},
  pages        = {724--729},
  publisher    = {IEEE},
  title        = {EM based channel estimation in an amplify-and-forward relaying network},
  url          = {http://dx.doi.org/10.1109/PIMRC.2010.5671627},
  year         = {2010},
}

Altmetric
View in Altmetric
Web of Science
Times cited: