Power Allocation in Two-Hop Amplify-and-Forward MIMO Relay Systems with QoS requirements

TL;DR

This paper introduces a novel, low-complexity method for power allocation in two-hop MIMO relay systems that efficiently approximates optimal solutions while satisfying QoS constraints.

Contribution

It proposes a new approach to approximate non-convex power allocation problems with convex ones in MIMO relay networks, reducing computational complexity.

Findings

The proposed method closely approximates optimal power allocation solutions.

Simulations demonstrate improved efficiency over existing bounds and relaxations.

The approach is applicable to both linear and non-linear transceiver architectures.

Abstract

The problem of minimizing the total power consumption while satisfying different quality-of-service (QoS) requirements in a two-hop multiple-input multiple-output network with a single non-regenerative relay is considered. As shown by Y. Rong in [1], the optimal processing matrices for both linear and non-linear transceiver architectures lead to the diagonalization of the source-relay-destination channel so that the power minimization problem reduces to properly allocating the available power over the established links. Unfortunately, finding the solution of this problem is numerically difficult as it is not in a convex form. To overcome this difficulty, existing solutions rely on the computation of upper- and lower-bounds that are hard to obtain or require the relaxation of the QoS constraints. In this work, a novel approach is devised for both linear and non-linear transceiver architectures, which allows to closely approximate the solutions of the non-convex power allocation problems with those of convex ones easy to compute in closed-form by means of multi-step procedures of reduced complexity. Computer simulations are used to assess the performance of the proposed approach and to make comparisons with alternatives.