{"id":"https://openalex.org/W2011560181","doi":"https://doi.org/10.1137/0209023","title":"Efficient Synthesis and Implementation of Large Discrete Fourier Transformations","display_name":"Efficient Synthesis and Implementation of Large Discrete Fourier Transformations","publication_year":1980,"publication_date":"1980-05-01","ids":{"openalex":"https://openalex.org/W2011560181","doi":"https://doi.org/10.1137/0209023","mag":"2011560181"},"language":"en","primary_location":{"id":"doi:10.1137/0209023","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209023","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5055332340","display_name":"S.D. Morgera","orcid":"https://orcid.org/0000-0001-8074-6803"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Salvatore D. Morgera","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055332340"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9674,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.84181416,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"2","first_page":"251","last_page":"272"},"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.9980999827384949,"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.9980999827384949,"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.9965000152587891,"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/T11417","display_name":"Advancements in PLL and VCO Technologies","score":0.9713000059127808,"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/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.7979099750518799},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.736129641532898},{"id":"https://openalex.org/keywords/prime-factor","display_name":"Prime factor","score":0.678848385810852},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.6747354865074158},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6633784770965576},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.6240944266319275},{"id":"https://openalex.org/keywords/realization","display_name":"Realization (probability)","score":0.5775465369224548},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.5727290511131287},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4922141134738922},{"id":"https://openalex.org/keywords/cooley\u2013tukey-fft-algorithm","display_name":"Cooley\u2013Tukey FFT algorithm","score":0.4920289218425751},{"id":"https://openalex.org/keywords/twiddle-factor","display_name":"Twiddle factor","score":0.47812333703041077},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4779945909976959},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4599759578704834},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.4439036250114441},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.4433434009552002},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42343708872795105},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.42101335525512695},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4168587923049927},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.4128648638725281},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.22473430633544922},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11448445916175842},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.07699355483055115}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.7979099750518799},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.736129641532898},{"id":"https://openalex.org/C30860621","wikidata":"https://www.wikidata.org/wiki/Q49008","display_name":"Prime factor","level":3,"score":0.678848385810852},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.6747354865074158},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6633784770965576},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.6240944266319275},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.5775465369224548},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.5727290511131287},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4922141134738922},{"id":"https://openalex.org/C1370844","wikidata":"https://www.wikidata.org/wiki/Q5167446","display_name":"Cooley\u2013Tukey FFT algorithm","level":3,"score":0.4920289218425751},{"id":"https://openalex.org/C4697666","wikidata":"https://www.wikidata.org/wiki/Q7857913","display_name":"Twiddle factor","level":5,"score":0.47812333703041077},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4779945909976959},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4599759578704834},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.4439036250114441},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.4433434009552002},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42343708872795105},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.42101335525512695},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4168587923049927},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.4128648638725281},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.22473430633544922},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11448445916175842},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.07699355483055115},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"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/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0209023","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209023","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":8,"referenced_works":["https://openalex.org/W1966904279","https://openalex.org/W2005015931","https://openalex.org/W2061171222","https://openalex.org/W2065387773","https://openalex.org/W2073086065","https://openalex.org/W2073373260","https://openalex.org/W2512335183","https://openalex.org/W2904838066"],"related_works":["https://openalex.org/W1984254719","https://openalex.org/W2031343199","https://openalex.org/W2047042807","https://openalex.org/W2371538653","https://openalex.org/W4255785774","https://openalex.org/W2149121524","https://openalex.org/W2017578039","https://openalex.org/W4229456379","https://openalex.org/W3046688035","https://openalex.org/W2012363129"],"abstract_inverted_index":{"A":[0,110],"systematic":[1],"technique":[2,24],"is":[3,25,42,82,101,115,141,152],"presented":[4,125],"for":[5,73,84,132,147,158],"synthesizing":[6],"and":[7,80,87],"efficiently":[8],"performing":[9],"large":[10,133,159],"discrete":[11],"Fourier":[12,92],"transformations":[13],"(DFT\u2019s)":[14],"in":[15,174],"the":[16,27,40,56,60,75,90,99,108,116,119,137],"range":[17],"from":[18],"60":[19],"to":[20,45,127,176],"5000":[21],"points.":[22],"The":[23,34],"termed":[26],"mutual":[28,35],"prime":[29,36,166],"factor":[30,37],"cyclic":[31,57],"algorithm":[32,41,61],"(MPFCA).":[33],"portion":[38],"of":[39,59,113],"attributed":[43],"originally":[44],"L.":[46],"H.":[47],"Thomas,":[48],"with":[49,89,181],"generalization":[50],"supplied":[51],"by":[52,66],"I.":[53],"J.":[54],"Good;":[55],"aspect":[58],"has":[62],"recently":[63],"been":[64],"formalized":[65],"S.":[67],"Winograd.":[68],"Three":[69],"methods":[70,124],"are":[71],"described":[72],"implementing":[74],"MPFCA;":[76],"computational":[77],"complexity":[78,140],"(multiplications":[79],"additions)":[81],"estimated":[83],"each":[85],"method":[86],"compared":[88],"fast":[91],"transform":[93],"(FFT).":[94],"For":[95],"special":[96],"purpose":[97],"hardware,":[98],"MPFCA":[100],"at":[102],"least":[103],"twice":[104],"as":[105,107],"efficient":[106],"FFT.":[109],"major":[111],"result":[112],"importance":[114],"realization":[117],"that":[118,145,154],"three":[120],"considerably":[121,142],"different":[122],"implementation":[123],"lead":[126],"rather":[128],"similar":[129],"multiplication":[130,139],"complexities":[131],"size":[134,149,160],"DFT\u2019s;":[135],"furthermore,":[136],"resulting":[138],"higher":[143],"than":[144],"achieved":[146],"small":[148],"DFT\u2019s.":[150],"It":[151],"felt":[153],"further":[155],"substantial":[156],"improvements":[157],"DFT\u2019s":[161],"built":[162],"up":[163],"using":[164],"mutually":[165],"factors":[167],"will":[168],"require":[169],"more":[170],"general":[171],"theoretical":[172],"results":[173],"addition":[175],"long,":[177],"tedious":[178],"hours":[179],"spent":[180],"computer":[182],"based":[183],"formula":[184],"manipulation":[185],"systems.":[186]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}