• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.05a
• /
• pp.164-169
• /
• 2005

Microphone array techniques are being used widely in wind tunnel measurements for identification of the distributed aerodynamic noise sources on the model being tested. Depending on the frequencies and sound levels, conventional beamforming algorithm has limitation in separating two adjacent sources. Several modifications to the classical beamforming have been developed to enhance way resolution and reduce sidelobe levels. In this Paper the robust adaptive beamforming and the CLEAN algorithm are used to compare to the result of conventional beamforming method. It is found that the CLEAN algorithm is capable of pin-pointing locations of multiple sources nearby, while these sources are unidentifiable with robust adaptive or conventional beamforming techniques.

• The Journal of the Acoustical Society of Korea
• /
• v.38 no.2
• /
• pp.145-153
• /
• 2019

Adaptive beamforming methods are known to suppress sidelobes and improve detection performance of weak signal by constructing weight vectors depending on the received signal itself. A standard adaptive beamforming like the MVDR (Minimum Variance Distortionless Response) is very sensitive to mismatches between weight vectors and actual signal steering vectors. Also, a large computational complexity for estimating a stable covariance matrix is required when wideband beamforming for a large-scale array is used. In this paper, we exploit the WBRCB (Wideband Robust Capon Beamforming) method for stable and robust wideband adaptive beamforming of a passive large uniform line array sonar. To improve robustness of adaptive beamforming performance in the presence of mismatches, we extract a optimum mismatch parameter. WBRCB with extracted mismatch parameter shows performance improvement in beamforming using synthetic and experimental passive sonar signals.

• The Journal of the Acoustical Society of Korea
• /
• v.36 no.2
• /
• pp.115-122
• /
• 2017

We propose a robust adaptive beamforming algorithm for triplet array sonar. The proposed beamforming algorithm obtains robustness to mismatches, left/right discrimination, and has two steps. The first is a cardioid beamformer, which supports left/right discrimination of target signals. It applies the conventional delay-and-subtract to each triplet's signal with its rotation angle and obtains multiple cardioid beams. The second is a robust adaptive beamforming to minimize nearby interferences. We regard cardioid beams as input signals of a line array and apply an adaptive beamforming algorithm to the cardioid beams. Simulations results show that the proposed algorithm provides significantly better performance than the conventional algorithms, while supporting left/right discrimination of target signals.

• ETRI Journal
• /
• v.29 no.1
• /
• pp.50-58
• /
• 2007

Robust adaptive beamforming based on worst-case performance optimization is investigated in this paper. It improves robustness against steering vector mismatches by the approach of diagonal loading. A closed-form solution to optimal loading is derived after some approximations. Besides reducing the computational complexity, it shows how different factors affect the optimal loading. Based on this solution, a performance analysis of the beamformer is carried out. As a consequence, approximated closed-form expressions of the source-of-interest power estimation and the output signalto-interference-plus-noise ratio are presented in order to predict its performance. Numerical examples show that the proposed closed-form expressions are very close to their actual values.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.399-406
• /
• 2011

Adaptive beamformers, which utilize a priori information on the arrival angle of the desired signal. suppress interferences while maximizing their gains in the desired signal direction. However, if there exist errors in the direction information, they can suffer from severe performance degradation since the desired signal is treated as an interference. A robust adaptive beamforming method is presented which exploits the signal-blocking structure of the Duvall beamformer. The proposed method finds an interference signal space directly from correlations of received signals and then obtains a weight vector such that it is orthogonal to the space. Applying the weight vector to two sub arrays which consist of one less sensors than the original uniform lineal array (ULA), the beamformer efficiently estimates the arrival angle of the desired signal. Its computational complexity is lower than existing methods, which require matrix inversion or eigendecomposition.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.9
• /
• pp.148-156
• /
• 2014

