Searcharxiv⌕ Search

arXiv subjects

Wenchong Huang

Publications and source records attributed to Wenchong Huang.

2 recordsLinked to original sources

Stability Analysis of Single- and Multi-Snapshot ESPRIT

Spectral estimation seeks to recover unknown frequencies from $T$ snapshots, each consisting of $Ω+1$ noisy Fourier measurements. Super-resolution refers to the recovery of frequencies whose minimum separation $Δ$ is smaller than $1/Ω$. We establish state-of-the-art stability bounds for single- and multi-snapshot ESPRIT when the frequencies form well-separated clumps, with the largest clump containing $n^\star$ frequencies. In particular, for single-snapshot ESPRIT, our error bound scales as $$ \mathcal{O}(Ω^{-1}\mathrm{SRF}^{2n^\star-2}\cdot\mathrm{Noise}), $$ where $\mathrm{SRF}:=(ΩΔ)^{-1}$ denotes the super-resolution factor, provided that the noise level satisfies $\mathrm{Noise}\lesssim(ΩΔ)^{2n^\star-2}$. In comparison with the minimax bounds [arXiv:1904.09186] and the computational resolution limits [arXiv:2003.02917, arXiv:2211.15208], our result shows that single-snapshot ESPRIT achieves the optimal stability scaling in the super-resolution regime. For multi-snapshot ESPRIT, we establish error bounds under both deterministic noise and Gaussian white noise, attaining the best-known SRF dependence under weaker conditions. Numerical experiments corroborate the theoretical error bounds.

eess.SP↗

Generalized Hankel/Toeplitz matrix for array signal processing

In this paper, we introduce generalized Hankel/Toeplitz matrices (GHM/GTM) and the associated generalized Vandermonde decomposition for nonuniform array signal processing and multi-dimensional super-resolution. The proposed framework was discovered from the study of resolution limit theory and extends the classical Hankel/Toeplitz structure by allowing substantially more flexible sampling geometries while preserving the underlying low-rank Vandermonde factorization. Through devising an optimal algorithm based on this GHM framework, we derive the state-of-the-art upper bound estimate for the computational resolution limit (CRL) of source-number detection in general $d$-dimensional super-resolution problems. For segmented sampling sets, whose geometry is closely related to sparse and distributed arrays, we establish deterministic lower bounds for the minimum singular values of the associated generalized Vandermonde matrices and derive corresponding stability and number-detection guarantees for multi-clump source configurations. To address the computational bottleneck of conventional multi-level Hankel constructions in high dimensions, we further introduce randomized GHM constructions whose matrix dimensions scale with the effective degrees of freedom rather than with the full tensor-product grid, together with deterministic recovery guarantees conditional on the realized Vandermonde factors. We also extend the framework to source localization by developing GHM-based MUSIC algorithms for nonuniform measurements, with stability characterized through the conditioning of the generalized Vandermonde factors. Numerical experiments on synthetic data demonstrate that the proposed GHM-based methods achieve competitive resolution and recovery accuracy while substantially reducing matrix size and computational cost, especially in high-dimensional settings.

eess.SP↗