Toeplitz-Enhanced Array Covariance Processing for DOA Estimation Under Low SNR and Limited Snapshots Authors: Xin Jin, Yanan Fan, Xiujuan Yao, Xinyu Li, Yanan Meng, Yi Yan, Xiang Gao Published: 2026 ABSTRACT Multiple-source DOA (Direction of Arrival) estimation is vital for array processing, radar, and integrated sensing and communications, yet classical subspace methods degrade under low signal-to-noise ratios and snapshot-starved conditions due to inaccurate sample covariance matrices. To address this, we propose a Toeplitz-enhanced neural network (TENN-DOA) for DOA estimation, a hybrid physics-informed framework for uniform linear arrays that combines the array signal processing prior with a lightweight learning-based regressor. The front end explicitly enforces the Hermitian–Toeplitz structure and fuses the projected matrix with the sample covariance via an analytically derived optimal shrinkage coefficient, yielding a robust covariance estimate. This enhanced representation is mapped onto an overcomplete angular dictionary, producing a feature sequence structurally coupled with the array manifold. A pooling-free one-dimensional convolutional neural network with decreasing kernel sizes starts with large kernels to capture the broad spectral envelope from grid mismatch, and then regresses to a pseudo spatial spectrum under multi-hot supervision for grid-point estimates. The Monte Carlo simulation results show that under the conditions of low signal-to-noise ratio, limited snapshots and the simulated ideal uniform linear array scenario, TENN-DOA achieves a higher resolution probability and lower root mean square error compared with MUSIC, TLS-ESPRIT and the deep learning-based baseline algorithm DA-MUSIC. 1. Introduction Direction-of-arrival (DOA) estimation infers the directions of incident waves from array measurements and is a basic operation in radar, communications, sonar, electronic reconnaissance, and space situational awareness. Its accuracy is governed by the array calibration, the signal-to-noise ratio (SNR), the number of snapshots, and the quality of covariance estimation [1,2]. Classical methods, such as MUSIC and ESPRIT, use the eigen structure of the sample covariance matrix (SCM) to separate signal and noise subspaces and can provide high resolution when the array is well calibrated, the SNR is adequate, and enough snapshots are available [3,4,5]. Passive sensing, however, often observes intermittent or non-cooperative sources over short coherent processing intervals. The resulting low SNR and limited snapshot regimes make covariance estimation the first bottleneck rather than a minor implementation detail. With few snapshots, the SCM can be poorly conditioned, rank deficient, or strongly perturbed relative to the population covariance. The associated eigenvalue gap and subspace orthogonality become less reliable, so spectral peaks broaden, merge, or develop spurious maxima. This threshold behavior is well documented for covariance-based estimators [6,7]. Linear shrinkage provides a principled way to reduce the covariance–variance by combining the SCM with a structured target; its benefit is strong when the target reflects reliable prior information, but its coefficient remains model and distribution dependent [8,9]. For an ideal calibrated ULA with spatially stationary statistics, the population co-variance is Hermitian–Toeplitz: entries on the same diagonal have the same expectation. Toeplitz reconstruction therefore provides a physically motivated regularization. Dai et al. showed that Toeplitz approximation can improve covariance-based DOA estimation for coherent sources in impulsive noise environments [10]. In the present work, the Toeplitz projection serves as the target of a data-adaptive shrinkage step; it is a structured pre-processing choice rather than a claim that the Toeplitz projection alone resolves all nonideal array effects. Sparse and continuous-domain estimators provide complementary alternatives. Grid-based sparse recovery formulates DOA estimation as a regularized inverse problem, whereas atomic norm methods operate in a continuous parameter domain. Adaptive Lp minimization, UAMP with a Bernoulli–Gaussian prior, and reweighted atomic norm minimization are representative examples [11,12,13]. Their performance and computational cost depend on the regularization, stopping criteria, dictionary resolution, and off-grid treatment. We therefore include SBL and off-grid SBL as explicit comparison baselines. Sparse array design offers another route to increased degrees of freedom: nested and coprime arrays extend the virtual aperture through difference arrays [14,15], while recent designs address irregular sparse arrays and near-field configurations [16,17]. While array design is vital for resolution improvement, its performance depends on the geometry, array continuity, and covariance estimation accuracy. Algorithmic solutions are still needed for legacy ULA systems with fixed hardware. Deep learning has also been used for robust, sparse array, gridless, and efficient DOA estimation. Prior work includes neural estimators robust to array imperfections [18], low SNR multilabel prediction [19], coarse-to-fine learning for coprime arrays with sensor position errors [20], knowledge-enhanced learning for frequency-hopping signals [21], sparse prior CNNs [22], complex-valued gridless networks [23], sparse array covariance transformation [24], subspace representation learning [25], residual CNNs for 2D DOA [26], SVM–random forest regression [27], and zero-padded DFT estimators [28]. Collectively, these studies show that deep networks can learn nonlinear array features inaccessible to linear models; however, their performance remains highly dependent on the input feature quality and training data distribution. The specific gap addressed here is the combination of low SNR, limited snapshots, and closely spaced sources in an ideal ULA. Directly feeding a degraded SCM into a network leaves the model to learn the covariance denoising, array geometry encoding, and peak discrimination simultaneously. Conversely, a purely model-driven eigenspace or sparse solver may incur threshold behavior or higher inference cost in the same regime. The closest methodological families are summarized in Table 1: structured covariance reconstruction supplies an analytic prior, sparse prior CNNs provide a learned grid spectrum, complex-valued gridless networks target the continuous output, and DA-MUSIC learns a covariance enhancement before subspace processing [10,22,23,29]. The objective of this study is consequently narrow and testable: to determine whether a Hermitian–Toeplitz/shrinkage front end followed by angular dictionary matching and a compact 1D CNN can improve two-source grid-based DOA resolution under the primary low SNR, limited snapshot ULA profile. The method is evaluated against classical beamforming and subspace estimators, DA-MUSIC, SBL, off-grid SBL, and TS-MUSIC using the same snapshot matrices and deterministic trial seeds. The main contributions of this work are as follows. We propose an end-to-end framework integrating covariance matrix optimization and deep neural estimation to improve the direction-of-arrival estimation performance of two sources under low signal-to-noise ratio and limited snapshot conditions. We propose an end-to-end framework integrating covariance matrix optimization and deep neural estimation to improve the direction-of-arrival estimation performance of two sources under low signal-to-noise ratio and limited snapshot conditions. The covariance-processing front end and overcomplete angle dictionary map the covariance estimates onto physically interpretable real-valued directional response sequences. The covariance-processing front end and overcomplete angle dictionary map the covariance estimates onto physically interpretable real-valued directional response sequences. A compact one-dimensional convolutional neural network without pooling layers regresses to generate grid-aligned pseudo-spectra, and peak discrimination is accomplished at its learning back end, without eigenvalue decomposition or iterative sparse optimization. A compact one-dimensional convolutional neural network without pooling layers regresses to generate grid-aligned pseudo-spectra, and peak discrimination is accomplished at its learning back end, without eigenvalue decomposition or iterative sparse optimization. The remainder of this paper is organized as follows. Section 2 presents the array signal model and problem formulation. Section 3 describes the proposed estimation algorithm. Section 4 reports the simulation settings, evaluation metrics, and comparative analyses against representative baselines. Section 5 concludes the paper and discusses future work. Unless otherwise stated, scalar variables are denoted by italic letters, e.g., N and λ; column vectors are denoted by bold lowercase letters, e.g., a and x; and matrices are denoted by bold uppercase letters, e.g., R and A. The superscripts (⋅)T, (⋅)H, and (⋅)−1 denote transpose, conjugate transpose, and inverse, respectively. The operator E[⋅] denotes the statistical expectation; tr(⋅) denotes the trace; and ∥⋅∥F denotes the Frobenius norm, where ∥A∥F=tr(AAH). The operator vec(⋅) stacks a matrix columnwise into a vector; IM is the M×M identity matrix; and CM×N and RM×N represent complex and real matrix spaces of size M×N, respectively. 2. Signal Model Consider a ULA consisting of M isotropic array elements. The interelement spacing is fixed at one half of the carrier wavelength, i.e., d=λ/2. Assume that K mutually uncorrelated far-field narrowband sources impinge on the array from distinct azimuth angles θ=[θ1,θ2,…,θK]T, with K