z-logo
open-access-imgOpen Access
Block Newtonised orthogonal matching pursuit for off‐grid DOA estimation in the presence of unknown mutual coupling
Author(s) -
Tang WenGen,
Jiang Hong,
Zhang Qi
Publication year - 2021
Publication title -
iet signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.384
H-Index - 42
eISSN - 1751-9683
pISSN - 1751-9675
DOI - 10.1049/sil2.12068
Subject(s) - matching pursuit , algorithm , robustness (evolution) , block (permutation group theory) , computer science , computational complexity theory , subspace topology , grid , direction of arrival , compressed sensing , matching (statistics) , mathematics , artificial intelligence , telecommunications , biochemistry , chemistry , statistics , geometry , antenna (radio) , gene
Mutual coupling (MC) between array elements can lead to severe accuracy degradation in direction‐of‐arrival (DOA) estimation. In this study, an off‐grid compressed sensing (CS) approach for DOA estimation in the presence of unknown MC is proposed using block Newtonised orthogonal matching pursuit (NOMP). First, the model of DOA estimation with MC is block sparsely represented to fully utilise the whole array aperture. Then, a block NOMP algorithm with multiple measurement vectors (MMV) is developed to achieve the estimates of DOA, in which the Newton refinement procedure is presented by deriving the first‐ and second‐order derivatives of the block steering matrix with respect to the angle grid. Compared with the subspace‐based and sparse recovery‐based methods with MC, the proposed block NOMP approach has robustness in a small number of snapshots and owns no grid‐mismatch effect. Meanwhile, in comparison to several existing off‐grid DOA estimation methods with MC, it can achieve higher estimation accuracy and similarly low computational complexity. The superior performance of the proposed approach is shown via numerical simulations.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here