Abstract

In this work, we propose a fast conjugate gradient method (CGM) for beamforming, after thoroughly analyzing the performances of the least mean square (LMS), the recursive least square (RLS), and the sample matrix inversion (SMI) adaptive beamforming algorithms. Various experiments are carried out to analyze the performances of each beamformer in detail. The proposed conjugate gradient method does not use the Eigen spread of the signal correlation matrix as in the case of the LMS and the RLS methods. It computes antenna array weights orthogonally for each iteration. Hence the convergence rate and the null depths of the proposed method are much better than the LMS, the SMI the RLS and the classical CGM. Also, the simulation results confirm that this method has a speed improvement of about 60% over the classical conjugate gradient method. This aspect significantly reduces the processor burden and saves a lot of power during the beamforming process. Hence the proposed method is superior compared to the LMS, the RLS, the SMI, and classical CGM and most suitable for high-speed mobile communication.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call