{"id":"https://openalex.org/W2585083698","doi":"https://doi.org/10.1109/tassp.1985.1164526","title":"On the structure of efficient DFT algorithms","display_name":"On the structure of efficient DFT algorithms","publication_year":1985,"publication_date":"1985-02-01","ids":{"openalex":"https://openalex.org/W2585083698","doi":"https://doi.org/10.1109/tassp.1985.1164526","mag":"2585083698"},"language":"en","primary_location":{"id":"doi:10.1109/tassp.1985.1164526","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tassp.1985.1164526","pdf_url":null,"source":{"id":"https://openalex.org/S98930721","display_name":"IEEE Transactions on Acoustics Speech and Signal Processing","issn_l":"0096-3518","issn":["0096-3518"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Acoustics, Speech, and Signal Processing","raw_type":"journal-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/A5111668184","display_name":"Howard Johnson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"H. Johnson","raw_affiliation_strings":["ROLM Corporation, Santa Clara, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ROLM Corporation, Santa Clara, CA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020160495","display_name":"C.S. Burrus","orcid":null},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Burrus","raw_affiliation_strings":["Department of Electrical Engineering, Rice University, Houston, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Rice University, Houston, TX, USA","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3312,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.88745704,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"33","issue":"1","first_page":"248","last_page":"254"},"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.9998000264167786,"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.9998000264167786,"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.9987999796867371,"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/T10688","display_name":"Image and Signal Denoising Methods","score":0.9749000072479248,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/chinese-remainder-theorem","display_name":"Chinese remainder theorem","score":0.7748866081237793},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6956799626350403},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.6823980808258057},{"id":"https://openalex.org/keywords/remainder","display_name":"Remainder","score":0.6728334426879883},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5769603252410889},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5574272871017456},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.5372360348701477},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.4450588822364807},{"id":"https://openalex.org/keywords/cooley\u2013tukey-fft-algorithm","display_name":"Cooley\u2013Tukey FFT algorithm","score":0.4376160204410553},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.37231308221817017},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31676504015922546},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.18871524930000305},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.1880514919757843},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10641774535179138},{"id":"https://openalex.org/keywords/short-time-fourier-transform","display_name":"Short-time Fourier transform","score":0.10343927145004272}],"concepts":[{"id":"https://openalex.org/C151635116","wikidata":"https://www.wikidata.org/wiki/Q193878","display_name":"Chinese remainder theorem","level":2,"score":0.7748866081237793},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6956799626350403},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.6823980808258057},{"id":"https://openalex.org/C39613435","wikidata":"https://www.wikidata.org/wiki/Q846677","display_name":"Remainder","level":2,"score":0.6728334426879883},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5769603252410889},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5574272871017456},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.5372360348701477},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.4450588822364807},{"id":"https://openalex.org/C1370844","wikidata":"https://www.wikidata.org/wiki/Q5167446","display_name":"Cooley\u2013Tukey FFT algorithm","level":3,"score":0.4376160204410553},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.37231308221817017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31676504015922546},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.18871524930000305},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.1880514919757843},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10641774535179138},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.10343927145004272},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tassp.1985.1164526","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tassp.1985.1164526","pdf_url":null,"source":{"id":"https://openalex.org/S98930721","display_name":"IEEE Transactions on Acoustics Speech and Signal Processing","issn_l":"0096-3518","issn":["0096-3518"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Acoustics, Speech, and Signal Processing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1487564550","https://openalex.org/W1985765205","https://openalex.org/W2005015931","https://openalex.org/W2065387773","https://openalex.org/W2074301347","https://openalex.org/W2086404994","https://openalex.org/W2091482192","https://openalex.org/W2121362046","https://openalex.org/W2122572738","https://openalex.org/W2142603808","https://openalex.org/W2584363070","https://openalex.org/W4244434309","https://openalex.org/W4299616802"],"related_works":["https://openalex.org/W1984910481","https://openalex.org/W2154733965","https://openalex.org/W1608773862","https://openalex.org/W2366394750","https://openalex.org/W2161621882","https://openalex.org/W2393337705","https://openalex.org/W2170618847","https://openalex.org/W4388257762","https://openalex.org/W2366738637","https://openalex.org/W2894692820"],"abstract_inverted_index":{"This":[0,53],"paper":[1],"examines":[2],"the":[3,6,43,57,63,66,71],"structure":[4,54],"of":[5,59,65,70],"prime":[7,72],"length":[8],"discrete":[9],"Fourier":[10],"transform":[11],"algorithms":[12,24],"that":[13,22],"are":[14],"developed":[15],"by":[16],"Winograd's":[17],"approach.":[18],"It":[19],"is":[20],"shown":[21],"those":[23],"have":[25],"considerable":[26],"structure,":[27],"and":[28,47,62],"this":[29],"can":[30],"be":[31],"exploited":[32],"to":[33],"develop":[34],"a":[35],"straightforward":[36],"design":[37,58],"procedure":[38],"which":[39,48],"does":[40],"not":[41],"use":[42],"Chinese":[44],"remainder":[45],"theorem":[46],"includes":[49],"any":[50],"allowed":[51],"permutations.":[52],"also":[55],"allows":[56],"real-data":[60],"programs":[61],"improvement":[64],"data":[67],"transfer":[68],"properties":[69],"factor":[73],"algorithm.":[74]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}