{"id":"https://openalex.org/W2030348437","doi":"https://doi.org/10.1109/sips.2014.6986055","title":"High-performance sparse fast Fourier transforms","display_name":"High-performance sparse fast Fourier transforms","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W2030348437","doi":"https://doi.org/10.1109/sips.2014.6986055","mag":"2030348437"},"language":"en","primary_location":{"id":"doi:10.1109/sips.2014.6986055","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sips.2014.6986055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Workshop on Signal Processing Systems (SiPS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://zenodo.org/record/1280158","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007560405","display_name":"J. W. Schumacher","orcid":"https://orcid.org/0000-0002-2185-2259"},"institutions":[{"id":"https://openalex.org/I67311998","display_name":"European Organization for Nuclear Research","ror":"https://ror.org/01ggx4157","country_code":"CH","type":"facility","lineage":["https://openalex.org/I67311998"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Jorn Schumacher","raw_affiliation_strings":["European Organization for Nuclear Research, Geneve, Gen\u00c3\u00a8ve, CH","CERN Geneva  Switzerland"],"affiliations":[{"raw_affiliation_string":"European Organization for Nuclear Research, Geneve, Gen\u00c3\u00a8ve, CH","institution_ids":["https://openalex.org/I67311998"]},{"raw_affiliation_string":"CERN Geneva  Switzerland","institution_ids":["https://openalex.org/I67311998"]}]},{"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"]},{"id":"https://openalex.org/I2799323385","display_name":"Board of the Swiss Federal Institutes of Technology","ror":"https://ror.org/01rvn4p91","country_code":"CH","type":"government","lineage":["https://openalex.org/I2799323385"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Markus Puschel","raw_affiliation_strings":["Eidgenossische Technische Hochschule Zurich, Zurich, ZH, CH","Department of Computer Science, ETH Zurich, Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Eidgenossische Technische Hochschule Zurich, Zurich, ZH, CH","institution_ids":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]},{"raw_affiliation_string":"Department of Computer Science, 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/A5007560405"],"corresponding_institution_ids":["https://openalex.org/I67311998"],"apc_list":null,"apc_paid":null,"fwci":3.2217,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.90901834,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9994999766349792,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9994999766349792,"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/T10688","display_name":"Image and Signal Denoising Methods","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9990000128746033,"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/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.8962329626083374},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.8163861036300659},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7630915641784668},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6897059679031372},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5568126440048218},{"id":"https://openalex.org/keywords/frequency-domain","display_name":"Frequency domain","score":0.5479509830474854},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.5352756381034851},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49612411856651306},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.46721163392066956},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.46411803364753723},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.38771185278892517},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.2012139856815338},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14696228504180908},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.12092941999435425},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09232383966445923}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.8962329626083374},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.8163861036300659},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7630915641784668},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6897059679031372},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5568126440048218},{"id":"https://openalex.org/C19118579","wikidata":"https://www.wikidata.org/wiki/Q786423","display_name":"Frequency domain","level":2,"score":0.5479509830474854},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.5352756381034851},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49612411856651306},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.46721163392066956},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.46411803364753723},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.38771185278892517},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.2012139856815338},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14696228504180908},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.12092941999435425},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09232383966445923},{"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/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/sips.2014.6986055","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sips.2014.6986055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Workshop on Signal Processing Systems (SiPS)","raw_type":"proceedings-article"},{"id":"pmh:oai:zenodo.org:1280158","is_oa":true,"landing_page_url":"https://zenodo.org/record/1280158","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:1280158","is_oa":true,"landing_page_url":"https://zenodo.org/record/1280158","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1494749725","https://openalex.org/W1501755821","https://openalex.org/W1964203463","https://openalex.org/W1999763281","https://openalex.org/W2061171222","https://openalex.org/W2078095679","https://openalex.org/W2096070062","https://openalex.org/W2102182691","https://openalex.org/W2107625832","https://openalex.org/W2108872752","https://openalex.org/W2111460811","https://openalex.org/W2113204179","https://openalex.org/W2123591640","https://openalex.org/W2123823842","https://openalex.org/W2136952590","https://openalex.org/W2146509513","https://openalex.org/W2164197394","https://openalex.org/W2296520333","https://openalex.org/W3141801167"],"related_works":["https://openalex.org/W2031343199","https://openalex.org/W2356814585","https://openalex.org/W2977460836","https://openalex.org/W2144412928","https://openalex.org/W2113951268","https://openalex.org/W4362564158","https://openalex.org/W1984254719","https://openalex.org/W2185259940","https://openalex.org/W2012363129","https://openalex.org/W2144032791"],"abstract_inverted_index":{"The":[0],"sparse":[1,20],"fast":[2],"Fourier":[3,14],"transform":[4],"(SFFT)":[5],"is":[6,104],"a":[7,19,91],"recent":[8],"novel":[9],"algorithm":[10,36],"to":[11,41,54,96,106],"compute":[12],"discrete":[13],"transforms":[15],"on":[16],"signals":[17],"with":[18,23],"frequency":[21],"domain":[22],"an":[24,86,101],"improved":[25],"asymptotic":[26],"runtime.":[27],"Reference":[28],"implementations":[29,47,78],"exist":[30],"for":[31,63],"different":[32],"variants":[33],"of":[34,50,74,93],"the":[35,56,72,75,97],"and":[37,79,100],"were":[38],"already":[39],"shown":[40],"be":[42],"faster":[43],"than":[44],"state-of-the-art":[45],"FFT":[46,108],"in":[48],"cases":[49],"sufficient":[51],"sparsity.":[52],"However,":[53],"date":[55],"SFFT":[57,77],"has":[58],"not":[59],"been":[60],"carefully":[61],"optimized":[62,87],"modern":[64],"processors.":[65],"In":[66],"this":[67],"paper,":[68],"we":[69,84],"first":[70],"analyze":[71],"performance":[73],"existing":[76,98],"discuss":[80],"possible":[81],"improvements.":[82],"Then":[83],"present":[85],"implementation.":[88],"We":[89],"achieve":[90],"speedup":[92],"2\u20135":[94],"compared":[95],"code":[99],"efficiency":[102],"that":[103],"competitive":[105],"highperformance":[107],"libraries.":[109]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}