Joint-block-sparsity for efficient 2-D DOA estimation with multiple separable observations

Abstract

In sparsity-based optimization problems, one of the major issue is computational complexity, especially when the unknown signal is represented in multi-dimensions such as in the problem of 2-D (azimuth and elevation) direction-of-arrival (DOA) estimation. In order to cope with this issue, this paper introduces a new sparsity structure that can be used to model the optimization problem in case of multiple data snapshots and multiple separable observations where the dictionary can be decomposed into two parts: azimuth and elevation dictionaries. The proposed sparsity structure is called joint-block-sparsity which enforces the sparsity in multiple dimensions, namely azimuth, elevation and data snapshots. In order to model the joint-block-sparsity in the optimization problem, triple mixed norms are used. In the simulations, the proposed method is compared with both sparsity-based techniques and subspace-based methods as well as the Cramer–Rao lower bound. It is shown that the proposed method effectively solves the 2-D DOA estimation problem with significantly low complexity and sufficient accuracy.