{"id":"https://openalex.org/W1989739006","doi":"https://doi.org/10.1145/1476589.1476610","title":"An economical method for calculating the discrete Fourier transform","display_name":"An economical method for calculating the discrete Fourier transform","publication_year":1968,"publication_date":"1968-01-01","ids":{"openalex":"https://openalex.org/W1989739006","doi":"https://doi.org/10.1145/1476589.1476610","mag":"1989739006"},"language":"en","primary_location":{"id":"doi:10.1145/1476589.1476610","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1476589.1476610","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the December 9-11, 1968, fall joint computer conference, part I on - AFIPS '68 (Fall, part I)","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/A5002775277","display_name":"R. Yavne","orcid":null},"institutions":[{"id":"https://openalex.org/I1306686416","display_name":"RTX (United States)","ror":"https://ror.org/0354t7b78","country_code":"US","type":"company","lineage":["https://openalex.org/I1306686416"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R. Yavne","raw_affiliation_strings":["Raytheon Company, Bedford, Massachusetts"],"affiliations":[{"raw_affiliation_string":"Raytheon Company, Bedford, Massachusetts","institution_ids":["https://openalex.org/I1306686416"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5002775277"],"corresponding_institution_ids":["https://openalex.org/I1306686416"],"apc_list":null,"apc_paid":null,"fwci":1.4772,"has_fulltext":false,"cited_by_count":114,"citation_normalized_percentile":{"value":0.80167621,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"115","last_page":"115"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13093","display_name":"Electric Power Systems and Control","score":0.487199991941452,"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"}},"topics":[{"id":"https://openalex.org/T13093","display_name":"Electric Power Systems and Control","score":0.487199991941452,"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/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.8539480566978455},{"id":"https://openalex.org/keywords/discrete-time-fourier-transform","display_name":"Discrete-time Fourier transform","score":0.765670895576477},{"id":"https://openalex.org/keywords/non-uniform-discrete-fourier-transform","display_name":"Non-uniform discrete Fourier transform","score":0.7159677147865295},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.7094798684120178},{"id":"https://openalex.org/keywords/discrete-hartley-transform","display_name":"Discrete Hartley transform","score":0.6485817432403564},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.6337894797325134},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.6271598935127258},{"id":"https://openalex.org/keywords/cyclotomic-fast-fourier-transform","display_name":"Cyclotomic fast Fourier transform","score":0.5859674215316772},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5577535629272461},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.5504992604255676},{"id":"https://openalex.org/keywords/discrete-sine-transform","display_name":"Discrete sine transform","score":0.5335481762886047},{"id":"https://openalex.org/keywords/cooley\u2013tukey-fft-algorithm","display_name":"Cooley\u2013Tukey FFT algorithm","score":0.5141732692718506},{"id":"https://openalex.org/keywords/hartley-transform","display_name":"Hartley transform","score":0.5051789879798889},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.49324339628219604},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4730210304260254},{"id":"https://openalex.org/keywords/short-time-fourier-transform","display_name":"Short-time Fourier transform","score":0.44964396953582764},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.4449703097343445},{"id":"https://openalex.org/keywords/harmonic-wavelet-transform","display_name":"Harmonic wavelet transform","score":0.4161933660507202},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40319710969924927},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1926182508468628},{"id":"https://openalex.org/keywords/discrete-wavelet-transform","display_name":"Discrete wavelet transform","score":0.102577805519104},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09253284335136414},{"id":"https://openalex.org/keywords/wavelet-transform","display_name":"Wavelet transform","score":0.059339284896850586}],"concepts":[{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.8539480566978455},{"id":"https://openalex.org/C122444316","wikidata":"https://www.wikidata.org/wiki/Q1440048","display_name":"Discrete-time Fourier transform","level":5,"score":0.765670895576477},{"id":"https://openalex.org/C62058723","wikidata":"https://www.wikidata.org/wiki/Q7049066","display_name":"Non-uniform discrete Fourier transform","level":5,"score":0.7159677147865295},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.7094798684120178},{"id":"https://openalex.org/C192853989","wikidata":"https://www.wikidata.org/wiki/Q1006531","display_name":"Discrete Hartley transform","level":5,"score":0.6485817432403564},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.6337894797325134},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.6271598935127258},{"id":"https://openalex.org/C43060483","wikidata":"https://www.wikidata.org/wiki/Q17006372","display_name":"Cyclotomic fast Fourier transform","level":5,"score":0.5859674215316772},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5577535629272461},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.5504992604255676},{"id":"https://openalex.org/C167058841","wikidata":"https://www.wikidata.org/wiki/Q971039","display_name":"Discrete sine transform","level":5,"score":0.5335481762886047},{"id":"https://openalex.org/C1370844","wikidata":"https://www.wikidata.org/wiki/Q5167446","display_name":"Cooley\u2013Tukey FFT algorithm","level":3,"score":0.5141732692718506},{"id":"https://openalex.org/C67757890","wikidata":"https://www.wikidata.org/wiki/Q1567607","display_name":"Hartley transform","level":5,"score":0.5051789879798889},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.49324339628219604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4730210304260254},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.44964396953582764},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.4449703097343445},{"id":"https://openalex.org/C1109138","wikidata":"https://www.wikidata.org/wiki/Q3280930","display_name":"Harmonic wavelet transform","level":5,"score":0.4161933660507202},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40319710969924927},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1926182508468628},{"id":"https://openalex.org/C46286280","wikidata":"https://www.wikidata.org/wiki/Q2414958","display_name":"Discrete wavelet transform","level":4,"score":0.102577805519104},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09253284335136414},{"id":"https://openalex.org/C196216189","wikidata":"https://www.wikidata.org/wiki/Q2867","display_name":"Wavelet transform","level":3,"score":0.059339284896850586},{"id":"https://openalex.org/C47432892","wikidata":"https://www.wikidata.org/wiki/Q831390","display_name":"Wavelet","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1476589.1476610","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1476589.1476610","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the December 9-11, 1968, fall joint computer conference, part I on - AFIPS '68 (Fall, part I)","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2086323236","https://openalex.org/W2076441550","https://openalex.org/W1546716936","https://openalex.org/W2155940912","https://openalex.org/W2122562869","https://openalex.org/W2006724675","https://openalex.org/W1952542430","https://openalex.org/W1974963296","https://openalex.org/W3126238602","https://openalex.org/W2258631014"],"abstract_inverted_index":{"With":[0],"the":[1,11,35,55,74,78,88,101,111,116,124,128,132,144],"advent":[2],"of":[3,19,63,119,135,141],"digital":[4],"computers":[5],"it":[6],"became":[7],"possible":[8],"to":[9,33],"compute":[10,34],"Discrete":[12,36,112],"Fourier":[13,37,56,75,89,113],"Transform":[14,38,57,76,90,114],"for":[15,27,53,58,72,86,109],"a":[16,30,40,50,59,70,93],"large":[17,61],"number":[18,62,118,134],"input":[20,64],"points":[21],"in":[22,39,46,69,77,127,143],"relatively":[23],"reasonable":[24],"times.":[25],"However,":[26],"certain":[28],"uses":[29],"demand":[31,51],"developed":[32,52,92],"very":[41,60,83],"short":[42],"time":[43,80],"or":[44],"even":[45],"real":[47],"time.":[48],"Also,":[49],"computing":[54,73,87,110],"points.":[65],"These":[66],"demands":[67],"resulted":[68],"requirement":[71],"fastest":[79],"possible.":[81],"A":[82],"economical":[84],"way":[85],"was":[91],"few":[94],"years":[95],"ago":[96],"and":[97,121],"is":[98,123,137],"known":[99],"as":[100,126],"Cooley-Tukey":[102,129,145],"Algorithm.":[103,146],"This":[104],"article":[105],"describes":[106],"another":[107],"algorithm":[108],"where":[115],"required":[117,133],"additions":[120],"subtractions":[122],"same":[125],"Algorithm;":[130],"but":[131],"multiplications":[136],"only":[138],"one":[139],"half":[140],"that":[142]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}