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

IEEE Communications Letters最新文献

筛选
英文 中文
IEEE Communications Letters Publication Information
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-04-10 DOI: 10.1109/LCOMM.2025.3552242
{"title":"IEEE Communications Letters Publication Information","authors":"","doi":"10.1109/LCOMM.2025.3552242","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3552242","url":null,"abstract":"","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 4","pages":"i-i"},"PeriodicalIF":3.7,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10960796","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143821783","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
IEEE Communications Letters Publication Information
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-03-11 DOI: 10.1109/LCOMM.2025.3542204
{"title":"IEEE Communications Letters Publication Information","authors":"","doi":"10.1109/LCOMM.2025.3542204","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3542204","url":null,"abstract":"","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 3","pages":"i-i"},"PeriodicalIF":3.7,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10922097","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143594381","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
Non-Stationary Channel Estimation for XL-MIMO With Hybrid Structure via Low-Rank Matrix Completion
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-02-26 DOI: 10.1109/LCOMM.2025.3546057
Yiwen Wu;Chen Liu;Yunchao Song;Wanyue Zhang;Zheng Huang
{"title":"Non-Stationary Channel Estimation for XL-MIMO With Hybrid Structure via Low-Rank Matrix Completion","authors":"Yiwen Wu;Chen Liu;Yunchao Song;Wanyue Zhang;Zheng Huang","doi":"10.1109/LCOMM.2025.3546057","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3546057","url":null,"abstract":"Due to the spatial non-stationary (SnS) property of extremely large-scale MIMO (XL-MIMO), channel estimation algorithms that rely on the assumption of spatial stationarity are no longer suitable. To address this problem, in this letter, we utilize the low-rank property of channels to investigate a non-stationary channel estimation algorithm based on low-rank matrix completion for XL-MIMO with hybrid structure. Specifically, we introduce a two-stage sampling method to select precoding and combining matrices from the codebooks and reformulate the non-stationary channel estimation problem as a matrix completion problem with a fixed-rank constraint. To handle the non-convex constraint, we treat the set of fixed-rank matrices as a manifold and utilize a fixed-rank matrix manifold-based gradient descent (FRM-GD) algorithm. Simulation results show that our algorithm significantly outperforms existing methods.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 4","pages":"863-867"},"PeriodicalIF":3.7,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817944","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
Secure Transmission in IRS and AN-Assisted MISO System: Maximizing Secrecy Energy Efficiency
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-02-25 DOI: 10.1109/LCOMM.2025.3545446
Panpan Xu;Weijie Tan;Zhenling Li;Chunguo Li;Rui Zhao
{"title":"Secure Transmission in IRS and AN-Assisted MISO System: Maximizing Secrecy Energy Efficiency","authors":"Panpan Xu;Weijie Tan;Zhenling Li;Chunguo Li;Rui Zhao","doi":"10.1109/LCOMM.2025.3545446","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3545446","url":null,"abstract":"In this letter, we investigate the maximization of secrecy energy efficiency (SEE) for multiple-input single-output (MISO) system assisted by artificial noise (AN) and an intelligent reflecting surface (IRS), in the presence of multiple eavesdroppers. To solve the complex and non-convex fractional programming problem of SEE maximization, we design an efficient method based on the Dinkelbach algorithm and alternative optimization, which divides the solving process into an outer algorithm and an inner algorithm. For the outer algorithm, we introduce the Dinkelbach operator to transform the fractional programming problem into a tractable subtractive form, involving the beamforming (BF) vector, AN vector, and IRS reflecting phase shift. In the inner algorithm, the integer problem is decomposed into two simpler sub-problems, then sub-optimal solutions can be obtained by iteratively optimizing the sub-problems. The simulation results verify that using AN can efficiently enhance the SEE in IRS-aided MISO systems, and the advantage of incorporating AN becomes even more pronounced in the presence of multiple eavesdroppers.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 4","pages":"858-862"},"PeriodicalIF":3.7,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817883","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
A Novel Discrete Phase RIS-Aided MIMO Multiuser Transceiver Design Using Dirty Paper Coding
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-02-25 DOI: 10.1109/LCOMM.2025.3545366
Hsiao-Feng Lu
{"title":"A Novel Discrete Phase RIS-Aided MIMO Multiuser Transceiver Design Using Dirty Paper Coding","authors":"Hsiao-Feng Lu","doi":"10.1109/LCOMM.2025.3545366","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3545366","url":null,"abstract":"In this letter we present a novel transceiver design for RIS-aided MIMO multiuser downlink communications. The design employs dirty paper coding and practical discrete-phase RIS to overcome the limitations of existing techniques and achieve the ultimate channel sum-rate capacity. The new design supports arbitrary number of antennas and users and provides a practical solution for next-generation wireless networks. In particular, a new method is proposed for optimizing the discrete phase shifts of RIS, with polynomial complexity in the number of RIS elements and linear complexity relative to the number discrete phases. Simulations show that our design with QPSK-phase RIS offers a cost-effective solution with significant performance improvement upon existing works for RIS-aided MIMO communications.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 4","pages":"848-852"},"PeriodicalIF":3.7,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817905","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 Optimization for Power-Splitting Relay-Assisted Over-the-Air Computation Networks
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-02-25 DOI: 10.1109/LCOMM.2025.3545370
Qishuo Wang;Quanzhong Li
{"title":"Joint Optimization for Power-Splitting Relay-Assisted Over-the-Air Computation Networks","authors":"Qishuo Wang;Quanzhong Li","doi":"10.1109/LCOMM.2025.3545370","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3545370","url":null,"abstract":"Relays can significantly improve the performance of over-the-air computation (AirComp) networks, especially when the sensors and the fusion center (FC) are far apart. However, the relay’s energy supply is a common constraint factor of relay-assisted AirComp networks. To address the power constrained issue, we introduce power-splitting (PS) relays into an AirComp network, where the relays can harvest energy from the transmitted signals of the sensors and the FC by the PS scheme and then forward the signals to the FC by using the harvested energy. Our objective is to minimize the computational mean square error (CMSE) at the FC by jointly optimizing the transmit coefficients at the sensors, the amplify and forward (AF) coefficients and PS ratios at the relays, and the de-noising factor at the FC, under the individual power constraints at the sensors and relays. The optimization problem is highly non-convex and difficult to solve. By exploiting the inexact block coordinate descent (IBCD) algorithm and the constrained concave-convex procedure (CCCP), we propose an IBCD-CCCP algorithm to solve the optimization problem effectively. Numerical results are presented to demonstrate the effectiveness of our scheme as compared to the baseline methods.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 4","pages":"853-857"},"PeriodicalIF":3.7,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817916","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
ZCLoRa: A Lightweight Deep Learning Based Receiver for Enhanced LoRa Decoding
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-02-24 DOI: 10.1109/LCOMM.2025.3544893
Irtizah;Akanksha Gupta;Satyam Agarwal
{"title":"ZCLoRa: A Lightweight Deep Learning Based Receiver for Enhanced LoRa Decoding","authors":"Irtizah;Akanksha Gupta;Satyam Agarwal","doi":"10.1109/LCOMM.2025.3544893","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3544893","url":null,"abstract":"This letter introduces Zak-CNN LoRa (ZCLoRa), a novel receiver designed for low-power, long-range Internet of things (IoT) applications, addressing key limitations in conventional LoRa communication systems. In existing LoRa implementations, challenges such as low transmission power, unknown channel conditions, and degraded received signals lead to suboptimal decoding performance. To overcome these issues, we propose ZCLoRa, which leverages the Zak transform and exploits its sparse representation capabilities, enabling effective signal denoising. The Zak-transformed signal is processed by a convolutional neural network (CNN) for enhanced symbol decoding. We evaluate the performance of ZCLoRa in terms of symbol error rate (SER), showing significant improvements in decoding accuracy while maintaining the low complexity and power efficiency essential for IoT devices. Furthermore, we validate our model on USRPs, providing empirical evidence of its real-world effectiveness.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 4","pages":"839-842"},"PeriodicalIF":3.7,"publicationDate":"2025-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817920","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
A Method to Verify Neural Network Decoders Against Adversarial Attacks
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-02-24 DOI: 10.1109/LCOMM.2025.3545068
Kaijie Shen;Chengju Li
{"title":"A Method to Verify Neural Network Decoders Against Adversarial Attacks","authors":"Kaijie Shen;Chengju Li","doi":"10.1109/LCOMM.2025.3545068","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3545068","url":null,"abstract":"In this letter, we focus on the robustness performance of deep neural networks (DNNs) in the context of channel decoding tasks when confronted with adversarial attacks. Leveraging interval analysis, we verify the robustness of these DNNs against adversarial attacks within a specific power range. We demonstrate that a verified upper bound can serve as an effective metric to quantify the defense capabilities of neural networks against such attacks. The verification can be useful in assessing the security of wireless communication systems using deep learning algorithms.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 4","pages":"843-847"},"PeriodicalIF":3.7,"publicationDate":"2025-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817853","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
Random Spreading With Higher Order Modulation in Unsourced Random Access
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-02-21 DOI: 10.1109/LCOMM.2025.3544250
Jian Dang;Zaichen Zhang;Yongpeng Wu
{"title":"Random Spreading With Higher Order Modulation in Unsourced Random Access","authors":"Jian Dang;Zaichen Zhang;Yongpeng Wu","doi":"10.1109/LCOMM.2025.3544250","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3544250","url":null,"abstract":"Unsourced random access (URA) is crucial for future massive access scenarios. Existing URA schemes often use low-order modulation and assess performance with a limited number of active users. This work presents a pilot-free URA scheme that employs random spreading and higher-order modulation. We derive a discrete mixture generalized approximate message passing algorithm to enhance active user detection (AUD) and data detection. Simulations show that our proposed method significantly outperforms pilot-based methods in AUD, and higher-order modulation supports a large number of active users while ensuring the target per user probability of error (PUPE) performance.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 4","pages":"829-833"},"PeriodicalIF":3.7,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817952","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-Link Operation With Exponential Increasing and Exponential Decreasing Hybrid Contention Windows for Low-Latency WLANs
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-02-21 DOI: 10.1109/LCOMM.2025.3544278
Yunxin Lv;Yongqi Chen;Jiabin Li;Meihua Bi;Yang Lu
{"title":"Multi-Link Operation With Exponential Increasing and Exponential Decreasing Hybrid Contention Windows for Low-Latency WLANs","authors":"Yunxin Lv;Yongqi Chen;Jiabin Li;Meihua Bi;Yang Lu","doi":"10.1109/LCOMM.2025.3544278","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3544278","url":null,"abstract":"Multi-link operation (MLO) has attracted intensive interests since the emergence of Wi-Fi 7. In this letter, we propose and investigate the adoption of both exponential increasing and exponential decreasing contention windows (CWs) in MLO capable stations (STAs) for low-latency wireless local area networks (WLANs). By letting a MLO capable STA to alternately adopt increasing and decreasing CW updating rules for links when activating links for channel contention, the advantages of both adopting a small CW and adopting a large CW can be obtained, thereby benefiting the latency performance of WLANs. Simulation results reveal that our proposal can achieve considerable latency reduction compared to the conventional schemes, and is a promising scheme to achieve low latency for WLANs under MLO.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 4","pages":"834-838"},"PeriodicalIF":3.7,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817918","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学术文献互助群
群 号：481959085
Book学术官方微信