Precoder design for MU-MISO transmission with guaranteed QoS constraints

Padmanabhan, Ayswarya; Tölli, Antti; Juntti, Markku; Tran, Le-Nam (2016-06-27)
 
Avaa tiedosto
Lataukset: 

URL:
http://ieeexplore.ieee.org/document/7499293/

Padmanabhan, Ayswarya
Tölli, Antti
Juntti, Markku
Tran, Le-Nam
Institute of Electrical and Electronics Engineers
27.06.2016

A. Padmanabhan, A. Toelli, M. Juntti and L. N. Tran, "Precoder Design for MU-MISO Transmission with Guaranteed QoS Constraints," European Wireless 2016; 22th European Wireless Conference, Oulu, Finland, 2016, pp. 1-5. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7499293&isnumber=7499250

https://rightsstatements.org/vocab/InC/1.0/
© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
https://rightsstatements.org/vocab/InC/1.0/
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2018062926684
Tiivistelmä

Abstract

We study the problem of designing transmit beamformer for maximizing the weight sum rate of a multi-user (MU)-multiple-input single-output (MISO) interference broadcast channel (IBC) with individual quality-of-service (QoS) constraints. The considered problem is known to be nonconvex and NP-hard indeed, and most of existing high-performance solutions are based on the centralized method. In this paper, we propose a distributed approach for the weighted sum rate maximization (WSRM) problem with QoS constraints by combining successive convex approximation (SCA) framework and the alternating directions method of multipliers (ADMM) technique. More specifically, the proposed algorithm extends a current centralized solution, where the SCA is used to arrive at an approximate convex problem at each step of the iterative procedure. The idea is that we apply the ADMM technique to solve the convex problem of the SCA based subproblem in a distributed manner. We also discuss some heuristic ways to accelerate the convergence rate of the proposed algorithm. Numerical simulations are provided to compare different models for both centralized and distributed algorithms.

Kokoelmat