An Off-Grid Iterative Reweighted Approach to One-Bit Direction of Arrival Estimation

This paper addresses the problem of direction of arrival (DOA) estimation only relying on the sign bits of the array signal. A new optimization model is formulated to realize the simultaneous estimation of one-bit DOAs and source number. Specifically, the proposed model jointly optimizes the DOA vec...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on vehicular technology 2023-06, Vol.72 (6), p.1-6
Main Authors: Feng, Lifang, Huang, Lei, Li, Qiang, He, Zhen-Qing, Chen, Mingyang
Format: Article
Language:English
Subjects:
Algorithms
Convexity
Direction of arrival
Direction-of-arrival estimation
DOA estimation
Estimation
Iterative methods
iterative reweighted approach
Manganese
Mathematical analysis
non-convex optimization
One-bit quantization
Optimization
Optimization models
Quantization (signal)
Sparse matrices
Upper bounds
Vectors (mathematics)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper addresses the problem of direction of arrival (DOA) estimation only relying on the sign bits of the array signal. A new optimization model is formulated to realize the simultaneous estimation of one-bit DOAs and source number. Specifically, the proposed model jointly optimizes the DOA vector and row sparse signal matrix under an improved maximum posteriori probability criterion. The resulting problem is quite challenging due to the non-convexity of DOA vector and the integral form in the model. By utilizing the framework of block successive upper-bound minimization, an off-grid iterative reweighted algorithm is devised to transform the original problem into a series of tractable subproblems. Numerical results are presented to confirm the superiority of our method.
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2023.3239003