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

IEEE Communications Letters最新文献

筛选
英文 中文
LEO Satellite-Assisted GSSK With Optimized Antenna Combination Selections and Detector 天线组合选择与探测器优化的LEO卫星辅助GSSK
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-04-01 DOI: 10.1109/LCOMM.2025.3556874
Chaorong Zhang;Ieok Cheng Wong;Benjamin K. Ng;Chan-Tong Lam
{"title":"LEO Satellite-Assisted GSSK With Optimized Antenna Combination Selections and Detector","authors":"Chaorong Zhang;Ieok Cheng Wong;Benjamin K. Ng;Chan-Tong Lam","doi":"10.1109/LCOMM.2025.3556874","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3556874","url":null,"abstract":"This letter introduces the LEO satellite-assisted generalized space shift keying (LEO-GSSK) scheme, as a trade-off wireless scheme with satisfactory spectral efficiency and bit error rate (BER) performance. We adopt advanced antenna combination selection strategies to further decrease complexity and enhance BER performance. Moreover, a low-complexity detector is designed in this investigated scheme while maintaining the acceptable BER. This detector also reduces complexity and mitigates the side effects of imperfect CSI estimation. The analytical performance of the LEO-GSSK scheme is presented in this letter, along with some interesting insights and conclusions given in simulation results. Besides, to approach practical wireless environment, the imperfect CSI estimation is considered in simulation results. The theoretical analysis and simulation results indicate that the LEO-GSSK scheme with novel antenna combination selection and detector designs, outperforms traditional schemes, offering a promising solution to meet the high data rate and reliable connectivity demands of satellite communications.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1210-1214"},"PeriodicalIF":3.7,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144272699","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
Metaheuristic Optimization of Trajectory and Dynamic Time Splitting for UAV Communication Systems 无人机通信系统的轨迹元启发式优化与动态时间分割
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-04-01 DOI: 10.1109/LCOMM.2025.3556714
Trinh Van Chien;Nguyen Minh Quan;Oh-Soon Shin;Van-Dinh Nguyen
{"title":"Metaheuristic Optimization of Trajectory and Dynamic Time Splitting for UAV Communication Systems","authors":"Trinh Van Chien;Nguyen Minh Quan;Oh-Soon Shin;Van-Dinh Nguyen","doi":"10.1109/LCOMM.2025.3556714","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3556714","url":null,"abstract":"The integration of unmanned aerial vehicles (UAVs) into wireless communication systems has emerged as a transformative approach, promising cost-efficient connectivity. This letter addresses the optimization of the dynamic time-splitting ratio and flight trajectory for a communication system linking a ground base station to the UAV equipped with backscatter devices (referred to as UB), and from UB to an end user. Given the inherent non-convexity of the problem, we develop two meta-heuristic-based approaches inspired by genetic algorithm and particle swarm optimization to enhance the total achievable rate while reducing computational complexity. Numerical results demonstrate the effectiveness of these meta-heuristic solutions, showcasing significant improvements in the achievable rate and computation time compared to existing benchmarks.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1200-1204"},"PeriodicalIF":3.7,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144272772","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
Generalized Extended Welch Bound for Multi-Cell Non-Orthogonal Sequence Sets 多单元非正交序列集的广义扩展Welch界
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-04-01 DOI: 10.1109/LCOMM.2025.3555222
Bingsheng Shen;Kaiqiang Liu;Zhi Gu;Yang Yang;Zhengchun Zhou
{"title":"Generalized Extended Welch Bound for Multi-Cell Non-Orthogonal Sequence Sets","authors":"Bingsheng Shen;Kaiqiang Liu;Zhi Gu;Yang Yang;Zhengchun Zhou","doi":"10.1109/LCOMM.2025.3555222","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3555222","url":null,"abstract":"Sequence sets with minimum total squared correlation (TSC) have important application in communications. In a multi-cell system, due to the difference in channel strength between the home cell and the neighboring cells, the TSC can be expressed as the sum of squares of weighted correlations among sequences. In this letter, we obtain a closed-form expression for the lower bound of weighted TSC under multi-cell systems which can be regarded as a generalization of the extended Welch bound, namely generalized extended welch bound (GEWB). Moreover, we find a class of sequence sets whose parameters can achieve the theoretical lower bound of the weighted TSC, indicating that the derived GEWB is tight.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1176-1180"},"PeriodicalIF":3.7,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144272911","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
Bandwidth Expansion in N-Fold Frequency Multiplier: Is It N or √N? N倍频倍频器的带宽扩展是N还是√N？
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-04-01 DOI: 10.1109/LCOMM.2025.3556767
Ahmet Alperen Oznam;Chouaieb Farhati;Mohaned Chraiti;Ali Ghrayeb;Hasari Celebi;Fatma Abdelkefi;Korkut Kaan Tokgoz
{"title":"Bandwidth Expansion in N-Fold Frequency Multiplier: Is It N or √N?","authors":"Ahmet Alperen Oznam;Chouaieb Farhati;Mohaned Chraiti;Ali Ghrayeb;Hasari Celebi;Fatma Abdelkefi;Korkut Kaan Tokgoz","doi":"10.1109/LCOMM.2025.3556767","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3556767","url":null,"abstract":"Frequency up-conversion is an essential step in wireless communication systems. Meanwhile, frequency multipliers are increasingly becoming an integral part of communication chains operating at millimeter-wave (mmWave) and sub-terahertz (sub-THz) frequencies. They offer a viable alternative to traditional mixers, which are highly constrained by their instability and high phase noise at such high frequencies. Despite the frequency multipliers’ advantages and the fact that they are commonly recommended by hardware designers, there is a lack of comprehensive theoretical guidelines detailing their impact on digital communications. One key aspect is their tendency to induce bandwidth expansion, a phenomenon not observed with mixers. When an N-fold frequency multiplier is used, a common practice among hardware designers is to allocate a bandwidth scaled by a multiple of N, which is deemed large enough to keep signals integrity. We provide an analytical framework to quantify the exact scaling factor of the bandwidth expansion. Contrary to common belief, we show that the bandwidth expansion scales as <inline-formula> <tex-math>$ sqrt {N} $ </tex-math></inline-formula>, using three counterexamples, namely Gaussian, Sinc, and raised cosine pulses. These findings can help conserve radio resources and further decrease the noise effect.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1205-1209"},"PeriodicalIF":3.7,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144272776","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
The Pulse Timer Algorithm for Mobile Molecular Communication 移动分子通信的脉冲定时器算法
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-03-31 DOI: 10.1109/LCOMM.2025.3556545
Motoharu Nishino;Tadashi Nakano
{"title":"The Pulse Timer Algorithm for Mobile Molecular Communication","authors":"Motoharu Nishino;Tadashi Nakano","doi":"10.1109/LCOMM.2025.3556545","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3556545","url":null,"abstract":"This letter explores mobile molecular communication, where bio-nanomachines interact and coordinate movement using signal molecules in aqueous environments. In the system studied, a sender emits periodic pulses of signal molecules that propagate through the environment, while a receiver observes these pulses to determine the sender’s direction. We propose the Pulse Timer Algorithm (PTA), a novel approach that leverages the Doppler shift, where the observed intervals between pulses change depending on the receiver’s motion relative to the sender. By setting a timer upon pulse detection, the PTA enables the receiver to maintain its direction of movement toward the sender if pulses arrive before the timer expires or change direction if no pulse is detected. Comparative analysis with the Pulse Interval Comparison Algorithm (PICA) demonstrates the PTA’s superior performance in guiding the receiver to the sender efficiently.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1196-1199"},"PeriodicalIF":3.7,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144272646","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 Multi-Carrier Deep Learning CSK Communication System 一种多载波深度学习CSK通信系统
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-03-31 DOI: 10.1109/LCOMM.2025.3556474
Majid Mobini;Georges Kaddoum;Marijan Herceg
{"title":"A Multi-Carrier Deep Learning CSK Communication System","authors":"Majid Mobini;Georges Kaddoum;Marijan Herceg","doi":"10.1109/LCOMM.2025.3556474","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3556474","url":null,"abstract":"A new Multi-Carrier Deep Learning Chaos Shift Keying (MC-DLCSK) modulation is designed in this letter. The proposed receiver includes a Neural Network (NN)-based classifier that recovers MC-DLCSK signals. The results demonstrate that the MC-DLCSK system achieves a considerable Bit Error Rate (BER) gain compared to all existing similar systems under both Additive White Gaussian Noise (AWGN) and Rayleigh fading channels.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1191-1195"},"PeriodicalIF":3.7,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144272645","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
FSIM-Net: Neural Network-Based Symbol Detector for Filter Shape Index Modulation FSIM-Net：基于神经网络的滤波器形状指数调制符号检测器
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-03-31 DOI: 10.1109/LCOMM.2025.3556431
Shubham Anand;Haïfa Farès;Majed Saad;Preetam Kumar
{"title":"FSIM-Net: Neural Network-Based Symbol Detector for Filter Shape Index Modulation","authors":"Shubham Anand;Haïfa Farès;Majed Saad;Preetam Kumar","doi":"10.1109/LCOMM.2025.3556431","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3556431","url":null,"abstract":"Filter shape index modulation (FSIM) is a promising approach that unlike most existing index modulation schemes does not sacrifice resource utilization by deactivating available resources but rather uses pulse shaping filters as indexing parameters. This principle is the key to enhance spectral efficiency and/or energy efficiency. However, the filter bank design relaxes the Nyquist criterion for zero intersymbol interference (ISI) to have more distinguishable filters and the inherent controlled ISI can be managed at the receiver side. This letter presents FSIM-Net, a simple neural network (NN)-based detector that enables joint detection of filter indices and QAM/PSK symbols in the presence of filters’ inherent ISI. FSIM-Net is trained offline in an additive white Gaussian noise (AWGN) channel and tested under various conditions by decoupling of inherent ISI and channel effect handling. The proposed receiver demonstrates superior performance especially in more realistic scenarios while simplifying the FSIM receiver architecture and avoiding potential error propagation compared to the conventional one.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"1141-1145"},"PeriodicalIF":3.7,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143932262","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
Optimized Qubit-Based Synchronization in Quantum Key Distribution 量子密钥分发中基于量子比特的优化同步
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-03-28 DOI: 10.1109/LCOMM.2025.3554260
Hao-Bing Sun;Jian Li;Xing-Wang Chu;Jing-Yang Liu;Hua-Jian Ding;Qin Wang
{"title":"Optimized Qubit-Based Synchronization in Quantum Key Distribution","authors":"Hao-Bing Sun;Jian Li;Xing-Wang Chu;Jing-Yang Liu;Hua-Jian Ding;Qin Wang","doi":"10.1109/LCOMM.2025.3554260","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3554260","url":null,"abstract":"Quantum key distribution (QKD) enables the generation of information-theoretic secure keys between two remote parties. A critical component of successful QKD implementation is the effective synchronization of clocks between these users. Traditional methods of locking to a reference clock or transmitting a synchronization signal rely on auxiliary equipment, which increases the complexity and cost, thus hindering the widespread deployment of QKD. Here, we propose a method to achieve clock and pulse synchronization by exploiting a subset of the transmitted qubits. We demonstrate our scheme with a time-bin phase-coding BB84 QKD system and verify the realization of long-term stable key generation over distances of 50 km and 100 km. Our method simplifies the implementation of QKD systems and introduces new possibilities for synchronization algorithms in other quantum communication protocols.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"1087-1091"},"PeriodicalIF":3.7,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143938024","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 for mmWave Cell-Free Access Network Based on Terahertz Backhaul 基于太赫兹回程的毫米波无蜂窝接入网性能分析
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-03-28 DOI: 10.1109/LCOMM.2025.3555748
Hongxin Lin;Yuanjian Li;Guanghui Chen;Zening Liu;Yongming Huang
{"title":"Performance Analysis for mmWave Cell-Free Access Network Based on Terahertz Backhaul","authors":"Hongxin Lin;Yuanjian Li;Guanghui Chen;Zening Liu;Yongming Huang","doi":"10.1109/LCOMM.2025.3555748","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3555748","url":null,"abstract":"This letter proposes a downlink cell-free massive multiple-input multiple-output (CF-mMIMO) network architecture integrating terahertz (THz) backhaul and millimeter wave (mmWave) access, where a source server transmits signals to the central processing unit (CPU) via THz links, then enabling adaptive decode-and-forward transmission to multiple fiber-connected mmWave access points (APs). A novel fluctuating two-ray (FTR) fading model is adopted to characterize mmWave links for accurate performance analysis. Closed-form expressions for outage probability and ergodic capacity are derived for maximum ratio combining (MRC) receivers, complemented by asymptotic analysis in high signal-to-noise ratio (SNR) regimes. Extensive simulations validate the analytical results and demonstrate a critical trade-off: while increasing the number of APs yields marginal outage probability improvement due to THz backhaul limitations, it substantially enhances ergodic capacity through effective spatial multiplexing.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 6","pages":"1181-1185"},"PeriodicalIF":3.7,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144272799","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
Space-to-Ground Optical Communication Downlink Scheduling Under Uncertainty of Link Availability 链路可用性不确定条件下的空地光通信下行调度
IF 3.7 3区 计算机科学
IEEE Communications Letters Pub Date : 2025-03-28 DOI: 10.1109/LCOMM.2025.3555945
Pei Lyu;Kanglian Zhao;Shihao Wang;Hangsheng Zhao
{"title":"Space-to-Ground Optical Communication Downlink Scheduling Under Uncertainty of Link Availability","authors":"Pei Lyu;Kanglian Zhao;Shihao Wang;Hangsheng Zhao","doi":"10.1109/LCOMM.2025.3555945","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3555945","url":null,"abstract":"Space-to-ground optical communication (STGOC) utilizes laser beams to establish bidirectional links between satellites and ground stations (GSs), which are sensitive to cloud blockage. In practical STGOC downlink scheduling, the uncertainty of link availability caused by cloud motion and dissipation is inevitable. We are the first to address STGOC downlink scheduling under the uncertainty of link availability, where the objective function aims to maximize the amount of data downloaded from the satellites. We provide a formulation of the scheduling problem based on Scenario Generation Approximating (SGA) while preserving the formulation linearity. A Greedy Heuristic-based algorithm is designed to solve the problem. Simulation results indicate that considering uncertainty can enhance data throughput, with the average optimality gap being 0.61%, while the running time is reduced compared to Gurobi and Kuhn-Munkres-based methods.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 5","pages":"1136-1140"},"PeriodicalIF":3.7,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143932263","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学术官方微信