Sparse adaptive L2LP algorithms with mixture norm constraint for multi-path channel estimation

Yanyan Wang, Yingsong Li, Rui Yang
{"title":"Sparse adaptive L2LP algorithms with mixture norm constraint for multi-path channel estimation","authors":"Yanyan Wang, Yingsong Li, Rui Yang","doi":"10.1109/ICCSNT.2017.8343747","DOIUrl":null,"url":null,"abstract":"An improved sparse l2 and lp norm error criterion algorithm (L2LP) is carried out by incorporating a p-norm like penalty into the cost function of the L2LP algorithm to fully utilize the prior information of the multi-path fading selective channel. The p-norm-like penalty is split into l0- and l1-norm constraints for large and small channel response coefficients for constructing the l0- and l1-norm constrained L2LP (L0L1-L2LP) algorithm. Two different zero attractors are exerted on the large and small coefficients, respectively. Furthermore, a reweighting factor is incorporated into the L0L1-L2LP algorithm to construct an enhanced algorithm named as reweighted L0L1-L2LP (RL0L1-L2LP) algorithm. The derivations of both sparse L2LP algorithms are introduced in detail. Numerical simulation samples are set up to discuss the channel estimation performance of our proposed L0L1-L2LP and RL0L1-L2LP algorithms. The obtained results give a confirmation that the proposed L0L1-L2LP and RL0L1-L2LP algorithms outperform the L2LP and the related L2LP algorithms in light of the convergence and steady-state performance for handling sparse channel estimation.","PeriodicalId":163433,"journal":{"name":"2017 6th International Conference on Computer Science and Network Technology (ICCSNT)","volume":"1 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 6th International Conference on Computer Science and Network Technology (ICCSNT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSNT.2017.8343747","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

An improved sparse l2 and lp norm error criterion algorithm (L2LP) is carried out by incorporating a p-norm like penalty into the cost function of the L2LP algorithm to fully utilize the prior information of the multi-path fading selective channel. The p-norm-like penalty is split into l0- and l1-norm constraints for large and small channel response coefficients for constructing the l0- and l1-norm constrained L2LP (L0L1-L2LP) algorithm. Two different zero attractors are exerted on the large and small coefficients, respectively. Furthermore, a reweighting factor is incorporated into the L0L1-L2LP algorithm to construct an enhanced algorithm named as reweighted L0L1-L2LP (RL0L1-L2LP) algorithm. The derivations of both sparse L2LP algorithms are introduced in detail. Numerical simulation samples are set up to discuss the channel estimation performance of our proposed L0L1-L2LP and RL0L1-L2LP algorithms. The obtained results give a confirmation that the proposed L0L1-L2LP and RL0L1-L2LP algorithms outperform the L2LP and the related L2LP algorithms in light of the convergence and steady-state performance for handling sparse channel estimation.
多径信道估计的混合范数约束稀疏自适应L2LP算法
为了充分利用多径衰落选择性信道的先验信息,在L2LP算法的代价函数中加入一个类p范数惩罚,提出了一种改进的稀疏l2和lp范数误差判据算法(L2LP)。对于大通道响应系数和小通道响应系数,类p范数惩罚被分为10范数约束和11范数约束,用于构造10范数约束和11范数约束的L2LP (L0L1-L2LP)算法。分别对大系数和小系数施加两个不同的零吸引子。在L0L1-L2LP算法中加入重加权因子,构造了一种增强算法,称为重加权L0L1-L2LP (RL0L1-L2LP)算法。详细介绍了这两种稀疏L2LP算法的推导。建立了数值模拟样本,讨论了我们提出的L0L1-L2LP和RL0L1-L2LP算法的信道估计性能。结果表明,L0L1-L2LP和RL0L1-L2LP算法在处理稀疏信道估计的收敛性和稳态性能方面优于L2LP及相关的L2LP算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信