Comparison between Epsilon Normalized Least Means Square (ϵ-NLMS) and Recursive Least Squares (RLS) Adaptive Algorithms

A. Mahdi, L. Abdulameer, A. Morad
{"title":"Comparison between Epsilon Normalized Least Means Square (ϵ-NLMS) and Recursive Least Squares (RLS) Adaptive Algorithms","authors":"A. Mahdi, L. Abdulameer, A. Morad","doi":"10.29007/H74F","DOIUrl":null,"url":null,"abstract":"There is an evidence that channel estimation in communication systems plays a crucial issue in recovering the transmitted data. In recent years, there has been an increasing interest to solve problems due to channel estimation and equalization especially when the channel impulse response is fast time varying Rician fading distribution that means channel impulse response change rapidly. Therefore, there must be an optimal channel estimation and equalization to recover transmitted data. However. this paper attempt to compare epsilon normalized least mean square (ϵ-NLMS) and recursive least squares (RLS) algorithms by computing their performance ability to track multiple fast time varying Rician fading channel with different values of Doppler frequency, as well as mean square deviation (MSD) has simulated to measure the difference between original channel and what is estimated. The simulation results of this study showed that (ϵ-NLMS) tend to perform fast time varying Rician fading channel better than (RLS) adaptive filter.","PeriodicalId":383579,"journal":{"name":"2018 International Conference on Computing Sciences and Engineering (ICCSE)","volume":"47 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Computing Sciences and Engineering (ICCSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29007/H74F","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

There is an evidence that channel estimation in communication systems plays a crucial issue in recovering the transmitted data. In recent years, there has been an increasing interest to solve problems due to channel estimation and equalization especially when the channel impulse response is fast time varying Rician fading distribution that means channel impulse response change rapidly. Therefore, there must be an optimal channel estimation and equalization to recover transmitted data. However. this paper attempt to compare epsilon normalized least mean square (ϵ-NLMS) and recursive least squares (RLS) algorithms by computing their performance ability to track multiple fast time varying Rician fading channel with different values of Doppler frequency, as well as mean square deviation (MSD) has simulated to measure the difference between original channel and what is estimated. The simulation results of this study showed that (ϵ-NLMS) tend to perform fast time varying Rician fading channel better than (RLS) adaptive filter.
Epsilon归一化最小均方(ϵ-NLMS)与递归最小二乘(RLS)自适应算法的比较
有证据表明,信道估计在通信系统中对恢复传输数据起着至关重要的作用。近年来,人们对信道估计和均衡问题的解决越来越感兴趣,特别是当信道脉冲响应是快速时变的时域衰落分布时,信道脉冲响应变化很快。因此,必须有一个最优的信道估计和均衡来恢复传输的数据。然而。本文通过计算epsilon归一化最小均方算法(ϵ-NLMS)和递归最小二乘算法(RLS)跟踪多个多普勒频率值不同的快速时变信道的性能,并通过模拟均方差(MSD)来测量原始信道与估计信道的差值,对它们进行了比较。本研究的仿真结果表明(ϵ-NLMS)比(RLS)自适应滤波器更倾向于处理快速时变衰落信道。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信