A Fast RLS-CM Algorithm for Blind Adaptive Beamforming

Y. Chen, T. Le-Ngoc, and B. Champagne (Canada)

Keywords

Beamforming, Constant Modulus (CM), Recursive Least Squares (RLS), Adaptive Array.

Abstract

An approximation for the constant modulus (CM) cost function is proposed to allow the use of the fast recursive least squares (RLS) algorithm. Simulations are performed to compare the performance of the introduced RLS-CM and stochastic gradient descent (SGD) algorithms for blind adaptive beamforming. Results indicate that the introduced RLS-CM has faster convergence speed and good tracking ability.

Important Links:



Go Back


IASTED
Rotating Call For Paper Image