Xin Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Xin Wang has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Junan Yang
College of Electronic Engineering, National University of Defense Technology, Hefei, China
3 shared publications - Can Zheng
School of Electrical Engineering, Korea University, Seoul, South Korea
1 shared publication - Chuanrong Jiang
College of Electronic Engineering, National University of Defense Technology, Hefei, China
1 shared publication - Chung Gu Kang
School of Electrical Engineering, Korea University, Seoul, South Korea
1 shared publication - Dengxi Wang
College of Electronic Engineering, National University of Defense Technology, Hefei, China
1 shared publication - Dongxing Zhao
College of Electronic Engineering, National University of Defense Technology, Hefei, China
1 shared publication
Latest Publications
- 31 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (11) , 3465-3469
Blind Wide-Range Carrier Frequency Offset Estimation for CP-OTFS System
Orthogonal Time-Frequency Space (OTFS) modulation has been popularized for its impressive advantages in mobile communication scenario. However, carrier frequency offset (CFO) caused by high-speed motion and transceiver frequency inconsistency can lead to inter-carrier interference. Furthermore, CFO may exceed the subcarrier spacing in some scenarios, such as satellite communication. Existing methods designed for OTFS mainly focus on fractional CFO, ignoring the integer CFO estimation task. In this letter, a blind wide-range CFO estimation method is proposed for cyclic prefix OTFS system to solve the problem of narrow CFO estimation range. Based on the cyclic prefix in the Delay-Doppler domain, a cost function is constructed to minimize the difference between cyclic prefix and its replicated part. Further, a two-stage estimation method is designed by computing the above cost function and existing fractional CFO estimator using multi-frame data to accomplish rough and precise estimation. The simulation results show that the proposed two-stage estimation method has a wider range and better accuracy compared to the previous CFO estimator.
- 31 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (11) , 3465-3469
Blind Wide-Range Carrier Frequency Offset Estimation for CP-OTFS System
Orthogonal Time-Frequency Space (OTFS) modulation has been popularized for its impressive advantages in mobile communication scenario. However, carrier frequency offset (CFO) caused by high-speed motion and transceiver frequency inconsistency can lead to inter-carrier interference. Furthermore, CFO may exceed the subcarrier spacing in some scenarios, such as satellite communication. Existing methods designed for OTFS mainly focus on fractional CFO, ignoring the integer CFO estimation task. In this letter, a blind wide-range CFO estimation method is proposed for cyclic prefix OTFS system to solve the problem of narrow CFO estimation range. Based on the cyclic prefix in the Delay-Doppler domain, a cost function is constructed to minimize the difference between cyclic prefix and its replicated part. Further, a two-stage estimation method is designed by computing the above cost function and existing fractional CFO estimator using multi-frame data to accomplish rough and precise estimation. The simulation results show that the proposed two-stage estimation method has a wider range and better accuracy compared to the previous CFO estimator.
- 17 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 25 (11) , 19874-19887
A Two-Stage Domain Adaptation Method Based on Data and Feature Levels for Cross-Receiver RF Fingerprint Identification
Radio Frequency Fingerprint Identification (RFFI) is a promising technology for Internet of Things (IoT) device authentication, which uses a device’s unique hardware imperfections patterns as the “fingerprint”, providing a highly secure, device-specific form of authentication for IoT devices. Due to the influence of inherent hardware imperfections of receivers, the performance of RFFI is markedly reduced when the receiver is changed. In engineering practice, when the receiver changes, the data on the new receiver needs to be relabeled and retrained, resulting in significant resource consumption. To address this limitation, a few studies utilized Domain Adaptation (DA) to avoid relabeling data on the new receiver. However, existing DA methods focused exclusively on aligning the domain distribution at the feature level, resulting in performance limitations and neglecting the utilization of unlabeled target domain data. To address these shortcomings, we propose a two-stage Domain Adaptation method for cross-receiver RFFI. The proposed method sequentially performs data-level domain alignment based on Tensor Alignment Invariant Subspace Learning and feature-level domain alignment based on Subdomain Adaptation to achieve a comprehensive domain alignment. In addition, we introduce a pseudo-labeling method based on Confident Learning to improve the utilization of unlabeled data. Experimental results on the publicly available WiSig dataset show that the proposed method achieves at least 30% performance improvement in cross-receiver scenarios, and outperforms other existing Domain Adaptation methods.
- 17 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 25 (11) , 19874-19887
A Two-Stage Domain Adaptation Method Based on Data and Feature Levels for Cross-Receiver RF Fingerprint Identification
Radio Frequency Fingerprint Identification (RFFI) is a promising technology for Internet of Things (IoT) device authentication, which uses a device’s unique hardware imperfections patterns as the “fingerprint”, providing a highly secure, device-specific form of authentication for IoT devices. Due to the influence of inherent hardware imperfections of receivers, the performance of RFFI is markedly reduced when the receiver is changed. In engineering practice, when the receiver changes, the data on the new receiver needs to be relabeled and retrained, resulting in significant resource consumption. To address this limitation, a few studies utilized Domain Adaptation (DA) to avoid relabeling data on the new receiver. However, existing DA methods focused exclusively on aligning the domain distribution at the feature level, resulting in performance limitations and neglecting the utilization of unlabeled target domain data. To address these shortcomings, we propose a two-stage Domain Adaptation method for cross-receiver RFFI. The proposed method sequentially performs data-level domain alignment based on Tensor Alignment Invariant Subspace Learning and feature-level domain alignment based on Subdomain Adaptation to achieve a comprehensive domain alignment. In addition, we introduce a pseudo-labeling method based on Confident Learning to improve the utilization of unlabeled data. Experimental results on the publicly available WiSig dataset show that the proposed method achieves at least 30% performance improvement in cross-receiver scenarios, and outperforms other existing Domain Adaptation methods.
- 26 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 29 (5) , 1097-1101
A Sparsity-Agnostic SL0 Channel Estimation Approach for OTFS Systems
Orthogonal time frequency space (OTFS) modulation has been shown to support reliable communication in high mobility scenarios. Due to the sparsity of the delay-Doppler (DD) domain, most existing algorithms utilize compressed sensing (CS) for OTFS channel estimation, while requiring a known channel sparsity. However, in cases that the sparsity is not readily accessible, the estimation accuracy of these CS algorithms decreases dramatically. In this letter, we propose a Smoothed ℓ0 (SL0) algorithm free of prior knowledge about channel sparsity for OTFS channel estimation. We obtain a novel vector expression of the input-output relationship in the DD domain and formulate it as a sparse signal recovery problem. In the case of unknown sparsity, a low-complexity SL0 algorithm is introduced to solve the problem with a faster reconstruction speed. Simulation results show that the proposed algorithm has significant advantages in estimation accuracy and complexity compared to algorithms that also do not require channel sparsity.
- 26 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 29 (5) , 1097-1101
A Sparsity-Agnostic SL0 Channel Estimation Approach for OTFS Systems
Orthogonal time frequency space (OTFS) modulation has been shown to support reliable communication in high mobility scenarios. Due to the sparsity of the delay-Doppler (DD) domain, most existing algorithms utilize compressed sensing (CS) for OTFS channel estimation, while requiring a known channel sparsity. However, in cases that the sparsity is not readily accessible, the estimation accuracy of these CS algorithms decreases dramatically. In this letter, we propose a Smoothed ℓ0 (SL0) algorithm free of prior knowledge about channel sparsity for OTFS channel estimation. We obtain a novel vector expression of the input-output relationship in the DD domain and formulate it as a sparse signal recovery problem. In the case of unknown sparsity, a low-complexity SL0 algorithm is introduced to solve the problem with a faster reconstruction speed. Simulation results show that the proposed algorithm has significant advantages in estimation accuracy and complexity compared to algorithms that also do not require channel sparsity.