Exact tracking analysis of the NLMS algorithm for correlated Gaussian inputs

T. Al-Naffouri, M. Moinuddin
{"title":"Exact tracking analysis of the NLMS algorithm for correlated Gaussian inputs","authors":"T. Al-Naffouri, M. Moinuddin","doi":"10.5281/ZENODO.43671","DOIUrl":null,"url":null,"abstract":"This work presents an exact tracking analysis of the Normalized Least Mean Square (NLMS) algorithm for circular complex correlated Gaussian inputs. Unlike the existing works, the analysis presented neither uses separation principle nor small step-size assumption. The approach is based on the derivation of a closed form expression for the cumulative distribution function (CDF) of random variables of the form (∥u∥D12)(∥u∥D22)-1 where u is a white Gaussian vector and D1 and D2 are diagonal matrices and using that to derive the first and second moments of such variables. These moments are then used to evaluate the tracking behavior of the NLMS algorithm in closed form. Thus, both the steady-state mean-square-error (MSE) and mean-square-deviation (MSD )tracking behaviors of the NLMS algorithm are evaluated. The analysis is also used to derive the optimum step-size that minimizes the excess MSE (EMSE). Simulations presented for the steady-state tracking behavior support the theoretical findings for a wide range of step-size and input correlation.","PeriodicalId":400766,"journal":{"name":"21st European Signal Processing Conference (EUSIPCO 2013)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"21st European Signal Processing Conference (EUSIPCO 2013)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5281/ZENODO.43671","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This work presents an exact tracking analysis of the Normalized Least Mean Square (NLMS) algorithm for circular complex correlated Gaussian inputs. Unlike the existing works, the analysis presented neither uses separation principle nor small step-size assumption. The approach is based on the derivation of a closed form expression for the cumulative distribution function (CDF) of random variables of the form (∥u∥D12)(∥u∥D22)-1 where u is a white Gaussian vector and D1 and D2 are diagonal matrices and using that to derive the first and second moments of such variables. These moments are then used to evaluate the tracking behavior of the NLMS algorithm in closed form. Thus, both the steady-state mean-square-error (MSE) and mean-square-deviation (MSD )tracking behaviors of the NLMS algorithm are evaluated. The analysis is also used to derive the optimum step-size that minimizes the excess MSE (EMSE). Simulations presented for the steady-state tracking behavior support the theoretical findings for a wide range of step-size and input correlation.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
相关高斯输入NLMS算法的精确跟踪分析
这项工作提出了对圆形复相关高斯输入的归一化最小均方(NLMS)算法的精确跟踪分析。与已有的分析不同,本文的分析既没有采用分离原理,也没有采用小步长假设。该方法基于形式为(∥u∥D12)(∥u∥D22)-1的随机变量的累积分布函数(CDF)的封闭形式表达式的推导,其中u是一个白色高斯向量,D1和D2是对角矩阵,并使用该表达式推导出这些变量的第一和第二矩。然后使用这些矩以封闭形式评估NLMS算法的跟踪行为。因此,对NLMS算法的稳态均方误差(MSE)和均方偏差(MSD)跟踪行为进行了评估。该分析还用于推导最大限度地减少过量MSE (EMSE)的最佳步长。对稳态跟踪行为的仿真支持了大范围步长和输入相关性的理论发现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Iterative algorithms for unbiased FIR state estimation in discrete time Detection of clipping in coded speech signals Primary emitter localization using smartly initialized Metropolis-Hastings algorithm Online multi-speaker tracking using multiple microphone arrays informed by auditory scene analysis Fast diffraction-pattern matching for object detection and recognition in digital holograms
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1