Analysis of the RLMS Adaptive Beamforming Algorithm Implemented with Finite Precision

This paper studies the influence of the use of finite wordlength on the operation of the RLMS adaptive beamformingalgorithm. The convergence behavior of RLMS, based on the minimum mean square error (MSE), is analyzed for operation with finite precision. Computer simulation results verify that a word...

Full description

Bibliographic Details
Main Authors: Srar, Jalal Abdulsayed, Chung, Kah-Seng, Mansour, Ali
Other Authors: APCC 2010 Technical Program Committee
Format: Conference Paper
Published: IEEE 2010
Subjects:
Online Access:http://hdl.handle.net/20.500.11937/13115
_version_ 1848748261577326592
author Srar, Jalal Abdulsayed
Chung, Kah-Seng
Mansour, Ali
author2 APCC 2010 Technical Program Committee
author_facet APCC 2010 Technical Program Committee
Srar, Jalal Abdulsayed
Chung, Kah-Seng
Mansour, Ali
author_sort Srar, Jalal Abdulsayed
building Curtin Institutional Repository
collection Online Access
description This paper studies the influence of the use of finite wordlength on the operation of the RLMS adaptive beamformingalgorithm. The convergence behavior of RLMS, based on the minimum mean square error (MSE), is analyzed for operation with finite precision. Computer simulation results verify that a wordlength of nine bits is sufficient for the RLMS algorithm to achieve performance close to that provided by full precision. The performance measures used include residual MSE, rate of convergence, error vector magnitude (EVM), and beam pattern. Based on all these measures, it is shown that the RLMS algorithm outperforms other earlier algorithms, such as least mean square (LMS), recursive least square (RLS), modified robust variable step size (MRVSS) and constrained stability LMS (CSLMS).
first_indexed 2025-11-14T07:02:14Z
format Conference Paper
id curtin-20.500.11937-13115
institution Curtin University Malaysia
institution_category Local University
last_indexed 2025-11-14T07:02:14Z
publishDate 2010
publisher IEEE
recordtype eprints
repository_type Digital Repository
spelling curtin-20.500.11937-131152017-01-30T11:34:55Z Analysis of the RLMS Adaptive Beamforming Algorithm Implemented with Finite Precision Srar, Jalal Abdulsayed Chung, Kah-Seng Mansour, Ali APCC 2010 Technical Program Committee array beamforming RLMS algorithm fixed-point arithmetic component This paper studies the influence of the use of finite wordlength on the operation of the RLMS adaptive beamformingalgorithm. The convergence behavior of RLMS, based on the minimum mean square error (MSE), is analyzed for operation with finite precision. Computer simulation results verify that a wordlength of nine bits is sufficient for the RLMS algorithm to achieve performance close to that provided by full precision. The performance measures used include residual MSE, rate of convergence, error vector magnitude (EVM), and beam pattern. Based on all these measures, it is shown that the RLMS algorithm outperforms other earlier algorithms, such as least mean square (LMS), recursive least square (RLS), modified robust variable step size (MRVSS) and constrained stability LMS (CSLMS). 2010 Conference Paper http://hdl.handle.net/20.500.11937/13115 IEEE fulltext
spellingShingle array beamforming
RLMS algorithm
fixed-point arithmetic
component
Srar, Jalal Abdulsayed
Chung, Kah-Seng
Mansour, Ali
Analysis of the RLMS Adaptive Beamforming Algorithm Implemented with Finite Precision
title Analysis of the RLMS Adaptive Beamforming Algorithm Implemented with Finite Precision
title_full Analysis of the RLMS Adaptive Beamforming Algorithm Implemented with Finite Precision
title_fullStr Analysis of the RLMS Adaptive Beamforming Algorithm Implemented with Finite Precision
title_full_unstemmed Analysis of the RLMS Adaptive Beamforming Algorithm Implemented with Finite Precision
title_short Analysis of the RLMS Adaptive Beamforming Algorithm Implemented with Finite Precision
title_sort analysis of the rlms adaptive beamforming algorithm implemented with finite precision
topic array beamforming
RLMS algorithm
fixed-point arithmetic
component
url http://hdl.handle.net/20.500.11937/13115