Hui Cao

Hui Cao

*This is an algorithmically generated author record based on publicly available information.

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:


Latest Publications

  • Open Access

    Enhanced Unitary Root SAMV with Toeplitz Covariance Completion and Subspace Projection for Coprime Array DOA Estimation

    by Hui Cao, Zhou Yang, Yuanyuan Yang, Qing Lu, Kehao Wang, Yuntao Wu

    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 T=200 snapshots and SNR=−10 dB, the proposed method reduces the RMSE by 47.86–56.47% 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.

  • A High-Precision Positioning Method for Automated Guided Vehicles Based on a Fiber Bragg Grating Sensor Array

    by Xin Gui, Haomiao Liu, Laiming Wu, Yixuan Li, Haiyang Wang, Zekun Wang, Weibing Gan, Hui Cao, Zhengying Li

    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.

  • Open Access

    DOA Estimation Based on Golden Ratio-Inspired Coprime Array

    by Zhou Yang, Hui Cao, Jialiang Zhang, Kehao Wang

    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 (ϕ≈1.618) 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.

  • Open Access

    Design of Selective Detector for Distributed Targets Through Stochastic Characteristic of the Fictitious Signal

    by Gaoqing Xiong, Hui Cao, Weijian Liu, Jialiang Zhang, Kehao Wang, Kai Yan

    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.

  • Adaptive Robust Subspace Detection Based on GLRT, Rao, Wald, Gradient, and Durbin Tests

    by Gaoqing Xiong, Hui Cao, Weijian Liu, Jun Liu, Chongying Qi, Daikun Zheng


  • Open Access

    Coherent DOA Estimation Algorithm with Co-Prime Arrays for Low SNR Signals

    by Fan Zhang, Hui Cao, Kehao Wang

    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 4°, the estimation accuracy can reach over 90%.


  • Open Access

    Joint Trajectory Planning, Time and Power Allocation to Maximize Throughput in UAV Network

    by Kehao Wang, Jiangwei Xu, Xiaobai Li, Pei Liu, Hui Cao, Kezhong Liu

    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.