{"id":"https://openalex.org/W2125771581","doi":"https://doi.org/10.1109/icassp.2002.5744992","title":"Multichannel fast affine projection algorithm for active noise Control","display_name":"Multichannel fast affine projection algorithm for active noise Control","publication_year":2002,"publication_date":"2002-05-01","ids":{"openalex":"https://openalex.org/W2125771581","doi":"https://doi.org/10.1109/icassp.2002.5744992","mag":"2125771581"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2002.5744992","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2002.5744992","pdf_url":null,"source":{"id":"https://openalex.org/S4363607879","display_name":"IEEE International Conference on Acoustics Speech and Signal Processing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Acoustics Speech and Signal Processing","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/A5082819549","display_name":"Martin Bouchard","orcid":"https://orcid.org/0000-0002-1165-438X"},"institutions":[{"id":"https://openalex.org/I153718931","display_name":"University of Ottawa","ror":"https://ror.org/03c4mmv16","country_code":"CA","type":"education","lineage":["https://openalex.org/I153718931"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Martin Bouchard","raw_affiliation_strings":["School of Information Technology and Engineering, University of Ottawa, Ottawa, ONT, Canada","School of Information Technology and Engineering, University of Ottawa, 161 Louis-Pasteur, P.O. Box 450, Station A, (Ontario), K1N 6N5, Canada"],"affiliations":[{"raw_affiliation_string":"School of Information Technology and Engineering, University of Ottawa, Ottawa, ONT, Canada","institution_ids":["https://openalex.org/I153718931"]},{"raw_affiliation_string":"School of Information Technology and Engineering, University of Ottawa, 161 Louis-Pasteur, P.O. Box 450, Station A, (Ontario), K1N 6N5, Canada","institution_ids":["https://openalex.org/I153718931"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5082819549"],"corresponding_institution_ids":["https://openalex.org/I153718931"],"apc_list":null,"apc_paid":null,"fwci":2.4667,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.87662338,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"II","last_page":"1873"},"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.9973999857902527,"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.9968000054359436,"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.7918931245803833},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6844098567962646},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6571248769760132},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.564799964427948},{"id":"https://openalex.org/keywords/adaptive-filter","display_name":"Adaptive filter","score":0.5383831262588501},{"id":"https://openalex.org/keywords/recursive-least-squares-filter","display_name":"Recursive least squares filter","score":0.5180256962776184},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.45341357588768005},{"id":"https://openalex.org/keywords/least-squares-function-approximation","display_name":"Least-squares function approximation","score":0.45176130533218384},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.44831329584121704},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.4345815181732178},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2809322476387024},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.14203408360481262},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11524194478988647}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7918931245803833},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6844098567962646},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6571248769760132},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.564799964427948},{"id":"https://openalex.org/C102248274","wikidata":"https://www.wikidata.org/wiki/Q168388","display_name":"Adaptive filter","level":2,"score":0.5383831262588501},{"id":"https://openalex.org/C145249878","wikidata":"https://www.wikidata.org/wiki/Q2835868","display_name":"Recursive least squares filter","level":3,"score":0.5180256962776184},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.45341357588768005},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.45176130533218384},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.44831329584121704},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.4345815181732178},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2809322476387024},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.14203408360481262},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11524194478988647},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icassp.2002.5744992","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2002.5744992","pdf_url":null,"source":{"id":"https://openalex.org/S4363607879","display_name":"IEEE International Conference on Acoustics Speech and Signal Processing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Acoustics Speech and Signal Processing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.58.8294","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.8294","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.site.uottawa.ca/~bouchard/publis/icassp2002_affine.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1506598295","https://openalex.org/W1523680888","https://openalex.org/W1602419334","https://openalex.org/W1930666600","https://openalex.org/W1936291120","https://openalex.org/W2115433244","https://openalex.org/W2126287638","https://openalex.org/W2165985312","https://openalex.org/W3169801697","https://openalex.org/W4302176828","https://openalex.org/W6630151832","https://openalex.org/W6636099188"],"related_works":["https://openalex.org/W2081837274","https://openalex.org/W2027630946","https://openalex.org/W3119704784","https://openalex.org/W2544484136","https://openalex.org/W2529395309","https://openalex.org/W2164852895","https://openalex.org/W4282823030","https://openalex.org/W3134357585","https://openalex.org/W2182582018","https://openalex.org/W3040496336"],"abstract_inverted_index":{"In":[0,71],"the":[1,34,56,60,64,90,105,109,122,139],"field":[2],"of":[3,59,89],"adaptive":[4,140],"signal":[5],"processing,":[6],"it":[7,96,118],"is":[8,80,93,97],"well":[9],"known":[10],"that":[11,101],"fast":[12,76],"affine":[13,77],"projection":[14,78],"algorithms":[15,29],"can":[16,42,104,119],"produce":[17],"a":[18,44,74],"good":[19],"tradeoff":[20,111],"between":[21,112],"convergence":[22,36,47,113,124],"speed":[23,37,48],"and":[24,95,115],"computational":[25,61,87,116],"complexity.":[26],"Although":[27],"these":[28],"typically":[30],"do":[31],"not":[32,102],"provide":[33,43,108,121],"same":[35],"as":[38],"recursive-least-squares":[39,69,128],"algorithms,":[40,54],"they":[41],"much":[45],"improved":[46],"compared":[49],"to":[50],"stochastic":[51],"gradient":[52],"descent":[53],"without":[55],"high":[57],"increase":[58],"load":[62],"or":[63],"instability":[65],"often":[66],"found":[67],"in":[68,138],"algorithms.":[70],"this":[72],"paper,":[73],"multichannel":[75],"algorithm":[79,92,107],"introduced":[81],"for":[82],"active":[83],"noise":[84],"control.":[85],"The":[86],"complexity":[88],"new":[91,106],"evaluated,":[94],"shown":[98],"through":[99],"simulations":[100],"only":[103],"expected":[110],"performance":[114,125],"complexity,":[117],"also":[120],"best":[123],"(even":[126],"over":[127],"algorithms)":[129],"when":[130],"non-ideal":[131],"noisy":[132],"acoustic":[133],"plant":[134],"models":[135],"are":[136],"used":[137],"systems.":[141]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}