发布求助
文献互助 智能选刊 最新文献

IEEE Communications Letters最新文献

筛选
英文 中文
Efficient Signal Demodulation Based on Multistage Interference Separation for MIMO-OTFS 基于多级干扰分离的MIMO-OTFS高效信号解调
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-04-17 DOI: 10.1109/LCOMM.2025.3562012
Zhiyong Luo;Honghao Shi;Beibei Zhu
{"title":"Efficient Signal Demodulation Based on Multistage Interference Separation for MIMO-OTFS","authors":"Zhiyong Luo;Honghao Shi;Beibei Zhu","doi":"10.1109/LCOMM.2025.3562012","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3562012","url":null,"abstract":"In typical communication scenarios with numerous scatters, the Multiple-Input Multiple-Output (MIMO) Orthogonal Time Frequency Space (OTFS) system encounters various dimensional interference, such as inter-Doppler interference (IDI), inter-antenna interference (IAI), and inter-symbol interference (ISI). These interference present significant challenges to effective signal demodulation at the receiver. To address these challenges, we propose an iterative symbol detector (ISD) based on multistage interference separation in the time-space (TS) domain, leveraging its inherent sparsity. Specifically, we integrate an equalizer before the ISD to provide initial estimates and mitigate IDI. In each iteration, the ISD reconstructs and cancels IAI and ISI, then applies the Gauss-Seidel (GS) iteration method to solve the TS domain equations following interference cancellation. Simulation results demonstrate the effectiveness of the proposed ISD, showing its ability to significantly reduce interference in the MIMO-OTFS system. It outperforms benchmark algorithm in 4-QAM and 16-QAM and enhanced demodulation performance.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1370-1374"},"PeriodicalIF":3.7,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144264282","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}
引用次数: 0
Diversity-Achieving Quadrature Spatial Modulation Aided MIMO-OTFS Transmission 分集实现正交空间调制辅助MIMO-OTFS传输
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-04-17 DOI: 10.1109/LCOMM.2025.3561770
Jiqing Yang;Lei Wang;Bo Wang
{"title":"Diversity-Achieving Quadrature Spatial Modulation Aided MIMO-OTFS Transmission","authors":"Jiqing Yang;Lei Wang;Bo Wang","doi":"10.1109/LCOMM.2025.3561770","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3561770","url":null,"abstract":"In this letter, a diversity-achieving quadrature spatial modulation (DAQSM) aided multiple-input multiple-output orthogonal time frequency space (MIMO-OTFS) scheme is proposed, which can provide both transmit diversity and higher spectral efficiency (SE). Through the design of expansion matrices (EMs), the proposed scheme can be conveniently extended to scenarios with more than two transmit antennas. Furthermore, we present the analytical expression of bit error rate (BER) and diversity analysis. Simulation results demonstrate the superior performance of the proposed scheme compared to related schemes in high-mobility scenarios.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1360-1364"},"PeriodicalIF":3.7,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144264180","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}
引用次数: 0
Resource Allocation in a RIS-Assisted TDMA Wireless Powered Sensor Network Using UAV 基于无人机的ris辅助TDMA无线传感器网络资源分配
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-04-17 DOI: 10.1109/LCOMM.2025.3562118
Omid Abachian Ghasemi;Mehdi Chehel Amirani
{"title":"Resource Allocation in a RIS-Assisted TDMA Wireless Powered Sensor Network Using UAV","authors":"Omid Abachian Ghasemi;Mehdi Chehel Amirani","doi":"10.1109/LCOMM.2025.3562118","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3562118","url":null,"abstract":"Integrating reconfigurable intelligent surfaces (RISs) with energy harvesting technology offers a promising solution to enhance the performance of wireless networks. This letter investigates an RIS-assisted wireless powered sensor network (WPSN) where sensors distributed in an area harvest energy from an unmanned aerial vehicle (UAV) and subsequently transmit their data to the fusion center (FC) using the Time Division Multiple Access (TDMA) protocol, aided by an RIS mounted on the UAV. In the proposed model, the wireless power transfer (WPT) time is predetermined as a fraction of the total data transmission time and is excluded from the optimization variables. The objective is to maximize the sum throughput by optimally allocating time to the sensors and adjusting the phase shifts of the RIS elements. The resulting non-convex optimization problem is solved by decomposing it into two subproblems: first, determining the optimal phase shifts; and second, developing an algorithm for optimal time allocation using the Lagrange dual method and Karush-Kuhn-Tucker (KKT) conditions. Excluding the WPT time from the optimization variables enables us to develop an efficient algorithm for time allocation with significantly reduced execution time compared to scenarios where WPT time is also an optimization variable, while maintaining comparable performance. Numerical results demonstrate that the proposed method significantly improves the network’s performance.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1375-1379"},"PeriodicalIF":3.7,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144264167","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}
引用次数: 0
Power Minimization for RIS-Assisted Uplink MIMO-NOMA Systems Based on HBF 基于HBF的ris辅助上行MIMO-NOMA系统功率最小化
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-04-16 DOI: 10.1109/LCOMM.2025.3561602
Gaopeng Li;Peiyu Wang;Wei Wu;Rongfang Song
{"title":"Power Minimization for RIS-Assisted Uplink MIMO-NOMA Systems Based on HBF","authors":"Gaopeng Li;Peiyu Wang;Wei Wu;Rongfang Song","doi":"10.1109/LCOMM.2025.3561602","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3561602","url":null,"abstract":"Non-orthogonal multiple access (NOMA), multiple-input multiple-output (MIMO), and reconfigurable intelligent surface (RIS) have drawn significant interest in the realm of wireless communication. In this letter, the total transmit power minimization for RIS-assisted uplink MIMO-NOMA systems based on hybrid beamforming (HBF) is studied. Additionally, extended successive interference cancellation (ESIC) is proposed. To be specific, users are grouped based on cascaded channel gains and interference from different groups are suppressed by ESIC. For the purpose of achieving minimal power consumption, we jointly design RIS phase shifts, HBF matrices, and the transmit power allocation. As evidenced by simulation results, the proposed methodology requires lower power consumption than traditional schemes.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1355-1359"},"PeriodicalIF":3.7,"publicationDate":"2025-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144264254","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}
引用次数: 0
Multi-Bit Successive Cancellation List Decoding of Polar Codes Using One-Bit Error Boundary 基于1位误差边界的极性码的多位连续对消列表译码
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-04-16 DOI: 10.1109/LCOMM.2025.3561246
In-Cheol Park;Seungju Woo;Jaeyoung Lee;Minha Park;Sangbeom Park
{"title":"Multi-Bit Successive Cancellation List Decoding of Polar Codes Using One-Bit Error Boundary","authors":"In-Cheol Park;Seungju Woo;Jaeyoung Lee;Minha Park;Sangbeom Park","doi":"10.1109/LCOMM.2025.3561246","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3561246","url":null,"abstract":"This letter proposes an efficient method to reduce path splits in the successive cancellation list (SCL) decoding. We construct the boundary consisting of single-bit and multi-bit nodes that have a low error probability within the SC-decoding tree. The nodes on the boundary are considered with only two candidates per path instead of descending to their child nodes. To establish the boundary, we investigate the error probability of multi-bit nodes in the SC-decoding tree. The proposed method reduces the overall decoding cycles by approximately 70% while maintaining almost the same error-correcting performance as the conventional SCL decoding method.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1350-1354"},"PeriodicalIF":3.7,"publicationDate":"2025-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144264255","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}
引用次数: 0
Analysis of Exponential Correlation Matrices for Massive MIMO Systems 大规模MIMO系统的指数相关矩阵分析
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-04-15 DOI: 10.1109/LCOMM.2025.3561089
Sateeshkrishna Dhuli;Said Kouachi;Abhay Kumar Sah;Stefan Werner
{"title":"Analysis of Exponential Correlation Matrices for Massive MIMO Systems","authors":"Sateeshkrishna Dhuli;Said Kouachi;Abhay Kumar Sah;Stefan Werner","doi":"10.1109/LCOMM.2025.3561089","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3561089","url":null,"abstract":"This letter proposes an efficient method for calculating the eigenvalues of large-scale exponential correlation matrices by leveraging tridiagonal matrix theory. The approach explicitly factorizes the characteristic polynomial into two lower-degree polynomials, preserving the distinction between odd and even matrix orders without resorting to approximations. The ability to efficiently compute these eigenvalues is critical for optimizing channel capacity, transmit beamforming, and other key operations in massive multiple-input multiple-output (MIMO) systems, which are essential for improving data rates, reliability, and spectral efficiency in wireless communications. This work derives the approximate eigenvalues using the Cauchy interlacing theorem. It then validates the accuracy of the proposed eigenvalue expressions by comparing them with existing expressions in the literature and applying them to massive MIMO capacity estimation, showing improved precision.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1345-1349"},"PeriodicalIF":3.7,"publicationDate":"2025-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144264170","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}
引用次数: 0
SSB-Based Multi-Target Detection and Joint Velocity, Angle, and Range Estimation in 5G-NR 5G-NR中基于ssb的多目标检测与关节速度、角度和距离估计
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-04-15 DOI: 10.1109/LCOMM.2025.3561082
Yousef Awad;Abdulkadir Celik;Ahmed Eltawil
{"title":"SSB-Based Multi-Target Detection and Joint Velocity, Angle, and Range Estimation in 5G-NR","authors":"Yousef Awad;Abdulkadir Celik;Ahmed Eltawil","doi":"10.1109/LCOMM.2025.3561082","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3561082","url":null,"abstract":"This work aims to leverage the existing fifth generation (5G) new radio (NR) synchronization signal (SS) burst for network-side integrated sensing and communications (ISAC). A novel density-based clustering of applications with noise (DBSCAN)-based multi target detection algorithm is proposed. Furthermore, utilizing the beam sweeping nature of the SS burst, joint velocity, angle, and range (JVAR) estimation algorithms are proposed. Simulation results show that the proposed detection algorithm can reach an overall average detection accuracy of around 0.98 for different number of targets scenarios. On the other hand, the JVAR estimation accuracy are dependent on the individual radar resolution of velocity, angle and range.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1340-1344"},"PeriodicalIF":3.7,"publicationDate":"2025-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144264284","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}
引用次数: 0
Rate Analysis and Optimization of LoS Beyond Diagonal RIS-Assisted MIMO Systems 超对角线ris辅助MIMO系统的LoS速率分析与优化
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-04-15 DOI: 10.1109/LCOMM.2025.3560380
Ignacio Santamaria;Jesús Gutiérrez;Mohammad Soleymani;Eduard Jorswieck
{"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}
引用次数: 0
Near-Optimal Beam Placement With Low Complexity for Multicast Services in LEO Satellite Networks 低轨道卫星网络多播业务的低复杂度近最优波束布局
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-04-15 DOI: 10.1109/LCOMM.2025.3560743
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}
引用次数: 0
Multi-Channel Two-Step Matching in High-Density LEO Satellites Network for Diverse User Demands 面向不同用户需求的高密度LEO卫星网络多通道两步匹配
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-04-15 DOI: 10.1109/LCOMM.2025.3560510
Luyao Wang;Mubiao Yan;Hao Zhou;Wenxin Yang;Zhuochen Xie
{"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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信