By Topic

Beamforming algorithm of diagonal loading based on matrix decomposition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhaohua Zeng ; Commun. & Inf. Eng. Coll., Xi''an Univ. of Sci. & Technol., Xi''an, China ; Wenjuan Liang ; Jianhong Zhang

In the beamforming algorithm of the matrix decomposition, through QR decomposition of data matrix, the QR decomposition algorithm transforms the problem of solving the weighted vector into the problem of solving a triangular linear equations, which avoids to estimating and inversing of array signal covariance matrix, improves the robustness of the data; But when the smaller sample number, the noise eigenvalue dispersion of the sample covariance matrix leads to the degradation of the beamforming algorithm performance and QR algorithm performance will be decreased. According to this shortcoming, the SVD algorithm of the diagonal loading is proposed in this paper, the simulation results showed that DL-SVD algorithm not only improve the performance of the algorithm but also reduce complexity.

Published in:

Broadband Network and Multimedia Technology (IC-BNMT), 2011 4th IEEE International Conference on

Date of Conference:

28-30 Oct. 2011