{"title":"多径信道估计的混合范数约束稀疏自适应L2LP算法","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":"{\"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}","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}
Sparse adaptive L2LP algorithms with mixture norm constraint for multi-path channel estimation
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.