Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao IEEE Transactions on...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
IEEE Transactions on Wireless Communications
Article . 2013 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
versions View all 1 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Robust ARQ Precoder Optimization for AF MIMO Relay Systems with Channel Estimation Errors

Authors: Zhengyu Zhang; Jie Xu; Ling Qiu;

Robust ARQ Precoder Optimization for AF MIMO Relay Systems with Channel Estimation Errors

Abstract

In this paper, we consider the robust retransmission precoder design for amplify-and-forward (AF) multi-input multi-output (MIMO) relay systems with channel estimation errors. With the objective of minimizing the average mean-squared-error of symbol estimations, we propose a novel progressive retransmission precoder by employing matrix diagonalization and channel pairing. As a consequence, we formulate the precoder design as a joint source/relay power allocation (PA) and channel pairing optimization problem. First, we propose the globally optimal solution, in which exhaustive search is employed for the channel pairing, while with each given channel pairing, an optimal PA algorithm is proposed to solve the nonconvex PA problem by utilizing the necessary conditions for optimality. However, the optimal channel pairing and PA solution is of very high complexity. In order to reduce the complexity, we then propose a suboptimal PA algorithm by iteratively optimizing the PA at the source and the relay, as well as a simplified channel pairing searching method based on the asymptotic optimal solution. It is shown that our proposed robust retransmission precoder improves the system performance significantly, meanwhile, the performance degradation of the low complexity PA and channel pairing algorithm is slight as compared to the optimal PA algorithm and the optimal channel pairing method.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    5
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
5
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!