Globally Optimal Max-Min Rate Joint Channel and Power Allocation for Hybrid NOMA-OMA Downlink Systems

IF 5.8 2区 工程技术 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Signal Processing Pub Date : 2025-03-19 DOI:10.1109/TSP.2025.3553084
Tanin Sultana;Sorina Dumitrescu
{"title":"Globally Optimal Max-Min Rate Joint Channel and Power Allocation for Hybrid NOMA-OMA Downlink Systems","authors":"Tanin Sultana;Sorina Dumitrescu","doi":"10.1109/TSP.2025.3553084","DOIUrl":null,"url":null,"abstract":"This work proposes a globally optimal solution algorithm to the joint power allocation (PA) and channel allocation (CA) problem for downlink hybrid NOMA-OMA systems with the objective of maximizing the minimum user rate. In the hybrid NOMA-OMA scenario, the users are divided into clusters, each cluster shares one channel using NOMA (Non-Orthogonal Multiple Access), while different clusters are assigned channels orthogonally. The optimization problem is converted to the problem of maximizing the user rate under the constraint that all rates be equal. It is further decomposed into PA and CA subproblems, which are solved iteratively. The PA subproblem is handled by first deriving an analytical expression of the total power as a function of the common user rate, and then solving it via bisection search. The CA subproblem keeps the equal-rate assignment fixed and aims to find the CA that minimizes the total power. We prove that the CA subproblem is equivalent to a minimum bipartite graph matching problem, for which efficient algorithms exist. Finally, we demonstrate that the proposed iterative algorithm converges to the globally optimal solution after a finite number of iterations. In addition, we prove that the number of iterations is at most three when the power budget is sufficiently large. Extensive experiments demonstrate the effectiveness of the proposed scheme.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"1674-1690"},"PeriodicalIF":5.8000,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Signal Processing","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10934740/","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

This work proposes a globally optimal solution algorithm to the joint power allocation (PA) and channel allocation (CA) problem for downlink hybrid NOMA-OMA systems with the objective of maximizing the minimum user rate. In the hybrid NOMA-OMA scenario, the users are divided into clusters, each cluster shares one channel using NOMA (Non-Orthogonal Multiple Access), while different clusters are assigned channels orthogonally. The optimization problem is converted to the problem of maximizing the user rate under the constraint that all rates be equal. It is further decomposed into PA and CA subproblems, which are solved iteratively. The PA subproblem is handled by first deriving an analytical expression of the total power as a function of the common user rate, and then solving it via bisection search. The CA subproblem keeps the equal-rate assignment fixed and aims to find the CA that minimizes the total power. We prove that the CA subproblem is equivalent to a minimum bipartite graph matching problem, for which efficient algorithms exist. Finally, we demonstrate that the proposed iterative algorithm converges to the globally optimal solution after a finite number of iterations. In addition, we prove that the number of iterations is at most three when the power budget is sufficiently large. Extensive experiments demonstrate the effectiveness of the proposed scheme.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
混合NOMA-OMA下行系统全局最优最大最小速率联合信道和功率分配
针对以最小用户速率最大化为目标的下行混合NOMA-OMA系统,提出了一种全局最优解算法。在混合NOMA- oma场景中,用户被分成集群,每个集群使用NOMA(非正交多址)共享一个信道,而不同的集群则以正交方式分配信道。将优化问题转化为在所有速率相等的约束下最大化用户速率的问题。将其进一步分解为PA子问题和CA子问题,迭代求解。首先推导出总功率作为普通用户速率的函数的解析表达式,然后通过对分搜索求解PA子问题。CA子问题保持等速率分配固定,旨在找到使总功率最小的CA。我们证明了CA子问题等价于最小二部图匹配问题,并且存在有效的算法。最后,我们证明了所提出的迭代算法在有限次迭代后收敛到全局最优解。此外,我们还证明了在功率预算足够大的情况下,迭代次数最多为3次。大量的实验证明了该方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing 工程技术-工程:电子与电气
CiteScore
11.20
自引率
9.30%
发文量
310
审稿时长
3.0 months
期刊介绍: The IEEE Transactions on Signal Processing covers novel theory, algorithms, performance analyses and applications of techniques for the processing, understanding, learning, retrieval, mining, and extraction of information from signals. The term “signal” includes, among others, audio, video, speech, image, communication, geophysical, sonar, radar, medical and musical signals. Examples of topics of interest include, but are not limited to, information processing and the theory and application of filtering, coding, transmitting, estimating, detecting, analyzing, recognizing, synthesizing, recording, and reproducing signals.
期刊最新文献
Radar Signal Reconstruction in Severe Interference via Robust Tensor Completion Efficient Off-Grid Near-Field Cascade Channel Estimation for XL-IRS Systems via Tucker Decomposition Joint Design of FDA Waveform and Receive Filter for Integrated Detection and Countermeasure Generalized Dilated Array Scheme Exploiting High-Order Virtual Co-Array for a Moving Platform Quantitative Error Feedback for Quantization Noise Reduction of Filtering over Graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1