Analysis of an LMS-based algorithm using reduced number of computations

J.M. Abu-Ghalune; M.A. Khasawneh; IEEE

doi:10.1109/ISCAS.1996.540343

Back

Conference proceeding

Analysis of an LMS-based algorithm using reduced number of computations

J.M. Abu-Ghalune, M.A. Khasawneh and IEEE

1996 IEEE International Symposium on Circuits and Systems (ISCAS), Vol.2, pp.25-28 vol.2

1996

DOI: https://doi.org/10.1109/ISCAS.1996.540343

Abstract

Algorithm design and analysis

Computational modeling

Convergence

Eigenvalues and eigenfunctions

Error correction

Finite impulse response filter

Least squares approximation

Signal processing

Many algorithms have been used to improve the performance of the LMS algorithm. One such algorithm is the one given by Mayyas and Khasawnch (1993). In this paper, we give a mathematical analysis for this algorithm, derive a bound on its convergence parameter, /spl delta/, and modify it to reduce the number of computations from (6N-3) to (4N+1). Simulation results presented in this paper serve to justify the improved performance of this algorithm over its predecessor: the LMS algorithm.

Metrics

1 Record Views

Details

Title: Analysis of an LMS-based algorithm using reduced number of computations
Creators - without role: J.M. Abu-Ghalune - Jordan University of Science and Technology
M.A. Khasawneh - Jordan University of Science and Technology
IEEE
Publication Details: 1996 IEEE International Symposium on Circuits and Systems (ISCAS), Vol.2, pp.25-28 vol.2
Publisher: IEEE
Identifiers: 9925271208331
Academic Unit: Prince Mohammad Bin Fahd University
Language: English
Resource Type: Conference proceeding