{"id":"https://openalex.org/W2791171721","doi":"https://doi.org/10.1145/3174243.3174263","title":"Memory-Efficient Fast Fourier Transform on Streaming Data by Fusing Permutations","display_name":"Memory-Efficient Fast Fourier Transform on Streaming Data by Fusing Permutations","publication_year":2018,"publication_date":"2018-02-15","ids":{"openalex":"https://openalex.org/W2791171721","doi":"https://doi.org/10.1145/3174243.3174263","mag":"2791171721"},"language":"en","primary_location":{"id":"doi:10.1145/3174243.3174263","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3174243.3174263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM/SIGDA 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/A5074840291","display_name":"Fran\u00e7ois Serre","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Fran\u00e7ois Serre","raw_affiliation_strings":["ETH Zurich, Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076407181","display_name":"Markus P\u00fcschel","orcid":"https://orcid.org/0000-0001-8834-8551"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Markus P\u00fcschel","raw_affiliation_strings":["ETH Zurich, Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074840291"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":0.3303,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.53397865,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"219","last_page":"228"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11034","display_name":"Digital Filter Design and Implementation","score":0.9995999932289124,"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/T11034","display_name":"Digital Filter Design and Implementation","score":0.9995999932289124,"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/T11417","display_name":"Advancements in PLL and VCO Technologies","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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/T10232","display_name":"Optical Network Technologies","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/datapath","display_name":"Datapath","score":0.9078676700592041},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.8014932870864868},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7539471387863159},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6032831072807312},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5668258666992188},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5665369033813477},{"id":"https://openalex.org/keywords/twiddle-factor","display_name":"Twiddle factor","score":0.5391993522644043},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.5364022850990295},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.4566255807876587},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4355788826942444},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4070831537246704},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.19364339113235474},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1837163269519806},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.10319885611534119},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08235353231430054}],"concepts":[{"id":"https://openalex.org/C2781198647","wikidata":"https://www.wikidata.org/wiki/Q1633673","display_name":"Datapath","level":2,"score":0.9078676700592041},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.8014932870864868},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7539471387863159},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6032831072807312},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5668258666992188},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5665369033813477},{"id":"https://openalex.org/C4697666","wikidata":"https://www.wikidata.org/wiki/Q7857913","display_name":"Twiddle factor","level":5,"score":0.5391993522644043},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.5364022850990295},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.4566255807876587},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4355788826942444},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4070831537246704},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.19364339113235474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1837163269519806},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.10319885611534119},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08235353231430054},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3174243.3174263","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3174243.3174263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1046360519","https://openalex.org/W1531091500","https://openalex.org/W1655492871","https://openalex.org/W1923763959","https://openalex.org/W1966045852","https://openalex.org/W1974793555","https://openalex.org/W1979502974","https://openalex.org/W1994493549","https://openalex.org/W2000993987","https://openalex.org/W2011849452","https://openalex.org/W2024381286","https://openalex.org/W2030898836","https://openalex.org/W2099788829","https://openalex.org/W2111755292","https://openalex.org/W2117639037","https://openalex.org/W2132733020","https://openalex.org/W2134419539","https://openalex.org/W2148212273","https://openalex.org/W2157530230","https://openalex.org/W2168847677","https://openalex.org/W2169957916","https://openalex.org/W2296333624","https://openalex.org/W2407573999","https://openalex.org/W2534984983","https://openalex.org/W3027123570","https://openalex.org/W6640355072"],"related_works":["https://openalex.org/W2031343199","https://openalex.org/W1984254719","https://openalex.org/W4229456379","https://openalex.org/W2351401773","https://openalex.org/W2151986570","https://openalex.org/W2371538653","https://openalex.org/W2149121524","https://openalex.org/W2375508047","https://openalex.org/W2061302196","https://openalex.org/W2093169932"],"abstract_inverted_index":{"We":[0,62],"propose":[1],"a":[2,19,27,64,73,86],"novel":[3],"FFT":[4,50,69],"datapath":[5],"that":[6],"reduces":[7],"the":[8,31,34,90,95,100,112],"memory":[9],"requirement":[10],"compared":[11],"to":[12,18,29,44,66,78],"state-of-the-art":[13],"RAM-based":[14],"implementations":[15,51],"by":[16],"up":[17],"factor":[20],"of":[21,49,55,59,88],"two.":[22],"The":[23,83,102],"novelty":[24],"is":[25,42,107],"in":[26],"technique":[28,103],"fuse":[30],"datapaths":[32],"for":[33,72,99,104],"required":[35],"perfect":[36],"shuffle":[37],"and":[38,41,57,77],"bit":[39],"reversal":[40],"applicable":[43,110],"an":[45],"entire":[46],"design":[47,70],"space":[48,71],"with":[52],"varying":[53],"degrees":[54],"reuse":[56],"number":[58],"input":[60,75],"ports.":[61],"implemented":[63],"tool":[65],"generate":[67],"this":[68],"given":[74],"size":[76],"benchmark":[79],"against":[80],"prior":[81],"work.":[82],"results":[84],"show":[85],"reduction":[87],"half":[89,94],"RAM":[91],"banks":[92],"and/or":[93],"logic":[96],"complexity":[97],"used":[98],"permutations.":[101],"fusing":[105],"permutations":[106],"more":[108],"generally":[109],"beyond":[111],"FFT.":[113]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}