{"id":"https://openalex.org/W4213417221","doi":"https://doi.org/10.1109/lsp.2022.3153207","title":"Data-Reuse Recursive Least-Squares Algorithms","display_name":"Data-Reuse Recursive Least-Squares Algorithms","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4213417221","doi":"https://doi.org/10.1109/lsp.2022.3153207"},"language":"en","primary_location":{"id":"doi:10.1109/lsp.2022.3153207","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2022.3153207","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023279451","display_name":"Constantin Paleologu","orcid":"https://orcid.org/0000-0002-0379-2360"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Constantin Paleologu","raw_affiliation_strings":["University Politehnica of Bucharest, Bucharest, Romania"],"raw_orcid":"https://orcid.org/0000-0002-0379-2360","affiliations":[{"raw_affiliation_string":"University Politehnica of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071376063","display_name":"Jacob Benesty","orcid":"https://orcid.org/0000-0002-0036-5865"},"institutions":[{"id":"https://openalex.org/I159129438","display_name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al","ror":"https://ror.org/002rjbv21","country_code":"CA","type":"education","lineage":["https://openalex.org/I159129438","https://openalex.org/I49663120"]},{"id":"https://openalex.org/I39481719","display_name":"Institut National de la Recherche Scientifique","ror":"https://ror.org/04td37d32","country_code":"CA","type":"education","lineage":["https://openalex.org/I39481719","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jacob Benesty","raw_affiliation_strings":["INRS-EMT, University of Quebec, Montreal, QC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRS-EMT, University of Quebec, Montreal, QC, Canada","institution_ids":["https://openalex.org/I159129438","https://openalex.org/I39481719"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070256554","display_name":"Silviu Ciochin\u0103","orcid":"https://orcid.org/0000-0003-3982-1837"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Silviu Ciochina","raw_affiliation_strings":["University Politehnica of Bucharest, Bucharest, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University Politehnica of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.9785,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.97877695,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"29","issue":null,"first_page":"752","last_page":"756"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10860","display_name":"Speech and Audio Processing","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/recursive-least-squares-filter","display_name":"Recursive least squares filter","score":0.7811863422393799},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.7481589913368225},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7171552181243896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6913658976554871},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6132010221481323},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5173189640045166},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.49124592542648315},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4718625247478485},{"id":"https://openalex.org/keywords/adaptive-filter","display_name":"Adaptive filter","score":0.45925232768058777},{"id":"https://openalex.org/keywords/least-squares-function-approximation","display_name":"Least-squares function approximation","score":0.44395965337753296},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.441210001707077},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1655525267124176},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.16552355885505676},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07249665260314941},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06723284721374512}],"concepts":[{"id":"https://openalex.org/C145249878","wikidata":"https://www.wikidata.org/wiki/Q2835868","display_name":"Recursive least squares filter","level":3,"score":0.7811863422393799},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.7481589913368225},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7171552181243896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6913658976554871},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6132010221481323},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5173189640045166},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.49124592542648315},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4718625247478485},{"id":"https://openalex.org/C102248274","wikidata":"https://www.wikidata.org/wiki/Q168388","display_name":"Adaptive filter","level":2,"score":0.45925232768058777},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.44395965337753296},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.441210001707077},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1655525267124176},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.16552355885505676},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07249665260314941},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06723284721374512},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.0},{"id":"https://openalex.org/C548081761","wikidata":"https://www.wikidata.org/wiki/Q180388","display_name":"Waste management","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lsp.2022.3153207","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2022.3153207","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Signal Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W26658632","https://openalex.org/W87496662","https://openalex.org/W647498929","https://openalex.org/W1523680888","https://openalex.org/W1544576535","https://openalex.org/W1565407539","https://openalex.org/W1602165951","https://openalex.org/W1975588945","https://openalex.org/W1979837465","https://openalex.org/W1984493659","https://openalex.org/W2003563417","https://openalex.org/W2006535037","https://openalex.org/W2014761159","https://openalex.org/W2030371713","https://openalex.org/W2042187938","https://openalex.org/W2046349008","https://openalex.org/W2047085268","https://openalex.org/W2065242685","https://openalex.org/W2069254750","https://openalex.org/W2080516498","https://openalex.org/W2100283766","https://openalex.org/W2121235768","https://openalex.org/W2126491786","https://openalex.org/W2132882255","https://openalex.org/W2141042379","https://openalex.org/W2148246129","https://openalex.org/W2149684112","https://openalex.org/W2150053932","https://openalex.org/W2153200902","https://openalex.org/W2161845075","https://openalex.org/W2166086965","https://openalex.org/W2169786833","https://openalex.org/W2342829713","https://openalex.org/W2615122654","https://openalex.org/W2615389023","https://openalex.org/W2790276104","https://openalex.org/W2793705271","https://openalex.org/W2921736226","https://openalex.org/W2969612761","https://openalex.org/W2973190484","https://openalex.org/W2980784807","https://openalex.org/W2996389006","https://openalex.org/W3134637099","https://openalex.org/W3163263478","https://openalex.org/W4210475733","https://openalex.org/W6633841275","https://openalex.org/W6674766236"],"related_works":["https://openalex.org/W2027630946","https://openalex.org/W2115882010","https://openalex.org/W2540778717","https://openalex.org/W3113906180","https://openalex.org/W1594413119","https://openalex.org/W2737757871","https://openalex.org/W2153755064","https://openalex.org/W132540092","https://openalex.org/W1988245724","https://openalex.org/W2171765073"],"abstract_inverted_index":{"There":[0],"are":[1],"different":[2],"strategies":[3],"to":[4,26,76],"improve":[5,27],"the":[6,10,22,28,32,36,42,60,68,74,77,84,90],"overall":[7],"performance":[8,91],"of":[9,31,39,62,67,86],"recursive":[11],"least-squares":[12],"(RLS)":[13],"adaptive":[14],"filter.":[15],"In":[16],"this":[17],"letter,":[18],"we":[19,50,72],"focus":[20],"on":[21],"data-reuse":[23,55,69],"approach,":[24],"aiming":[25],"convergence":[29],"rate/tracking":[30],"algorithm":[33],"by":[34],"reusing":[35],"same":[37],"set":[38],"data":[40],"(i.e.,":[41],"input":[43],"and":[44],"reference":[45],"signals)":[46],"several":[47],"times.":[48],"First,":[49],"present":[51],"a":[52,63],"computationally":[53],"efficient":[54],"RLS":[56,79],"algorithm,":[57],"which":[58],"is":[59],"result":[61],"low":[64],"complexity":[65],"implementation":[66],"process.":[70],"Moreover,":[71],"extend":[73],"idea":[75],"fast":[78],"algorithm.":[80],"Simulations":[81],"performed":[82],"in":[83],"context":[85],"echo":[87],"cancellation":[88],"support":[89],"gain.":[92]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":18},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}