Pub Date : 2025-12-03DOI: 10.1109/LCOMM.2025.3639928
Leandro R. Ximenes;Igor S. C. Rodrigues;Miguel S. Pinheiro
This letter presents a unified framework to achieve space-time-color coding for screen-to-camera (S2C) communication. The novel approach integrates color-shift keying (CSK) modulation, tensor-based S2C modeling, and the visible light communications (VLC) scheme called color-hopping space-time (CHST) scheme to enable high-order, flicker-free video transmission. We further propose the alternating optimization for Khatri-Rao factorization (AO-KRF) algorithm for efficient symbol detection, achieving fast convergence and low complexity. Simulation and experimental results, including real video and real screen–smartphone setups under ambient light, confirm that AO-KRF attains good performance while reducing computational cost, making the framework suitable for real-time and realistic S2C communication scenarios.
{"title":"Space-Time-Color Scheme for Screen-to-Camera Communications","authors":"Leandro R. Ximenes;Igor S. C. Rodrigues;Miguel S. Pinheiro","doi":"10.1109/LCOMM.2025.3639928","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3639928","url":null,"abstract":"This letter presents a unified framework to achieve space-time-color coding for screen-to-camera (S2C) communication. The novel approach integrates color-shift keying (CSK) modulation, tensor-based S2C modeling, and the visible light communications (VLC) scheme called color-hopping space-time (CHST) scheme to enable high-order, flicker-free video transmission. We further propose the alternating optimization for Khatri-Rao factorization (AO-KRF) algorithm for efficient symbol detection, achieving fast convergence and low complexity. Simulation and experimental results, including real video and real screen–smartphone setups under ambient light, confirm that AO-KRF attains good performance while reducing computational cost, making the framework suitable for real-time and realistic S2C communication scenarios.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"507-511"},"PeriodicalIF":4.4,"publicationDate":"2025-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11275689","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145778259","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}
In pulse orthogonal frequency division multiplexing (OFDM)-based integrated sensing and communication (ISAC) systems, the embedding of communication signals typically leads to elevated autocorrelation sidelobe levels (SLLs) and increased peak-to-average power ratio (PAPR). This letter proposes a sequence design framework that jointly optimizes sensing and communication performance where a PAPR constraint is incorporated to regulate signal power fluctuations. To address the resulting non-convex problem, an efficient algorithm is developed by integrating the alternating direction method of multipliers (ADMM) with coordinate descent (CD). Simulations show the method achieves low SLLs below –30 dB while ensuring robust communication reliability.
{"title":"Pulse OFDM-Based ISAC Sequence Design With Low Sidelobe Levels and PAPR Property","authors":"Jizhou Chen;Kainan Cheng;Jun Li;Jinyang He;Huiyong Li;Dezhi Wang;Ziyang Cheng","doi":"10.1109/LCOMM.2025.3639622","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3639622","url":null,"abstract":"In pulse orthogonal frequency division multiplexing (OFDM)-based integrated sensing and communication (ISAC) systems, the embedding of communication signals typically leads to elevated autocorrelation sidelobe levels (SLLs) and increased peak-to-average power ratio (PAPR). This letter proposes a sequence design framework that jointly optimizes sensing and communication performance where a PAPR constraint is incorporated to regulate signal power fluctuations. To address the resulting non-convex problem, an efficient algorithm is developed by integrating the alternating direction method of multipliers (ADMM) with coordinate descent (CD). Simulations show the method achieves low SLLs below –30 dB while ensuring robust communication reliability.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"527-531"},"PeriodicalIF":4.4,"publicationDate":"2025-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145778226","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}
Pub Date : 2025-11-28DOI: 10.1109/LCOMM.2025.3638736
Yuanbo Liu;Weiyang Xu;Yucheng Wu
Existing methods for impulsive noise (IN) suppression in power line communication (PLC) suffer from error floors, particularly in frequency-selective channels. We introduce the multi-scale wavelet attention network (MSWANet), a two-stage deep learning framework to address this issue. The proposed architecture first leverages the frame preamble for initial channel estimation. The resulting channel state information (CSI) then guides the MSWANet in denoising the data symbols. MSWANet synergistically integrates wavelet transforms for efficient multiscale analysis with gated attention for precise feature fusion, allowing it to accurately separate sporadic IN from the desired signal. Validated on a public real-world noise dataset, this decoupled approach demonstrates at least 6.3 dB SINR gain over competing methods at a target bit error rate of $10^{-5}$ .
现有的电力线通信（PLC）脉冲噪声抑制方法存在误差层，特别是在频率选择信道中。我们引入了多尺度小波注意网络（MSWANet），一个两阶段深度学习框架来解决这个问题。所提出的架构首先利用帧前导进行初始信道估计。由此产生的信道状态信息（CSI）然后指导MSWANet去噪数据符号。MSWANet协同集成小波变换，用于有效的多尺度分析，并具有精确特征融合的门控注意，使其能够准确地从所需信号中分离零星的IN。在公开的真实世界噪声数据集上验证，这种解耦方法在目标误码率为10^{-5}$的情况下，比竞争方法至少获得6.3 dB SINR增益。
{"title":"A Two-Stage Network for PLC Impulsive Noise Suppression and Channel Estimation","authors":"Yuanbo Liu;Weiyang Xu;Yucheng Wu","doi":"10.1109/LCOMM.2025.3638736","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3638736","url":null,"abstract":"Existing methods for impulsive noise (IN) suppression in power line communication (PLC) suffer from error floors, particularly in frequency-selective channels. We introduce the multi-scale wavelet attention network (MSWANet), a two-stage deep learning framework to address this issue. The proposed architecture first leverages the frame preamble for initial channel estimation. The resulting channel state information (CSI) then guides the MSWANet in denoising the data symbols. MSWANet synergistically integrates wavelet transforms for efficient multiscale analysis with gated attention for precise feature fusion, allowing it to accurately separate sporadic IN from the desired signal. Validated on a public real-world noise dataset, this decoupled approach demonstrates at least 6.3 dB SINR gain over competing methods at a target bit error rate of <inline-formula> <tex-math>$10^{-5}$ </tex-math></inline-formula>.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"297-301"},"PeriodicalIF":4.4,"publicationDate":"2025-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145760927","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}
Pub Date : 2025-11-27DOI: 10.1109/LCOMM.2025.3637904
Zhenhui Yang;Kechao Cai;Zhuoyue Chen;Jinbei Zhang
Quantum satellite networks enable entanglement distribution between ground stations, but existing single-satellite solutions relying solely on satellite-to-ground downlinks cannot effectively support long-distance entanglement distribution. To overcome this limitation, we propose a hybrid approach, Entanglement Distribution using Hybrid Links (ED-HL), which integrates both entanglement distribution using a single satellite (ED-SS) and entanglement distribution assisted by inter-satellite links (ED-IS), where satellites are equipped with quantum memories. The key challenge in ED-HL is to effectively coordinate satellites to distribute entanglement to ground stations via inter-satellite links and downlinks. We formulate this entanglement distribution problem as an integer programming problem, establish its submodularity, monotonicity and non-negativity properties, and design a greedy algorithm for its solution. Simulations based on real-world constellation data show that ED-HL significantly extends the entanglement distribution distance compared to single-satellite approaches.
{"title":"Optimizing Satellite-to-Ground Station Pair Assignments Using Hybrid Links for Long-Distance Quantum Entanglement Distribution","authors":"Zhenhui Yang;Kechao Cai;Zhuoyue Chen;Jinbei Zhang","doi":"10.1109/LCOMM.2025.3637904","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3637904","url":null,"abstract":"Quantum satellite networks enable entanglement distribution between ground stations, but existing single-satellite solutions relying solely on satellite-to-ground downlinks cannot effectively support long-distance entanglement distribution. To overcome this limitation, we propose a hybrid approach, Entanglement Distribution using Hybrid Links (ED-HL), which integrates both entanglement distribution using a single satellite (ED-SS) and entanglement distribution assisted by inter-satellite links (ED-IS), where satellites are equipped with quantum memories. The key challenge in ED-HL is to effectively coordinate satellites to distribute entanglement to ground stations via inter-satellite links and downlinks. We formulate this entanglement distribution problem as an integer programming problem, establish its submodularity, monotonicity and non-negativity properties, and design a greedy algorithm for its solution. Simulations based on real-world constellation data show that ED-HL significantly extends the entanglement distribution distance compared to single-satellite approaches.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"322-326"},"PeriodicalIF":4.4,"publicationDate":"2025-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145760929","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}
Pub Date : 2025-11-26DOI: 10.1109/LCOMM.2025.3637247
Ki-Ho Lee;Hyun-Ho Choi;Jung-Ryun Lee
This letter proposes an attention-driven semantic transmission scheme for AI-native wireless communications. Leveraging self-attention scores from a pretrained bidirectional encoder representations from Transformers (BERT) model, the framework prioritizes semantically important tokens in both initial transmission and retransmission stages, without task-specific supervision. Experiments on sentences from public web sources confirm consistent improvements over conventional baselines in semantic fidelity, measured by cosine similarity and BERTScore. This model-agnostic approach provides a practical solution for robust and bandwidth-efficient communication, supporting future AI-native systems that prioritize meaning preservation over exact symbol reconstruction.
{"title":"Attention-Driven Semantic Transmission Scheme for AI-Native Wireless Communications","authors":"Ki-Ho Lee;Hyun-Ho Choi;Jung-Ryun Lee","doi":"10.1109/LCOMM.2025.3637247","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3637247","url":null,"abstract":"This letter proposes an attention-driven semantic transmission scheme for AI-native wireless communications. Leveraging self-attention scores from a pretrained bidirectional encoder representations from Transformers (BERT) model, the framework prioritizes semantically important tokens in both initial transmission and retransmission stages, without task-specific supervision. Experiments on sentences from public web sources confirm consistent improvements over conventional baselines in semantic fidelity, measured by cosine similarity and BERTScore. This model-agnostic approach provides a practical solution for robust and bandwidth-efficient communication, supporting future AI-native systems that prioritize meaning preservation over exact symbol reconstruction.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"287-291"},"PeriodicalIF":4.4,"publicationDate":"2025-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145760926","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}
This letter investigates channel estimation for ultra-massive multiple-input multiple-output (MIMO) communications. We propose a joint low-rank and sparse Bayesian estimation (LRSBE) algorithm for spatial non-stationary ultra-massive channels by exploiting the low-rankness and sparsity in the beam domain. Specifically, the channel estimation integrates sparse Bayesian learning and soft-threshold gradient descent within the expectation-maximization framework. Simulation results show that the proposed algorithm significantly outperforms the state-of-the-art alternatives under different signal-to-noise ratio conditions in terms of estimation accuracy and overall complexity.
{"title":"Joint Low-Rank and Sparse Bayesian Channel Estimation for Ultra-Massive MIMO Communications","authors":"Jianghan Ji;Cheng-Xiang Wang;Shuaifei Chen;Chen Huang;Xiping Wu;Emil Björnson","doi":"10.1109/LCOMM.2025.3637318","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3637318","url":null,"abstract":"This letter investigates channel estimation for ultra-massive multiple-input multiple-output (MIMO) communications. We propose a joint low-rank and sparse Bayesian estimation (LRSBE) algorithm for spatial non-stationary ultra-massive channels by exploiting the low-rankness and sparsity in the beam domain. Specifically, the channel estimation integrates sparse Bayesian learning and soft-threshold gradient descent within the expectation-maximization framework. Simulation results show that the proposed algorithm significantly outperforms the state-of-the-art alternatives under different signal-to-noise ratio conditions in terms of estimation accuracy and overall complexity.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"312-316"},"PeriodicalIF":4.4,"publicationDate":"2025-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145760848","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}
Pub Date : 2025-11-26DOI: 10.1109/LCOMM.2025.3637401
Zhuangzhuang Tie;Zan Li;Jia Shi;Jiangbo Si
This letter investigates physical-layer security for orthogonal time frequency space (OTFS) systems under a discriminatory channel estimation (DCE) scheme that exploits the block-circulant structure of the delay–Doppler channel and coarse prior knowledge. We derive a fixed-point characterization of the linear minimum mean square error (LMMSE) channel-estimation error that captures the impact of pilot power, interference and multipath richness. A closed-form expression for the secrecy rate is obtained, showing that secrecy improves with pilot power at low-to-moderate levels but deteriorates in the high-power regime. Numerical results validate the analysis and reveal trade-offs among pilot allocation, path diversity and secrecy performance.
{"title":"Secure OTFS Transmission: A Theoretical Framework Based on Discriminatory Channel Estimation","authors":"Zhuangzhuang Tie;Zan Li;Jia Shi;Jiangbo Si","doi":"10.1109/LCOMM.2025.3637401","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3637401","url":null,"abstract":"This letter investigates physical-layer security for orthogonal time frequency space (OTFS) systems under a discriminatory channel estimation (DCE) scheme that exploits the block-circulant structure of the delay–Doppler channel and coarse prior knowledge. We derive a fixed-point characterization of the linear minimum mean square error (LMMSE) channel-estimation error that captures the impact of pilot power, interference and multipath richness. A closed-form expression for the secrecy rate is obtained, showing that secrecy improves with pilot power at low-to-moderate levels but deteriorates in the high-power regime. Numerical results validate the analysis and reveal trade-offs among pilot allocation, path diversity and secrecy performance.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"327-331"},"PeriodicalIF":4.4,"publicationDate":"2025-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145760854","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}
Pub Date : 2025-11-26DOI: 10.1109/LCOMM.2025.3637721
Duc Trong Minh Hoang;Long Bao Le
This letter studies the backdoor attack on the task-oriented digital semantic communication system. We propose TrojanDSC, a two-stage backdoor learning strategy. Specifically, in the first stage we focus the attack on the critical latent dimensions using an optimized latent trigger, and in the second stage we fine-tune the semantic encoder and classification layer. We evaluate TrojanDSC across a range of channel conditions, trigger types, and the fine-tuning defense, showing that it achieves an attack success rate (ASR) over 94% for the poison rates of 10% or more with negligible accuracy degradation on clean inputs and remains effective even after the fine-tuning defense.
{"title":"Backdoor Attacks on Semantic Communications Systems With Joint Source and Channel Coding","authors":"Duc Trong Minh Hoang;Long Bao Le","doi":"10.1109/LCOMM.2025.3637721","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3637721","url":null,"abstract":"This letter studies the backdoor attack on the task-oriented digital semantic communication system. We propose TrojanDSC, a two-stage backdoor learning strategy. Specifically, in the first stage we focus the attack on the critical latent dimensions using an optimized latent trigger, and in the second stage we fine-tune the semantic encoder and classification layer. We evaluate TrojanDSC across a range of channel conditions, trigger types, and the fine-tuning defense, showing that it achieves an attack success rate (ASR) over 94% for the poison rates of 10% or more with negligible accuracy degradation on clean inputs and remains effective even after the fine-tuning defense.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"273-277"},"PeriodicalIF":4.4,"publicationDate":"2025-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145760905","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}
Pub Date : 2025-11-25DOI: 10.1109/LCOMM.2025.3636940
Shunwai Zhang;Hong Liu
In this letter, we propose a reconfigurable intelligent surface (RIS)-assisted decode-and-forward (DF) relay system based on polarization-adjusted convolutional (PAC) codes to achieve enhanced ultra-reliable and low-latency performance in short packet communications. Firstly, we derive closed-form expressions for the upper and lower bounds of the ideal ergodic capacity (EC) under Rayleigh fading channels using Jensen’s inequality and Taylor series expansion. Secondly, for practical short packet communications, we further derive the upper bound of the EC with finite blocklength via Gamma approximation method. Simulation results demonstrate the tightness of the derived bounds. The results also show that the proposed system based on PAC coding scheme is superior to the benchmark polar coding scheme and low density parity check (LDPC) coding scheme for short packet communications.
{"title":"RIS-Assisted DF Relay System Based on PAC Codes for Short Packet Communication","authors":"Shunwai Zhang;Hong Liu","doi":"10.1109/LCOMM.2025.3636940","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3636940","url":null,"abstract":"In this letter, we propose a reconfigurable intelligent surface (RIS)-assisted decode-and-forward (DF) relay system based on polarization-adjusted convolutional (PAC) codes to achieve enhanced ultra-reliable and low-latency performance in short packet communications. Firstly, we derive closed-form expressions for the upper and lower bounds of the ideal ergodic capacity (EC) under Rayleigh fading channels using Jensen’s inequality and Taylor series expansion. Secondly, for practical short packet communications, we further derive the upper bound of the EC with finite blocklength via Gamma approximation method. Simulation results demonstrate the tightness of the derived bounds. The results also show that the proposed system based on PAC coding scheme is superior to the benchmark polar coding scheme and low density parity check (LDPC) coding scheme for short packet communications.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"263-267"},"PeriodicalIF":4.4,"publicationDate":"2025-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145760899","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}
Reconfigurable intelligent surfaces (RISs) have been emerging as a key technology for future wireless systems, where accurate characterization of reflection properties is a prerequisite for practical applications. While existing characterization methods rely on specialized facilities like anechoic chambers or horn antennas, this letter proposes an in-situ self-calibration approach that estimates RIS reflection characteristics by leveraging the RIS itself to generate diverse observation patterns for validation. The approach utilizes an alternating optimization method to separately estimate the RIS reflection coefficients and wireless channel parameters, thereby addressing the coupling between wireless channel propagation and RIS modulation in the received signals. Real-world experiments with an RIS prototype validate the effectiveness of the proposed approach, demonstrating its feasibility for practical RIS deployment.
{"title":"Estimating RIS Reflection Characteristics via In-Situ Self-Calibration","authors":"Fengquan Zhan;Dongheng Zhang;Ganlin Zhang;Ruixu Geng;Yan Chen","doi":"10.1109/LCOMM.2025.3636857","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3636857","url":null,"abstract":"Reconfigurable intelligent surfaces (RISs) have been emerging as a key technology for future wireless systems, where accurate characterization of reflection properties is a prerequisite for practical applications. While existing characterization methods rely on specialized facilities like anechoic chambers or horn antennas, this letter proposes an in-situ self-calibration approach that estimates RIS reflection characteristics by leveraging the RIS itself to generate diverse observation patterns for validation. The approach utilizes an alternating optimization method to separately estimate the RIS reflection coefficients and wireless channel parameters, thereby addressing the coupling between wireless channel propagation and RIS modulation in the received signals. Real-world experiments with an RIS prototype validate the effectiveness of the proposed approach, demonstrating its feasibility for practical RIS deployment.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"282-286"},"PeriodicalIF":4.4,"publicationDate":"2025-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145760921","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：