Max-Min Fair Precoder Design and Power Allocation for MU-MIMO NOMA

被引:5
|
作者
Yalcin, Ahmet Zahid [1 ]
Cetin, Mustafa Kagan [1 ]
Yuksel, Melda [1 ]
机构
[1] TOBB Univ Econ & Technol, TR-06560 Ankara, Turkey
关键词
NOMA; Optimization; Base stations; Receivers; Downlink; Resource management; Complexity theory; Max-min fairness; mean square error; MIMO; MMSE; precoder design; rate splitting; SDR; SCA;
D O I
10.1109/TVT.2021.3077504
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this correspondence, transmit precoders and their power allocation coefficients are designed jointly for a downlink non-orthogonal multiple access (NOMA) wireless communication system. The objective is to provide max-min fairness (MMF) among the strongest users in each group, while maintaining minimum target rates for all the other users. The proposed solutions are respectively based on semi-definite relaxation (SDR) and successive convex approximation (SCA) and on the minimum mean square error (MMSE) approaches. For the latter approach, a simplification is also suggested to lower complexity. It is shown that while rate-splitting (RS) has the best MMF rates, the low-complexity MMSE approach has the least complexity. Moreover, the SDR/SCA approach offers an excellent tradeoff between the two.
引用
收藏
页码:6217 / 6221
页数:5
相关论文
共 50 条
  • [21] Research on the utility max-min fair algorithm of resource allocation
    Xu, T
    Liao, JX
    PERFORMANCE CHALLENGES FOR EFFICIENT NEXT GENERATION NETWORKS, VOLS 6A-6C, 2005, 6A-6C : 1967 - 1976
  • [22] DMMF: Dominant and Max-Min Fair Allocation in Satellite Networks
    LIN Fuhong
    ZHENG Yi
    ZHOU Xianwei
    Lü Xing
    China Communications, 2015, (S2) : 149 - 154
  • [23] An Approximation Alaorithm for Max-Min Fair Allocation of Indivisible Goods
    Asadpour, Arash
    Saberi, Amin
    STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 114 - 121
  • [24] Modeling max-min fair bandwidth allocation in BitTorrent communities
    Antal, Elvira
    Vinko, Tamas
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2017, 66 (02) : 383 - 400
  • [25] AN APPROXIMATION ALGORITHM FOR MAX-MIN FAIR ALLOCATION OF INDIVISIBLE GOODS
    Asadpour, Arash
    Saberi, Amin
    SIAM JOURNAL ON COMPUTING, 2010, 39 (07) : 2970 - 2989
  • [26] On Max-min Fair Resource Allocation for Distributed Job Execution
    Guan, Yitong
    Li, Chuanyou
    Tang, Xueyan
    PROCEEDINGS OF THE 48TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING (ICPP 2019), 2019,
  • [27] DMMF: Dominant and Max-Min Fair Allocation in Satellite Networks
    Lin Fuhong
    Zheng Yi
    Zhou Xianwei
    Lue Xing
    CHINA COMMUNICATIONS, 2015, 12 (02) : 149 - 154
  • [28] Improving XCP to achieve max-min fair bandwidth allocation
    Yang, Xiaowei
    Lu, Yanbin
    Zan, Lei
    COMPUTER NETWORKS, 2010, 54 (03) : 442 - 461
  • [29] Improving XCP to achieve max-min fair bandwidth allocation
    Zan, Lei
    Yang, Xiaowei
    NETWORKING 2007: AD HOC AND SENSOR NETWORKS, WIRELESS NETWORKS, NEXT GENERATION INTERNET, PROCEEDINGS, 2007, 4479 : 992 - +
  • [30] Algorithms for Max-Min Share Fair Allocation of Indivisible Chores
    Aziz, Haris
    Rauchecker, Gerhard
    Schryen, Guido
    Walsh, Toby
    THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 335 - 341