Speed-Sensitive Weighting Algorithm for Digital Beamforming of Adaptive Antenna Arrays

Abstract

One of the main objectives of adaptive antenna array processing is reducing the computational complexity and convergence time in a joint state. This article proposes a speed-sensitive adaptive algorithm for estimating the weights of smart antenna systems based on least mean squares (LMS) or constant modulus (CM) algorithms. According to the next estimated location as well as the source velocity, this novel proposed weighting algorithm selects those weights that have a higher effect on the radiation pattern and will then form the antenna pattern by only changing these weights. In this research, 3 versions of the new algorithm named as: Not-zero (Leaves half number of weights as it is the other half), Zero (Sets half number of weights to be zero and estimates other half), and Updating (Leaves half of weights unchanged and estimates other half in one phase and updates all weights in the next phase) are proposed. Through simulation of these 3 versions of speed-sensitive algorithms and comparing among conventional full weight LMS and CM algorithms, new LMS-based and CM-based algorithms have been finally proposed that offer reduced complexity and acceptable performance at different signal to noise ratios (SNRs). In this investigation, three channel scenarios are simulated which are as follows: pure noisy channel, channel with one interferer and channel with two interferers. In accordance with the simulation results, an appropriate algorithm based on weighting half number of array elements and updating all existing weights between two consecutive times to avoid error propagation effect has been proposed.