Comparison of Contemporary Constant Modulus Algorithms for Blind Beamforming Application

In this paper, we compare the performance of recently obtained results of constant modulus algorithms such as Hybrid Recursive and Least Mean Square-based Constant Modulus Algorithm (RLS-LMS-CMA), Non-Negative Matrix Factorization based Unscented Kalman Filter Constant Modulus Algorithm (NMF-UKF-CMA), and Alternating Direction Method of Multipliers (ADMM) based Least Means Square Constant Modulation Algorithm (LMS-ADMM-CMA) for beamforming application. We observe that the Hybrid RLS-LMS-CMA algorithm performs near analogous to the NMF-UKF-CMA algorithm and better than the LMS-ADMM-CMA algorithm in terms of tracking ability, better sidelobe rejection ratio, and with less mean square deviation with reduced computational complexity.