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

IEEE Communications Letters最新文献

筛选
英文 中文
Rescale-Invariant Federated Reinforcement Learning for Resource Allocation in V2X Networks
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-10-25 DOI: 10.1109/LCOMM.2024.3486166
Kaidi Xu;Shenglong Zhou;Geoffrey Ye Li
{"title":"Rescale-Invariant Federated Reinforcement Learning for Resource Allocation in V2X Networks","authors":"Kaidi Xu;Shenglong Zhou;Geoffrey Ye Li","doi":"10.1109/LCOMM.2024.3486166","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3486166","url":null,"abstract":"Federated Reinforcement Learning (FRL) offers a promising solution to various practical challenges in resource allocation for vehicle-to-everything (V2X) networks. However, the data discrepancy among individual agents can significantly degrade the performance of FRL-based algorithms. To address this limitation, we exploit the node-wise invariance property of rectified linear unit-activated neural networks, with the aim of reducing data discrepancy to improve learning performance. Based on this property, we introduce a backward rescale-invariant operation to develop a rescale-invariant FRL algorithm. Simulation results demonstrate that the proposed algorithm notably enhances both convergence speed and convergent performance.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 12","pages":"2799-2803"},"PeriodicalIF":3.7,"publicationDate":"2024-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810497","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 Unintentional Modulation Feature Extraction Framework Based on Decomposition Reconstruction and Metric Learning
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-10-25 DOI: 10.1109/LCOMM.2024.3486280
Wei Zhang;Lutao Liu;Yilin Jiang;Yuxin Liu
{"title":"Deep Unintentional Modulation Feature Extraction Framework Based on Decomposition Reconstruction and Metric Learning","authors":"Wei Zhang;Lutao Liu;Yilin Jiang;Yuxin Liu","doi":"10.1109/LCOMM.2024.3486280","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3486280","url":null,"abstract":"In this letter, the avoiding of the powerful interference of intentional modulation (IM) information on unintentional modulation (UM) feature is primarily studied. To address this challenging issue, a novel framework for deep UM feature extraction is proposed. The ideas of decomposition reconstruction and metric learning are introduced into deep learning. Meanwhile, an objective function is designed to automatically learn the deep UM feature that is insensitive to the IM information. The experimental results show the remarkable stability and separability of the deep UM feature across measured data with variable IM parameters.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 12","pages":"2854-2858"},"PeriodicalIF":3.7,"publicationDate":"2024-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810314","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
Optimal Sensing Policy With Interference-Model Uncertainty
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-10-23 DOI: 10.1109/LCOMM.2024.3485008
Vincent Corlay;Jean-Christophe Sibel;Nicolas Gresset
{"title":"Optimal Sensing Policy With Interference-Model Uncertainty","authors":"Vincent Corlay;Jean-Christophe Sibel;Nicolas Gresset","doi":"10.1109/LCOMM.2024.3485008","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3485008","url":null,"abstract":"This letter considers a half-duplex scenario where an interferer behaves according to a parametric model but the values of the model parameters are unknown. We explore the necessary number of sensing steps to gather sufficient knowledge about the interferer’s behavior. With more sensing steps, the reliability of the model-parameter estimates is improved, thereby enabling more effective link adaptation. However, in each time slot, the communication system experiencing interference must choose between sensing and communication. Thus, we propose to investigate the optimal policy for maximizing the expected sum communication data rate over a finite-time communication. This approach contrasts with most studies on interference management in the literature, which assume that the parameters of the interference model are perfectly known. We begin by showing that the problem under consideration can be modeled within the framework of a Markov decision process (MDP). Following this, we demonstrate that both the optimal open-loop and optimal closed-loop policies can be determined with reduced computational complexity compared to the standard backward-induction algorithm.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 12","pages":"2914-2919"},"PeriodicalIF":3.7,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810379","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
D-IRA Codes Over Integer Rings for Lattice-Based Multiple Access
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-10-22 DOI: 10.1109/LCOMM.2024.3484580
Tianbo Zhang;Fangtao Yu;Tao Yang;Rongke Liu
{"title":"D-IRA Codes Over Integer Rings for Lattice-Based Multiple Access","authors":"Tianbo Zhang;Fangtao Yu;Tao Yang;Rongke Liu","doi":"10.1109/LCOMM.2024.3484580","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3484580","url":null,"abstract":"We study capacity-approaching irregular repeat accumulate (IRA) codes over integer rings \u0000<inline-formula> <tex-math>$mathbb {Z}_{2^{m}}$ </tex-math></inline-formula>\u0000 for \u0000<inline-formula> <tex-math>$2^{m}$ </tex-math></inline-formula>\u0000-PAM signaling, \u0000<inline-formula> <tex-math>$m=1,2,cdots $ </tex-math></inline-formula>\u0000. Such codes belong to the ensemble of lattice codes. First, the effect of zero-divisors on the iterative belief-propagation (BP) decoding is analyzed. We show that the symmetric Gaussian approximation is invalid for existing IRA codes over integer rings. Then we propose a new doubly IRA (D-IRA) ring code structure, which consists of irregular multiplier distribution and irregular node-degree distribution. Such structure can restore the symmetry and optimize the BP decoding threshold. Numerical result demonstrates the improved performance of D-IRA codes for AWGN channel. Also, it is demonstrated that the lattice based multiple-access scheme with D-IRA code performs within 3 dB the capacity limit.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 12","pages":"2719-2723"},"PeriodicalIF":3.7,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810480","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
Singular Value Decomposition Optimizes Multi-Level Orthogonal Code Index Modulation DCSK System
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-10-22 DOI: 10.1109/LCOMM.2024.3484451
Gang Zhang;Xibiao Chen;Yanan Hu
{"title":"Singular Value Decomposition Optimizes Multi-Level Orthogonal Code Index Modulation DCSK System","authors":"Gang Zhang;Xibiao Chen;Yanan Hu","doi":"10.1109/LCOMM.2024.3484451","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3484451","url":null,"abstract":"To improve the bit error rate (BER) performance of the differential chaotic shift keying (DCSK) system, this letter proposes a multi-level orthogonal code index modulation DCSK (MOCIM-DCSK) system. A set of mutually orthogonal reference signals is generated using the Gram-Schmidt algorithm, with each reference signal carrying code index bits and modulation bits for the transmission of information signals. Additionally, to further enhance the system’s reliability, singular value decomposition (SVD)-aided detection is introduced, successfully suppressing additive white Gaussian noise (AWGN). The BER formulas of MOCIM-DCSK system over AWGN channel and multipath Rayleigh fading channels is derived, and the complexity of MOCIM-DCSK system is compared with other systems. Simulation results validate the correctness of the theoretical derivations and demonstrate the outstanding BER performance of the system. Furthermore, the application of SVD to the MC-DCSK system provides additional evidence of its advantages and versatility in enhancing BER performance.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 12","pages":"2874-2878"},"PeriodicalIF":3.7,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810315","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
Tensor Modalization-Based Holographic MIMO Channel Estimation
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-10-18 DOI: 10.1109/LCOMM.2024.3483304
Shouliang Du;Liyang Lu;Zhaocheng Wang
{"title":"Tensor Modalization-Based Holographic MIMO Channel Estimation","authors":"Shouliang Du;Liyang Lu;Zhaocheng Wang","doi":"10.1109/LCOMM.2024.3483304","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3483304","url":null,"abstract":"To capture the essence of electromagnetic propagation in arbitrary scattering, the holographic MIMO (HMIMO) channel is usually modeled by a Fourier plane-wave series expansion. HMIMO channel estimation, whose mathematical formulation is significantly varied, reminiscent of conventional sparse recovery solutions may result in unprecedented challenges. In this letter, we propose a tensor modalized channel estimation approach for efficient holographic communications. Specially, Fourier plane wave-based channel is formulated as a 2-mode tensor by jointly employing the physical dimensions of the transmitter and the receiver, enabling the extraction of high-dimensional electromagnetic characteristics. The channel estimation problem is further modeled as a 3-mode sparse tensor reconstruction issue by exploiting spatial characteristics of wireless channels, wherein an additional tensor dimension is added for the information union of various channel slices. Tensor compressive sampling matching pursuit (TCoSaMP) is elaborated based on a multiple selection mechanism, with theoretical guarantees derived from the perspective of a high-dimensional tensor. Furthermore, detailed complexity analysis demonstrates the efficiency of TCoSaMP. Simulation results validate that the proposed method offers improvements in both accuracy and computational efficiency.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 12","pages":"2879-2883"},"PeriodicalIF":3.7,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810316","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
Blind Recognition Algorithm of Reed-Solomon Codes Based on Multiple Threshold Judgment and Matrix Recording
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-10-18 DOI: 10.1109/LCOMM.2024.3483281
Zhuolun Wu;Wei Zhang;Yihan Wang;Yanyan Liu
{"title":"Blind Recognition Algorithm of Reed-Solomon Codes Based on Multiple Threshold Judgment and Matrix Recording","authors":"Zhuolun Wu;Wei Zhang;Yihan Wang;Yanyan Liu","doi":"10.1109/LCOMM.2024.3483281","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3483281","url":null,"abstract":"Reed-Solomon (RS) codes are widely utilized in systems such as digital transmission and storage systems because of their error-correcting capability. Nevertheless, the substantial number of iterative operations inherent to existing RS code recognition algorithms results in a considerable increase in computational complexity. In this letter, a blind recognition algorithm of RS codes based on multiple threshold judgment and the matrix recording is proposed. The multiple threshold judgment method terminates the iterative process when the threshold condition is satisfied, effectively reducing the recognition process’s computational complexity. Meanwhile, the matrix recording method significantly improves the recognition probability. Simulation results show that the false recognition probability of the proposed recognition algorithm is approaching the false recognition bottom bound and achieves a gain of 0.5dB for RS(31,15,8,37) compared to the low-complexity GFFT (LC-GFFT). Under favourable channel conditions, the computational complexity of the proposed recognition algorithm is reduced by 82.74% and 16.79% compared with the existing RS (31,15,8,37) and RS (255,239,8,285) blind recognition algorithms, respectively.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 12","pages":"2709-2713"},"PeriodicalIF":3.7,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810476","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
Frequency-Constrained Iterative Adversarial Attacks for Automatic Modulation Classification
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-10-17 DOI: 10.1109/LCOMM.2024.3482552
Yigong Chen;Xiaoqiang Qiao;Jiang Zhang;Tao Zhang;Yihang Du
{"title":"Frequency-Constrained Iterative Adversarial Attacks for Automatic Modulation Classification","authors":"Yigong Chen;Xiaoqiang Qiao;Jiang Zhang;Tao Zhang;Yihang Du","doi":"10.1109/LCOMM.2024.3482552","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3482552","url":null,"abstract":"Although adversarial attacks present a significant threat to intelligent models based on deep learning (DL) for automatic modulation classification (AMC). However, the existing works for electromagnetic signal adversarial attacks introduce high frequency components in the frequency domain, which causes spectral mismatch and glitch problems, degrading the attack success rate after transmission through a band-limited channel. In this letter, we propose a frequency-constrained iterative adversarial attacks (FCIAA) algorithm which can suppress the high frequency components and optimize adversarial perturbations during the iterative process to alleviate such problems. The experiments using qualitative and quantitative indicators demonstrate that the proposed algorithm can effectively constrain out-of-band perturbation energy, which improves both the time and frequency domain concealment quality of the adversarial signals and enhances adversarial attacks effect.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 12","pages":"2734-2738"},"PeriodicalIF":3.7,"publicationDate":"2024-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810479","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 Beamforming for RIS-Aided Multi-Pair Transmission Using Partial Elements
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-10-17 DOI: 10.1109/LCOMM.2024.3482455
Yicheng Xu;Ruifeng Gao;Yingdong Hu;Ye Li;Jue Wang;Tony Q. S. Quek
{"title":"Passive Beamforming for RIS-Aided Multi-Pair Transmission Using Partial Elements","authors":"Yicheng Xu;Ruifeng Gao;Yingdong Hu;Ye Li;Jue Wang;Tony Q. S. Quek","doi":"10.1109/LCOMM.2024.3482455","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3482455","url":null,"abstract":"In current reconfigurable intelligent surface (RIS)-aided systems, adding a new pair of transceivers often requires the RIS phases to be entirely re-calculated for all elements, inducing great overhead, especially for large-scale RISs. In this letter, we propose to only adjust part of RIS elements to serve the newly added pair, while the other elements stay unchanged, providing more flexibility to balance performance and overhead. Simulation results show that the method, with modifying only a small portion of elements, can achieve most of the RIS gain that would be achieved if optimizing phases of all the elements.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 12","pages":"2764-2768"},"PeriodicalIF":3.7,"publicationDate":"2024-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810485","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
QoE-Driven Multiple UAVs-Mounted Reconfigurable Intelligent Surface Communication
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-10-16 DOI: 10.1109/LCOMM.2024.3481963
Haowen Xu;Jianchao Chen;Ming Jiang
{"title":"QoE-Driven Multiple UAVs-Mounted Reconfigurable Intelligent Surface Communication","authors":"Haowen Xu;Jianchao Chen;Ming Jiang","doi":"10.1109/LCOMM.2024.3481963","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3481963","url":null,"abstract":"In this letter, we investigate a new reconfigurable intelligent surface (RIS) aided unmanned aerial vehicle (RUAV) system. Specifically, a multiple-RUAV (mRUAV) scenario is considered, where a new hybrid quality-of-experience (HQoE) metric jointly considering energy efficiency, relative data rate quality and transmission delay is designed. The objective of the proposed system is to maximize HQoE by jointly optimizing the transmit power of base station (BS), the beamformers at BS and RUAVs, and the positions of RUAVs. For handling this non-convex optimization problem, we first optimize the positions of RUAVs by a sphere estimation based particle swarm optimization (SEPSO) algorithm, and then apply the block coordinate descent (BCD) algorithm on the other variables. Simulation results show that the proposed system can outperform existing solutions.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 12","pages":"2824-2828"},"PeriodicalIF":3.7,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810391","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学术官方微信