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

IEEE Communications Letters最新文献

筛选
英文 中文
Joint Beamforming for Simultaneous Proactive Eavesdropping and Communication in MU-MIMO Systems MU-MIMO系统中同时主动窃听和通信的联合波束形成
IF 4.4 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-06-09 DOI: 10.1109/LCOMM.2025.3577758
Yongjin Jing;Fengchao Zhu;Jiacheng Liao;Lei Pan
{"title":"Joint Beamforming for Simultaneous Proactive Eavesdropping and Communication in MU-MIMO Systems","authors":"Yongjin Jing;Fengchao Zhu;Jiacheng Liao;Lei Pan","doi":"10.1109/LCOMM.2025.3577758","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3577758","url":null,"abstract":"In this letter, we design joint communication and artificial jamming beamforming to guarantee both downlink multi-user (MU) communication and proactive eavesdropping for a full-duplex base-station (FD-BS). Specifically, we aim to maximize the weighted sum-rate (WSR) of legitimate communication users (CUs) under the total power budget constraint and successful eavesdropping constraint. The equivalence between the weighted mean squared error (MSE) minimization problem and the original non-convex WSR maximization problem is strictly proved. First-order Taylor approximation is applied to relax the non-convex constraint. Then an alternating optimization framework based on block coordinate descent (BCD) algorithm is proposed to solve the weighted MSE minimization problem iteratively. Simulation results are provided to illustrate the effectiveness of the proposed beamforming design.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 8","pages":"1859-1863"},"PeriodicalIF":4.4,"publicationDate":"2025-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144831833","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
Indoor Heterogeneous Multi-Access Edge Computing Systems: Online Learning for Channel Variation-Aware Task Offloading 室内异构多访问边缘计算系统：通道变化感知任务卸载的在线学习
IF 4.4 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-06-09 DOI: 10.1109/LCOMM.2025.3577651
Ryangsoo Kim;Sung Chang Kim;Yonggang Kim
{"title":"Indoor Heterogeneous Multi-Access Edge Computing Systems: Online Learning for Channel Variation-Aware Task Offloading","authors":"Ryangsoo Kim;Sung Chang Kim;Yonggang Kim","doi":"10.1109/LCOMM.2025.3577651","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3577651","url":null,"abstract":"We investigate task offloading in indoor heterogeneous multi-access edge computing (MEC) systems with cellular and WiFi networks. Due to unpredictable mobile device mobility and spatially varying multipath fading, MEC systems face time-varying wireless channel conditions, making it challenging to make deterministic task offloading decisions. We propose an online learning-based task offloading decision algorithm that enables mobile devices to learn spatially varying channel conditions and optimize task offloading policy over time. Our algorithm minimizes the energy consumption of each mobile device while ensuring maximum task offloading delay guarantees. Numerical simulation results demonstrate the effectiveness of our algorithm.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 8","pages":"1844-1848"},"PeriodicalIF":4.4,"publicationDate":"2025-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144831881","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
Joint Beamforming Design and Trajectory Optimization for UAV-Enabled Cell-Free ISAC MIMO Systems 无人机支持无小区ISAC MIMO系统联合波束形成设计与轨迹优化
IF 4.4 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-06-09 DOI: 10.1109/LCOMM.2025.3577697
Jincheng Zhong;Jilong Wu;Yaqi Li;Chenyu Zhang;Pengcheng Zhu
{"title":"Joint Beamforming Design and Trajectory Optimization for UAV-Enabled Cell-Free ISAC MIMO Systems","authors":"Jincheng Zhong;Jilong Wu;Yaqi Li;Chenyu Zhang;Pengcheng Zhu","doi":"10.1109/LCOMM.2025.3577697","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3577697","url":null,"abstract":"This letter presents a comprehensive investigation into beamforming design and trajectory optimization for integrated sensing and communication (ISAC) systems under a cell-free architecture, supported by multiple unmanned aerial vehicles (UAVs). To effectively incorporate sensing into communication tasks, we propose an efficient tracking scheme based on the extended Kalman filter (EKF) to estimate the positions of mobile user equipments (UEs), which are then used for beamforming design and trajectory optimization. The originally complex non-convex optimization problem is decomposed into several tractable subproblems, which are efficiently addressed using the block coordinate descent (BCD) method and fractional programming (FP). Numerical simulations validate the effectiveness of the proposed framework, demonstrating notable improvements in both average sum-rate and sensing accuracy.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 8","pages":"1849-1853"},"PeriodicalIF":4.4,"publicationDate":"2025-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144831835","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
Deep Learning-Based Two-Step Denoising and Detection for MIMO-NOMA Under Imperfect Conditions 不完全条件下基于深度学习的MIMO-NOMA两步去噪与检测
IF 4.4 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-06-09 DOI: 10.1109/LCOMM.2025.3578081
Meyra Chusna Mayarakaca;Byung Moo Lee
{"title":"Deep Learning-Based Two-Step Denoising and Detection for MIMO-NOMA Under Imperfect Conditions","authors":"Meyra Chusna Mayarakaca;Byung Moo Lee","doi":"10.1109/LCOMM.2025.3578081","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3578081","url":null,"abstract":"Non-orthogonal multiple access (NOMA) has the potential to pave the way for next-generation wireless systems, especially when combined with multiple-input multiple-output (MIMO) technology. However, conventional detection schemes such as successive interference cancellation (SIC) often suffer from performance degradation under imperfect conditions. This letter presents a novel two-step deep learning (DL) framework for MIMO-NOMA signal detection. The proposed two-step deep learning (DL) framework first employs an autoencoder (AE) to denoise the received signal, and then feeds it to the deep neural network (DNN) for signal detection. The proposed architecture utilizes an AE with convolutional layers and a dual-receiver DNN signal detection for each user signal, eliminating the need for SIC. Simulation results demonstrate that the proposed system achieves a 10 dB bit error rate (BER) gain at 20 dB SNR and an achievable rate exceeding 12 bps/Hz, outperforms other DL-based detection methods, and conventional SIC.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 8","pages":"1874-1878"},"PeriodicalIF":4.4,"publicationDate":"2025-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144831793","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
Pre/Post-Coding Techniques Using Zadoff-Chu Sequence for PAPR Reduction in OTFS 利用Zadoff-Chu序列降低OTFS中PAPR的前后编码技术
IF 4.4 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-06-09 DOI: 10.1109/LCOMM.2025.3577743
Srinivasarao Chintagunta;Nandini Rao Gopal;Akash Singh
{"title":"Pre/Post-Coding Techniques Using Zadoff-Chu Sequence for PAPR Reduction in OTFS","authors":"Srinivasarao Chintagunta;Nandini Rao Gopal;Akash Singh","doi":"10.1109/LCOMM.2025.3577743","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3577743","url":null,"abstract":"High peak-to-average power ratio (PAPR) is one of the major drawbacks of orthogonal time frequency space (OTFS) based communication systems, leading to deteriorated bit error rate (BER) performance. This letter proposes precoding and postcoding approaches using the Zadoff-Chu sequence to reduce PAPR in OTFS and presents a performance analysis through simulations. The simulation results confirm a significant decrease in PAPR with the proposed approaches compared to other coded OTFS systems, as well as improved BER performance in the presence of a high-power amplifier (HPA) with a specific input backoff.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 8","pages":"1854-1858"},"PeriodicalIF":4.4,"publicationDate":"2025-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144831831","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
Low-Complexity Vector-by-Vector Detector for AFDM-IM Systems by Reconstructing Sparse Channel Matrix 基于稀疏信道矩阵重构的AFDM-IM系统低复杂度矢量检测器
IF 4.4 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-06-06 DOI: 10.1109/LCOMM.2025.3577262
Xiaoshan Wang;Lixia Xiao;Qu Luo;Jiaxi Zhou;Miaowen Wen;Tao Jiang
{"title":"Low-Complexity Vector-by-Vector Detector for AFDM-IM Systems by Reconstructing Sparse Channel Matrix","authors":"Xiaoshan Wang;Lixia Xiao;Qu Luo;Jiaxi Zhou;Miaowen Wen;Tao Jiang","doi":"10.1109/LCOMM.2025.3577262","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3577262","url":null,"abstract":"In this letter, a low-complexity vector-by-vector aided expectation propagation (VV-EP) detector is proposed for affine frequency division multiplexing (AFDM) with index modulation (IM) through reconstructing the sparse effective channel matrix. Specifically, the low-correlation elements of the effective channel matrix are set to zero by a preset threshold. Based on the reconstructed sparse matrix, approximate inverse operation can be implemented by Cholesky decomposition to reduce computational complexity. Moreover, the lower triangular matrix is constructed iteratively to improve detection performance. Simulation results indicate that the designed VV-EP algorithm is capable of reducing complexity by about 90% with a negligible performance loss compared to the orthogonal approximate message passing (OAMP) detector.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 8","pages":"1839-1843"},"PeriodicalIF":4.4,"publicationDate":"2025-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144831886","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
Distributed Uplink Rate-Splitting Multiple Access for Multi-Access Edge Computing 面向多接入边缘计算的分布式上行分速率多接入
IF 4.4 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-06-05 DOI: 10.1109/LCOMM.2025.3577097
Apostolos A. Tegos;Yue Xiao;Sotiris A. Tegos;George K. Karagiannidis;Panagiotis D. Diamantoulakis
{"title":"Distributed Uplink Rate-Splitting Multiple Access for Multi-Access Edge Computing","authors":"Apostolos A. Tegos;Yue Xiao;Sotiris A. Tegos;George K. Karagiannidis;Panagiotis D. Diamantoulakis","doi":"10.1109/LCOMM.2025.3577097","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3577097","url":null,"abstract":"In this work, we introduce multi-access edge computing (MEC) with distributed uplink rate-splitting multiple access (RSMA)-assisted, which has been shown to increase the achievable capacity region compared to other distributed uplink counterparts, including non-orthogonal multiple access (NOMA). It is noteworthy that the integration of distributed uplink multiple access and MEC has not been investigated in the existing literature, while distributed uplink RSMA can also be seen as a generalization of distributed uplink NOMA. In more detail, considering a system with two remote radio heads (RRHs) and two users, where the users have the ability to offload their data to either RRH, we aim to minimize the delay for the full offloading scenario. To this end, both the power allocation coefficient and the number of bits offloaded to each RRH are optimized. Simulations show that the proposed scheme outperforms both OMA-assisted MEC and NOMA-assisted MEC.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 8","pages":"1834-1838"},"PeriodicalIF":4.4,"publicationDate":"2025-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144831885","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
Cooperative Repair Schemes of Reed–Solomon Codes With Three Erasures 三擦Reed-Solomon码的协同修复方案
IF 4.4 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-06-05 DOI: 10.1109/LCOMM.2025.3576872
Ke Wang;Wenjie Ma
{"title":"Cooperative Repair Schemes of Reed–Solomon Codes With Three Erasures","authors":"Ke Wang;Wenjie Ma","doi":"10.1109/LCOMM.2025.3576872","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3576872","url":null,"abstract":"Reed-Solomon (RS) codes are widely utilized in distributed storage systems, where multiple node failures occur occasionally. For the cooperative repair of <inline-formula> <tex-math>$[n,k]$ </tex-math></inline-formula> RS codes over <inline-formula> <tex-math>$mathbb {F}_{q^{ell } }$ </tex-math></inline-formula> with three erasures, existing schemes necessitate <inline-formula> <tex-math>$ n {-} k geq q^{ell - 1} $ </tex-math></inline-formula>, <inline-formula> <tex-math>$ell geq 4$ </tex-math></inline-formula> and typically require three rounds of information interaction during the collaboration phase. This letter presents two key advancements. First, we develop an enhanced three-round cooperative repair scheme by using linearized polynomials corresponding to meticulously designed subspaces. Compared with the existing schemes, the proposed scheme maintains the same repair bandwidth while reducing the constraint to <inline-formula> <tex-math>$ n {-} k geq q^{m} $ </tex-math></inline-formula> with an integer <inline-formula> <tex-math>$min left [{{frac {3}{4}ell, ell -1}}right]$ </tex-math></inline-formula>, <inline-formula> <tex-math>$ell geq 4$ </tex-math></inline-formula>. Second, we refine the repair scheme to achieve one-round collaboration, albeit with a minor increase in the repair bandwidth.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 8","pages":"1829-1833"},"PeriodicalIF":4.4,"publicationDate":"2025-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144831887","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
Passive User Profiling Using Array of Sustainable Backscatter Tags 使用可持续反向散射标签阵列的被动用户分析
IF 4.4 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-06-05 DOI: 10.1109/LCOMM.2025.3576750
Haoming Wang;Hao Lai;Amus Chee Yuen Goay;Deepak Mishra;Aruna Seneviratne;Eliathamby Ambikairajah
{"title":"Passive User Profiling Using Array of Sustainable Backscatter Tags","authors":"Haoming Wang;Hao Lai;Amus Chee Yuen Goay;Deepak Mishra;Aruna Seneviratne;Eliathamby Ambikairajah","doi":"10.1109/LCOMM.2025.3576750","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3576750","url":null,"abstract":"Wireless technology is increasingly used for real-time identity verification through active sensors, but traditional biometrics like fingerprint scanning raise privacy concerns due to their invasive nature. To address this, we propose a first-ever Backscatter Communication (BackCom)-based user profiling and commodity RFID height or weight profiling demonstration, using backscatter signals from RFID tags placed in the environment rather than on individuals. These battery-free, energy-harvesting tags offer a sustainable, privacy-preserving method for passive identity recognition. By applying a pre-trained linear machine learning algorithm to the Received Signal Strength Indicator (RSSI) data from RFID tags, we can identify individuals based on the modulation of the backscatter signal caused by their unique physical characteristics. Our system achieves up to 90.2% accuracy in identifying individuals from a set of seven. Additionally, we employ an unsupervised anomaly detection method that combines ResNet-18 feature extraction with Principal Component Analysis (PCA), yielding over 90% overall accuracy in distinguishing between known and unknown subjects.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 8","pages":"1824-1828"},"PeriodicalIF":4.4,"publicationDate":"2025-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144831838","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
An Out-of-Band Spectrum Suppression Technique for Frequency Division Duplexing Communication Systems 频分双工通信系统的带外频谱抑制技术
IF 4.4 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-06-04 DOI: 10.1109/LCOMM.2025.3576499
Yuchen Bian;Jun Peng;Wei Liu;Songbai He;Fei You;Tianyang Zhong;Yijie Tang;Xinyu Wang;Leyan Wan
{"title":"An Out-of-Band Spectrum Suppression Technique for Frequency Division Duplexing Communication Systems","authors":"Yuchen Bian;Jun Peng;Wei Liu;Songbai He;Fei You;Tianyang Zhong;Yijie Tang;Xinyu Wang;Leyan Wan","doi":"10.1109/LCOMM.2025.3576499","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3576499","url":null,"abstract":"The conventional full-band (FB) digital predistortion (DPD) method could be ineffective in frequency division duplexing (FDD) communication systems, particularly when power amplifiers (PAs) are driven into the near-saturation region. This letter introduces an out-of-band (OOB) spectrum suppression technique with an anti-aliasing architecture to mitigate the spectrum spreading effect of PAs. The proposed anti-aliasing architecture significantly reduces computational complexity compared to existing methods. The experimental results show that the proposed method achieves better ACPR performance than existing methods, while it reduces the computational complexity by approximately 80%.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 8","pages":"1809-1813"},"PeriodicalIF":4.4,"publicationDate":"2025-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144831670","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学术官方微信