{"id":"https://openalex.org/W2163748104","doi":"https://doi.org/10.1109/icassp.2011.5946332","title":"An efficient variable step-size proportionate affine projection algorithm","display_name":"An efficient variable step-size proportionate affine projection algorithm","publication_year":2011,"publication_date":"2011-05-01","ids":{"openalex":"https://openalex.org/W2163748104","doi":"https://doi.org/10.1109/icassp.2011.5946332","mag":"2163748104"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2011.5946332","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2011.5946332","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-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, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University Politehnica of 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, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRS-EMT, University of Quebec, Montreal, Canada","institution_ids":["https://openalex.org/I159129438","https://openalex.org/I39481719"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088650299","display_name":"Felix Albu","orcid":"https://orcid.org/0000-0002-3240-809X"},"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":"Felix Albu","raw_affiliation_strings":["University Politehnica of Bucharest, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University Politehnica of Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"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, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University Politehnica of Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.057,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.79011847,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"80","issue":null,"first_page":"77","last_page":"80"},"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.9998999834060669,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.6834914684295654},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6755388975143433},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6428415775299072},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.5881034135818481},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5814685821533203},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.4914776086807251},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4583638608455658},{"id":"https://openalex.org/keywords/adaptive-filter","display_name":"Adaptive filter","score":0.4561845362186432},{"id":"https://openalex.org/keywords/echo","display_name":"Echo (communications protocol)","score":0.45346179604530334},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4467615485191345},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4422942101955414},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4371081590652466},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33650627732276917},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.20308297872543335}],"concepts":[{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.6834914684295654},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6755388975143433},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6428415775299072},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.5881034135818481},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5814685821533203},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4914776086807251},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4583638608455658},{"id":"https://openalex.org/C102248274","wikidata":"https://www.wikidata.org/wiki/Q168388","display_name":"Adaptive filter","level":2,"score":0.4561845362186432},{"id":"https://openalex.org/C2779426996","wikidata":"https://www.wikidata.org/wiki/Q18389128","display_name":"Echo (communications protocol)","level":2,"score":0.45346179604530334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4467615485191345},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4422942101955414},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4371081590652466},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33650627732276917},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.20308297872543335},{"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/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.2011.5946332","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2011.5946332","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1544576535","https://openalex.org/W1967940738","https://openalex.org/W2006825001","https://openalex.org/W2043467869","https://openalex.org/W2063266395","https://openalex.org/W2065804682","https://openalex.org/W2099464104","https://openalex.org/W2111143454","https://openalex.org/W2132591905","https://openalex.org/W2137928951","https://openalex.org/W2141793797","https://openalex.org/W2143643945","https://openalex.org/W2166879193","https://openalex.org/W2166922380","https://openalex.org/W2167090453","https://openalex.org/W2168349993","https://openalex.org/W4301462798","https://openalex.org/W6679669853","https://openalex.org/W6681126137"],"related_works":["https://openalex.org/W2954392969","https://openalex.org/W2162631815","https://openalex.org/W3124166275","https://openalex.org/W2026859618","https://openalex.org/W2358531026","https://openalex.org/W812148123","https://openalex.org/W2103984789","https://openalex.org/W2004466918","https://openalex.org/W1550896938","https://openalex.org/W2182582018"],"abstract_inverted_index":{"Proportionate-type":[0],"affine":[1,23],"projection":[2,24],"algorithms":[3,13],"(PAPAs)":[4],"are":[5],"very":[6],"attractive":[7],"choices":[8],"for":[9],"echo":[10,38],"cancellation.":[11],"These":[12],"combine":[14],"the":[15,22,28,33,37],"good":[16,68],"features":[17],"(convergence":[18],"and":[19,27,74],"tracking)":[20],"of":[21,36,58],"algorithm":[25,65],"(APA)":[26],"proportionate":[29],"idea,":[30],"which":[31],"exploits":[32],"sparseness":[34],"character":[35],"path":[39],"in":[40],"order":[41],"to":[42,86],"further":[43],"increase":[44],"their":[45],"convergence":[46,72],"rate.":[47],"In":[48],"this":[49],"paper,":[50],"we":[51],"develop":[52],"a":[53,59,67,80],"variable":[54],"step-size":[55],"(VSS)":[56],"version":[57],"recently":[60],"proposed":[61],"PAPA.":[62],"The":[63],"new":[64],"achieves":[66],"compromise":[69],"between":[70],"fast":[71],"rate":[73],"low":[75,81],"misadjustment,":[76],"but":[77],"also":[78],"has":[79],"computational":[82],"complexity":[83],"as":[84],"compared":[85],"its":[87],"classical":[88],"counterparts.":[89]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}