Home Technology New Proposed Adaptive Beamforming Algorithms Based on Merging CGM and NLMS methods
Chapter
Licensed
Unlicensed Requires Authentication

New Proposed Adaptive Beamforming Algorithms Based on Merging CGM and NLMS methods

Become an author with De Gruyter Brill

Abstract

This paper proposes new two adaptive beamforming algorithms based on a merging method for performance enhancement of mobile communications systems. The first proposal method includes merging pure Conjugate Gradient Method (CGM) with pure Normalized Least Mean Square (NLMS) algorithms, so that it is called CGM-NLMS. While the second proposed algorithmwill merge pure CGMwithModified NLMS algorithm so that it is called CGM-MNLMS. The MNLMS algorithm is regarded as variable regularization parameter ε(k) which is fixed in the conventional NLMS algorithm. The regularization parameter ε(k) uses reciprocal of the estimation error square of the update step size of NLMS instead of fixed regularization parameter (ε). With the new proposed (CGM-NLMS) and (CGM-MNLMS) algorithms, the estimated weight coefficients, which are acquired from the first stage (CGM) algorithm, are stored and then used as initial weight coefficients for NLMS (or MNLMS) algorithm processing. Through simulation results of adaptive beamforming system using an Additive White Gaussian Noise (AWGN) channel model and Rayleigh fading channel with a Jakes power spectral density, the two new proposed algorithms provide fast convergence time, higher interference suppression capability and low level of MSD, and MSE at steady state compared with the pure CGM and pure NLMS algorithms

Abstract

This paper proposes new two adaptive beamforming algorithms based on a merging method for performance enhancement of mobile communications systems. The first proposal method includes merging pure Conjugate Gradient Method (CGM) with pure Normalized Least Mean Square (NLMS) algorithms, so that it is called CGM-NLMS. While the second proposed algorithmwill merge pure CGMwithModified NLMS algorithm so that it is called CGM-MNLMS. The MNLMS algorithm is regarded as variable regularization parameter ε(k) which is fixed in the conventional NLMS algorithm. The regularization parameter ε(k) uses reciprocal of the estimation error square of the update step size of NLMS instead of fixed regularization parameter (ε). With the new proposed (CGM-NLMS) and (CGM-MNLMS) algorithms, the estimated weight coefficients, which are acquired from the first stage (CGM) algorithm, are stored and then used as initial weight coefficients for NLMS (or MNLMS) algorithm processing. Through simulation results of adaptive beamforming system using an Additive White Gaussian Noise (AWGN) channel model and Rayleigh fading channel with a Jakes power spectral density, the two new proposed algorithms provide fast convergence time, higher interference suppression capability and low level of MSD, and MSE at steady state compared with the pure CGM and pure NLMS algorithms

Downloaded on 22.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/9783110470383-001/html?lang=en&srsltid=AfmBOoo8L3q2IOa_NXDMDyuCI8QSF2iQtrylU-x_QSdFYQdBe3HTTRWG
Scroll to top button