High Resolution Direction Finding Using Krylov Subspace
Hichem Semira, Hocine Belkacemi, Sylvie Marcos
Abstract
Hichem Semira, Hocine Belkacemi, Sylvie Marcos
Abstract
This paper proposes two new algorithms for the direction of arrival (DOA) estimation of P radiating sources. Unlike the classical subspace-based methods, they do not resort to the eigen-decomposition of the covariance matrix of the received data. Indeed, the proposed algorithms involve the building of the signal subspace from the Krylov subspace of order P associated with the covariance matrix of the received data and a search steering vector, through either the multi-stage Wiener filter (MSWF) or the conjugate gradient method (CG). The proposed algorithms exhibit a higher super-resolution capability than the classical MUSIC and ESPRIT algorithms. A comparison with another theoretically equivalent Krylov subspace-based algorithm, namely the auxiliary vector basis is also presented. It reveals that the proposed CG-based method outperforms over its counterparts in term of resolution of closely spaced-sources with a small number of snapshots and a low signal-to-noise ratio (SNR).
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper proposes two new algorithms for the direction of arrival (DOA) estimation of P radiating sources. Unlike the classical subspace-based methods, they do not resort to the eigen-decomposition of the covariance matrix of the received data. Indeed, the proposed algorithms involve the building of the signal subspace from the Krylov subspace of order P associated with the covariance matrix of the received data and a search steering vector, through either the multi-stage Wiener filter (MSWF) or the conjugate gradient method (CG). The proposed algorithms exhibit a higher super-resolution capability than the classical MUSIC and ESPRIT algorithms. A comparison with another theoretically equivalent Krylov subspace-based algorithm, namely the auxiliary vector basis is also presented. It reveals that the proposed CG-based method outperforms over its counterparts in term of resolution of closely spaced-sources with a small number of snapshots and a low signal-to-noise ratio (SNR).
Key concepts: Krylov subspace, Algorithm, Signal subspace, Subspace topology, Covariance matrix, Mathematics, Conjugate gradient method, Basis (linear algebra)