{"id":"https://openalex.org/W2167090453","doi":"https://doi.org/10.1109/lsp.2009.2035665","title":"An Efficient Proportionate Affine Projection Algorithm for Echo Cancellation","display_name":"An Efficient Proportionate Affine Projection Algorithm for Echo Cancellation","publication_year":2009,"publication_date":"2009-11-03","ids":{"openalex":"https://openalex.org/W2167090453","doi":"https://doi.org/10.1109/lsp.2009.2035665","mag":"2167090453"},"language":"en","primary_location":{"id":"doi:10.1109/lsp.2009.2035665","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2009.2035665","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":"C. Paleologu","raw_affiliation_strings":["Telecommunications Department, Politehnica University of Bucharest, Bucharest, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Telecommunications Department, Politehnica University of Bucharest, 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":"S. Ciochina","raw_affiliation_strings":["Telecommunications Department, Politehnica University of Bucharest, Bucharest, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Telecommunications Department, Politehnica University of Bucharest, 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":"J. Benesty","raw_affiliation_strings":["INRS-EMT, Universite du Quebec, Montreal, QUE, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRS-EMT, Universite du Quebec, Montreal, QUE, Canada","institution_ids":["https://openalex.org/I159129438","https://openalex.org/I39481719"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.7751,"has_fulltext":false,"cited_by_count":136,"citation_normalized_percentile":{"value":0.97531261,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":"17","issue":"2","first_page":"165","last_page":"168"},"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.9994999766349792,"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.6569151282310486},{"id":"https://openalex.org/keywords/echo","display_name":"Echo (communications protocol)","score":0.5880417227745056},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5761290788650513},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.5496965646743774},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5488789081573486},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5033640265464783},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49066102504730225},{"id":"https://openalex.org/keywords/adaptive-filter","display_name":"Adaptive filter","score":0.48915961384773254},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.46399280428886414},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.45730262994766235},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.4534856677055359},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4120478928089142},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33427613973617554},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.07541808485984802}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6569151282310486},{"id":"https://openalex.org/C2779426996","wikidata":"https://www.wikidata.org/wiki/Q18389128","display_name":"Echo (communications protocol)","level":2,"score":0.5880417227745056},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5761290788650513},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.5496965646743774},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5488789081573486},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5033640265464783},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49066102504730225},{"id":"https://openalex.org/C102248274","wikidata":"https://www.wikidata.org/wiki/Q168388","display_name":"Adaptive filter","level":2,"score":0.48915961384773254},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.46399280428886414},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.45730262994766235},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.4534856677055359},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4120478928089142},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33427613973617554},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.07541808485984802},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lsp.2009.2035665","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lsp.2009.2035665","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.725.5393","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.725.5393","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://externe.emt.inrs.ca/users/benesty/papers/spl_feb2010.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W591273972","https://openalex.org/W1485076880","https://openalex.org/W1544576535","https://openalex.org/W1930666600","https://openalex.org/W2006825001","https://openalex.org/W2039960940","https://openalex.org/W2063266395","https://openalex.org/W2099464104","https://openalex.org/W2108816505","https://openalex.org/W2142458999","https://openalex.org/W2143643945","https://openalex.org/W2168349993","https://openalex.org/W2489547515","https://openalex.org/W3145321633","https://openalex.org/W3161872616","https://openalex.org/W6629077521","https://openalex.org/W6660484869"],"related_works":["https://openalex.org/W2954392969","https://openalex.org/W2162631815","https://openalex.org/W2026859618","https://openalex.org/W3124166275","https://openalex.org/W2358531026","https://openalex.org/W812148123","https://openalex.org/W2103984789","https://openalex.org/W2004466918","https://openalex.org/W2112363686","https://openalex.org/W1550896938"],"abstract_inverted_index":{"<para":[0],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[1],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">":[2],"Proportionate-type":[3],"normalized":[4],"least-mean-square":[5],"algorithms":[6],"were":[7],"developed":[8],"in":[9,36],"the":[10,20,25,31,52,73,76,88,92,115],"context":[11],"of":[12,42,54,75,114],"echo":[13],"cancellation.":[14],"In":[15],"order":[16],"to":[17,30,110],"further":[18],"increase":[19],"convergence":[21],"rate":[22],"and":[23,98],"tracking,":[24],"\u201cproportionate\u201d":[26],"idea":[27],"was":[28],"applied":[29],"affine":[32],"projection":[33],"algorithm":[34,90],"(APA)":[35],"a":[37,48,64,105,111],"straightforward":[38],"manner.":[39],"The":[40,79],"objective":[41],"this":[43,62],"letter":[44],"is":[45,57,68,81],"twofold.":[46,83],"First,":[47],"general":[49],"framework":[50],"for":[51],"derivation":[53],"proportionate-type":[55,66],"APAs":[56],"proposed.":[58],"Second,":[59],"based":[60],"on":[61],"approach,":[63],"new":[65],"APA":[67],"developed,":[69],"taking":[70],"into":[71],"account":[72],"\u201chistory\u201d":[74],"proportionate":[77],"factors.":[78],"benefit":[80],"also":[82,103],"Simulation":[84],"results":[85],"indicate":[86],"that":[87],"proposed":[89],"outperforms":[91],"classical":[93],"one":[94],"(achieving":[95],"faster":[96],"tracking":[97],"lower":[99,106],"misadjustment).":[100],"Besides,":[101],"it":[102],"has":[104],"computational":[107],"complexity":[108],"due":[109],"recursive":[112],"implementation":[113],"\u201cproportionate":[116],"history.\u201d":[117],"</para>":[118]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":18},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":20},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":7}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}