Double Iterative Waterfilling for Sum Rate Maximization in Multicarrier NOMA Systems

被引:0
|
作者
Fu, Yaru [1 ]
Salaun, Lou [2 ,3 ]
Sung, Chi Wan [1 ]
Chen, Chung Shue [2 ]
Coupechoux, Marceau [3 ]
机构
[1] City Univ Hong Kong, Tat Chee Ave, Kowloon, Hong Kong, Peoples R China
[2] Nokia Paris Saclay, Bell Labs, F-91620 Nozay, France
[3] Univ Paris Saclay, Telecom ParisTech, LTCI, Paris, France
关键词
Multicarrier non-orthogonal multiple access (MC-NOMA); successive interference cancellation (SIC); iterative waterfilling algorithm (IWA); resource allocation; NONORTHOGONAL MULTIPLE-ACCESS;
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
This paper investigates the subcarrier and power allocation for the downlink of a multicarrier non-orthogonal multiple access (MC-NOMA) system. A three-step algorithm is proposed to deal with the sum rate maximization problem. In Step 1, we assume that each user can use all the subcarriers simultaneously and apply the synchronous iterative waterfilling algorithm (SIWA) to obtain a power vector for each user. In Step 2, subcarriers are assigned to users by a heuristic greedy method based on the achieved power allocation result of Step 1. In Step 3, SIWA is used once again to further improve the system performance with the obtained subcarrier assignment result of Step 2. The convergence of SIWA in Step 3 is proved when the number of multiplexed users is no more than two. Since SIWA is applied twice, we call our three-step method Double Iterative Waterfilling Algorithm (DIWA). Numerical results show that the proposed DIWA achieves comparable performance to an existing near-optimal solution but with much lower time complexity.
引用
收藏
页数:6
相关论文
共 50 条
  • [31] Channel Assignment with Power Allocation for Sum Rate Maximization in NOMA Cellular Networks
    Gupta, Priya
    Ghosh, Debashis
    PROCEEDINGS OF THE 2020 5TH INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION AND SECURITY (ICCCS-2020), 2020,
  • [32] Sum-rate Maximization Guaranteeing User Fairness for NOMA in Fading Channels
    Xing, Hong
    Liu, Yuanwei
    Nallanathan, Arumugam
    Ding, Zhiguo
    2018 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2018,
  • [33] Optimal Sum-Rate Maximization in a NOMA System with Channel Estimation Error
    Zamani, Mohammad Reza
    Eslami, Mohsen
    Khorramizadeh, Mostafa
    26TH IRANIAN CONFERENCE ON ELECTRICAL ENGINEERING (ICEE 2018), 2018, : 720 - 724
  • [34] Sum Rate Maximization of Massive MIMO NOMA in LEO Satellite Communication System
    Gao, Zhixiang
    Liu, Aijun
    Han, Chen
    Liang, Xiaohu
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2021, 10 (08) : 1667 - 1671
  • [35] Multi-Armed Bandit Based Sum Rate Maximization for UAV-Assisted NOMA Communication Systems
    Elsayed, Abeer
    Makkey, Mostafa Y.
    Elnahas, Osama
    2024 14TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING, ICEENG 2024, 2024, : 288 - 293
  • [36] Optimized Shallow Neural Networks for Sum-Rate Maximization in Energy Harvesting Downlink Multiuser NOMA Systems
    Kim, Heasung
    Cho, Taehyun
    Lee, Jungwoo
    Shin, Wonjae
    Vincent Poor, H.
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2021, 39 (04) : 982 - 997
  • [37] Sum power iterative waterfilling for Gaussian vector broadcast channels
    Vishwanath, S
    Rhee, W
    Jindal, N
    Jafar, S
    Goldsmith, A
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 467 - 467
  • [38] Joint rate maximization of downlink and uplink in NOMA SWIPT systems
    Li, Shufeng
    Wan, Zelin
    Jin, Libiao
    PHYSICAL COMMUNICATION, 2021, 46
  • [39] Active Inference for Sum Rate Maximization in UAV-Assisted Cognitive NOMA Networks
    Obite, Felix
    Krayani, Ali
    Alam, Atm S.
    Marcenaro, Lucio
    Nallanathan, Arumugam
    Regazzoni, Carlo
    2023 IEEE 9TH WORLD FORUM ON INTERNET OF THINGS, WF-IOT, 2023,
  • [40] Sum Rate Maximization for NOMA-Based VLC With Optical Intelligent Reflecting Surface
    Liu, Zehao
    Yang, Fang
    Sun, Shiyuan
    Song, Jian
    Han, Zhu
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2023, 12 (05) : 848 - 852