Metraipolis › archive › dc_a471dc079a5d

Generalized Hankel/Toeplitz matrix for array signal processing — arXiv:2609.03325

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.03325
License (as archived)
CC0-1.0
Archived
2026-10-17T02:48:16.673Z
SHA-256 of the archived text
e247165edb1fc63cf1ec7b644d25d4bdd44431e83a162ac101207db4a181920e
Stable URL of this page
https://metraipolis.com/documento/dc_a471dc079a5d

How to cite

Generalized Hankel/Toeplitz matrix for array signal processing — arXiv:2609.03325 — arXiv (en), https://arxiv.org/abs/2609.03325 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a471dc079a5d (Metraipolis archive dc_a471dc079a5d, sha256 e247165edb1fc63cf1ec7b644d25d4bdd44431e83a162ac101207db4a181920e)
BibTeX
@misc{dca471dc079a5d,
  title = {Generalized Hankel/Toeplitz matrix for array signal processing — arXiv:2609.03325},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.03325},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a471dc079a5d; sha256 e247165edb1fc63cf1ec7b644d25d4bdd44431e83a162ac101207db4a181920e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03325. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-04 in math.IT).
Categorie arXiv: Signal Processing (eess.SP) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.03325 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T02:22:59.020Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).