Yuxin Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yuxin Zhao has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Bin Tang
University of Electronic Science and Technology of China
8 shared publications - Kaili Jiang
University of Electronic Science and Technology of China
8 shared publications - Hancong Feng
School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu, China
5 shared publications Dechang Wang
University of Electronic Science and Technology of China
3 shared publicationsHancong Feng
University of Electronic Science and Technology of China
3 shared publications- Kailun Tian
University of Electronic Science and Technology of China
3 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (21) , 51004-51017
Joint Time–Phase Synchronization for Distributed Sensing Networks via Feature-Level Hyperplane Regression
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (21) , 51004-51017
Joint Time–Phase Synchronization for Distributed Sensing Networks via Feature-Level Hyperplane Regression
- 1 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 10446-10460
Subspace Identification in Structurally Folded Wideband Spectrum Sensing
Real-time, high-fidelity wideband spectrum sensing (WSS) faces fundamental analog-to-digital conversion (ADC) bottlenecks. In sub-Nyquist regimes, spectral folding is typically treated as a detrimental ambiguity or resolved via complex iterative reconstruction. In this paper, we propose the Structured Folding Receiver (SFR), which departs from existing architectures by explicitly decoupling the necessity of folding from the design freedom of signal labeling. By proactively engineering the folding process with pre-defined structural tags, the SFR transforms the ambiguous aliasing into a parameterized subspace identification task. This approach circumvents the hardware-intensive requirements of high-speed random sequences or near-ideal pulses inherent in the classic sub-Nyquist paradigm. Within this unified view, we first derive the Maximum Likelihood (ML) detector and identify its structural model mismatch in wideband scenarios. To address this, we propose a generic Maximum Spectral Variance (MSV) detector that shifts the paradigm from local matching to global structural quantification. Unlike conventional CS-based methods, the SFR preserves fine-grained physical waveform details while maintaining computational complexity comparable to the fast Fourier transform. Simulation results demonstrate that the SFR offers a superior trade-off between detection accuracy, processing latency, and waveform fidelity.
- 1 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 10446-10460
Subspace Identification in Structurally Folded Wideband Spectrum Sensing
Real-time, high-fidelity wideband spectrum sensing (WSS) faces fundamental analog-to-digital conversion (ADC) bottlenecks. In sub-Nyquist regimes, spectral folding is typically treated as a detrimental ambiguity or resolved via complex iterative reconstruction. In this paper, we propose the Structured Folding Receiver (SFR), which departs from existing architectures by explicitly decoupling the necessity of folding from the design freedom of signal labeling. By proactively engineering the folding process with pre-defined structural tags, the SFR transforms the ambiguous aliasing into a parameterized subspace identification task. This approach circumvents the hardware-intensive requirements of high-speed random sequences or near-ideal pulses inherent in the classic sub-Nyquist paradigm. Within this unified view, we first derive the Maximum Likelihood (ML) detector and identify its structural model mismatch in wideband scenarios. To address this, we propose a generic Maximum Spectral Variance (MSV) detector that shifts the paradigm from local matching to global structural quantification. Unlike conventional CS-based methods, the SFR preserves fine-grained physical waveform details while maintaining computational complexity comparable to the fast Fourier transform. Simulation results demonstrate that the SFR offers a superior trade-off between detection accuracy, processing latency, and waveform fidelity.
- 18 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (4) , 8143-8158
Joint Pulse Association, Sorting, and Localization of Pulse Radar Signals With Cluster Reconnaissance
A significant challenge in cluster collaborative reconnaissance is achieving pulse association between disparate reconnaissance units. However, traditional time-of-arrival (TOA) histogram methods struggle to attain high accuracy in radar pulse association when reconnaissance units are distant, the pulse repetition frequency (PRF) of the radar signal is high, or the emitter's position is suboptimal. Furthermore, these methods are sensitive to the division of the TOA histogram. To address these issues, we propose a pulse association method for cluster reconnaissance that treats the association, sorting, and localization of radar signals as a unified problem, aiming to solve them collectively. Additionally, we introduce the concept of a fuzzy generation set to resolve ambiguities in localization. Simulation results demonstrate that our proposed method significantly enhances the accuracy of pulse association while also achieving high sorting accuracy and localization precision. Under conditions with a TOA error of 50 ns, a site error of 10 m and a pulse drop rate of 0.2, our proposed method achieves an estimation accuracy exceeding 90% for the emitters count, with pulse association and sorting accuracies greater than 95%, and a localization RMSE of less than 1%.
- 18 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (4) , 8143-8158
Joint Pulse Association, Sorting, and Localization of Pulse Radar Signals With Cluster Reconnaissance
A significant challenge in cluster collaborative reconnaissance is achieving pulse association between disparate reconnaissance units. However, traditional time-of-arrival (TOA) histogram methods struggle to attain high accuracy in radar pulse association when reconnaissance units are distant, the pulse repetition frequency (PRF) of the radar signal is high, or the emitter's position is suboptimal. Furthermore, these methods are sensitive to the division of the TOA histogram. To address these issues, we propose a pulse association method for cluster reconnaissance that treats the association, sorting, and localization of radar signals as a unified problem, aiming to solve them collectively. Additionally, we introduce the concept of a fuzzy generation set to resolve ambiguities in localization. Simulation results demonstrate that our proposed method significantly enhances the accuracy of pulse association while also achieving high sorting accuracy and localization precision. Under conditions with a TOA error of 50 ns, a site error of 10 m and a pulse drop rate of 0.2, our proposed method achieves an estimation accuracy exceeding 90% for the emitters count, with pulse association and sorting accuracies greater than 95%, and a localization RMSE of less than 1%.
- 22 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 60 (4) , 5060-5072
Syntactic Modeling and Neural-Based Parsing for Multifunction Radar Signal Interpretation
The analysis of intercepted multifunction radar (MFR) signals and the assessment of potential threats are critical in the field of radar countermeasures. The complexity of MFR control mechanisms poses serious challenges in modeling and recognizing their internal states. MFRs, being discrete event systems (DESs), can be well described by formal languages. This paper presents a generalized version of the previous syntactic modeling of MFRs, utilizing the proposed latent variable controlled stochastic context-free grammar (LVCSCFG). The enhanced model incorporates a mapping between the external environment and the production probabilities, offering a more effective representation of the resource management process. Additionally, we introduce a neural-based approach for maximum likelihood estimation of the MFR's internal states, which are represented by a grammar tree. LVCSCFG exhibits enhanced representation of MFR dynamic behaviors, and simulation results indicate that the neural network outperforms traditional statistical parsing algorithms in terms of speed and precision under various non-ideal channel conditions.
- 22 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 60 (4) , 5060-5072
Syntactic Modeling and Neural-Based Parsing for Multifunction Radar Signal Interpretation
The analysis of intercepted multifunction radar (MFR) signals and the assessment of potential threats are critical in the field of radar countermeasures. The complexity of MFR control mechanisms poses serious challenges in modeling and recognizing their internal states. MFRs, being discrete event systems (DESs), can be well described by formal languages. This paper presents a generalized version of the previous syntactic modeling of MFRs, utilizing the proposed latent variable controlled stochastic context-free grammar (LVCSCFG). The enhanced model incorporates a mapping between the external environment and the production probabilities, offering a more effective representation of the resource management process. Additionally, we introduce a neural-based approach for maximum likelihood estimation of the MFR's internal states, which are represented by a grammar tree. LVCSCFG exhibits enhanced representation of MFR dynamic behaviors, and simulation results indicate that the neural network outperforms traditional statistical parsing algorithms in terms of speed and precision under various non-ideal channel conditions.
- Open Access
- 26 February 2024
- Published by MDPI AG in Remote Sensing
- Vol. 16 (5) , 811
A Fast Power Spectrum Sensing Solution for Generalized Coprime Sampling
With the growing scarcity of spectrum resources, wideband spectrum sensing is necessary to process a large volume of data at a high sampling rate. For some applications, only second-order statistics are required for spectrum estimation. In this case, a fast power spectrum sensing solution is proposed based on the generalized coprime sampling. The solution involves the inherent structure of the sensing vector to reconstruct the autocorrelation sequence of inputs from sub-Nyquist samples, which requires only parallel Fourier transform and simple multiplication operations. Thus, it takes less time than the state-of-the-art methods while maintaining the same performance, and it achieves higher performance than the existing methods within the same execution time without the need to pre-estimate the number of inputs. Furthermore, the influence of the model mismatch has only a minor impact on the estimation performance, allowing for more efficient use of the spectrum resource in a distributed swarm scenario. Simulation results demonstrate the low complexity in sampling and computation, thus making it a more practical solution for real-time and distributed wideband spectrum sensing applications.
- 26 February 2024
- Published by MDPI AG in Remote Sensing
- Vol. 16 (5) , 811
Open AccessA Fast Power Spectrum Sensing Solution for Generalized Coprime Sampling
With the growing scarcity of spectrum resources, wideband spectrum sensing is necessary to process a large volume of data at a high sampling rate. For some applications, only second-order statistics are required for spectrum estimation. In this case, a fast power spectrum sensing solution is proposed based on the generalized coprime sampling. The solution involves the inherent structure of the sensing vector to reconstruct the autocorrelation sequence of inputs from sub-Nyquist samples, which requires only parallel Fourier transform and simple multiplication operations. Thus, it takes less time than the state-of-the-art methods while maintaining the same performance, and it achieves higher performance than the existing methods within the same execution time without the need to pre-estimate the number of inputs. Furthermore, the influence of the model mismatch has only a minor impact on the estimation performance, allowing for more efficient use of the spectrum resource in a distributed swarm scenario. Simulation results demonstrate the low complexity in sampling and computation, thus making it a more practical solution for real-time and distributed wideband spectrum sensing applications.
- 13 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 59 (6) , 9621-9634
Self-Supervised Contrastive Learning for Extracting Radar Word in the Hierarchical Model of Multifunction Radar
The analysis of intercepted multifunction radar (MFR) signals has attracted considerable attention in the field of cognitive electronic reconnaissance. The agility of pulse parameters makes it difficult to recognize their behavior states. Currently, most existing approaches for recognizing MFR behaviors heavily depend on prior information, which can hardly be obtained in a non cooperative way. This study develops a contrastive self supervised method to adaptively segment and cluster MFR pulse sequences into radar words with little prior information. First, a convolutional neural network (CNN) is trained in a self-supervised manner to differentiate between adjacent and nonadjacent pulse group embeddings to learn robust feature representations from sequences of pulse descriptor words (PDWs). Next, based on the learned embeddings, test statistics are calculated for each PDW sequence to detect change points, which are in turn used to segment the sequence into multiple subsegments, each containing only one radar word. Finally, feature vectors are produced for clustering the subsegments into groups of radar words. Simulation results show that without using any labeled data, the proposed method can effectively extract the radar words of a hypothetical MFR under corrupted and overlapped pulse parameters and performs only slightly worse than the state-of-the-art fully supervised method.
- 13 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 59 (6) , 9621-9634
Self-Supervised Contrastive Learning for Extracting Radar Word in the Hierarchical Model of Multifunction Radar
The analysis of intercepted multifunction radar (MFR) signals has attracted considerable attention in the field of cognitive electronic reconnaissance. The agility of pulse parameters makes it difficult to recognize their behavior states. Currently, most existing approaches for recognizing MFR behaviors heavily depend on prior information, which can hardly be obtained in a non cooperative way. This study develops a contrastive self supervised method to adaptively segment and cluster MFR pulse sequences into radar words with little prior information. First, a convolutional neural network (CNN) is trained in a self-supervised manner to differentiate between adjacent and nonadjacent pulse group embeddings to learn robust feature representations from sequences of pulse descriptor words (PDWs). Next, based on the learned embeddings, test statistics are calculated for each PDW sequence to detect change points, which are in turn used to segment the sequence into multiple subsegments, each containing only one radar word. Finally, feature vectors are produced for clustering the subsegments into groups of radar words. Simulation results show that without using any labeled data, the proposed method can effectively extract the radar words of a hypothetical MFR under corrupted and overlapped pulse parameters and performs only slightly worse than the state-of-the-art fully supervised method.
- Open Access
- 27 July 2023
- Published by MDPI AG in Remote Sensing
- Vol. 15 (15) , 3743
Information Fusion for Radar Signal Sorting with the Distributed Reconnaissance Receivers
The conventional method of centralizing information fusion is commonly employed for sorting radar signals in reconnaissance receivers. However, challenges arise when the distance between reconnaissance receivers and the fusion center is distant, or when the fusion center is compromised by hostile forces. To address these issues, this paper proposes a novel distributed information fusion method. In this method, each reconnaissance receiver is restricted to accessing adjacent nodes within an undirected graph for information transmission and local computation. The distributed Dempster’s combination rule and the cautious conjunctive rule are implemented using weight functions and consensus algorithms. Furthermore, an innovative outlier detection algorithm is incorporated into the fusion process to enhance its robustness. Experimental results demonstrate that the proposed method effectively improves the accuracy of radar signal sorting. When the sorting accuracy of a single reconnaissance receiver is equal to or higher than 60%, both fusion rules achieve a sorting accuracy of 100%. Even when the sorting accuracy of a single reconnaissance receiver is as low as 50%, the fused result still maintains a sorting accuracy of over 97%.
- 27 July 2023
- Published by MDPI AG in Remote Sensing
- Vol. 15 (15) , 3743
Open AccessInformation Fusion for Radar Signal Sorting with the Distributed Reconnaissance Receivers
The conventional method of centralizing information fusion is commonly employed for sorting radar signals in reconnaissance receivers. However, challenges arise when the distance between reconnaissance receivers and the fusion center is distant, or when the fusion center is compromised by hostile forces. To address these issues, this paper proposes a novel distributed information fusion method. In this method, each reconnaissance receiver is restricted to accessing adjacent nodes within an undirected graph for information transmission and local computation. The distributed Dempster’s combination rule and the cautious conjunctive rule are implemented using weight functions and consensus algorithms. Furthermore, an innovative outlier detection algorithm is incorporated into the fusion process to enhance its robustness. Experimental results demonstrate that the proposed method effectively improves the accuracy of radar signal sorting. When the sorting accuracy of a single reconnaissance receiver is equal to or higher than 60%, both fusion rules achieve a sorting accuracy of 100%. Even when the sorting accuracy of a single reconnaissance receiver is as low as 50%, the fused result still maintains a sorting accuracy of over 97%.