In recent years, one-bit quantization has attracted widespread attention in the field of direction-of-arrival (DOA) estimation as a low-cost and low-power solution. Many researchers have proposed various estimation algorithms for one-bit DOA estimation, among which atomic norm minimization algorithms exhibit particularly attractive performance as gridless estimation algorithms. However, current one-bit DOA algorithms with atomic norm minimization typically rely on approximating the trace function, which is not the optimal approximation and introduces errors, along with resolution limitations. To date, there have been few studies on how to enhance resolution under the framework of one-bit DOA estimation. This paper aims to improve the resolution constraints of one-bit DOA estimation. The log-det heuristic is applied to approximate and solve the atomic norm minimization problem. In particular, a reweighted binary atomic norm minimization with noise assumption constraints is proposed to achieve high-resolution and robust one-bit DOA estimation. Finally, the alternating direction method of multipliers algorithm is employed to solve the established optimization problem. Simulations are conducted to demonstrate that the proposed algorithm can effectively enhance the resolution.
This letter presents a method to optimize the estimation of direction of arrival (DOA) using the uniform linear array (ULA) with one‐bit signals in the presence of non‐uniform noise. With the Toeplitz properties and the rank characteristics of the signal subspace matrix formed by the ULA, the alternating minimization (AM) method is employed to optimize the estimation problem. To address this challenge further, we utilize the singular value thresholding (SVT) method and the approximate projection method. The angle deviations caused by non‐uniform noise can be effectively corrected and a significant improvement in the estimation performance can be achieved. The feasibility and effectiveness of the proposed method are demonstrated through simulation results.