{"id":"https://openalex.org/W4220839798","doi":"https://doi.org/10.3390/a15040111","title":"A Variable Step Size Normalized Least-Mean-Square Algorithm Based on Data Reuse","display_name":"A Variable Step Size Normalized Least-Mean-Square Algorithm Based on Data Reuse","publication_year":2022,"publication_date":"2022-03-24","ids":{"openalex":"https://openalex.org/W4220839798","doi":"https://doi.org/10.3390/a15040111"},"language":"en","primary_location":{"id":"doi:10.3390/a15040111","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15040111","pdf_url":"https://www.mdpi.com/1999-4893/15/4/111/pdf?version=1648188616","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/15/4/111/pdf?version=1648188616","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018668270","display_name":"Alexandru-George Rusu","orcid":null},"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":"Alexandru-George Rusu","raw_affiliation_strings":["Department of Research and Development, Rohde & Schwarz Topex, 020335 Bucharest, Romania","Department of Telecommunications, University Politehnica of Bucharest, 060042 Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Research and Development, Rohde & Schwarz Topex, 020335 Bucharest, Romania","institution_ids":[]},{"raw_affiliation_string":"Department of Telecommunications, University Politehnica of Bucharest, 060042 Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"middle","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":true,"raw_author_name":"Constantin Paleologu","raw_affiliation_strings":["Department of Telecommunications, University Politehnica of Bucharest, 060042 Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Telecommunications, University Politehnica of Bucharest, 060042 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 H5A 1K6, Canada"],"affiliations":[{"raw_affiliation_string":"INRS-EMT, University of Quebec, Montreal, QC H5A 1K6, 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 Ciochin\u0103","raw_affiliation_strings":["Department of Telecommunications, University Politehnica of Bucharest, 060042 Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Telecommunications, University Politehnica of Bucharest, 060042 Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5023279451"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":3.1555,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.91813132,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"15","issue":"4","first_page":"111","last_page":"111"},"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.9998000264167786,"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.9983999729156494,"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/algorithm","display_name":"Algorithm","score":0.7090169191360474},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5999652147293091},{"id":"https://openalex.org/keywords/least-mean-squares-filter","display_name":"Least mean squares filter","score":0.5509549379348755},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.532044529914856},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.48667722940444946},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.4843624532222748},{"id":"https://openalex.org/keywords/adaptive-filter","display_name":"Adaptive filter","score":0.42073625326156616},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37657320499420166},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.20803168416023254}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7090169191360474},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5999652147293091},{"id":"https://openalex.org/C32617633","wikidata":"https://www.wikidata.org/wiki/Q1426666","display_name":"Least mean squares filter","level":3,"score":0.5509549379348755},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.532044529914856},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.48667722940444946},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.4843624532222748},{"id":"https://openalex.org/C102248274","wikidata":"https://www.wikidata.org/wiki/Q168388","display_name":"Adaptive filter","level":2,"score":0.42073625326156616},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37657320499420166},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.20803168416023254},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a15040111","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15040111","pdf_url":"https://www.mdpi.com/1999-4893/15/4/111/pdf?version=1648188616","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:b1eb2cb86d1e4b79ac865585336af3b2","is_oa":true,"landing_page_url":"https://doaj.org/article/b1eb2cb86d1e4b79ac865585336af3b2","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 15, Iss 4, p 111 (2022)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/15/4/111/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15040111","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 15; Issue 4; Pages: 111","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a15040111","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15040111","pdf_url":"https://www.mdpi.com/1999-4893/15/4/111/pdf?version=1648188616","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2896006707","display_name":null,"funder_award_id":"PN-III-P1-1.1-TE-2019-0420","funder_id":"https://openalex.org/F4320323983","funder_display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii"}],"funders":[{"id":"https://openalex.org/F4320323983","display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","ror":"https://ror.org/01q7jq182"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4220839798.pdf","grobid_xml":"https://content.openalex.org/works/W4220839798.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W48610814","https://openalex.org/W647498929","https://openalex.org/W1523680888","https://openalex.org/W1565407539","https://openalex.org/W2003563417","https://openalex.org/W2065242685","https://openalex.org/W2065804682","https://openalex.org/W2099464104","https://openalex.org/W2102351287","https://openalex.org/W2108816505","https://openalex.org/W2127076901","https://openalex.org/W2135969423","https://openalex.org/W2141042379","https://openalex.org/W2141793797","https://openalex.org/W2148246129","https://openalex.org/W2149673267","https://openalex.org/W2169786833","https://openalex.org/W2258782427","https://openalex.org/W2340041121","https://openalex.org/W2544921883","https://openalex.org/W2588531509","https://openalex.org/W3145321633","https://openalex.org/W3157188644","https://openalex.org/W3209929327","https://openalex.org/W3210821751","https://openalex.org/W3217652264","https://openalex.org/W4210475733","https://openalex.org/W6674766236","https://openalex.org/W6804118718"],"related_works":["https://openalex.org/W2287235845","https://openalex.org/W2586228848","https://openalex.org/W2081837274","https://openalex.org/W2253481662","https://openalex.org/W1998353256","https://openalex.org/W2357454918","https://openalex.org/W2189195857","https://openalex.org/W3040496336","https://openalex.org/W2370278301","https://openalex.org/W2146261928"],"abstract_inverted_index":{"The":[0,43,209],"principal":[1],"issue":[2],"in":[3,203,212],"acoustic":[4],"echo":[5],"cancellation":[6],"(AEC)":[7],"is":[8,49,56,65,201],"to":[9,78,143],"estimate":[10],"the":[11,15,50,59,68,84,97,112,116,137,145,149,153,159,173,179,183,206,213,218,223],"impulse":[12],"response":[13],"between":[14,83],"loudspeaker":[16],"and":[17,104,161],"microphone":[18],"of":[19,62,70,96,118,148,156,172,182,191,205,215,222],"a":[20,30,80,107,128,189,197],"hands-free":[21],"communication":[22],"device.":[23],"This":[24,110],"application":[25],"can":[26,35,100,195],"be":[27,36,101,196],"addressed":[28],"as":[29,106],"system":[31],"identification":[32],"problem,":[33],"which":[34,141,177,200],"solved":[37],"by":[38,67,151],"using":[39],"an":[40,169],"adaptive":[41],"filter.":[42],"most":[44],"common":[45],"one":[46],"for":[47],"AEC":[48,216],"normalized":[51,72,192],"least-mean-square":[52],"(NLMS)":[53],"algorithm.":[54,184,226],"It":[55],"known":[57],"that":[58,135],"overall":[60],"performance":[61,86,220],"this":[63,93,124,187],"algorithm":[64,99,134,150],"controlled":[66,103],"value":[69],"its":[71],"step":[73,120,130,193],"size":[74,121,131],"parameter.":[75,109],"In":[76,123],"order":[77],"obtain":[79],"proper":[81],"compromise":[82],"main":[85,113],"criteria":[87],"(e.g.,":[88],"convergence":[89,146,180],"rate/tracking":[90,147],"versus":[91],"accuracy/robustness),":[92],"specific":[94],"term":[95],"NLMS":[98,132],"further":[102],"designed":[105],"variable":[108,119,129],"represents":[111],"motivation":[114],"behind":[115],"development":[117],"algorithms.":[122],"paper,":[125],"we":[126,167],"propose":[127],"(VSS-NLMS)":[133],"exploits":[136],"data":[138,157,174],"reuse":[139,175],"mechanism,":[140],"aims":[142],"improve":[144],"reusing":[152],"same":[154],"set":[155],"(i.e.,":[158],"input":[160],"reference":[162],"signals)":[163],"several":[164],"times.":[165],"Nevertheless,":[166],"involved":[168],"equivalent":[170],"version":[171],"NLMS,":[176],"provides":[178],"modes":[181],"Based":[185],"on":[186],"approach,":[188],"sequence":[190],"sizes":[194],"priori":[198],"scheduled,":[199],"advantageous":[202],"terms":[204],"computational":[207],"complexity.":[208],"simulation":[210],"results":[211],"context":[214],"supported":[217],"good":[219],"features":[221],"proposed":[224],"VSS-NLMS":[225]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5}],"updated_date":"2026-04-14T08:04:32.555800","created_date":"2022-04-03T00:00:00"}