Reference : Efficient sum-rate maximization for medium-scale MIMO AF-relay networks
Scientific journals : Article
Engineering, computing & technology : Computer science
Security, Reliability and Trust
Efficient sum-rate maximization for medium-scale MIMO AF-relay networks
Naghsh, M.M. []
Soltanalian, M. []
Stoica, P. []
Masjedi, M. []
Ottersten, Björn mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
IEEE Transactions on Wireless Communications
Institute of Electrical and Electronics Engineers
6400 - 6411
Yes (verified by ORBilu)
New York
[en] MIMO ; Antennas ; Relay networks (telecommunications) ; Algorithm design and analysis ; Optimization ; Approximation algorithms
[en] We consider the problem of sum-rate maximization in multiple-input multiple-output (MIMO) amplify-and-forward relay networks with multi-operator. The aim is to design the MIMO relay amplification matrix (i.e., the relay beamformer) to maximize the achievable communication sum rate through the relay. The design problem for the case of single-antenna users can be cast as a non-convex optimization problem, which, in general, belongs to a class of NP-hard problems. We devise a method based on the minorization-maximization technique to obtain quality solutions to the problem. Each iteration of the proposed method consists of solving a strictly convex unconstrained quadratic program. This task can be done quite efficiently, such that the suggested algorithm can handle the beamformer design for relays with up to ~70 antennas within a few minutes on an ordinary personal computer. Such a performance lays the ground for the proposed method to be employed in medium-scale (or lower regime massive) MIMO scenarios.

File(s) associated to this reference

Fulltext file(s):

Limited access
Efficient sum-rate.pdfPublisher postprint2.02 MBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.