对下行混合NOMA网络功率最小化的再思考

IF 3.7 3区 计算机科学 Q2 TELECOMMUNICATIONS
Ximing Xie;Fang Fang;Xianbin Wang
{"title":"对下行混合NOMA网络功率最小化的再思考","authors":"Ximing Xie;Fang Fang;Xianbin Wang","doi":"10.1109/LCOMM.2025.3548041","DOIUrl":null,"url":null,"abstract":"This letter investigates the problem of minimizing total transmission power in a downlink multi-user hybrid non-orthogonal multiple access (H-NOMA) network. The system consists of an access point (AP) equipped with multiple antennas serving multiple single-antenna users, divided into clusters. A closed-form beamforming solution is derived to achieve near optimal performance for the case where each cluster contains two users. The proposed solution significantly reduces reducing computational complexity compared to existing semidefinite programming (SDP) approaches. Based on the derived beamforming solution, an efficient grouping strategy is proposed to determine the optimal clustering plan for users. Simulation results show that the proposed approach outperforms conventional methods, such as orthogonal multiple access (OMA), zero-forcing (ZF), and other clustering benchmarks. It also has competitive performance compared to dirty paper coding (DPC), in terms of total transmission power reduction.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"953-957"},"PeriodicalIF":3.7000,"publicationDate":"2025-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Rethinking Power Minimization in a Downlink Hybrid NOMA Network\",\"authors\":\"Ximing Xie;Fang Fang;Xianbin Wang\",\"doi\":\"10.1109/LCOMM.2025.3548041\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This letter investigates the problem of minimizing total transmission power in a downlink multi-user hybrid non-orthogonal multiple access (H-NOMA) network. The system consists of an access point (AP) equipped with multiple antennas serving multiple single-antenna users, divided into clusters. A closed-form beamforming solution is derived to achieve near optimal performance for the case where each cluster contains two users. The proposed solution significantly reduces reducing computational complexity compared to existing semidefinite programming (SDP) approaches. Based on the derived beamforming solution, an efficient grouping strategy is proposed to determine the optimal clustering plan for users. Simulation results show that the proposed approach outperforms conventional methods, such as orthogonal multiple access (OMA), zero-forcing (ZF), and other clustering benchmarks. It also has competitive performance compared to dirty paper coding (DPC), in terms of total transmission power reduction.\",\"PeriodicalId\":13197,\"journal\":{\"name\":\"IEEE Communications Letters\",\"volume\":\"29 5\",\"pages\":\"953-957\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2025-03-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Communications Letters\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10912507/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"TELECOMMUNICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10912507/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了在下行多用户混合非正交多址(H-NOMA)网络中最小化总传输功率的问题。该系统由一个接入点(AP)组成,该接入点配备了多个天线,为多个单天线用户提供服务,并分为集群。在每个集群包含两个用户的情况下,导出了一种封闭形式的波束形成解决方案,以获得接近最佳的性能。与现有的半确定规划(SDP)方法相比,该方法显著降低了计算复杂度。在此基础上,提出了一种有效的分组策略,以确定用户的最优聚类计划。仿真结果表明,该方法优于传统的聚类方法,如正交多址(OMA)、零强迫(ZF)和其他聚类基准。在总传输功率降低方面,与脏纸编码(DPC)相比,它也具有竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Rethinking Power Minimization in a Downlink Hybrid NOMA Network
This letter investigates the problem of minimizing total transmission power in a downlink multi-user hybrid non-orthogonal multiple access (H-NOMA) network. The system consists of an access point (AP) equipped with multiple antennas serving multiple single-antenna users, divided into clusters. A closed-form beamforming solution is derived to achieve near optimal performance for the case where each cluster contains two users. The proposed solution significantly reduces reducing computational complexity compared to existing semidefinite programming (SDP) approaches. Based on the derived beamforming solution, an efficient grouping strategy is proposed to determine the optimal clustering plan for users. Simulation results show that the proposed approach outperforms conventional methods, such as orthogonal multiple access (OMA), zero-forcing (ZF), and other clustering benchmarks. It also has competitive performance compared to dirty paper coding (DPC), in terms of total transmission power reduction.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Communications Letters
IEEE Communications Letters 工程技术-电信学
CiteScore
8.10
自引率
7.30%
发文量
590
审稿时长
2.8 months
期刊介绍: The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信