{"id":"https://openalex.org/W41679398","doi":null,"title":"Algorithmes de filtrage adaptatifs \u00e9volu\u00e9s pour le traitement du signal d\u2019un capteur de son intrins\u00e8que \u00e0 fibre optique","display_name":"Algorithmes de filtrage adaptatifs \u00e9volu\u00e9s pour le traitement du signal d\u2019un capteur de son intrins\u00e8que \u00e0 fibre optique","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W41679398","mag":"41679398"},"language":"fr","primary_location":{"id":"pmh:oai:EPrintsUneraTest01:1711","doi":null,"is_oa":false,"landing_page_url":"http://scd-theses.u-strasbg.fr/1711/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400486","display_name":"Serveur des th\u00e8ses de l'Universit\u00e9 de Strasbourg (University of Strasbourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I68947357","host_organization_name":"Universit\u00e9 de Strasbourg","host_organization_lineage":["https://openalex.org/I68947357"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Th\u00e8se de doctorat"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"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/A5086182986","display_name":"Madjid Arezki","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Madjid Arezki","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5086182986"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11233","display_name":"Advanced Adaptive Filtering 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"}},"topics":[{"id":"https://openalex.org/T11233","display_name":"Advanced Adaptive Filtering 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"}},{"id":"https://openalex.org/T11034","display_name":"Digital Filter Design and Implementation","score":9.999999747378752e-05,"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":9.999999747378752e-05,"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/adaptive-filtering","display_name":"adaptive filtering","score":0.8360000252723694},{"id":"https://openalex.org/keywords/adaptive-noise-cancellation","display_name":"adaptive noise cancellation","score":0.7300000190734863},{"id":"https://openalex.org/keywords/recursive-least-squares","display_name":"recursive least squares","score":0.7580000162124634},{"id":"https://openalex.org/keywords/fast-recursive-least-squares","display_name":"fast recursive least squares","score":0.7620000243186951},{"id":"https://openalex.org/keywords/numerically-stable-algorithms","display_name":"numerically stable algorithms","score":0.8100000023841858},{"id":"https://openalex.org/keywords/computational-cost-reduction","display_name":"computational complexity reduction","score":0.7239999771118164}],"concepts":[{"id":"https://openalex.org/C15708023","wikidata":"https://www.wikidata.org/wiki/Q80083","display_name":"Humanities","level":1,"score":0.7922798991203308},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.6336637735366821},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.41990044713020325}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:EPrintsUneraTest01:1711","doi":null,"is_oa":false,"landing_page_url":"http://scd-theses.u-strasbg.fr/1711/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400486","display_name":"Serveur des th\u00e8ses de l'Universit\u00e9 de Strasbourg (University of Strasbourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I68947357","host_organization_name":"Universit\u00e9 de Strasbourg","host_organization_lineage":["https://openalex.org/I68947357"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Th\u00e8se de doctorat"},{"id":"mag:41679398","doi":null,"is_oa":false,"landing_page_url":"http://www.theses.fr/2009STRA6130","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W66513466","https://openalex.org/W621165875","https://openalex.org/W126607664","https://openalex.org/W2588427962","https://openalex.org/W351193236","https://openalex.org/W2510194649","https://openalex.org/W2008793362","https://openalex.org/W2113719240","https://openalex.org/W2997806300","https://openalex.org/W118665517"],"abstract_inverted_index":{"Les":[0],"microphones":[1],"a":[2,24,153,179,196,210],"fibres":[3],"optiques":[4],"intrinseques":[5],"tels":[6],"que":[7],"nous":[8,194],"les":[9,21,67,112,122],"avons":[10],"consideres":[11],"ont":[12],"une":[13,17,144],"grande":[14,18],"dynamique":[15],"et":[16,84,125,174,202,219],"sensibilite":[19],"qui":[20,42],"rendent":[22],"apte":[23],"un":[25,34,76,130,158,184,197],"grand":[26],"spectre":[27],"d\u2019application.":[28],"Mais":[29],"leurs":[30,49],"performances":[31,86],"peuvent":[32],"etre":[33,44],"handicap":[35],"par":[36],"rapport":[37],"aux":[38],"differents":[39],"effets":[40],"parasites":[41],"doivent":[43],"elimines":[45],"pour":[46,66,120,163],"exploiter":[47],"pleinement":[48],"performances.":[50],"Le":[51],"principal":[52],"objectif":[53],"de":[54,61,70,81,90,133,136,146,169,172,215],"notre":[55],"etude,":[56],"est":[57,171,176],"d\u2019evaluer":[58],"la":[59,192,207,211,213],"possibilite":[60],"developper":[62],"des":[63,94,114,220],"algorithmes":[64,113,142],"d\u2019adaptation":[65],"applications":[68],"d\u2019annulation":[69],"bruit":[71],"adaptive":[72],"tout":[73],"en":[74,105,129],"maintenant":[75],"equilibre":[77],"entre":[78],"sa":[79],"complexite":[80,168],"calcul":[82,147,170],"reduite":[83,178],"ses":[85,138],"adaptatives.":[87],"Nous":[88,155,205],"presentons":[89],"nouvelles":[91],"versions":[92],"d\u2019algorithmes":[93],"moindres":[95,115],"carres":[96,116],"recursifs":[97,117],"rapides":[98,118],"numeriquement":[99],"stables":[100],"(NS-FRLS).":[101],"Elles":[102],"sont":[103],"obtenues":[104],"utilisant":[106],"quelques":[107],"formules":[108],"redondantes,":[109],"disponible":[110],"dans":[111],"(FRLS),":[119],"estimer":[121],"erreurs":[123],"numeriques":[124],"retroagir":[126],"ces":[127],"dernieres":[128],"point":[131],"quelconque":[132],"l\u2019algorithme":[134],"afin":[135],"modifier":[137],"proprietes":[139],"numeriques.":[140],"Ces":[141],"representent":[143],"charge":[145],"trop":[148],"importante":[149],"qu\u2019il":[150],"faut":[151],"chercher":[152],"reduire.":[154],"proposons":[156],"ainsi":[157],"nouvel":[159],"algorithme":[160],"rapide":[161],"M-SMFTF":[162],"le":[164],"filtrage":[165],"adaptatif.":[166],"Sa":[167],"6L":[173],"celle-ci":[175],"considerablement":[177],"(2L+4P)":[180],"quand":[181],"on":[182],"utilise":[183],"predicteur":[185],"aller":[186],"reduit":[187],"d\u2019ordre":[188],"P":[189],"(P<<L).":[190],"Dans":[191],"conclusion":[193],"procedons":[195],"bilan":[198],"du":[199],"travail":[200],"theorique":[201,218],"experimental":[203],"accompli.":[204],"tracerons":[206],"perspective":[208],"concernant":[209],"fois":[212],"continuation":[214],"nos":[216],"travaux":[217],"developpements":[221],"technologiques.":[222]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}