Maximization of sum-rate capacity in MU-MIMO Broadcast system with computationally efficient algorithms

IF 2 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC
Swadhin Kumar Mishra , Lipsikha Padhy , Arunanshu Mahapatro , Prabina Pattanayak
{"title":"Maximization of sum-rate capacity in MU-MIMO Broadcast system with computationally efficient algorithms","authors":"Swadhin Kumar Mishra ,&nbsp;Lipsikha Padhy ,&nbsp;Arunanshu Mahapatro ,&nbsp;Prabina Pattanayak","doi":"10.1016/j.phycom.2025.102653","DOIUrl":null,"url":null,"abstract":"<div><div>The aim of this paper is to optimize the sum-rate in a wireless system with multiple users and multiple inputs and multiple outputs (MU-MIMO). The optimal value of the channel rate is achieved using the dirty paper coding (DPC) technique. But the DPC is accompanied by a large computational complexity and a requirement for complete channel state information (CSI) at the transmitter. The complexity of the system grows exponentially with the number of users. So, the DPC is practically prohibitive in networks with low latency and high data rate requirements. To achieve near-optimal channel capacity in a MU-MIMO broadcast (BC) system, we apply meta-heuristic optimization methods to select an optimal set of antennas from both the base station (BS) and receiver side. The selection process is accomplished by recently developed arithmetic optimization algorithm (AOA) and golden jackal optimization (GJO) algorithms, and it is seen that these optimization strategies provide almost the same throughput as DPC. Along with that, the computational and temporal complexity of the optimization algorithms is insignificant in comparison to the complexity of DPC. We propose modified versions of the GJO and AOA algorithms and utilize them in the MU-MIMO and also in massive MIMO systems. The results show that, in terms of throughput, the AOA algorithm outperforms the GJO algorithm in the MIMO BC system as well as in massive MIMO system.</div></div>","PeriodicalId":48707,"journal":{"name":"Physical Communication","volume":"71 ","pages":"Article 102653"},"PeriodicalIF":2.0000,"publicationDate":"2025-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Physical Communication","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1874490725000564","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

The aim of this paper is to optimize the sum-rate in a wireless system with multiple users and multiple inputs and multiple outputs (MU-MIMO). The optimal value of the channel rate is achieved using the dirty paper coding (DPC) technique. But the DPC is accompanied by a large computational complexity and a requirement for complete channel state information (CSI) at the transmitter. The complexity of the system grows exponentially with the number of users. So, the DPC is practically prohibitive in networks with low latency and high data rate requirements. To achieve near-optimal channel capacity in a MU-MIMO broadcast (BC) system, we apply meta-heuristic optimization methods to select an optimal set of antennas from both the base station (BS) and receiver side. The selection process is accomplished by recently developed arithmetic optimization algorithm (AOA) and golden jackal optimization (GJO) algorithms, and it is seen that these optimization strategies provide almost the same throughput as DPC. Along with that, the computational and temporal complexity of the optimization algorithms is insignificant in comparison to the complexity of DPC. We propose modified versions of the GJO and AOA algorithms and utilize them in the MU-MIMO and also in massive MIMO systems. The results show that, in terms of throughput, the AOA algorithm outperforms the GJO algorithm in the MIMO BC system as well as in massive MIMO system.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Physical Communication
Physical Communication ENGINEERING, ELECTRICAL & ELECTRONICTELECO-TELECOMMUNICATIONS
CiteScore
5.00
自引率
9.10%
发文量
212
审稿时长
55 days
期刊介绍: PHYCOM: Physical Communication is an international and archival journal providing complete coverage of all topics of interest to those involved in all aspects of physical layer communications. Theoretical research contributions presenting new techniques, concepts or analyses, applied contributions reporting on experiences and experiments, and tutorials are published. Topics of interest include but are not limited to: Physical layer issues of Wireless Local Area Networks, WiMAX, Wireless Mesh Networks, Sensor and Ad Hoc Networks, PCS Systems; Radio access protocols and algorithms for the physical layer; Spread Spectrum Communications; Channel Modeling; Detection and Estimation; Modulation and Coding; Multiplexing and Carrier Techniques; Broadband Wireless Communications; Wireless Personal Communications; Multi-user Detection; Signal Separation and Interference rejection: Multimedia Communications over Wireless; DSP Applications to Wireless Systems; Experimental and Prototype Results; Multiple Access Techniques; Space-time Processing; Synchronization Techniques; Error Control Techniques; Cryptography; Software Radios; Tracking; Resource Allocation and Inference Management; Multi-rate and Multi-carrier Communications; Cross layer Design and Optimization; Propagation and Channel Characterization; OFDM Systems; MIMO Systems; Ultra-Wideband Communications; Cognitive Radio System Architectures; Platforms and Hardware Implementations for the Support of Cognitive, Radio Systems; Cognitive Radio Resource Management and Dynamic Spectrum Sharing.
×
引用
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学术官方微信