{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T09:00:18Z","timestamp":1772269218030,"version":"3.50.1"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1109\/icassp.2019.8682498","type":"proceedings-article","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T20:01:56Z","timestamp":1555531316000},"page":"4843-4847","source":"Crossref","is-referenced-by-count":16,"title":["A Recursive Least-squares Algorithm Based on the Nearest Kronecker Product Decomposition"],"prefix":"10.1109","author":[{"given":"Camelia","family":"Elisei-Iliescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Constantin","family":"Paleologu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob","family":"Benesty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silviu","family":"Ciochina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TASLP.2015.2499602"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.2200\/S00289ED1V01Y201006SAP006"},{"key":"ref31","first-page":"ii-1881","article-title":"An improved PNLMS algorithm","author":"benesty","year":"2002","journal-title":"Proc IEEE ICASSP"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/89.861368"},{"key":"ref34","year":"2002","journal-title":"Digital Network Echo Cancellers"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SSAP.1996.534845"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-1684(00)00085-2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2006.04.005"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329429"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/MSP.2013.2297439","article-title":"Tensor decompositions for signal processing applications: From two-way to multiway component analysis","volume":"32","author":"cichocki","year":"2015","journal-title":"IEEE Signal Processing Mag"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2015.7383768"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2570862"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2617858"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2017.2685461"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2690524"},{"key":"ref28","author":"golub","year":"1996","journal-title":"Matrix Computations"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.917874"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2018.09.005"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04437-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2715882"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/b98818"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2258340"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TASLP.2018.2842146"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2794455"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8644-3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(00)00393-9"},{"key":"ref1","author":"haykin","year":"2002","journal-title":"Adaptive Filter Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.23919\/EUSIPCO.2017.8081651"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178591"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2017.12.015"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2018.01.010"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/EUSIPCO.2015.7362832"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.23919\/EUSIPCO.2018.8553092"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8461971"}],"event":{"name":"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","location":"Brighton, United Kingdom","start":{"date-parts":[[2019,5,12]]},"end":{"date-parts":[[2019,5,17]]}},"container-title":["ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8671773\/8682151\/08682498.pdf?arnumber=8682498","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:23:03Z","timestamp":1657855383000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8682498\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/icassp.2019.8682498","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}