{"id":"https://openalex.org/W2012363129","doi":"https://doi.org/10.1137/0913039","title":"A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $","display_name":"A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $","publication_year":1992,"publication_date":"1992-05-01","ids":{"openalex":"https://openalex.org/W2012363129","doi":"https://doi.org/10.1137/0913039","mag":"2012363129"},"language":"en","primary_location":{"id":"doi:10.1137/0913039","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0913039","pdf_url":null,"source":{"id":"https://openalex.org/S4210181992","display_name":"SIAM Journal on Scientific and Statistical Computing","issn_l":"0196-5204","issn":["0196-5204","2168-3417"],"is_oa":false,"is_in_doaj":false,"is_core":false,"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 Scientific and Statistical 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/A5014471483","display_name":"Clive Temperton","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Clive Temperton","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5014471483"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.15787252,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"13","issue":"3","first_page":"676","last_page":"686"},"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.9993000030517578,"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.9993000030517578,"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/T11417","display_name":"Advancements in PLL and VCO Technologies","score":0.9872999787330627,"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"}},{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9868000149726868,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.9300354719161987},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.9278308153152466},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.8982915878295898},{"id":"https://openalex.org/keywords/raders-fft-algorithm","display_name":"Rader's FFT algorithm","score":0.7648242115974426},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.734943151473999},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.6989151835441589},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6675899028778076},{"id":"https://openalex.org/keywords/prime-factor","display_name":"Prime factor","score":0.6356762051582336},{"id":"https://openalex.org/keywords/cooley\u2013tukey-fft-algorithm","display_name":"Cooley\u2013Tukey FFT algorithm","score":0.624217689037323},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.5772656798362732},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5528970956802368},{"id":"https://openalex.org/keywords/twiddle-factor","display_name":"Twiddle factor","score":0.4858241081237793},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.366083025932312},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.29534223675727844},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22282248735427856},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.15831482410430908},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.1229744553565979},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0847504734992981},{"id":"https://openalex.org/keywords/short-time-fourier-transform","display_name":"Short-time Fourier transform","score":0.07193204760551453}],"concepts":[{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.9300354719161987},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.9278308153152466},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.8982915878295898},{"id":"https://openalex.org/C69598009","wikidata":"https://www.wikidata.org/wiki/Q7280126","display_name":"Rader's FFT algorithm","level":5,"score":0.7648242115974426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.734943151473999},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.6989151835441589},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6675899028778076},{"id":"https://openalex.org/C30860621","wikidata":"https://www.wikidata.org/wiki/Q49008","display_name":"Prime factor","level":3,"score":0.6356762051582336},{"id":"https://openalex.org/C1370844","wikidata":"https://www.wikidata.org/wiki/Q5167446","display_name":"Cooley\u2013Tukey FFT algorithm","level":3,"score":0.624217689037323},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.5772656798362732},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5528970956802368},{"id":"https://openalex.org/C4697666","wikidata":"https://www.wikidata.org/wiki/Q7857913","display_name":"Twiddle factor","level":5,"score":0.4858241081237793},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.366083025932312},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.29534223675727844},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22282248735427856},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.15831482410430908},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.1229744553565979},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0847504734992981},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.07193204760551453},{"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.1137/0913039","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0913039","pdf_url":null,"source":{"id":"https://openalex.org/S4210181992","display_name":"SIAM Journal on Scientific and Statistical Computing","issn_l":"0196-5204","issn":["0196-5204","2168-3417"],"is_oa":false,"is_in_doaj":false,"is_core":false,"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 Scientific and Statistical Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1973109866","https://openalex.org/W1984156273","https://openalex.org/W1987741783","https://openalex.org/W2006537647","https://openalex.org/W2010918451","https://openalex.org/W2031015570","https://openalex.org/W2036812077","https://openalex.org/W2038631342","https://openalex.org/W2042527476","https://openalex.org/W2060469182","https://openalex.org/W2061171222","https://openalex.org/W2099490452","https://openalex.org/W2121362046","https://openalex.org/W2122572738","https://openalex.org/W2137367115","https://openalex.org/W2162611351","https://openalex.org/W2904838066","https://openalex.org/W3021014091"],"related_works":["https://openalex.org/W1984254719","https://openalex.org/W2149121524","https://openalex.org/W2031343199","https://openalex.org/W2144412928","https://openalex.org/W2047042807","https://openalex.org/W2371538653","https://openalex.org/W4255785774","https://openalex.org/W2977460836","https://openalex.org/W2042527476","https://openalex.org/W4246835537"],"abstract_inverted_index":{"Prime":[0],"factor":[1,35,61],"fast":[2],"Fourier":[3],"transform":[4,52],"(FFT)":[5],"algorithms":[6],"have":[7,20],"two":[8],"important":[9],"advantages:":[10],"they":[11,19],"can":[12],"be":[13],"simultaneously":[14],"self-sorting":[15,78],"and":[16,18,81],"in-place,":[17],"a":[21,45,58],"lower":[22,83],"operation":[23,84],"count":[24],"than":[25],"conventional":[26],"FFT":[27,36],"algorithms.":[28],"The":[29],"major":[30],"disadvantage":[31],"of":[32,48,50,95],"the":[33,51,77,82,89,93,96],"prime":[34,60],"has":[37],"been":[38],"that":[39],"it":[40],"was":[41],"only":[42],"applicable":[43,65],"to":[44],"limited":[46],"set":[47],"values":[49],"length":[53],"N.":[54],"This":[55],"paper":[56],"presents":[57],"generalized":[59],"FFT,":[62],"which":[63],"is":[64],"for":[66],"any":[67],"$N":[68],"=":[69],"2^p":[70],"3^q":[71],"5^r":[72],"$,":[73],"while":[74],"maintaining":[75],"both":[76],"in-place":[79],"capability":[80],"count.":[85],"Timing":[86],"experiments":[87],"on":[88],"Cray":[90],"Y-MP":[91],"demonstrate":[92],"advantages":[94],"new":[97],"algorithm.":[98]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}