Joint Linear Processing for an Amplify-and-Forward MIMO Relay Channel with Imperfect Channel State Information

• Main Authors: Vandendorpe Luc, Chalise BatuK
• Format: Article
• Language: English
• Published: SpringerOpen 2010-01-01
• Series: EURASIP Journal on Advances in Signal Processing
• Online Access: http://asp.eurasipjournals.com/content/2010/640186
• ISSN: 1687-6172; 1687-6180

<p/> <p>The problem of jointly optimizing the source precoder, relay transceiver, and destination equalizer has been considered in this paper for a multiple-input-multiple-output (MIMO) amplify-and-forward (AF) relay channel, where the channel estimates of all links are assumed to be imperfect. The considered joint optimization problem is nonconvex and does not offer closed-form solutions. However, it has been shown that the optimization of one variable when others are fixed is a convex optimization problem which can be efficiently solved using interior-point algorithms. In this context, an iterative technique with the guaranteed convergence has been proposed for the AF MIMO relay channel that includes the direct link. It has been also shown that, for the double-hop relay case without the receive-side antenna correlations in each hop, the global optimality can be confirmed since the structures of the source precoder, relay transceiver, and destination equalizer have closed forms and the remaining joint power allocation can be solved using Geometric Programming (GP) technique under high signal-to-noise ratio (SNR) approximation. In the latter case, the performance of the iterative technique and the GP method has been compared with simulations to ensure that the iterative approach gives reasonably good solutions with an acceptable complexity. Moreover, simulation results verify the robustness of the proposed design when compared to the nonrobust design that assumes estimated channels as actual channels.</p>