Modified LMS algorithm for fast identification of digital channels

W. Novotny, H. N. Ferrao, J. O. Pérez, Claudia F. Sayago
{"title":"Modified LMS algorithm for fast identification of digital channels","authors":"W. Novotny, H. N. Ferrao, J. O. Pérez, Claudia F. Sayago","doi":"10.1109/CONIEL.2005.50","DOIUrl":null,"url":null,"abstract":"A new modified LMS algorithm, to adjust the coefficients of an adaptive digital filter, is presented. Starting from the basic LMS (least mean square) algorithm, the modified algorithm, LMSm, has been conceived in order to achieve, for a determined number of iterations, both properties in parallel: a faster convergence rate; a smaller final quadratic error than the LMS and nLMS algorithms. The underlying idea is its application to digital communication channel identification and later equalization, which requires a high frequency of operation. These properties have been analytically derived and its behaviour has been extensively verified. Both analytical and experimental results obtained by using the LMSm algorithm in standard digital channel models show the following important improvements: a higher velocity of convergence; a smaller mean squared error between the model identified by the system and the real channel parameters.","PeriodicalId":367791,"journal":{"name":"15th International Conference on Electronics, Communications and Computers (CONIELECOMP'05)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"15th International Conference on Electronics, Communications and Computers (CONIELECOMP'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONIEL.2005.50","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

A new modified LMS algorithm, to adjust the coefficients of an adaptive digital filter, is presented. Starting from the basic LMS (least mean square) algorithm, the modified algorithm, LMSm, has been conceived in order to achieve, for a determined number of iterations, both properties in parallel: a faster convergence rate; a smaller final quadratic error than the LMS and nLMS algorithms. The underlying idea is its application to digital communication channel identification and later equalization, which requires a high frequency of operation. These properties have been analytically derived and its behaviour has been extensively verified. Both analytical and experimental results obtained by using the LMSm algorithm in standard digital channel models show the following important improvements: a higher velocity of convergence; a smaller mean squared error between the model identified by the system and the real channel parameters.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
改进的LMS算法快速识别数字信道
提出了一种新的改进LMS算法来调整自适应数字滤波器的系数。从基本的LMS(最小均方)算法出发,提出了改进的lsm算法,以便在确定的迭代次数下实现并行的两个特性:更快的收敛速度;最终二次误差小于LMS和nLMS算法。其基本思想是将其应用于数字通信信道识别和后期均衡,这需要较高的工作频率。这些性质已被解析导出,其行为已被广泛证实。在标准数字信道模型中使用LMSm算法得到的分析和实验结果表明,该算法具有以下重要改进:更快的收敛速度;系统识别的模型与实际信道参数之间的均方误差较小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Indoors radio channel simulator A novel method of matrix channel estimation for MIMO system [3G mobile communications] Notice of Violation of IEEE Publication PrinciplesUnited optimization of transceivers used in multiuser MIMO wireless system Multiagent architecture for telerobotics HAPS systems performance using a Ka-band channel model based on a time series generator
wanfang
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1