Research of Adaptive Beamforming Algorithm Based on Matrix Decomposition

• Published in: 2010 2nd International Conference on Information Engineering and Computer Science pp. 1 - 4
• Main Authors: Zeng Zhaohua, Zhang Jianhong, Zhao Qian, Liu Hanjun
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.12.2010
• Subjects: Array signal processing; Arrays; Equations; Interference; Mathematical model; Matrix decomposition; Signal processing algorithms
• ISBN: 1424479398; 9781424479399
• ISSN: 2156-7379
• DOI: 10.1109/ICIECS.2010.5678268

In this paper, in order to avoid the sample autocorrelation matrix inversion of antenna array in the adaptive beamforming, first of all, a QR decomposition algorithm is investigated. In the algorithm, the problem of solving weight vector is transformed into the problem of solving triangular linear equations by QR decomposition of direct sample data matrix, and the estimation and the inversion of the autocorrelation matrix is avoided, which improves the numerical robustness. Then, a new algorithm is proposed, which uses the singular value and singular value vector for the calculation of weight vector by singular value decomposition (SVD) of the sample data matrix. The proposed algorithm also avoids the estimation and the inversion of the autocorrelation matrix, and the estimation computation and the estimation error is reduced. Furthermore, the complexity and performance can be compromised by changing the number of zero assigned of the smaller singular value. Simulation result shows that the proposed method possesses almost the same performance as the QR decomposition method, and both the methods can achieve the correct beamforming.