A Sparse Representation-Based DOA Estimation Algorithm With Separable Observation Model

Conventional sparse representation (SR)-based direction-of-arrival (DOA) estimation algorithms suffer from high computational complexity. To be specific, a wide angular range and a large-scale array will enlarge the scale of the spatial observation matrix, which results in huge computation cost for DOA estimation. In this letter, a new efficient DOA estimation algorithm based on the separable sparse representation (SSR-DOA for short) is derived, in which a separable structure for spatial observation matrix is introduced to reduce the complexity. Besides, a dual-sparsity strategy is engaged to make the algorithm tractable. Experimental results show that high resolution performance can be obtained efficiently by the proposed algorithm.