{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:27:10Z","timestamp":1740115630690,"version":"3.37.3"},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["16K00223"],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Automatica"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1016\/j.automatica.2016.09.025","type":"journal-article","created":{"date-parts":[[2016,11,2]],"date-time":"2016-11-02T11:16:39Z","timestamp":1478085399000},"page":"244-248","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["H<\/mml:mi><\/mml:mstyle><\/mml:mrow>\u221e<\/mml:mi><\/mml:mrow><\/mml:msub><\/mml:math> optimality and a posteriori output estimate of the forgetting factor NLMS algorithm"],"prefix":"10.1016","volume":"75","author":[{"given":"Kiyoshi","family":"Nishiyama","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.automatica.2016.09.025_br000005","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1109\/89.861368","article-title":"Proportionate normalized least-mean-squares application in echo cancelers","volume":"8","author":"Duttweiler","year":"2000","journal-title":"IEEE Transactions on Speech and Audio Processing"},{"issue":"2","key":"10.1016\/j.automatica.2016.09.025_br000010","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/78.485923","article-title":"H\u221e optimality of the LMS algorithm","volume":"44","author":"Hassibi","year":"1996","journal-title":"IEEE Transactions on Signal Processing"},{"year":"1996","series-title":"Adaptive filter theory","author":"Haykin","key":"10.1016\/j.automatica.2016.09.025_br000015"},{"year":"1993","series-title":"Adaptive system identification and signal processing algorithms","author":"Kalouptsidis","key":"10.1016\/j.automatica.2016.09.025_br000020"},{"key":"10.1016\/j.automatica.2016.09.025_br000025","doi-asserted-by":"crossref","DOI":"10.1155\/2007\/84376","article-title":"A low delay and fast converging improved proportionate algorithm for sparse system identification","author":"Khong","year":"2007","journal-title":"EURASIP Journal on Audio, Speech, and Music Processing"},{"issue":"5","key":"10.1016\/j.automatica.2016.09.025_br000030","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1109\/TSP.2004.826156","article-title":"An H\u221e optimization and its fast algorithm for time-variant system identification","volume":"52","author":"Nishiyama","year":"2004","journal-title":"IEEE Transactions on Signal Processing"},{"key":"10.1016\/j.automatica.2016.09.025_br000035","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.sigpro.2013.10.007","article-title":"A unified view of adaptive algorithms for finite impulse response filters using the H\u221e framework","volume":"97","author":"Nishiyama","year":"2014","journal-title":"Signal Processing"},{"key":"10.1016\/j.automatica.2016.09.025_br000040","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.sigpro.2015.02.012","article-title":"A new approach to introducing a forgetting factor into the normalized least mean squares algorithm","volume":"114","author":"Nishiyama","year":"2015","journal-title":"Signal Processing"},{"year":"2008","series-title":"Adaptive filters","author":"Sayed","key":"10.1016\/j.automatica.2016.09.025_br000045"}],"container-title":["Automatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0005109816303697?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0005109816303697?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,4,2]],"date-time":"2021-04-02T00:19:09Z","timestamp":1617322749000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0005109816303697"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":9,"alternative-id":["S0005109816303697"],"URL":"https:\/\/doi.org\/10.1016\/j.automatica.2016.09.025","relation":{},"ISSN":["0005-1098"],"issn-type":[{"type":"print","value":"0005-1098"}],"subject":[],"published":{"date-parts":[[2017,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"optimality and a posteriori output estimate of the forgetting factor NLMS algorithm","name":"articletitle","label":"Article Title"},{"value":"Automatica","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.automatica.2016.09.025","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}