{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T06:24:34Z","timestamp":1766298274771,"version":"3.41.0"},"reference-count":29,"publisher":"Wiley","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Navy Defense Foundation of China","award":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"],"award-info":[{"award-number":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"]}]},{"name":"Navy Defense Foundation of China","award":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"],"award-info":[{"award-number":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"],"award-info":[{"award-number":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology innovative Talents Foundation of Harbin","award":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"],"award-info":[{"award-number":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"]}]},{"name":"Science and Technology innovative Talents Foundation of Harbin","award":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"],"award-info":[{"award-number":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"]}]},{"name":"International Science and Technology Cooperation Program of China","award":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"],"award-info":[{"award-number":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"]}]},{"name":"Projects for the Selected Returned Overseas Chinese Scholars of Heilongjiang Province of China","award":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"],"award-info":[{"award-number":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"]}]},{"name":"Foundational Research Funds for the Central Universities","award":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"],"award-info":[{"award-number":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"]}]},{"name":"Foundational Research Funds for the Central Universities","award":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"],"award-info":[{"award-number":["4010403020102","4010403020103","61571149","2013RFXXJ083","2016RAXXJ044","2014DFR10240","HEUCF131602","HEUCFD1433"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2017]]},"abstract":"<jats:p>An improved norm-constrained set-membership normalized least mean square (INCSM-NLMS) algorithm is proposed for adaptive sparse channel estimation (ASCE). The proposed INCSM-NLMS algorithm is implemented by incorporating an<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><mml:mrow><mml:msub><mml:mrow><mml:mi>l<\/mml:mi><\/mml:mrow><mml:mrow><mml:mi>p<\/mml:mi><\/mml:mrow><\/mml:msub><\/mml:mrow><\/mml:math>-norm penalty into the cost function of the traditional set-membership normalized least mean square (SM-NLMS) algorithm, which is also denoted as<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\"><mml:mrow><mml:msub><mml:mrow><mml:mi>l<\/mml:mi><\/mml:mrow><mml:mrow><mml:mi>p<\/mml:mi><\/mml:mrow><\/mml:msub><\/mml:mrow><\/mml:math>-norm penalized SM-NLMS (LPSM-NLMS) algorithm. The derivation of the proposed LPSM-NLMS algorithm is given theoretically, resulting in a zero attractor in its iteration. By using this proposed zero attractor, the convergence speed is effectively accelerated and the channel estimation steady-state error is also observably reduced in comparison with the existing popular SM-NLMS algorithms for estimating exact sparse multipath channels. The estimation behaviors are investigated via a typical sparse wireless multipath channel, a typical network echo channel, and an acoustic channel. The computer simulation results show that the proposed LPSM-NLMS algorithm is better than those corresponding sparse SM-NLMS and traditional SM-NLMS algorithms when the channels are exactly sparse.<\/jats:p>","DOI":"10.1155\/2017\/8056126","type":"journal-article","created":{"date-parts":[[2017,1,11]],"date-time":"2017-01-11T21:07:02Z","timestamp":1484168822000},"page":"1-8","source":"Crossref","is-referenced-by-count":12,"title":["Adaptive Channel Estimation Based on an Improved Norm-Constrained Set-Membership Normalized Least Mean Square Algorithm"],"prefix":"10.1155","volume":"2017","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2450-6028","authenticated-orcid":true,"given":"Yingsong","family":"Li","sequence":"first","affiliation":[{"name":"College of Information and Communications Engineering, Harbin Engineering University, Harbin 150001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhan","family":"Jin","sequence":"additional","affiliation":[{"name":"College of Information and Communications Engineering, Harbin Engineering University, Harbin 150001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanyan","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Information and Communications Engineering, Harbin Engineering University, Harbin 150001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/97.668945"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/53.41661"},{"year":"2013","key":"3"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2014.2327376"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1186\/1687-1499-2013-204"},{"year":"2001","key":"8"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.507"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TAP.2007.908844"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/26.990897"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/jstsp.2011.2169649"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/jproc.2010.2042415"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2010.05.015"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/lsp.2009.2024736"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2011.09.035"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1002\/acs.2536"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2016.04.003"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.aeue.2016.04.001"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/89.861368"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/572969"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1007\/s00034-015-0132-3"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/937252"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1002\/dac.2531"},{"year":"1991","key":"37"},{"issue":"1","key":"38","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","year":"1996","journal-title":"Journal of the Royal Statistical Society. Series B. Methodological"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2006.871582"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1002\/acs.2428"},{"key":"40","first-page":"1457","volume":"5","year":"2004","journal-title":"Journal of Machine Learning Research"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1121\/1.382599"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2017\/8056126.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2017\/8056126.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2017\/8056126.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T09:49:39Z","timestamp":1749894579000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/wcmc\/2017\/8056126\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":29,"alternative-id":["8056126","8056126"],"URL":"https:\/\/doi.org\/10.1155\/2017\/8056126","relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2017]]}}}