scholarly journals Robust adaptive beamforming based on the direct biconvex optimization modeling

Author(s):  
Jinfeng Hu ◽  
Xinying Zou

Abstract It is well known that the performance of the minimum variance distortionless response beamformer is sensitive to steering vector mismatch, which motivates the development of robust adaptive beamforming(RAB). However, robust adaptive beamforming (RAB) is usually modeled as a nonconvex optimization problem. The most state-of-art methods solve it indirectly by approximating the nonconvex problem to the convex optimization problem, which causes the approximation errors and performance degradation. To circumvent this problem, a novel method that is against the mismatch of the signal look direction errors, which reformulates RAB as the biconvex form directly, is proposed. This method imposes ideal response constraints to guarantee the gain of the angular region in which the actual signal lies and suppresses the signals in the remaining region, and constructs a four-order problem. Then, an auxiliary variable is introduced to reformulate it as a biconvex problem without approximation process, which can be efficiently solved iteratively by the alternating direction method of multipliers (ADMM) algorithm. Simulation results show that the proposed method can obtain a better performance on the signal-to-interference-plus-noise (SINR) and flexible control of error range.

2020 ◽  
Vol 56 (18) ◽  
pp. 957-959
Author(s):  
Ziwei Liu ◽  
Shanshan Zhao ◽  
Gengxin Zhang

2004 ◽  
Vol 12 (02) ◽  
pp. 149-174 ◽  
Author(s):  
KILSEOK CHO ◽  
ALAN D. GEORGE ◽  
RAJ SUBRAMANIYAN ◽  
KEONWOOK KIM

Matched-field processing (MFP) localizes sources more accurately than plane-wave beamforming by employing full-wave acoustic propagation models for the cluttered ocean environment. The minimum variance distortionless response MFP (MVDR–MFP) algorithm incorporates the MVDR technique into the MFP algorithm to enhance beamforming performance. Such an adaptive MFP algorithm involves intensive computational and memory requirements due to its complex acoustic model and environmental adaptation. The real-time implementation of adaptive MFP algorithms for large surveillance areas presents a serious computational challenge where high-performance embedded computing and parallel processing may be required to meet real-time constraints. In this paper, three parallel algorithms based on domain decomposition techniques are presented for the MVDR–MFP algorithm on distributed array systems. The parallel performance factors in terms of execution times, communication times, parallel efficiencies, and memory capacities are examined on three potential distributed systems including two types of digital signal processor arrays and a cluster of personal computers. The performance results demonstrate that these parallel algorithms provide a feasible solution for real-time, scalable, and cost-effective adaptive beamforming on embedded, distributed array systems.


Sign in / Sign up

Export Citation Format

Share Document