Search

This paper investigates the optimal design issue of general two-hop amplify-and-forward (AF) MIMO relay networks with one source, one destination and multiple relays, each having multiple antennas. Beginning with the study of the mean-square error (MSE) matrix of the system and the use of Wiener filter for the destination processing, a constrained optimization problem with respect to the unknown relay precoder matrix is formulated with a goal of minimizing the total relay transmit power subject to the MSE-based quality of service (QoS) requirement on each data stream. As the original optimization problem is very difficult to solve, a lower bound of the cost function is pursued to achieve an approximate optimization problem. The modified problem is then solved under the perfect channel state information (CSI) condition using the diagonalization method along with the majorization theory to obtain optimal relay precoder with either nonoptimal or optimal source precoding. It is shown that a convex relay precoding solution is available in the case of nonoptimal source precoding whereas a joint optimal source and relay precoder can be obtained through a multilevel waterfilling algorithm. The optimal design of the relay network under imperfect CSI condition is also considered by modifying the optimization problem with the channel mean and covariance matrix, leading to a robust optimization design of the relay precoder. The proposed technique is validated by Monto Carlo simulations and is also compared with one existing method. [ABSTRACT FROM AUTHOR]

In this paper, we first derive an optimal precoder for amplify-and-forward (AF) multiple-antenna relay systems with single-antenna source and destination terminals by maximizing the output signal-to-noise ratio (SNR). Then, the resulting maximum SNR expression and its approximation at high transmission SNR are analyzed to obtain their statistical properties for independently identically distributed (i.i.d.) Rayleigh fading channels. Based on the properties of the approximate maximum SNR, the average symbol error probability (ASEP) is investigated, leading to an explicit diversity order and array gain. The ergodic achievable rate is also studied, giving a tight closed-form upper bound. The theoretical analysis is finally validated by Monte Carlo simulations. [ABSTRACT FROM AUTHOR]