pith. sign in

arxiv: 1111.6682 · v2 · pith:2CM6IGGInew · submitted 2011-11-29 · 💻 cs.IT · math.IT

A General Robust Linear Transceiver Design for Multi-Hop Amplify-and-Forward MIMO Relaying Systems

classification 💻 cs.IT math.IT
keywords designtransceiverrobustmatrixproposedalgorithmamplify-and-forwardchannel
0
0 comments X p. Extension
pith:2CM6IGGI Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{2CM6IGGI}

Prints a linked pith:2CM6IGGI badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

In this paper, linear transceiver design for multi-hop amplify-and-forward (AF) multiple-input multiple-out (MIMO) relaying systems with Gaussian distributed channel estimation errors is investigated. Commonly used transceiver design criteria including weighted mean-square-error (MSE) minimization, capacity maximization, worst-MSE/MAX-MSE minimization and weighted sum-rate maximization, are considered and unified into a single matrix-variate optimization problem. A general robust design algorithm is proposed to solve the unified problem. Specifically, by exploiting majorization theory and properties of matrix-variate functions, the optimal structure of the robust transceiver is derived when either the covariance matrix of channel estimation errors seen from the transmitter side or the corresponding covariance matrix seen from the receiver side is proportional to an identity matrix. Based on the optimal structure, the original transceiver design problems are reduced to much simpler problems with only scalar variables whose solutions are readily obtained by iterative water-filling algorithm. A number of existing transceiver design algorithms are found to be special cases of the proposed solution. The differences between our work and the existing related work are also discussed in detail. The performance advantages of the proposed robust designs are demonstrated by simulation results.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.