{"id":"https://openalex.org/W2123823842","doi":"https://doi.org/10.1109/icassp.2009.4959642","title":"Generating high performance pruned FFT implementations","display_name":"Generating high performance pruned FFT implementations","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W2123823842","doi":"https://doi.org/10.1109/icassp.2009.4959642","mag":"2123823842"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2009.4959642","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2009.4959642","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Acoustics, Speech and Signal Processing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5062806943","display_name":"Franz Franchetti","orcid":"https://orcid.org/0000-0002-3529-8973"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Franz Franchetti","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie Mellon University, Department of Electrical and Computer Engineering, Pittsburgh, PA, United States#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University, Department of Electrical and Computer Engineering, Pittsburgh, PA, United States#TAB#","institution_ids":["https://openalex.org/I74973139"]}]},{"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/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Markus Puschel","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie Mellon University, Department of Electrical and Computer Engineering, Pittsburgh, PA, United States#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University, Department of Electrical and Computer Engineering, Pittsburgh, PA, United States#TAB#","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"549","last_page":"552"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9988999962806702,"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"}},{"id":"https://openalex.org/T11034","display_name":"Digital Filter Design and Implementation","score":0.9977999925613403,"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.9330412149429321},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7634141445159912},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7336567044258118},{"id":"https://openalex.org/keywords/vectorization","display_name":"Vectorization (mathematics)","score":0.7244986295700073},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.7102384567260742},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.6891403198242188},{"id":"https://openalex.org/keywords/raders-fft-algorithm","display_name":"Rader's FFT algorithm","score":0.5999885201454163},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.554409921169281},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.4721401035785675},{"id":"https://openalex.org/keywords/cooley\u2013tukey-fft-algorithm","display_name":"Cooley\u2013Tukey FFT algorithm","score":0.4129159450531006},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3684534430503845},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.18171867728233337},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15860876441001892},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.12238198518753052},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09014689922332764}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.9330412149429321},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7634141445159912},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7336567044258118},{"id":"https://openalex.org/C41681595","wikidata":"https://www.wikidata.org/wiki/Q7917855","display_name":"Vectorization (mathematics)","level":2,"score":0.7244986295700073},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.7102384567260742},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.6891403198242188},{"id":"https://openalex.org/C69598009","wikidata":"https://www.wikidata.org/wiki/Q7280126","display_name":"Rader's FFT algorithm","level":5,"score":0.5999885201454163},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.554409921169281},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.4721401035785675},{"id":"https://openalex.org/C1370844","wikidata":"https://www.wikidata.org/wiki/Q5167446","display_name":"Cooley\u2013Tukey FFT algorithm","level":3,"score":0.4129159450531006},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3684534430503845},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.18171867728233337},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15860876441001892},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.12238198518753052},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09014689922332764},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icassp.2009.4959642","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2009.4959642","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Acoustics, Speech and Signal Processing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.207.2053","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.2053","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.cmu.edu/~franzf/papers/icassp09.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1555087507","https://openalex.org/W1964203463","https://openalex.org/W2090690379","https://openalex.org/W2102182691","https://openalex.org/W2134572726","https://openalex.org/W2136952590","https://openalex.org/W2138184302","https://openalex.org/W2146236588","https://openalex.org/W2147146929","https://openalex.org/W2164197394","https://openalex.org/W2296520333","https://openalex.org/W2432517183","https://openalex.org/W2981264952","https://openalex.org/W3142790024"],"related_works":["https://openalex.org/W2042527476","https://openalex.org/W2144412928","https://openalex.org/W4246835537","https://openalex.org/W2554524608","https://openalex.org/W2012363129","https://openalex.org/W3046688035","https://openalex.org/W3046243388","https://openalex.org/W1984254719","https://openalex.org/W2977460836","https://openalex.org/W4362564158"],"abstract_inverted_index":{"We":[0,29],"derive":[1],"a":[2],"recursive":[3],"general-radix":[4],"pruned":[5,32,48,62],"Cooley-Tukey":[6],"fast":[7],"Fourier":[8],"transform":[9],"(FFT)":[10],"algorithm":[11,17,34],"in":[12,91],"Kronecker":[13],"product":[14],"notation.":[15],"The":[16],"is":[18],"compatible":[19],"with":[20],"vectorization":[21],"and":[22,41,81,87],"parallelization":[23],"required":[24],"on":[25],"state-of-the-art":[26],"multicore":[27,54],"CPUs.":[28],"include":[30],"the":[31,36,47,51,61,68,78,82],"FFT":[33,49,63,71],"into":[35],"program":[37],"generation":[38],"system":[39],"Spiral,":[40],"automatically":[42],"generate":[43],"optimized":[44],"implementations":[45,72],"of":[46,84],"for":[50],"Intel":[52],"Core2Duo":[53],"processor.":[55],"Experimental":[56],"results":[57],"show":[58],"that":[59],"using":[60],"can":[64],"indeed":[65],"speed":[66],"up":[67,74],"fastest":[69],"available":[70],"by":[73],"to":[75],"30%":[76],"when":[77],"problem":[79],"size":[80],"pattern":[83],"unused":[85],"inputs":[86],"outputs":[88],"are":[89],"known":[90],"advance.":[92]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}