{"id":"https://openalex.org/W2963256822","doi":"https://doi.org/10.3390/a12080147","title":"An Optimized Differential Step-Size LMS Algorithm","display_name":"An Optimized Differential Step-Size LMS Algorithm","publication_year":2019,"publication_date":"2019-07-24","ids":{"openalex":"https://openalex.org/W2963256822","doi":"https://doi.org/10.3390/a12080147","mag":"2963256822"},"language":"en","primary_location":{"id":"doi:10.3390/a12080147","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12080147","pdf_url":"https://www.mdpi.com/1999-4893/12/8/147/pdf?version=1564576061","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/12/8/147/pdf?version=1564576061","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, 014142 Bucharest, Romania","Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Research and Development, Rohde & Schwarz Topex, 014142 Bucharest, Romania","institution_ids":[]},{"raw_affiliation_string":"Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"middle","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, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 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, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","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"]}]}],"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":0.1892,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.49641518,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":"8","first_page":"147","last_page":"147"},"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9983000159263611,"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/T10860","display_name":"Speech and Audio Processing","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/algorithm","display_name":"Algorithm","score":0.7438899874687195},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7434980273246765},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.66001296043396},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6517882943153381},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5684202313423157},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.48064935207366943},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.4249055087566376},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.41454771161079407},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40278160572052},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2814459204673767},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1385723054409027}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7438899874687195},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7434980273246765},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.66001296043396},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6517882943153381},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5684202313423157},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.48064935207366943},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.4249055087566376},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.41454771161079407},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40278160572052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2814459204673767},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1385723054409027},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a12080147","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12080147","pdf_url":"https://www.mdpi.com/1999-4893/12/8/147/pdf?version=1564576061","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:cff433b707944520ae0766482f13c552","is_oa":true,"landing_page_url":"https://doaj.org/article/cff433b707944520ae0766482f13c552","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-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 12, Iss 8, p 147 (2019)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/12/8/147/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a12080147","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","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a12080147","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12080147","pdf_url":"https://www.mdpi.com/1999-4893/12/8/147/pdf?version=1564576061","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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2963256822.pdf","grobid_xml":"https://content.openalex.org/works/W2963256822.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W123803282","https://openalex.org/W1152868481","https://openalex.org/W1979740015","https://openalex.org/W1999602961","https://openalex.org/W2035476608","https://openalex.org/W2099464104","https://openalex.org/W2105591650","https://openalex.org/W2106793162","https://openalex.org/W2108816505","https://openalex.org/W2118718620","https://openalex.org/W2119099945","https://openalex.org/W2129629082","https://openalex.org/W2130363034","https://openalex.org/W2135969423","https://openalex.org/W2141793797","https://openalex.org/W2143643945","https://openalex.org/W2147553224","https://openalex.org/W2149673267","https://openalex.org/W2258782427","https://openalex.org/W2293909378","https://openalex.org/W2488876280","https://openalex.org/W2565077243","https://openalex.org/W2902610268","https://openalex.org/W2951217737","https://openalex.org/W2965778005","https://openalex.org/W3099579977","https://openalex.org/W3145321633","https://openalex.org/W4234397156","https://openalex.org/W6677759377"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2378211422","https://openalex.org/W4321353415","https://openalex.org/W2130974462","https://openalex.org/W972276598","https://openalex.org/W2086519370","https://openalex.org/W2028665553","https://openalex.org/W2087343574","https://openalex.org/W2535915176","https://openalex.org/W2105860728"],"abstract_inverted_index":{"Adaptive":[0],"algorithms":[1,92],"with":[2,51],"differential":[3],"step-sizes":[4],"(related":[5],"to":[6],"the":[7,14,67,71,74,77,90,98],"filter":[8],"coefficients)":[9],"are":[10,23],"well":[11],"known":[12],"in":[13,86,97],"literature,":[15],"most":[16],"frequently":[17],"as":[18],"\u201cproportionate\u201d":[19],"algorithms.":[20,75],"Usually,":[21],"they":[22],"derived":[24],"on":[25],"a":[26,44],"heuristic":[27],"basis.":[28],"In":[29],"this":[30],"paper,":[31],"we":[32,42],"introduce":[33],"an":[34,38,83],"algorithm":[35,46],"resulting":[36],"from":[37],"optimization":[39],"criterion.":[40],"Thereby,":[41],"obtain":[43],"benchmark":[45],"and":[47,69],"also":[48],"another":[49],"version":[50],"lower":[52],"computational":[53,87],"complexity,":[54],"which":[55],"is":[56,80],"rigorously":[57],"valid":[58],"for":[59],"less":[60],"correlated":[61],"input":[62],"signals.":[63],"Simulation":[64],"results":[65],"confirm":[66],"theory":[68],"outline":[70],"performance":[72,79],"of":[73],"Unfortunately,":[76],"good":[78],"obtained":[81],"by":[82],"important":[84],"increase":[85],"complexity.":[88],"Nevertheless,":[89],"proposed":[91],"could":[93],"represent":[94],"useful":[95],"benchmarks":[96],"field.":[99]},"counts_by_year":[{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}