{"title":"Rate Analysis and Optimization of LoS Beyond Diagonal RIS-Assisted MIMO Systems","authors":"Ignacio Santamaria;Jesús Gutiérrez;Mohammad Soleymani;Eduard Jorswieck","doi":"10.1109/LCOMM.2025.3560380","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3560380","url":null,"abstract":"In this letter, we derive an expression for the achievable rate in a multiple-input multiple-output (MIMO) system assisted by a beyond-diagonal reconfigurable intelligent surface (BD-RIS) when the channels to and from the BD-RIS are line-of-sight (LoS) while the direct link is non-line-of-sight (NLoS). The rate expression allows to derive the optimal unitary and symmetric scattering BD-RIS matrix in closed form. Our simulation results show that the proposed solution is competitive even under the more usual Ricean channel fading model when the direct link is weak.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1325-1329"},"PeriodicalIF":3.7,"publicationDate":"2025-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10964306","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144264267","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Satya Chan;Hee Wook Kim;Daesub Oh;Bonjun Ku;Sooyoung Kim
{"title":"Near-Optimal Beam Placement With Low Complexity for Multicast Services in LEO Satellite Networks","authors":"Satya Chan;Hee Wook Kim;Daesub Oh;Bonjun Ku;Sooyoung Kim","doi":"10.1109/LCOMM.2025.3560743","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3560743","url":null,"abstract":"Low-Earth Orbit (LEO) satellite constellations are transforming global communication by providing low-latency and consistent coverage. A critical challenge in LEO systems lies in optimizing beam placement to maximize the minimum bit rate for ground nodes (GNs), particularly for multicast services. This study addresses the computational complexity of existing geometry-based beam placement methods, limiting their scalability. We propose a novel solution that adapts Welzl’s algorithm for beam placement application, and introduces a linear center estimation method based on Taylor series-based approximations. Simulation results demonstrate that our approach achieves near-optimal solutions with significantly reducing complexity, making it well-suited for large-scale LEO satellite networks.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1335-1339"},"PeriodicalIF":3.7,"publicationDate":"2025-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144264181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-Channel Two-Step Matching in High-Density LEO Satellites Network for Diverse User Demands","authors":"Luyao Wang;Mubiao Yan;Hao Zhou;Wenxin Yang;Zhuochen Xie","doi":"10.1109/LCOMM.2025.3560510","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3560510","url":null,"abstract":"This letter addresses the wireless resource scheduling challenge for high-density low-earth orbit (LEO) satellite constellations, catering to the demands of wide-area User Equipments (UEs). Aiming to maximize system capacity, we conceptualize the issue as a multi-branch bipartite graph matching problem with specially designed vertices, and propose an ‘access-right’ based two-step matching mechanism for satellite channel allocation (ARSMM). ARSMM runs in two steps. Firstly, the mechanism employs a Hungarian algorithm based on determining ‘access-right’ to obtain satellite-UE scheduling. Secondly, it introduces a matching adjustment algorithm based on three criteria, respectively, to accommodate the varying channel demands of the UEs. Numerical simulation results indicate that ARSMM markedly improves resource utilization efficiency and system capacity compared to the baseline algorithm. Moreover, it achieves near-parity with the Genetic Algorithm while significantly improving processing speed to millisecond-level efficiency.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1330-1334"},"PeriodicalIF":3.7,"publicationDate":"2025-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144264257","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Deep Q-Network Enabled Low Complexity Beam Alignment for mmWave Massive MIMO System","authors":"Jing Xu;Hua Zhang;Simeng Fan;Wujie Fan","doi":"10.1109/LCOMM.2025.3560334","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3560334","url":null,"abstract":"In this letter, we model the beam alignment problem in millimeter-wave massive MIMO system as a Markov decision process. Given the highly dynamic environment, we leverage deep reinforcement learning to solve the non-convex beam alignment problem. Specifically, by leveraging the locations of the target vehicle and its neighboring vehicles, we propose a deep Q-network (DQN)-based beam alignment algorithm with lower computation complexity. In addition, to address the issue of model obsolescence caused by the changed traffic density, an online mode is elaborated to dynamically adjust to changing environments. Simulation results show that the proposed DQN scheme has better alignment performance and lower complexity than the existing baseline schemes.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1320-1324"},"PeriodicalIF":3.7,"publicationDate":"2025-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144264253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Enhanced Codebook of Sparse Vector Coding Based on Mean-Variance Trade-Off Model for URLLC","authors":"Yifei Yang;Changju Chen;Pengcheng Zhu","doi":"10.1109/LCOMM.2025.3559985","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3559985","url":null,"abstract":"Sparse Vector Coding (SVC) is a novel coding scheme of short packet transmission in Ultra-Reliable Low-Latency Communication (URLLC). SVC is usually modeled as a standard Compressed Sensing (CS) model, so the column correlation coefficient of the encoding dictionary will directly determine the decoding performance. Starting from the point of view of optimizing codebook, this letter will first model the minimization of the maximum column correlation coefficient as a linear integer programming (LIP) problem, and obtain a tighter solution than existing studies. Then, the optimization objective was transformed into statistical parameters of column correlation coefficient distribution and modeled as mean-variance trade-off model, which was a convex optimization problem and optimized by Semi-Definite Programming (SDP) and Modern Portfolio Theory (MPT) respectively, improving the Block Error Ratio (BLER) performance about 1dB and reduced the computational complexity. Simulation results verify the effectiveness of the above algorithms and improve the decoding performance effectively.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1310-1314"},"PeriodicalIF":3.7,"publicationDate":"2025-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144264279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Qiaoyan Peng;Qingqing Wu;Wen Chen;Guangji Chen;Ying Gao;Lexi Xu;Shaodan Ma
{"title":"Semi-Passive IRS Enabled Sensing With Group Movable Sensors","authors":"Qiaoyan Peng;Qingqing Wu;Wen Chen;Guangji Chen;Ying Gao;Lexi Xu;Shaodan Ma","doi":"10.1109/LCOMM.2025.3560075","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3560075","url":null,"abstract":"The performance of the sensing system is limited by the signal attenuation and the number of receiving components. In this letter, we investigate the sensor position selection in a semi-passive intelligent reflecting surface (IRS) enabled non-line-of-sight (NLoS) sensing system. The IRS consists of passive elements and active sensors, where the sensors can receive and process the echo signal for direction-of-arrival (DoA) estimation. Motivated by the movable antenna array and fluid antenna system, we consider the case where the sensors are integrated into a group for movement and derive the corresponding Cramer-Rao bound (CRB). Then, the optimal solution for the positions of the movable sensors (MSs) to the CRB minimization problem is derived in closed form. Moreover, we characterize the relationship between the CRB and system parameters. Theoretical analysis and numerical results are provided to demonstrate the superiority of the proposed MS scheme over the fixed-position (FP) scheme.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1315-1319"},"PeriodicalIF":3.7,"publicationDate":"2025-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144264152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Secrecy Capacity Maximization for IRS-Assisted High-Speed Train Communications","authors":"Cuiran Li;Jiahui Luan;Zepeng Zhang;Bo Ai;Hao Wu;Jianli Xie","doi":"10.1109/LCOMM.2025.3559484","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3559484","url":null,"abstract":"In this letter, we propose an IRS-assisted MIMO communication system model in the presence of an eavesdropper (Eve). A distance-dependent Rician factor and real-time Doppler frequency offset (DFO) compensation mechanism are utilized to characterize highly time-varying wireless channels. The secrecy capacity optimization problem is formulated by jointly optimizing the transmit beamforming, artificial noise (AN) matrix, and IRS phase shifts, subject to transmit power and unit modulus constraints. To solve the non-convex problem, it is transformed into convex optimization problem by using weighted minimum mean square error (WMMSE) algorithm, and an alternating optimization strategy with coupled variables is used to derive the optimal solution. Simulation results show that the optimization algorithm proposed in this letter converges quickly and achieves higher secrecy capacity.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1290-1294"},"PeriodicalIF":3.7,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144264168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ngoc-Ha Truong;Gia-Vuong Nguyen;Ngoc Son Truong;Thien Huynh-The
{"title":"Toward Robust Channel Estimation in 5G With Atrous Pyramid Attention Networks","authors":"Ngoc-Ha Truong;Gia-Vuong Nguyen;Ngoc Son Truong;Thien Huynh-The","doi":"10.1109/LCOMM.2025.3559597","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3559597","url":null,"abstract":"Accurate channel estimation is crucial for reliable communication in modern wireless networks like fifth-generation (5G) and beyond 5G. However, current advanced methods face critical challenges in estimating channel coefficients accurately under noisy conditions and maintaining efficient model complexity. To overcome these challenges, this work proposes APANet, a deep convolutional network specially designed by incorporating atrous pyramid modules and synthesis attention modules to capture both local relationships and long-range dependencies in channel response matrices. Accordingly, APANet improves learning efficiency of complex channel patterns to increase the accuracy of channel estimation. Simulation results based on a synthesis channel dataset reveal that APANet outperforms state-of-the-art methods in estimation accuracy across various channel configurations while maintaining competitive computational efficiency. These results demonstrate the robustness and suitability of APANet for practical wireless networks, thus showcasing its potential to revolutionize channel estimation techniques.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1305-1309"},"PeriodicalIF":3.7,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144264153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Minwoo Kim;Youngchol Choi;Yeongjun Kim;Eojin Seo;Hyun Jong Yang
{"title":"Joint Spectrum Sensing and Resource Allocation for OFDMA-Based Underwater Acoustic Communications","authors":"Minwoo Kim;Youngchol Choi;Yeongjun Kim;Eojin Seo;Hyun Jong Yang","doi":"10.1109/LCOMM.2025.3559513","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3559513","url":null,"abstract":"Underwater acoustic (UWA) communications generally rely on cognitive radio (CR)-based ad-hoc networks due to challenges such as long propagation delay, limited channel resources, and high attenuation. To address the constraints of limited frequency resources, UWA communications have recently incorporated orthogonal frequency division multiple access (OFDMA), significantly enhancing spectral efficiency (SE) through multiplexing gains. Still, the low propagation speed of UWA signals, combined with the dynamic underwater environment, creates asynchrony in multiple access scenarios. This causes inaccurate spectrum sensing as inter-carrier interference (ICI) increases, which leads to difficulties in resource allocation. As efficient resource allocation is essential for achieving high-quality communication in OFDMA-based CR networks, these challenges degrade communication reliability in UWA systems. To resolve the issue, we propose an end-to-end sensing and resource optimization method using deep reinforcement learning (DRL) in an OFDMA-based UWA-CR network. Through extensive simulations, we confirm that the proposed method is superior to baseline schemes, outperforming other methods by 42.9 % in SE and 4.4 % in communication success rate.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1300-1304"},"PeriodicalIF":3.7,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144264258","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}