In the MVDR (minimum variance distortionless response) adaptive array, its performance could be greatly deteriorated in the presence of steering vector errors as the desired signal is treated as an interference. This paper suggests an computationally simple adaptive beamforming method which is robust against these errors. In the proposed method, a minimization problem that is formulated according to the DCB (doubly constrained beamforming) principle is solved to find a solution vector, which is in turn projected onto a subspace to obtain a new steering vector. The minimization problem and the subspace projection are dealt with using some principal eigenpairs, which are obtained using a modified PASTd(projection approximation subspace tracking with deflation). We improve the existing MPASTd(modified PASTd) algorithm such that the computational complexity is reduced. The proposed beamforming method can significantly reduce the complexity as compared with the conventional ones directly eigendecomposing an estimate of the corelation matrix to find all eigenvalues and eigenvectors. Moreover, the proposed method is shown, through simulation, to provide performance improvement over the conventional ones.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.5
• /
• pp.115-122
• /
• 2011

Adaptive arrays suffer from severe performance degradation when there are errors in the steering vector. The DCRCB (doubly constrained robust Capon beamformer) overcomes such a problem, introducing a spherical uncertainty set of the steering vector together with a norm constraint. However, in the standard DCRCB, it is a difficult task to determine the bound for the uncertainty, the radius of the spherical set, such that a near best solution is obtained. A novel beamforming method is presented which has no difficulty of the uncertainty bound setting, employing a recursive search for the steering vector. Though the basic idea of recursive search has been known, the conventional recursive method needs to set a parameter for the termination of the search. The proposed method terminates it by using distances to the signal subspace, without the need for parameter setting. Simulation demonstrates that the proposed method has better performance than the conventional recursive method and than the non-recursive standard DCRCB, even the one with the optimum uncertainty bound.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4A
• /
• pp.269-277
• /
• 2012

When there are mismatches between the beamforming steering vector and the array response vector for the desired signal, the performance can be severely degraded as the adaptive array attempts to suppress the desired signal as well as interferences. In this paper, an robust method is proposed for the adaptive array in the presence of both direction errors and random errors in the steering vector. The proposed method first finds a signal-plus-interference subspace (SIS) from the correlation matrix, which in turn is exploited to extract an interference subspace based on the structure of a uniform linear array (ULA), the effect of the desired signal direction vector being reduced as much as possible. Then, the weight vector is attained to be orthogonal to the interference subspace. Simulation shows that the proposed method, in terms of signal-to-interference plus noise ratio (SINR), outperforms existing ones such as the doubly constrained robust Capon beamformer (DCRCB).

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.3
• /
• pp.119-123
• /
• 2006

The orthogonal frequency-division multiplexing (OFDM) technique is well known to be robust against the frequency-selective fading in wireless channels. It is due to the exploitation of a guard interval that is inserted at beginning of each OFDM symbol. Based on the conventional OFDM and a polyphase filtered orthogonal frequency division multiplexing (PF-OFDM) technique, we developed an adaptive beamforming algorithm for antenna arrays. The proposed algorithm would lead to an efficient use of channel, since it is possible to eliminate a guard interval and also easily suppress interchannel interference at the same time. In this paper, a series of computer simulations have been provided to show the performance of the proposed system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.9
• /
• pp.519-527
• /
• 2014

Adaptive arrays can minimize contributions from interferences incident onto an sensor array while preserving a signal the direction vector of which corresponds to the array steering vector to within a scalar factor. If there exist errors in the steering vector, severe performance degradation can be caused since the desired signal is misunderstood as an interference by the array. This paper presents an adaptive beamforming method which is robust against steering vector errors, exploiting a range of the desired signal direction. In the presented method, an correlation matrix of array response vectors is obtained through integration over the direction range and a minimization problem is formulated using some eigenvectors of the correlation matrix such that a more accurate steering vector than initially given one can be found. The minimization problem is transformed into a relaxed SDP (semidefinite program) problem, which can be effectively solved since it is a sort of convex optimization. Simulation results show that the proposed method outperforms existing ones such as ORM (outside-range-based method) and USM (uncertainty-based method).