{"id":"https://openalex.org/W2087899231","doi":"https://doi.org/10.1145/1117201.1117263","title":"GSFAP adaptive filtering using log arithmetic for resource-constrained embedded systems","display_name":"GSFAP adaptive filtering using log arithmetic for resource-constrained embedded systems","publication_year":2006,"publication_date":"2006-02-22","ids":{"openalex":"https://openalex.org/W2087899231","doi":"https://doi.org/10.1145/1117201.1117263","mag":"2087899231"},"language":"en","primary_location":{"id":"doi:10.1145/1117201.1117263","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1117201.1117263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 ACM/SIGDA 14th international symposium on Field programmable gate arrays","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/A5021767901","display_name":"M. Tich\u00fd","orcid":"https://orcid.org/0000-0003-4024-4838"},"institutions":[{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":true,"raw_author_name":"Milan Tichy","raw_affiliation_strings":["University of Dublin, Trinity College, Dublin, Ireland","Univ. of Dublin, Trinity College, Dublin, Ireland#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Dublin, Trinity College, Dublin, Ireland","institution_ids":["https://openalex.org/I205274468"]},{"raw_affiliation_string":"Univ. of Dublin, Trinity College, Dublin, Ireland#TAB#","institution_ids":["https://openalex.org/I205274468"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109478699","display_name":"Andy Nisbet","orcid":null},"institutions":[{"id":"https://openalex.org/I11983389","display_name":"Manchester Metropolitan University","ror":"https://ror.org/02hstj355","country_code":"GB","type":"education","lineage":["https://openalex.org/I11983389"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andy Nisbet","raw_affiliation_strings":["Manchester Metropolitan University, Manchester, UK","(Manchester Metropolitan University, Manchester, UK)"],"affiliations":[{"raw_affiliation_string":"Manchester Metropolitan University, Manchester, UK","institution_ids":["https://openalex.org/I11983389"]},{"raw_affiliation_string":"(Manchester Metropolitan University, Manchester, UK)","institution_ids":["https://openalex.org/I11983389"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003800161","display_name":"David Gregg","orcid":"https://orcid.org/0000-0003-3782-4612"},"institutions":[{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"David Gregg","raw_affiliation_strings":["University of Dublin, Trinity College, Dublin, Ireland","Univ. of Dublin, Trinity College, Dublin, Ireland#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Dublin, Trinity College, Dublin, Ireland","institution_ids":["https://openalex.org/I205274468"]},{"raw_affiliation_string":"Univ. of Dublin, Trinity College, Dublin, Ireland#TAB#","institution_ids":["https://openalex.org/I205274468"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5021767901"],"corresponding_institution_ids":["https://openalex.org/I205274468"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16430838,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"236","last_page":"236"},"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/T11034","display_name":"Digital Filter Design and Implementation","score":0.9983999729156494,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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-filter","display_name":"Adaptive filter","score":0.6806257367134094},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.670408308506012},{"id":"https://openalex.org/keywords/recursive-least-squares-filter","display_name":"Recursive least squares filter","score":0.5805225372314453},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4724041819572449},{"id":"https://openalex.org/keywords/digital-signal-processing","display_name":"Digital signal processing","score":0.46194204688072205},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.447824627161026},{"id":"https://openalex.org/keywords/fixed-point-arithmetic","display_name":"Fixed-point arithmetic","score":0.43962493538856506},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43802422285079956},{"id":"https://openalex.org/keywords/least-mean-squares-filter","display_name":"Least mean squares filter","score":0.43724849820137024},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.42044204473495483},{"id":"https://openalex.org/keywords/signal-processing","display_name":"Signal processing","score":0.41021859645843506},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.3625503480434418},{"id":"https://openalex.org/keywords/floating-point","display_name":"Floating point","score":0.31504225730895996},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19212663173675537},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.1618707776069641}],"concepts":[{"id":"https://openalex.org/C102248274","wikidata":"https://www.wikidata.org/wiki/Q168388","display_name":"Adaptive filter","level":2,"score":0.6806257367134094},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.670408308506012},{"id":"https://openalex.org/C145249878","wikidata":"https://www.wikidata.org/wiki/Q2835868","display_name":"Recursive least squares filter","level":3,"score":0.5805225372314453},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4724041819572449},{"id":"https://openalex.org/C84462506","wikidata":"https://www.wikidata.org/wiki/Q173142","display_name":"Digital signal processing","level":2,"score":0.46194204688072205},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.447824627161026},{"id":"https://openalex.org/C163973906","wikidata":"https://www.wikidata.org/wiki/Q649900","display_name":"Fixed-point arithmetic","level":3,"score":0.43962493538856506},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43802422285079956},{"id":"https://openalex.org/C32617633","wikidata":"https://www.wikidata.org/wiki/Q1426666","display_name":"Least mean squares filter","level":3,"score":0.43724849820137024},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.42044204473495483},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.41021859645843506},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.3625503480434418},{"id":"https://openalex.org/C84211073","wikidata":"https://www.wikidata.org/wiki/Q117879","display_name":"Floating point","level":2,"score":0.31504225730895996},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19212663173675537},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.1618707776069641},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1117201.1117263","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1117201.1117263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 ACM/SIGDA 14th international symposium on Field programmable gate arrays","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1492221128","https://openalex.org/W1501537878","https://openalex.org/W1503096262","https://openalex.org/W1544576535","https://openalex.org/W1580633658","https://openalex.org/W1587217691","https://openalex.org/W1590879322","https://openalex.org/W1835192048","https://openalex.org/W1840119786","https://openalex.org/W1928131651","https://openalex.org/W1930666600","https://openalex.org/W1998747003","https://openalex.org/W2030848303","https://openalex.org/W2051411812","https://openalex.org/W2074104157","https://openalex.org/W2074131847","https://openalex.org/W2097460654","https://openalex.org/W2099401829","https://openalex.org/W2105083025","https://openalex.org/W2115002670","https://openalex.org/W2115461836","https://openalex.org/W2139431698","https://openalex.org/W2143937145","https://openalex.org/W2146616399","https://openalex.org/W2147698585","https://openalex.org/W2153552581","https://openalex.org/W2154957829","https://openalex.org/W2165653503","https://openalex.org/W2166343987","https://openalex.org/W2742863897","https://openalex.org/W2895674046"],"related_works":["https://openalex.org/W2081837274","https://openalex.org/W3040496336","https://openalex.org/W2144530466","https://openalex.org/W3134357585","https://openalex.org/W2476510629","https://openalex.org/W2792824092","https://openalex.org/W2612844333","https://openalex.org/W2253481662","https://openalex.org/W2105767219","https://openalex.org/W2982106677"],"abstract_inverted_index":{"Adaptive":[0],"filters":[1],"are":[2,61,90,104,192],"widely":[3],"used":[4,31],"in":[5,18,68],"digital":[6,22],"signal":[7],"processing":[8],"for":[9,66,95,198],"such":[10,20,55],"applications":[11],"as":[12,21,56],"system":[13],"identification,":[14],"noise":[15],"cancellation,":[16],"and":[17,86,127,172,183],"areas":[19],"communication":[23],"systems.":[24],"Traditionally,":[25],"small":[26,69],"resource-constrained":[27],"embedded":[28,70],"systems":[29],"have":[30],"the":[32,79,122,128,134,145,158,167,176,188,196,199],"least":[33,41,58],"computationally":[34,64,97],"intensive":[35,98],"filter":[36],"adaptive":[37,53,99],"algorithms":[38,103],"based":[39,102],"on":[40,218],"mean":[42],"squares":[43,59],"(LMS).The":[44],"power-normalized":[45],"version":[46],"(NLMS)":[47],"is":[48,216],"typical":[49],"example.":[50,222],"More":[51],"complex":[52],"algorithms,":[54],"recursive":[57],"(RLS),":[60],"usually":[62],"too":[63],"expensive":[65],"implementation":[67,77],"systems.Our":[71],"work":[72],"deals":[73],"with":[74,112],"a":[75,91,114,219],"floating-point-like":[76],"of":[78,125,131,136,166,175,180,187],"Gauss-Seidel":[80],"fast":[81],"affine":[82],"projection":[83],"(GSFAP)":[84],"algorithm":[85],"shows":[87],"that":[88,206],"FPGAs":[89],"highly":[92],"suitable":[93],"platform":[94],"more":[96],"algorithms.":[100],"FAP":[101],"characterized":[105],"by":[106],"better":[107],"adaptation":[108,209],"properties":[109,210],"than":[110,153,195],"NLMS":[111,126,201,214],"only":[113],"slightly":[115,193],"higher":[116,194],"complexity,":[117],"providing":[118],"some":[119],"compromise":[120],"between":[121],"slow":[123],"convergence":[124],"computational":[129],"complexity":[130],"RLS.We":[132],"present":[133],"design":[135,162],"an":[137],"optimized":[138],"core":[139,191],"which":[140,215],"implements":[141],"GSFAP.":[142],"To":[143],"reduce":[144],"resource":[146,185],"requirements":[147,186,197],"we":[148],"use":[149,165],"logarithmic":[150,169,181],"arithmetic,":[151],"rather":[152],"conventional":[154],"floating":[155],"point,":[156],"within":[157],"custom":[159],"core.":[160,202],"Our":[161],"makes":[163],"effective":[164],"pipelined":[168],"addition":[170],"units,":[171],"takes":[173],"advantage":[174],"very":[177],"low":[178],"cost":[179],"multiplication":[182],"division.The":[184],"resulting":[189],"GSFAP":[190,207],"corresponding":[200],"However,":[203],"experiments":[204],"show":[205],"has":[208],"much":[211],"superior":[212],"to":[213],"demonstrated":[217],"noise/echo":[220],"cancellation":[221]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}