Hui Cao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hui Cao has a total of 58 co-authors. Here are the top co-authors by number of shared publications:
- Kehao Wang
Wuhan University of Technology
10 shared publications - Jialiang Zhang
School of Information Engineering, Wuhan University of Technology, Wuhan, China
5 shared publications - Qi Liu
South China University of Technology, Guangzhou, Guangdong, China
4 shared publications - Hing Cheung So
City University of Hong Kong
3 shared publications - Yuntao Wu
School of Computer Science and Engineering, Wuhan Institute of Technology, Wuhan 430205, China
3 shared publications - Gaoqing Xiong
School of Information Engineering, Wuhan University of Technology, Wuhan 430070, China
2 shared publications
Latest Publications
- Open Access
- 14 August 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (16) , 2942
Enhanced Unitary Root SAMV with Toeplitz Covariance Completion and Subspace Projection for Coprime Array DOA Estimation
To address the issues of incomplete virtual array utilization and direction of arrival (DOA) estimation performance degradation under noise interference in coprime array processing, this paper proposes the Toeplitz Assisted Subspace Projection enhanced Unitary Root Sparse Asymptotic Minimum Variance (TASP-URootSAMV) algorithm. First, trace regularized Toeplitz covariance completion is employed to fill aperture holes in the virtual domain by exploiting shift invariance structure, reconstructing the interpolated covariance matrix through convex optimization and Wiener prediction. Second, eigenspace projection is performed to suppress background noise through Toeplitz-averaged covariance estimation and signal/noise subspace separation. Third, unitary root SAMV is applied to perform grid-initialized off-grid DOA refinement through iterative polynomial rooting, thereby mitigating grid-induced modeling errors and reducing sensitivity to the initial angular grid. Algorithm performance is evaluated through two complementary experiments. Spatial spectrum and root mean square error (RMSE) analysis indicate that, at snapshots and dB, the proposed method reduces the RMSE by – compared with the considered algorithms, with accuracy close to the Cramér–Rao bound (CRB) in the tested cases. Additionally, the algorithm maintains distinguishable spectral peaks for the tested source numbers. Grid-spacing analysis indicates relatively stable performance over the tested initialization-grid intervals, whereas the performance of the grid-dependent comparison method degrades as the grid spacing increases. The convergence experiments also show limited sensitivity to the tested initialization settings and comparable computational efficiency. Under the adopted simulation assumptions, these results indicate improved estimation accuracy under the tested noisy conditions.- 14 August 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (16) , 2942
Open AccessEnhanced Unitary Root SAMV with Toeplitz Covariance Completion and Subspace Projection for Coprime Array DOA Estimation
To address the issues of incomplete virtual array utilization and direction of arrival (DOA) estimation performance degradation under noise interference in coprime array processing, this paper proposes the Toeplitz Assisted Subspace Projection enhanced Unitary Root Sparse Asymptotic Minimum Variance (TASP-URootSAMV) algorithm. First, trace regularized Toeplitz covariance completion is employed to fill aperture holes in the virtual domain by exploiting shift invariance structure, reconstructing the interpolated covariance matrix through convex optimization and Wiener prediction. Second, eigenspace projection is performed to suppress background noise through Toeplitz-averaged covariance estimation and signal/noise subspace separation. Third, unitary root SAMV is applied to perform grid-initialized off-grid DOA refinement through iterative polynomial rooting, thereby mitigating grid-induced modeling errors and reducing sensitivity to the initial angular grid. Algorithm performance is evaluated through two complementary experiments. Spatial spectrum and root mean square error (RMSE) analysis indicate that, at snapshots and dB, the proposed method reduces the RMSE by – compared with the considered algorithms, with accuracy close to the Cramér–Rao bound (CRB) in the tested cases. Additionally, the algorithm maintains distinguishable spectral peaks for the tested source numbers. Grid-spacing analysis indicates relatively stable performance over the tested initialization-grid intervals, whereas the performance of the grid-dependent comparison method degrades as the grid spacing increases. The convergence experiments also show limited sensitivity to the tested initialization settings and comparable computational efficiency. Under the adopted simulation assumptions, these results indicate improved estimation accuracy under the tested noisy conditions. - 26 June 2026
- Published by Elsevier in Physical Communication
- Vol. 78
Joint positioning and precoding for max-min fairness in RSMA-based hybrid satellite-UAV-terrestrial networks
- 26 June 2026
- Published by Elsevier in Physical Communication
- Vol. 78
Joint positioning and precoding for max-min fairness in RSMA-based hybrid satellite-UAV-terrestrial networks
- 13 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 26 (10) , 15387-15396
A High-Precision Positioning Method for Automated Guided Vehicles Based on a Fiber Bragg Grating Sensor Array
Due to the high-precision positioning demands of automated guided vehicles in electromagnetically sensitive and wireless-restricted fully-automatic factories, a fully passive fusion positioning method employing fiber Bragg grating array sensors is developed in this paper. First, the grating array sensing fiber signal is parametrically modeled, and a feature-matching algorithm is applied to link physical locations with signal waveform features, providing high-fidelity data for dynamic positioning. Then, leveraging the principle of real-time velocity calculation within fiber partitions, a particle filter-based multi-fiber partition information fusion and state recursion framework is proposed. This framework iteratively predicts and compensates for target motion within the fiber sensing blind zone, overcoming the spatial resolution limitations of fiber sensing systems and significantly improving trajectory estimation accuracy from meter-level to centimeter-level. Finally, by taking advantage of real-time iteration across multiple sensing fiber partitions, a dynamic feedback correction mechanism is constructed. This mechanism corrects the predicted state in real time using interval observation data, effectively constraining accumulated errors within the physical intervals of adjacent feature points, addressing the error accumulation issue common in traditional partitioned velocity positioning methods. Experimental results demonstrate that by combining the grating array fiber multi-partitions sensing method with the feature matching particle filter positioning algorithm, the dynamic average positioning error can be less than 2 cm, and it has the ability to determine the parking position with high precision. This provides a reliable technical solution for centimeter-level positioning of automated guided vehicles in fully-automatic factories.
- 13 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 26 (10) , 15387-15396
A High-Precision Positioning Method for Automated Guided Vehicles Based on a Fiber Bragg Grating Sensor Array
Due to the high-precision positioning demands of automated guided vehicles in electromagnetically sensitive and wireless-restricted fully-automatic factories, a fully passive fusion positioning method employing fiber Bragg grating array sensors is developed in this paper. First, the grating array sensing fiber signal is parametrically modeled, and a feature-matching algorithm is applied to link physical locations with signal waveform features, providing high-fidelity data for dynamic positioning. Then, leveraging the principle of real-time velocity calculation within fiber partitions, a particle filter-based multi-fiber partition information fusion and state recursion framework is proposed. This framework iteratively predicts and compensates for target motion within the fiber sensing blind zone, overcoming the spatial resolution limitations of fiber sensing systems and significantly improving trajectory estimation accuracy from meter-level to centimeter-level. Finally, by taking advantage of real-time iteration across multiple sensing fiber partitions, a dynamic feedback correction mechanism is constructed. This mechanism corrects the predicted state in real time using interval observation data, effectively constraining accumulated errors within the physical intervals of adjacent feature points, addressing the error accumulation issue common in traditional partitioned velocity positioning methods. Experimental results demonstrate that by combining the grating array fiber multi-partitions sensing method with the feature matching particle filter positioning algorithm, the dynamic average positioning error can be less than 2 cm, and it has the ability to determine the parking position with high precision. This provides a reliable technical solution for centimeter-level positioning of automated guided vehicles in fully-automatic factories.
- 17 November 2025
- Published by Springer Nature in Iranian Journal of Science and Technology, Transactions of Electrical Engineering
- Vol. 50 (3) , 1-10
G-ESPRIT: Graphformer-Enhanced Direction-of-Arrival Estimation with Differentiable ESPRIT
- 17 November 2025
- Published by Springer Nature in Iranian Journal of Science and Technology, Transactions of Electrical Engineering
- Vol. 50 (3) , 1-10
G-ESPRIT: Graphformer-Enhanced Direction-of-Arrival Estimation with Differentiable ESPRIT
- Open Access
- 11 November 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (22) , 3617
DOA Estimation Based on Golden Ratio-Inspired Coprime Array
To address the challenges of limited degrees of freedom (DOF) and mutual coupling effects in sparse array-based Direction-of-arrival (DOA) estimation, this paper proposes a novel array configuration termed the Golden ratio Inspired Coprime Array (GICA). This design integrates the golden ratio () into the geometric arrangement of three hierarchically structured subarrays to achieve enhanced difference coarray properties. Theoretical analysis demonstrates that the proposed configuration, through strategic sensor placement and virtual domain processing, significantly increases the achievable DOF. Comprehensive simulations show that this design exhibits competitive estimation performance, achieving reduced root mean square error (RMSE) across most signal-to-noise ratio (SNR) regimes and snapshot conditions when compared with contemporary coprime array configurations. Additionally, quantitative mutual coupling analysis reveals that the proposed structure achieves superior electromagnetic compatibility, demonstrating the lowest coupling leakage coefficient among tested configurations. Experimental validation under varying coupling strengths shows that this array design maintains stable estimation performance with minimal degradation. These results confirm the proposed configuration as an effective sparse array solution that simultaneously enhances DOA estimation accuracy and mutual coupling robustness.- 11 November 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (22) , 3617
Open AccessDOA Estimation Based on Golden Ratio-Inspired Coprime Array
To address the challenges of limited degrees of freedom (DOF) and mutual coupling effects in sparse array-based Direction-of-arrival (DOA) estimation, this paper proposes a novel array configuration termed the Golden ratio Inspired Coprime Array (GICA). This design integrates the golden ratio () into the geometric arrangement of three hierarchically structured subarrays to achieve enhanced difference coarray properties. Theoretical analysis demonstrates that the proposed configuration, through strategic sensor placement and virtual domain processing, significantly increases the achievable DOF. Comprehensive simulations show that this design exhibits competitive estimation performance, achieving reduced root mean square error (RMSE) across most signal-to-noise ratio (SNR) regimes and snapshot conditions when compared with contemporary coprime array configurations. Additionally, quantitative mutual coupling analysis reveals that the proposed structure achieves superior electromagnetic compatibility, demonstrating the lowest coupling leakage coefficient among tested configurations. Experimental validation under varying coupling strengths shows that this array design maintains stable estimation performance with minimal degradation. These results confirm the proposed configuration as an effective sparse array solution that simultaneously enhances DOA estimation accuracy and mutual coupling robustness. - 30 July 2025
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 19 (11) , 1-10
Robust DOA Estimation for Sparse Arrays under Sensor Failures via Structured Matrix Completion
- 30 July 2025
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 19 (11) , 1-10
Robust DOA Estimation for Sparse Arrays under Sensor Failures via Structured Matrix Completion
- Open Access
Design of Selective Detector for Distributed Targets Through Stochastic Characteristic of the Fictitious Signal
We investigate the problem of detecting the distributed targets buried in the Gaussian noise whose covariance matrix is unknown when signal mismatch occurs. The idea is to add a fictitious signal under the null hypothesis of the origin detection problem so that when signal mismatch occurs, the fictitious signal captures the mismatched signals, thus making the null hypothesis more plausible. More precisely, the fictitious signal is modeled as a Gaussian component with a covariance matrix of a stochastic factor multiplied by a rank-one matrix. The generalized likelihood ratio test (GLRT) is employed to address the modification detection problem. We present an exhaustive derivation of the detector and prove that it possesses the constant false alarm rate (CFAR) property. The performance analysis demonstrates the effectiveness of the proposed detector. When the SNR is 23 dB, as generalized cosine squared decreases from 1 to 0.83, the detection probability of the proposed GLRT-SL drops to 0.65, exhibiting the fastest decline compared to the G-ABORT-HE, which falls to 0.98, and the GW-ABORT-HE, which decreases to 0.85.
Open AccessDesign of Selective Detector for Distributed Targets Through Stochastic Characteristic of the Fictitious Signal
We investigate the problem of detecting the distributed targets buried in the Gaussian noise whose covariance matrix is unknown when signal mismatch occurs. The idea is to add a fictitious signal under the null hypothesis of the origin detection problem so that when signal mismatch occurs, the fictitious signal captures the mismatched signals, thus making the null hypothesis more plausible. More precisely, the fictitious signal is modeled as a Gaussian component with a covariance matrix of a stochastic factor multiplied by a rank-one matrix. The generalized likelihood ratio test (GLRT) is employed to address the modification detection problem. We present an exhaustive derivation of the detector and prove that it possesses the constant false alarm rate (CFAR) property. The performance analysis demonstrates the effectiveness of the proposed detector. When the SNR is 23 dB, as generalized cosine squared decreases from 1 to 0.83, the detection probability of the proposed GLRT-SL drops to 0.65, exhibiting the fastest decline compared to the G-ABORT-HE, which falls to 0.98, and the GW-ABORT-HE, which decreases to 0.85.
- 29 June 2024
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 43 (10) , 6351-6372
Adaptive Robust Subspace Detection Based on GLRT, Rao, Wald, Gradient, and Durbin Tests
- 29 June 2024
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 43 (10) , 6351-6372
Adaptive Robust Subspace Detection Based on GLRT, Rao, Wald, Gradient, and Durbin Tests
- Open Access
Coherent DOA Estimation Algorithm with Co-Prime Arrays for Low SNR Signals
The Direction of Arrival (DOA) estimation of coherent signals in co-prime arrays has become a popular research topic. However, traditional spatial smoothing and subspace algorithms fail to perform well under low signal-to-noise ratio (SNR) and small snapshots. To address this issue, we have introduced an Enhanced Spatial Smoothing (ESS) algorithm that utilizes a space-time correlation matrix for de-noising and decoherence. Finally, an Estimating Signal Parameter via Rotational Invariance Techniques (ESPRIT) algorithm is used for DOA estimation. In comparison to other decoherence methods, when the SNR is −8 dB and the number of snapshots is 150, the mean square error (MSE) of the proposed algorithm approaches the Cramér–Rao bound (CRB), the probability of resolution (PoR) can reach over 88%, and, when the angular resolution is greater than , the estimation accuracy can reach over 90%.Open AccessCoherent DOA Estimation Algorithm with Co-Prime Arrays for Low SNR Signals
The Direction of Arrival (DOA) estimation of coherent signals in co-prime arrays has become a popular research topic. However, traditional spatial smoothing and subspace algorithms fail to perform well under low signal-to-noise ratio (SNR) and small snapshots. To address this issue, we have introduced an Enhanced Spatial Smoothing (ESS) algorithm that utilizes a space-time correlation matrix for de-noising and decoherence. Finally, an Estimating Signal Parameter via Rotational Invariance Techniques (ESPRIT) algorithm is used for DOA estimation. In comparison to other decoherence methods, when the SNR is −8 dB and the number of snapshots is 150, the mean square error (MSE) of the proposed algorithm approaches the Cramér–Rao bound (CRB), the probability of resolution (PoR) can reach over 88%, and, when the angular resolution is greater than , the estimation accuracy can reach over 90%. - Open Access
Joint Trajectory Planning, Time and Power Allocation to Maximize Throughput in UAV Network
Due to the advantages of strong mobility, flexible deployment, and low cost, unmanned aerial vehicles (UAVs) are widely used in various industries. As a flying relay, UAVs can establish line-of-sight (LOS) links for different scenarios, effectively improving communication quality. In this paper, considering the limited energy budget of UAVs and the existence of multiple jammers, we introduce a simultaneous wireless information and power transfer (SWIPT) technology and study the problems of joint-trajectory planning, time, and power allocation to increase communication performance. Specifically, the network includes multiple UAVs, source nodes (SNs), destination nodes (DNs), and jammers. We assume that the UAVs need to communicate with DNs, the SNs use the SWIPT technology to transmit wireless energy and information to UAVs, and the jammers can interfere with the channel from UAVs to DNs. In this network, our target was to maximize the throughput of DNs by optimizing the UAV’s trajectory, time, and power allocation under the constraints of jammers and the actual motion of UAVs (including UAV energy budget, maximum speed, and anti-collision constraints). Since the formulated problem was non-convex and difficult to solve directly, we first decomposed the original problem into three subproblems. We then solved the subproblems by applying a successive convex optimization technology and a slack variables method. Finally, an efficient joint optimization algorithm was proposed to obtain a sub-optimal solution by using a block coordinate descent method. Simulation results indicated that the proposed algorithm has better performance than the four baseline schemes.
Open AccessJoint Trajectory Planning, Time and Power Allocation to Maximize Throughput in UAV Network
Due to the advantages of strong mobility, flexible deployment, and low cost, unmanned aerial vehicles (UAVs) are widely used in various industries. As a flying relay, UAVs can establish line-of-sight (LOS) links for different scenarios, effectively improving communication quality. In this paper, considering the limited energy budget of UAVs and the existence of multiple jammers, we introduce a simultaneous wireless information and power transfer (SWIPT) technology and study the problems of joint-trajectory planning, time, and power allocation to increase communication performance. Specifically, the network includes multiple UAVs, source nodes (SNs), destination nodes (DNs), and jammers. We assume that the UAVs need to communicate with DNs, the SNs use the SWIPT technology to transmit wireless energy and information to UAVs, and the jammers can interfere with the channel from UAVs to DNs. In this network, our target was to maximize the throughput of DNs by optimizing the UAV’s trajectory, time, and power allocation under the constraints of jammers and the actual motion of UAVs (including UAV energy budget, maximum speed, and anti-collision constraints). Since the formulated problem was non-convex and difficult to solve directly, we first decomposed the original problem into three subproblems. We then solved the subproblems by applying a successive convex optimization technology and a slack variables method. Finally, an efficient joint optimization algorithm was proposed to obtain a sub-optimal solution by using a block coordinate descent method. Simulation results indicated that the proposed algorithm has better performance than the four baseline schemes.