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...

Full description

Bibliographic Details
Main Authors: Srar, J., Chung, Kah-Seng, Mansour, A.
Format: Conference Paper
Published: 2012
Online Access:http://hdl.handle.net/20.500.11937/14392
_version_ 1848748610910420992
author Srar, J.
Chung, Kah-Seng
Mansour, A.
author_facet Srar, J.
Chung, Kah-Seng
Mansour, A.
author_sort Srar, J.
building Curtin Institutional Repository
collection Online Access
description 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).
first_indexed 2025-11-14T07:07:47Z
format Conference Paper
id curtin-20.500.11937-14392
institution Curtin University Malaysia
institution_category Local University
last_indexed 2025-11-14T07:07:47Z
publishDate 2012
recordtype eprints
repository_type Digital Repository
spelling curtin-20.500.11937-143922018-03-29T09:06:09Z LLMS adaptive beamforming algorithm implemented with finite precision Srar, J. Chung, Kah-Seng Mansour, A. 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). 2012 Conference Paper http://hdl.handle.net/20.500.11937/14392 10.1109/TELFOR.2012.6419207 restricted
spellingShingle Srar, J.
Chung, Kah-Seng
Mansour, A.
LLMS adaptive beamforming algorithm implemented with finite precision
title LLMS adaptive beamforming algorithm implemented with finite precision
title_full LLMS adaptive beamforming algorithm implemented with finite precision
title_fullStr LLMS adaptive beamforming algorithm implemented with finite precision
title_full_unstemmed LLMS adaptive beamforming algorithm implemented with finite precision
title_short LLMS adaptive beamforming algorithm implemented with finite precision
title_sort llms adaptive beamforming algorithm implemented with finite precision
url http://hdl.handle.net/20.500.11937/14392