The problem of minimizing the total power consumption while satisfying different quality-of-service (QoS) requirements in a two-hop multiple-input multiple-output (MIMO) network with a single nonregenerative relay is considered. As shown by Y. Rong ["Multihop nonregenerative MIMO relays: QoS considerations," IEEE Trans. Signal Process., vol. 59, no. 1, pp. 209-303, 2011] in [1], the optimal processing matrices for both linear and nonlinear 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 nonlinear transceiver architectures, which allows to closely approximate the solutions of the nonconvex power allocation problems with those of convex ones easy to compute in closed-form by means of multistep procedures of reduced complexity. Computer simulations are used to assess the performance of the proposed approach and to make comparisons with alternatives.
Power Allocation in Two-Hop Amplify-and-Forward MIMO Relay Systems with QoS requirements
SANGUINETTI, LUCA;D'AMICO, ANTONIO ALBERTO
2012-01-01
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 (MIMO) network with a single nonregenerative relay is considered. As shown by Y. Rong ["Multihop nonregenerative MIMO relays: QoS considerations," IEEE Trans. Signal Process., vol. 59, no. 1, pp. 209-303, 2011] in [1], the optimal processing matrices for both linear and nonlinear 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 nonlinear transceiver architectures, which allows to closely approximate the solutions of the nonconvex power allocation problems with those of convex ones easy to compute in closed-form by means of multistep procedures of reduced complexity. Computer simulations are used to assess the performance of the proposed approach and to make comparisons with alternatives.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
