Robust Adaptive Beamforming Based on a Gradient Projection Method
نویسندگان
چکیده
Recently, adaptive beamforming has been widely used in wireless communications, microphone array speech processing and so on. One of the adaptive beamforming methods is directionally constrained minimization of power. However, this method is known to degrade if some of underlying assumptions on the environment, sources, or sensor array become violated [5]. To resolve this disadvantage, some methods have been proposed [7, 8, 10], whereas these methods does not sufficiently exploit the degree of freedom of the step parameter in the recursive rule, or take relatively large computational complexity. In this paper, we propose an algorithm of robust adaptive beamforming. First, we apply a gradient projection method to the minimization problem with linear constraints and derive a generalized recursive rule. We next present the convergence condition of the recursive rule and propose a design method of the step parameter in the recursive rule such that the convergence condition is approximately satisfied. Finally, we show that the proposed algorithm gives more robust performance than the conventional algorithm. Notation: For a complex matrix A, AT , Ā and A∗ stand for the transpose, complex conjugate and complex conjugate transpose of A, respectively.
منابع مشابه
Design of Robust Adaptive Beamforming Algorithms Based on Low-Rank and Cross-Correlation Techniques
This work presents cost-effective low-rank techniques for designing robust adaptive beamforming (RAB) algorithms. The proposed algorithms are based on the exploitation of the cross-correlation between the array observation data and the output of the beamformer. Firstly, we construct a general linear equation considered in large dimensions whose solution yields the steering vector mismatch. Then...
متن کاملStudy of Efficient Robust Adaptive Beamforming Algorithms Based on Shrinkage Techniques
This paper proposes low-complexity robust adaptive beamforming (RAB) techniques based on shrinkage methods. We firstly briefly review a Low-Complexity Shrinkage-Based Mismatch Estimation (LOCSME) batch algorithm to estimate the desired signal steering vector mismatch, in which the interference-plus-noise covariance (INC) matrix is also estimated with a recursive matrix shrinkage method. Then we...
متن کاملRobust Adaptive Beamforming Algorithms Based on the Constrained Constant Modulus Criterion
We present a robust adaptive beamforming algorithm based on the worst-case criterion and the constrained constant modulus approach, which exploits the constant modulus property of the desired signal. Similarly to the existing worstcase beamformer with the minimum variance design, the problem can be reformulated as a second-order cone (SOC) program and solved with interior point methods. An anal...
متن کاملRobust Krylov-Subspace Methods for Passive Sonar Adaptive Beamforming
Krylov-subspace methods, such as the multistage Wiener filter and conjugate gradient method, are often used for reduced-dimension adaptive beamforming. These techniques do not, however, allow for steering vector mismatch, which is typically present in many applications of interest, including passive sonar. Here, we discuss recently proposed robust methods that do allow for steering vector misma...
متن کاملRobust Adaptive Beamforming Algorithms using the Constrained Constant Modulus Criterion
We present a robust adaptive beamforming algorithm based on the worst-case criterion and the constrained constant modulus approach, which exploits the constant modulus property of the desired signal. Similarly to the existing worst-case beamformer with the minimum variance design, the problem can be reformulated as a secondorder cone (SOC) program and solved with interior point methods. An anal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005