Accurate LOS/NLOS identification is essential for robust Wi-Fi localization and sensing, yet existing COTS-based methods suffer from high data requirements (e.g., 100–500 packets) and AGC-induced amplitude distortion. To overcome these limitations, we propose two AGC-robust features: CIR Decay, capturing post-peak energy decay in the time-domain channel impulse response, and SEoAR (Sample Entropy of Amplitude Ratios), quantifying frequency-domain signal complexity using CSI amplitude ratios that inherently cancel AGC effects. Evaluated on Wi-Fi 6 COTS devices, our approach achieves 94% weighted accuracy with only 10 CSI packets, reducing data needs by over 90% compared to PhaseU and LiFi. This ultra-low sample dependency enables real-time, lightweight LOS/NLOS identification on resource-constrained edge platforms.
{"title":"Sample-Efficient LOS/NLOS Identification in Wi-Fi 6 With COTS Devices","authors":"Jian Wang;Lixing Wang;Haotian Zhang;Qingxu Deng;Wei Fang;Daqing Chen;Chao Shi;Jingyu Dong","doi":"10.1109/LCOMM.2025.3644181","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3644181","url":null,"abstract":"Accurate LOS/NLOS identification is essential for robust Wi-Fi localization and sensing, yet existing COTS-based methods suffer from high data requirements (e.g., 100–500 packets) and AGC-induced amplitude distortion. To overcome these limitations, we propose two AGC-robust features: CIR Decay, capturing post-peak energy decay in the time-domain channel impulse response, and SEoAR (Sample Entropy of Amplitude Ratios), quantifying frequency-domain signal complexity using CSI amplitude ratios that inherently cancel AGC effects. Evaluated on Wi-Fi 6 COTS devices, our approach achieves 94% weighted accuracy with only 10 CSI packets, reducing data needs by over 90% compared to PhaseU and LiFi. This ultra-low sample dependency enables real-time, lightweight LOS/NLOS identification on resource-constrained edge platforms.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"622-626"},"PeriodicalIF":4.4,"publicationDate":"2025-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145830896","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 presents an improved non-orthogonal multiple access (NOMA) design using time-domain interleaving (TDI). The frequency diversity inherent in TDI is leveraged to improve the bit error rate (BER) of NOMA by mitigating the detrimental effects of channel frequency selectivity. The instantaneous signal-to-interference-plus-noise ratio (SINR) of the proposed system is derived and used to evaluate the BER using minimum-mean-square-error (MMSE) equalization semi-analytically with spatial diversity over frequency-selective fading channels for an arbitrary number of users. Moreover, a tight analytic lower-bound (LB) is derived to enable efficient BER evaluation. The obtained analytical results, corroborated by Monte Carlo simulation, demonstrate that TDI can provide significant BER improvement to NOMA by resolving the performance degradation caused by severe fading and multi-user interference. The synergy of receiver spatial diversity and TDI enabled the low-complexity zero-forcing (ZF) equalizer to offer BER that is comparable to MMSE, which is drastically different from the single-input single-output (SISO) case.
{"title":"Design and Performance Analysis of NOMA-OFDM With Time-Domain Interleaving","authors":"Tasneem Assaf;Welelaw Lakew;Shihab Jimaa;Arafat Al-Dweik","doi":"10.1109/LCOMM.2025.3644341","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3644341","url":null,"abstract":"This letter presents an improved non-orthogonal multiple access (NOMA) design using time-domain interleaving (TDI). The frequency diversity inherent in TDI is leveraged to improve the bit error rate (BER) of NOMA by mitigating the detrimental effects of channel frequency selectivity. The instantaneous signal-to-interference-plus-noise ratio (SINR) of the proposed system is derived and used to evaluate the BER using minimum-mean-square-error (MMSE) equalization semi-analytically with spatial diversity over frequency-selective fading channels for an arbitrary number of users. Moreover, a tight analytic lower-bound (LB) is derived to enable efficient BER evaluation. The obtained analytical results, corroborated by Monte Carlo simulation, demonstrate that TDI can provide significant BER improvement to NOMA by resolving the performance degradation caused by severe fading and multi-user interference. The synergy of receiver spatial diversity and TDI enabled the low-complexity zero-forcing (ZF) equalizer to offer BER that is comparable to MMSE, which is drastically different from the single-input single-output (SISO) case.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"542-546"},"PeriodicalIF":4.4,"publicationDate":"2025-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145830816","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-12-15DOI: 10.1109/LCOMM.2025.3644424
Shu Cai;Yikai Chen;Jun Zhang;Qi Zhang;Zi-Qiong Lian;Ya-Feng Liu
Joint power and admission control (JPAC) is crucial for interference management in wireless networks, but its mixed-integer nature renders the problem NP-hard. This letter pioneers JPAC optimization for fluid antenna system (FAS)-aided interference channels, where users leverage dynamic port selection to enhance spatial diversity. We formulate the FAS-JPAC problem for a K-link single-input single-output (SISO) interference channel as a unified sparse $ell _{0}$ -minimization problem. The introduction of port selection variables induces novel integer constraints and bilinear SINR constraints, challenges absent in prior JPAC formulations. To address these challenges, we propose a generalized $ell _{q}$ -minimization deflation (GLQMD) framework. Our solution features: 1) An alternating direction method of multipliers (ADMM)-based algorithm with semi-closed-form updates for efficient resolution of the nonconvex sparse $ell _{q}$ -minimization subproblem; and 2) Port-aware pre/postprocessing that accelerates deflation and narrow the $ell _{q}$ -$ell _{0}$ approximation gap, respectively. Simulations show that FAS-JPAC yields substantial gains in both admitted links and power efficiency over conventional JPAC baselines while maintaining runtimes on the same order as LQMD.
联合功率与准入控制（JPAC）是无线网络干扰管理的关键，但其混合整数的特性使得该问题难以解决。这封信开创了JPAC优化流体天线系统（FAS）辅助干扰信道，其中用户利用动态端口选择来增强空间多样性。我们将k链路单输入单输出（SISO）干扰信道的FAS-JPAC问题表述为统一的稀疏最小化问题。端口选择变量的引入引入了新的整数约束和双线性SINR约束，这是以前的JPAC公式所没有的挑战。为了解决这些挑战，我们提出了一个广义的$ well _{q}$最小化通货紧缩（GLQMD）框架。我们的解决方案特点：1)一种基于交替方向乘法器（ADMM）的半封闭更新算法，用于有效解决非凸稀疏$ well _{q}$最小化子问题；2)端口感知的预处理/后处理，分别加速通货紧缩和缩小$ well _{q}$ - $ well _{0}$近似差距。仿真表明，与传统的JPAC基线相比，FAS-JPAC在允许的链路和功率效率方面都取得了实质性的进展，同时保持了与LQMD相同的运行时间。
{"title":"Joint Power and Admission Control for Fluid Antenna System-Aided Interference Channels","authors":"Shu Cai;Yikai Chen;Jun Zhang;Qi Zhang;Zi-Qiong Lian;Ya-Feng Liu","doi":"10.1109/LCOMM.2025.3644424","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3644424","url":null,"abstract":"Joint power and admission control (JPAC) is crucial for interference management in wireless networks, but its mixed-integer nature renders the problem NP-hard. This letter pioneers JPAC optimization for fluid antenna system (FAS)-aided interference channels, where users leverage dynamic port selection to enhance spatial diversity. We formulate the FAS-JPAC problem for a K-link single-input single-output (SISO) interference channel as a unified sparse <inline-formula> <tex-math>$ell _{0}$ </tex-math></inline-formula>-minimization problem. The introduction of port selection variables induces novel integer constraints and bilinear SINR constraints, challenges absent in prior JPAC formulations. To address these challenges, we propose a generalized <inline-formula> <tex-math>$ell _{q}$ </tex-math></inline-formula>-minimization deflation (GLQMD) framework. Our solution features: 1) An alternating direction method of multipliers (ADMM)-based algorithm with semi-closed-form updates for efficient resolution of the nonconvex sparse <inline-formula> <tex-math>$ell _{q}$ </tex-math></inline-formula>-minimization subproblem; and 2) Port-aware pre/postprocessing that accelerates deflation and narrow the <inline-formula> <tex-math>$ell _{q}$ </tex-math></inline-formula>-<inline-formula> <tex-math>$ell _{0}$ </tex-math></inline-formula> approximation gap, respectively. Simulations show that FAS-JPAC yields substantial gains in both admitted links and power efficiency over conventional JPAC baselines while maintaining runtimes on the same order as LQMD.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"557-561"},"PeriodicalIF":4.4,"publicationDate":"2025-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145830915","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-12-15DOI: 10.1109/LCOMM.2025.3644410
Zihang Zeng;Shu Sun;Meixia Tao;Yin Xu;Xianghao Yu
Wireless channel modeling in complex environments is crucial for modern communication system design and deployment. Traditional channel modeling approaches face challenges in balancing accuracy, efficiency, and scalability, while recent neural approaches such as neural radiance field (NeRF) suffer from long training and slow inference. To tackle these challenges, we propose voxelized radiance field (VoxelRF), a novel neural representation for wireless channel modeling that enables fast and accurate synthesis of spatial spectra of received signals. VoxelRF replaces the costly multilayer perceptron (MLP) used in NeRF-based methods with trilinear interpolation of voxel grid-based representation and two shallow MLPs to model both propagation and transmitter-dependent effects. To further accelerate training and inference speed, we introduce an empty space skipping mechanism to reduce sampling in free space. Experimental results demonstrate that VoxelRF achieves competitive accuracy with significantly reduced computation and limited training data, making it more practical for real-time and resource-constrained wireless channel prediction.
{"title":"VoxelRF: Voxelized Radiance Field for Fast Wireless Channel Modeling","authors":"Zihang Zeng;Shu Sun;Meixia Tao;Yin Xu;Xianghao Yu","doi":"10.1109/LCOMM.2025.3644410","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3644410","url":null,"abstract":"Wireless channel modeling in complex environments is crucial for modern communication system design and deployment. Traditional channel modeling approaches face challenges in balancing accuracy, efficiency, and scalability, while recent neural approaches such as neural radiance field (NeRF) suffer from long training and slow inference. To tackle these challenges, we propose voxelized radiance field (VoxelRF), a novel neural representation for wireless channel modeling that enables fast and accurate synthesis of spatial spectra of received signals. VoxelRF replaces the costly multilayer perceptron (MLP) used in NeRF-based methods with trilinear interpolation of voxel grid-based representation and two shallow MLPs to model both propagation and transmitter-dependent effects. To further accelerate training and inference speed, we introduce an empty space skipping mechanism to reduce sampling in free space. Experimental results demonstrate that VoxelRF achieves competitive accuracy with significantly reduced computation and limited training data, making it more practical for real-time and resource-constrained wireless channel prediction.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"617-621"},"PeriodicalIF":4.4,"publicationDate":"2025-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145830871","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-12-15DOI: 10.1109/LCOMM.2025.3644395
Thanh V. Pham;Susumu Ishihara
Optical orthogonal frequency-division multiplexing (OFDM) and probabilistic constellation shaping (PCS) have emerged as powerful techniques to enhance the performance of optical wireless communications (OWC) systems. While PCS improves spectral efficiency and adaptability, we show that its integration with optical OFDM can inadvertently increase the peak-to-average power ratio (PAPR) of the signal, exacerbating clipping distortion due to signal clipping. This letter investigates the impact of PCS on the PAPR of direct current-biased optical OFDM (DCO-OFDM) waveforms and proposes an optimization of PCS that maximizes channel capacity, considering clipping distortion. The optimization problem is shown to be complex and non-convex. We thus present a suboptimal yet efficient solving approach based on projected gradient descent to solve the problem. Simulation results demonstrate the superiority of the proposed approach over the conventional uniform signaling, particularly under severe clipping distortion conditions.
{"title":"Optimization of Probabilistic Constellation Shaping for Optical OFDM Systems With Clipping Distortion","authors":"Thanh V. Pham;Susumu Ishihara","doi":"10.1109/LCOMM.2025.3644395","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3644395","url":null,"abstract":"Optical orthogonal frequency-division multiplexing (OFDM) and probabilistic constellation shaping (PCS) have emerged as powerful techniques to enhance the performance of optical wireless communications (OWC) systems. While PCS improves spectral efficiency and adaptability, we show that its integration with optical OFDM can inadvertently increase the peak-to-average power ratio (PAPR) of the signal, exacerbating clipping distortion due to signal clipping. This letter investigates the impact of PCS on the PAPR of direct current-biased optical OFDM (DCO-OFDM) waveforms and proposes an optimization of PCS that maximizes channel capacity, considering clipping distortion. The optimization problem is shown to be complex and non-convex. We thus present a suboptimal yet efficient solving approach based on projected gradient descent to solve the problem. Simulation results demonstrate the superiority of the proposed approach over the conventional uniform signaling, particularly under severe clipping distortion conditions.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"562-566"},"PeriodicalIF":4.4,"publicationDate":"2025-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145830856","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}
Orthogonal Time Frequency Space (OTFS) suffers from high peak-to-average power ratio (PAPR) when the number of Doppler bins is large. To address this issue, a discrete Fourier transform spread OTFS (DFT-s-OTFS) scheme is employed by applying DFT spreading across the Doppler dimension. This letter presents a thorough PAPR analysis of DFT-s-OTFS using different pulse shaping filters and resource allocation strategies. Specifically, we derive a PAPR upper bound of DFT-s-OTFS of interleaved and block Doppler resource allocation schemes. Our analysis reveals that DFT-s-OTFS with interleaved allocation yields a lower PAPR than that of block allocation. Furthermore, we show that interleaved allocation produces a periodic time-domain signal composed of repeated quadrature amplitude modulated (QAM) symbols which simplifies the transmitter design. From our analytical results, the root raised cosine (RRC) pulse generally results in a higher maximum PAPR compared to the rectangular pulse. Simulation results confirm the validity of the derived PAPR upper bounds. Furthermore, we also demonstrate through BER simulation analysis that the DFT-s-OTFS gives the same performance as OTFS without DFT spreading.
{"title":"PAPR of DFT-s-OTFS With Pulse Shaping","authors":"Jialiang Zhu;Sanoopkumar Pungayil Sasindran;Arman Farhang","doi":"10.1109/LCOMM.2025.3643648","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3643648","url":null,"abstract":"Orthogonal Time Frequency Space (OTFS) suffers from high peak-to-average power ratio (PAPR) when the number of Doppler bins is large. To address this issue, a discrete Fourier transform spread OTFS (DFT-s-OTFS) scheme is employed by applying DFT spreading across the Doppler dimension. This letter presents a thorough PAPR analysis of DFT-s-OTFS using different pulse shaping filters and resource allocation strategies. Specifically, we derive a PAPR upper bound of DFT-s-OTFS of interleaved and block Doppler resource allocation schemes. Our analysis reveals that DFT-s-OTFS with interleaved allocation yields a lower PAPR than that of block allocation. Furthermore, we show that interleaved allocation produces a periodic time-domain signal composed of repeated quadrature amplitude modulated (QAM) symbols which simplifies the transmitter design. From our analytical results, the root raised cosine (RRC) pulse generally results in a higher maximum PAPR compared to the rectangular pulse. Simulation results confirm the validity of the derived PAPR upper bounds. Furthermore, we also demonstrate through BER simulation analysis that the DFT-s-OTFS gives the same performance as OTFS without DFT spreading.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"512-516"},"PeriodicalIF":4.4,"publicationDate":"2025-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11299050","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145778224","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}
Pub Date : 2025-12-11DOI: 10.1109/LCOMM.2025.3642810
Li-Hsiang Shen
This letter proposes a novel six-dimensional movable metasurface (6DMM)-assisted downlink non-orthogonal multiple access (NOMA) system, in which a conventional base station (BS) equipped with fixed antennas serves multiple users with the assistance of a reconfigurable intelligent surface (RIS) with six-dimensional spatial configurability. In contrast to traditional RIS with static surface, the proposed 6DMM architecture allows each element to dynamically adjust its position and orient the whole metasurface in yaw-pitch-roll axes, enabling both spatial and electromagnetic controls. We formulate a sum-rate maximization problem that jointly optimizes the BS NOMA-based beamforming, phase-shifts, element positions, and rotation angles of metasurface under constraints of NOMA power levels, unit-modulus of phase-shifts, power budget, inter-element separation and boundaries of element position/orientation. Due to non-convexity and high-dimensionality, we employ a probabilistic cross-entropy optimization (CEO) scheme to iteratively refine the solution distribution based on maximizing likelihood and elite solution sampling. Simulation results show that the proposed CEO-based 6DMM-NOMA architecture achieves substantial rate performance gains compared to 6DMM sub-structures, conventional static RIS, and other multiple access mechanisms. It also highlights the effectiveness of CEO providing probabilistic optimization for solving high-dimensional scalable metasurface.
{"title":"6D Movable Metasurface (6DMM) in Downlink NOMA Transmissions","authors":"Li-Hsiang Shen","doi":"10.1109/LCOMM.2025.3642810","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3642810","url":null,"abstract":"This letter proposes a novel six-dimensional movable metasurface (6DMM)-assisted downlink non-orthogonal multiple access (NOMA) system, in which a conventional base station (BS) equipped with fixed antennas serves multiple users with the assistance of a reconfigurable intelligent surface (RIS) with six-dimensional spatial configurability. In contrast to traditional RIS with static surface, the proposed 6DMM architecture allows each element to dynamically adjust its position and orient the whole metasurface in yaw-pitch-roll axes, enabling both spatial and electromagnetic controls. We formulate a sum-rate maximization problem that jointly optimizes the BS NOMA-based beamforming, phase-shifts, element positions, and rotation angles of metasurface under constraints of NOMA power levels, unit-modulus of phase-shifts, power budget, inter-element separation and boundaries of element position/orientation. Due to non-convexity and high-dimensionality, we employ a probabilistic cross-entropy optimization (CEO) scheme to iteratively refine the solution distribution based on maximizing likelihood and elite solution sampling. Simulation results show that the proposed CEO-based 6DMM-NOMA architecture achieves substantial rate performance gains compared to 6DMM sub-structures, conventional static RIS, and other multiple access mechanisms. It also highlights the effectiveness of CEO providing probabilistic optimization for solving high-dimensional scalable metasurface.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"517-521"},"PeriodicalIF":4.4,"publicationDate":"2025-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145778157","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-12-11DOI: 10.1109/LCOMM.2025.3639746
Lei Qian;Ang Li;Chenyan Zhang;Wenwen Jiang;Chenguang Zhang;Nuo Huang
The stochastic terminal rotations and random link blockages in visible light communication (VLC) systems can significantly degrade statistical delay performance. To address this, this letter aims to mathematically characterize the statistical delay for VLC systems. First, we propose a Markov-modulated Laplace process (MMLP) service model capturing burstiness from orientation dynamics and blockages. Then, we analytically derive the probability density function of the achievable transmission rate under dynamic channel conditions. Finally, we establish closed-form delay bounds using a unified exponential supermartingale construction. Monte Carlo simulations validate our bounds’ superior accuracy over traditional effective bandwidth/effective capacity methods, particularly in high-burstiness scenarios. Specifically, the proposed bound achieves a delay violation probability from 10-2 to 10-3 at a delay threshold of 1 ms, which meets the stringent requirements of delay-sensitive applications.
{"title":"Statistical Delay Characterization for Visible Light Communication Under Realistic Dynamics","authors":"Lei Qian;Ang Li;Chenyan Zhang;Wenwen Jiang;Chenguang Zhang;Nuo Huang","doi":"10.1109/LCOMM.2025.3639746","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3639746","url":null,"abstract":"The stochastic terminal rotations and random link blockages in visible light communication (VLC) systems can significantly degrade statistical delay performance. To address this, this letter aims to mathematically characterize the statistical delay for VLC systems. First, we propose a Markov-modulated Laplace process (MMLP) service model capturing burstiness from orientation dynamics and blockages. Then, we analytically derive the probability density function of the achievable transmission rate under dynamic channel conditions. Finally, we establish closed-form delay bounds using a unified exponential supermartingale construction. Monte Carlo simulations validate our bounds’ superior accuracy over traditional effective bandwidth/effective capacity methods, particularly in high-burstiness scenarios. Specifically, the proposed bound achieves a delay violation probability from 10-2 to 10-3 at a delay threshold of 1 ms, which meets the stringent requirements of delay-sensitive applications.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"502-506"},"PeriodicalIF":4.4,"publicationDate":"2025-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145778266","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}
Current semantic communication methods encode all features uniformly, however, downstream models are far more sensitive to distortions in high-frequency semantic features than in low-frequency ones. To address this issue, we propose an Ordered Hierarchical Encoding (OHE) framework for semantic image transmission. OHE employs a hierarchical encoding scheme that combine cascaded pooling with cross-attention to construct multi-scale semantic representations, effectively decoupling and extracting low-frequency and high-frequency features. Furthermore, an ordered representation mechanism with random prefix masking enforces a natural prioritization of semantic information, enabling progressive reconstruction and supporting simple, flexible rate control. Extensive experiments conducted on various datasets demonstrate that our method outperforms the baselines.
{"title":"Ordered Hierarchical Encoding for Robust Image Semantic Communication","authors":"Huogen Yang;Zhehao Zhou;Zhongmin Yang;Xianchao Zhang;Shuxiao Ye;Changheng Wang;Guangxue Yue","doi":"10.1109/LCOMM.2025.3642888","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3642888","url":null,"abstract":"Current semantic communication methods encode all features uniformly, however, downstream models are far more sensitive to distortions in high-frequency semantic features than in low-frequency ones. To address this issue, we propose an Ordered Hierarchical Encoding (OHE) framework for semantic image transmission. OHE employs a hierarchical encoding scheme that combine cascaded pooling with cross-attention to construct multi-scale semantic representations, effectively decoupling and extracting low-frequency and high-frequency features. Furthermore, an ordered representation mechanism with random prefix masking enforces a natural prioritization of semantic information, enabling progressive reconstruction and supporting simple, flexible rate control. Extensive experiments conducted on various datasets demonstrate that our method outperforms the baselines.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"532-536"},"PeriodicalIF":4.4,"publicationDate":"2025-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145830814","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-12-10DOI: 10.1109/LCOMM.2025.3642793
Rui Xu;Yuanhang He;Gaolei Li;Chaofeng Zhang;Jianhua Li
Remote embodied intelligence relies on the seamless transmission of rich multi-modal sensory information, particularly vision and touch, to enable intelligent agents to collaboratively perceive, interact with, and manipulate physical environments. However, transmitting such high-dimensional and heterogeneous data over wireless channels in real time poses substantial challenges in terms of bandwidth, latency, and semantic integrity. In this letter, we propose a novel vision-tactile fusion semantic communication (VT-FSC) framework tailored for remote embodied intelligence applications. By leveraging cross-modal feature fusion and attention-guided semantic compression, the proposed system transforms raw visual and tactile data into a unified low-dimensional semantic representation. This compact representation is then robustly transmitted through noisy wireless channels and decoded at the receiver to reconstruct both the visual scene and the tactile signal accurately. To ensure perceptual alignment, encoder and decoder are jointly optimized via human-in-the-loop feedback mechanisms. Experimental results in the multi-model dataset show that our method achieves up to 15% higher ST-SIM and 47% lower RMSE than baselines, validating the effectiveness of our framework in achieving high semantic compression rates and accurate perceptual reconstruction for remote embodied intelligence applications.
{"title":"VT-FSC: Vision-Tactile Fusion Semantic Communication for Remote Embodied Intelligence","authors":"Rui Xu;Yuanhang He;Gaolei Li;Chaofeng Zhang;Jianhua Li","doi":"10.1109/LCOMM.2025.3642793","DOIUrl":"https://doi.org/10.1109/LCOMM.2025.3642793","url":null,"abstract":"Remote embodied intelligence relies on the seamless transmission of rich multi-modal sensory information, particularly vision and touch, to enable intelligent agents to collaboratively perceive, interact with, and manipulate physical environments. However, transmitting such high-dimensional and heterogeneous data over wireless channels in real time poses substantial challenges in terms of bandwidth, latency, and semantic integrity. In this letter, we propose a novel vision-tactile fusion semantic communication (VT-FSC) framework tailored for remote embodied intelligence applications. By leveraging cross-modal feature fusion and attention-guided semantic compression, the proposed system transforms raw visual and tactile data into a unified low-dimensional semantic representation. This compact representation is then robustly transmitted through noisy wireless channels and decoded at the receiver to reconstruct both the visual scene and the tactile signal accurately. To ensure perceptual alignment, encoder and decoder are jointly optimized via human-in-the-loop feedback mechanisms. Experimental results in the multi-model dataset show that our method achieves up to 15% higher ST-SIM and 47% lower RMSE than baselines, validating the effectiveness of our framework in achieving high semantic compression rates and accurate perceptual reconstruction for remote embodied intelligence applications.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"30 ","pages":"582-586"},"PeriodicalIF":4.4,"publicationDate":"2025-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145830898","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
扫码关注我们
求助内容：
应助结果提醒方式：