有限块长上行多组MIMO-NOMA的传输设计

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Yuan Yin , Yiyang Zhang , Jiaheng Wang , Ningxing Shen , Jianli Guo , Kang Zheng
{"title":"有限块长上行多组MIMO-NOMA的传输设计","authors":"Yuan Yin ,&nbsp;Yiyang Zhang ,&nbsp;Jiaheng Wang ,&nbsp;Ningxing Shen ,&nbsp;Jianli Guo ,&nbsp;Kang Zheng","doi":"10.1016/j.comnet.2025.111313","DOIUrl":null,"url":null,"abstract":"<div><div>Non-orthogonal multiple access (NOMA) with multiple-input multiple-output (MIMO) is one of the promising candidates to support massive connectivity and improve spectral efficiency for wireless communications. To apply MIMO–NOMA in practical applications, finite blocklength has to be considered. In this article, we explore the finite blocklength transmission design for uplink MIMO–NOMA with group successive interference cancellation (GSIC). We employ the effective throughput as the performance metric to balance the transmission rate and error performance in the finite blocklength regime. To maximize the system effective throughput, we formulate a joint optimization problem of the precoding vectors, equalization vectors, and transmission rates. Since this joint resource allocation is complex and non-convex, we decompose it into two subproblems, i.e., the joint transceiver design and transmission rate adaptation. We first propose an effective algorithm based on the principles of successive convex approximation (SCA) and alternating optimization to provide a joint transceiver design. Then, we derive a semi-closed-form solution of the optimal transmission rates and develop an iterative algorithm to adapt the transmission rates for all the users. Finally, we propose a joint resource allocation algorithm based on block coordinate descent (BCD). Simulation results demonstrate the performance gains by optimizing the transceiver design and transmission rates, which proves the superiority of the proposed algorithm.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"266 ","pages":"Article 111313"},"PeriodicalIF":4.4000,"publicationDate":"2025-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Transmission design for uplink multi-group MIMO–NOMA with finite blocklength\",\"authors\":\"Yuan Yin ,&nbsp;Yiyang Zhang ,&nbsp;Jiaheng Wang ,&nbsp;Ningxing Shen ,&nbsp;Jianli Guo ,&nbsp;Kang Zheng\",\"doi\":\"10.1016/j.comnet.2025.111313\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Non-orthogonal multiple access (NOMA) with multiple-input multiple-output (MIMO) is one of the promising candidates to support massive connectivity and improve spectral efficiency for wireless communications. To apply MIMO–NOMA in practical applications, finite blocklength has to be considered. In this article, we explore the finite blocklength transmission design for uplink MIMO–NOMA with group successive interference cancellation (GSIC). We employ the effective throughput as the performance metric to balance the transmission rate and error performance in the finite blocklength regime. To maximize the system effective throughput, we formulate a joint optimization problem of the precoding vectors, equalization vectors, and transmission rates. Since this joint resource allocation is complex and non-convex, we decompose it into two subproblems, i.e., the joint transceiver design and transmission rate adaptation. We first propose an effective algorithm based on the principles of successive convex approximation (SCA) and alternating optimization to provide a joint transceiver design. Then, we derive a semi-closed-form solution of the optimal transmission rates and develop an iterative algorithm to adapt the transmission rates for all the users. Finally, we propose a joint resource allocation algorithm based on block coordinate descent (BCD). Simulation results demonstrate the performance gains by optimizing the transceiver design and transmission rates, which proves the superiority of the proposed algorithm.</div></div>\",\"PeriodicalId\":50637,\"journal\":{\"name\":\"Computer Networks\",\"volume\":\"266 \",\"pages\":\"Article 111313\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2025-04-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1389128625002816\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625002816","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

多输入多输出(MIMO)非正交多址(NOMA)是支持大规模连接和提高无线通信频谱效率的重要技术之一。为了在实际应用中应用MIMO-NOMA,必须考虑有限块长。在本文中,我们探讨了具有组连续干扰消除(GSIC)的上行MIMO-NOMA的有限块长传输设计。我们采用有效吞吐量作为性能指标来平衡有限块长度状态下的传输速率和错误性能。为了最大限度地提高系统的有效吞吐量,我们提出了预编码矢量、均衡矢量和传输速率的联合优化问题。由于该联合资源分配具有复杂性和非凸性,我们将其分解为两个子问题,即联合收发器设计和传输速率自适应。我们首先提出了一种基于连续凸近似(SCA)和交替优化原理的有效算法,以提供联合收发器设计。然后,我们推导了最优传输速率的半封闭解,并开发了一种迭代算法来适应所有用户的传输速率。最后,提出了一种基于块坐标下降(BCD)的联合资源分配算法。仿真结果表明,通过优化收发器设计和传输速率,可以提高系统的性能,验证了该算法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Transmission design for uplink multi-group MIMO–NOMA with finite blocklength
Non-orthogonal multiple access (NOMA) with multiple-input multiple-output (MIMO) is one of the promising candidates to support massive connectivity and improve spectral efficiency for wireless communications. To apply MIMO–NOMA in practical applications, finite blocklength has to be considered. In this article, we explore the finite blocklength transmission design for uplink MIMO–NOMA with group successive interference cancellation (GSIC). We employ the effective throughput as the performance metric to balance the transmission rate and error performance in the finite blocklength regime. To maximize the system effective throughput, we formulate a joint optimization problem of the precoding vectors, equalization vectors, and transmission rates. Since this joint resource allocation is complex and non-convex, we decompose it into two subproblems, i.e., the joint transceiver design and transmission rate adaptation. We first propose an effective algorithm based on the principles of successive convex approximation (SCA) and alternating optimization to provide a joint transceiver design. Then, we derive a semi-closed-form solution of the optimal transmission rates and develop an iterative algorithm to adapt the transmission rates for all the users. Finally, we propose a joint resource allocation algorithm based on block coordinate descent (BCD). Simulation results demonstrate the performance gains by optimizing the transceiver design and transmission rates, which proves the superiority of the proposed algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
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学术官方微信