Vandermonde Decomposition Reconstruction for DOA Estimation with Sparse Arrays

In this work, we propose a novel direction-of-arrival (DOA) estimation algorithm for sparse linear array via Vandermonde decomposition reconstruction. Unlike virtual array interpolation algorithms, the suggested method performs interpolation directly on the physical array, that is, Nyquist spatial filling. By utilizing the Vandermonde decomposition of the covariance matrix of a uniform linear array (ULA), this filling process is formulated as a structured matrix completion problem via matrix factorization, where the factor matrix is encouraged to exhibit a Vandermonde structure. Subsequently, an iterative approach is developed to solve the resultant problem using the alternating direction method of multipliers (ADMM). Finally, DOAs are retrieved from the reconstructed covariance matrix using subspace-based algorithms. Simulation results demonstrate the superiority of our algorithm over the existing methods.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/icct62411.2024.10946520
Primary Topic
Image and Signal Denoising Methods
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Vandermonde Decomposition Reconstruction for DOA Estimation with Sparse Arrays

Zhenhui Wang, Xiao Peng Li, Qiang Li, Lei Huang
Image and Signal Denoising Methods
article

Vandermonde Decomposition Reconstruction for DOA Estimation with Sparse Arrays

Zhenhui Wang, Xiao Peng Li, Qiang Li, Lei Huang
article en

Abstract

In this work, we propose a novel direction-of-arrival (DOA) estimation algorithm for sparse linear array via Vandermonde decomposition reconstruction. Unlike virtual array interpolation algorithms, the suggested method performs interpolation directly on the physical array, that is, Nyquist spatial filling. By utilizing the Vandermonde decomposition of the covariance matrix of a uniform linear array (ULA), this filling process is formulated as a structured matrix completion problem via matrix factorization, where the factor matrix is encouraged to exhibit a Vandermonde structure. Subsequently, an iterative approach is developed to solve the resultant problem using the alternating direction method of multipliers (ADMM). Finally, DOAs are retrieved from the reconstructed covariance matrix using subspace-based algorithms. Simulation results demonstrate the superiority of our algorithm over the existing methods.

Shenzhen University (CN)
National Natural Science Foundation of China
Climate action
Openalex Percentile: Top 71%
Image and Signal Denoising Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.