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

IEEE Communications Letters最新文献

筛选
英文 中文
IEEE Communications Letters Publication Information IEEE Communications Letters 出版信息
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-11-12 DOI: 10.1109/LCOMM.2024.3484891
{"title":"IEEE Communications Letters Publication Information","authors":"","doi":"10.1109/LCOMM.2024.3484891","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3484891","url":null,"abstract":"","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"C2-C2"},"PeriodicalIF":3.7,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10750499","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142636535","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 Society Information IEEE 通信学会信息
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-11-12 DOI: 10.1109/LCOMM.2024.3484889
{"title":"IEEE Communications Society Information","authors":"","doi":"10.1109/LCOMM.2024.3484889","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3484889","url":null,"abstract":"","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"C3-C3"},"PeriodicalIF":3.7,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10750498","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142664377","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
Learning Decentralized and Scalable Resource Management for Wireless Powered Communication Networks 为无线供电通信网络学习分散式可扩展资源管理
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-10-02 DOI: 10.1109/LCOMM.2024.3472067
Kobuljon Ismanov Abdurakhmonovich;Doyun Lee;Seung-Eun Hong;Jaewook Lee;Hoon Lee
{"title":"Learning Decentralized and Scalable Resource Management for Wireless Powered Communication Networks","authors":"Kobuljon Ismanov Abdurakhmonovich;Doyun Lee;Seung-Eun Hong;Jaewook Lee;Hoon Lee","doi":"10.1109/LCOMM.2024.3472067","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3472067","url":null,"abstract":"This letter presents deep learning approaches for addressing resource allocation problems in wireless-powered communication networks. Conventional deep neural network (DNN) methods require the global channel state information (CSI), invoking impractical centralized operations. Also, their computations depend on the user population, which lacks the scalability of the network size. To this end, we propose decentralized and scalable DNN architectures. We interpret the ideal centralized DNN as a nomographic function that can be decomposed into multiple component DNNs. Each of these is dedicated to processing the local CSI of individual users, thereby leading to the decentralized architecture. To reduce coordination overheads among the H-AP and users, individual users leverage a DNN that compresses local CSI into low-dimensional messages shared with the H-AP. Since these DNN modules are designed to share identical trainable parameters, the proposed learning architecture can be universally applied to various configurations with arbitrary user populations. Numerical results show that the proposed decentralized method achieves almost identical performance to centralized schemes with reduced complexity.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2563-2567"},"PeriodicalIF":3.7,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142636578","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
Performance Analysis of a Biologically Inspired Collective Gradient Detection Method for a Bio-Nanomachine Cluster 受生物启发的生物纳米机器集群集体梯度检测方法的性能分析
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-26 DOI: 10.1109/LCOMM.2024.3469130
Mayuka Chiba;Tadashi Nakano
{"title":"Performance Analysis of a Biologically Inspired Collective Gradient Detection Method for a Bio-Nanomachine Cluster","authors":"Mayuka Chiba;Tadashi Nakano","doi":"10.1109/LCOMM.2024.3469130","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3469130","url":null,"abstract":"In molecular communication, information can be encoded on the concentration gradient of signal molecules, making gradient detection an important issue. This letter considers a biologically inspired method for a cluster of bio-nanomachines to perform collective gradient detection. It develops a mathematical model of the collective gradient detection method, and uses the model to analyze its performance. One of the major findings reported in this letter is the existence of an optimal cluster size that can maximize the gradient detection performance. The contributions of this letter include exploring a new research direction in molecular communication, where a cluster of bio-nanomachines is used as a unit of molecular communication systems.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2528-2532"},"PeriodicalIF":3.7,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142636576","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 Semi-Supervised Learning-Based Spectrum Sensing at Low SNR 基于深度半监督学习的低信噪比频谱传感
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-26 DOI: 10.1109/LCOMM.2024.3468299
Guanghai Xu;Yonghua Wang;Bingfeng Zheng;Jiawen Li
{"title":"Deep Semi-Supervised Learning-Based Spectrum Sensing at Low SNR","authors":"Guanghai Xu;Yonghua Wang;Bingfeng Zheng;Jiawen Li","doi":"10.1109/LCOMM.2024.3468299","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3468299","url":null,"abstract":"Deep learning (DL) has been introduced to spectrum sensing to improve spectrum utilization effectively. However, some DL-based methods struggle to sense spectrum occupancy at low-signal-to-noise ratio (SNR) and require significant quantities of labeled samples for training in new environments. Therefore, this letter proposes a novel spectrum sensing method based on deep semi-supervised learning (DSSL). Specifically, adopting the DSSL during offline training can effectively mitigate the issue of insufficient labeled samples, while introducing an improved Generative Adversarial Network (GAN) makes the convolutional neural network (CNN) model robust to incorrect pseudo-labels through adversarial learning, thereby enhancing the adaptability and performance of the CNN model. Simulation results show that the proposed approach is more effective and robust than existing methods, particularly under low SNR levels.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2558-2562"},"PeriodicalIF":3.7,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142636577","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
Temporal-Assisted Dynamic Beampattern Optimization in Integrated Sensing and Communication Systems 综合传感与通信系统中的时序辅助动态示波器优化
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-25 DOI: 10.1109/LCOMM.2024.3468158
Shengcai Zhou;Luping Xiang;Kun Yang
{"title":"Temporal-Assisted Dynamic Beampattern Optimization in Integrated Sensing and Communication Systems","authors":"Shengcai Zhou;Luping Xiang;Kun Yang","doi":"10.1109/LCOMM.2024.3468158","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3468158","url":null,"abstract":"In this letter, an integrated sensing and communication (ISAC) system is investigated. Initially, we introduce a design criterion wherein sensing data acquired from the preceding time slot is employed for instantaneous optimal beamforming in the succeeding time slot, aiming to enhance the communication rate. Subsequently, the development of optimal beamforming is addressed, and a high-caliber suboptimal resolution is derived utilizing successive convex approximation (SCA) techniques combined with the iterative rank minimization (IRM) methodology. Our evaluations, grounded on numerical analyses, reveal that the communication rate of the introduced beamforming strategy surpasses that of conventional omnidirectional sensing and pilot based approaches.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2548-2552"},"PeriodicalIF":3.7,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142636579","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
Flexible Restart Mechanism for Successive Cancellation Flip Decoding of Polar Codes 极性编码连续取消翻转解码的灵活重启机制
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-25 DOI: 10.1109/LCOMM.2024.3465393
Xue Xiyue;He Meilin;Guo Rui
{"title":"Flexible Restart Mechanism for Successive Cancellation Flip Decoding of Polar Codes","authors":"Xue Xiyue;He Meilin;Guo Rui","doi":"10.1109/LCOMM.2024.3465393","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3465393","url":null,"abstract":"Polar codes can achieve near-capacity performance under low-complexity successive cancellation (SC) decoding. However, short to medium-length block codes exhibit insufficient error-correction performance with the SC algorithm, which limits their practical applications. Although the successive cancellation flip (SCF) decoder improves SC performance, its variable execution time poses challenges in certain scenarios. The simplified restart mechanism (SRM) reduces the execution time of SCF decoders through conditional restart of the additional trials from the second half of the codeword. However, regardless of the position of the flipped bit on the RHS, additional decoding trials can only start from a fixed restart position, which limits efficiency improvements. This letter proposes a flexible restart mechanism (FRM), introducing multiple optional restart positions to further optimize the simplified restart mechanism, reducing both execution time and its variability. In simulations, we used P(1024, 128) and P(2048, 256) polar codes to compare the performance of SCF decoders embedding with FRM and SRM. The results indicate that, compared to the SCF decoder, the SCF decoder with FRM reduces average execution time, average additional execution time, execution time variance, and median additional execution time by 14.95%, 63.42%, 86.55%, and 58.20%, respectively. Compared to the SCF decoder embedding with SRM, FRM achieves improvements in these metrics by 5.15%, 23.14%, 20.24%, and 29.71%, respectively.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2459-2463"},"PeriodicalIF":3.7,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142636278","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
Subcarrier Interleaved Index Modulation Assisted OFDM Backscatter Communication 子载波交错索引调制辅助 OFDM 反向散射通信
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-25 DOI: 10.1109/LCOMM.2024.3467669
Dongdong Mou;Lixia Xiao;Miaoran Peng;Jiaxi Zhou;Guanghua Liu;Tao Jiang
{"title":"Subcarrier Interleaved Index Modulation Assisted OFDM Backscatter Communication","authors":"Dongdong Mou;Lixia Xiao;Miaoran Peng;Jiaxi Zhou;Guanghua Liu;Tao Jiang","doi":"10.1109/LCOMM.2024.3467669","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3467669","url":null,"abstract":"In this letter, we propose a subcarrier interleaved index modulation assisted orthogonal frequency division multiplexing (SIIM-OFDM) scheme for backscatter system. Specifically, the tag data vector, modulated with subcarrier index modulation (IM), is reconstructed leveraging the combined permutation and Hadamard matrix to mitigate the sensitivity of the inter-carrier interference. Then we derive the average bit error probability (ABEP) for the SIIM-OFDM backscattered signal and analyze the asymptotic detection performance bound of the proposed system. Furthermore, a hardware verification prototype is built to validate the proposed scheme. Experimental results and simulations validate that the proposed SIIM-OFDM backscatter achieves significant performance gains compared to the existing schemes.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2533-2537"},"PeriodicalIF":3.7,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142636571","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 Huffman Coding-Based Adaptive Spatial Modulation 基于低复杂度哈夫曼编码的自适应空间调制
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-24 DOI: 10.1109/LCOMM.2024.3467169
Gangfei Hu;Yukun Yang;Pingping Shang;Yuyang Peng;Poongundran Selvaprabhu;Han Hai
{"title":"Low-Complexity Huffman Coding-Based Adaptive Spatial Modulation","authors":"Gangfei Hu;Yukun Yang;Pingping Shang;Yuyang Peng;Poongundran Selvaprabhu;Han Hai","doi":"10.1109/LCOMM.2024.3467169","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3467169","url":null,"abstract":"Adaptive spatial modulation (ASM) is a novel technology in multiple-input-multiple-output (MIMO) systems, which dynamically adjusts the modulation order of the transmit antenna based on the constantly changing channel state information (CSI). The combination of ASM and Huffman coding, using the Huffman method, allows for flexible spatial symbols to provide different activation probabilities for the transmit antenna. However, the exhaustive search conducted by Huffman-ASM requires a large number of candidate combinations to identify the optimal modulation combination. This results in high computational complexity and a heavy feedback burden. To address the challenge, this letter proposes a low-complexity algorithm based on the Huffman-ASM scheme. This scheme does not include all candidate combinations in the calculation but directly selects several optimal candidate combinations based on channel gain sorting; therefore, it reduces system complexity and alleviates the burden on the feedback path. The simulation results indicate that, compared to the conventional scheme, the proposed scheme exhibits only a slight decrease in performance while significantly reducing computational complexity.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2468-2472"},"PeriodicalIF":3.7,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142636280","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 Robust Physical Layer Key Generation Algorithm for Ultra-Wideband Ranging Process 超宽带测距过程的稳健物理层密钥生成算法
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2024-09-24 DOI: 10.1109/LCOMM.2024.3466954
Jianghao Wu;Haoyu Wu;Yun Chen
{"title":"A Robust Physical Layer Key Generation Algorithm for Ultra-Wideband Ranging Process","authors":"Jianghao Wu;Haoyu Wu;Yun Chen","doi":"10.1109/LCOMM.2024.3466954","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3466954","url":null,"abstract":"Ultra-wideband (UWB) technology has been widely used for low-cost accurate ranging and positioning. To ensure communication security, a secret key must be derived before every ranging session. However, this process introduces significant latency and requires additional hardware. Therefore, this letter proposes a low-cost physical layer key generation algorithm that leverages the characteristics of multi-path channels for authentication and encryption. By effectively utilizing channel impulse response (CIR) and channel features, the proposed approach significantly reduces the key disagreement rate (KDR). Moreover, a scrambled timestamp sequence (STS) assisted error correction method is also proposed to further reduce the KDR. Simulation results demonstrate that, for a 128-bit physical key, the proposed scheme achieves a 0.5% KDR and over 83% STS matching rate at a 10 dB Signal to Noise Ratio (SNR). By utilizing several generation processes, the proposed algorithm can efficiently generate the physical layer key during the ranging session.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2478-2482"},"PeriodicalIF":3.7,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142636336","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学术官方微信