LLMS adaptive beamforming algorithm implemented with finite precision

This paper studies the influence of the use of finite wordlength on the operation of the LLMS adaptive beamforming algorithm. The convergence behavior of LLMS algorithm, based on the minimum mean square error (MSE), is analyzed for operation with finite precision. Computer simulation results verify that a wordlength of eight bits is sufficient for the LLMS algorithm to achieve performance close to that provided by full precision. Based on the simulation results, it is shown that the LLMS algorithm outperforms least mean square (LMS) in addition to other earlier algorithms, such as, modified robust variable step size (MRVSS) and constrained stability LMS (CSLMS).