4.6 Article

Passive direction finding with a pair of acoustic vector sensors using fourth-order cumulants

Journal

SIGNAL PROCESSING
Volume 201, Issue -, Pages -

Publisher

ELSEVIER
DOI: 10.1016/j.sigpro.2022.108706

Keywords

Direction finding; Acoustic vector sensor; Coarray; Fourth -order cumulant

Funding

  1. National Natural Science Foundation of China [61771302]

Ask authors/readers for more resources

This paper proposes an elevation-azimuth direction finding algorithm using a pair of identically oriented acoustic vector sensors that can be deployed at unknown locations. By defining two fourth-order cumulant (FOC) matrices with translational invariance property, the coarray steering vectors of the sensors can be recovered in closed-form. The identifiability performance of the algorithm is investigated, and it is shown that up to 9 sources can be uniquely identified. The algorithm is also extended to accommodate AVS arrays with unknown sensor locations, and the asymptotic performance bound is derived. Numerical examples are provided to verify the efficacy of the algorithm.
In this paper, an elevation-azimuth direction finding algorithm with the use of a pair of identically oriented acoustic vector sensors, which can be arbitrarily deployed at unknown locations, is proposed. Two fourth-order cumulant (FOC) matrices, which impose the so-called translational invariance property in the coarray domain, are defined. Such invariant structure allows recovering the coarray steering vectors of the acoustic vector sensors in closed-form from the generalized eigenvectors of the matrix pencil, which is built from the two defined FOC matrices. The identifiability performance of the proposed algorithm is further investigated. It is shown that up to 9 sources can be uniquely identified. The extension of the proposed algorithm for accommodating arbitrary AVS arrays with unknown sensor locations is also addressed. Afterward, the asymptotic performance bound of the considered problem is derived. Finally, the efficacy of the proposed algorithm is verified by numerical examples.(c) 2022 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available