{"id":"https://openalex.org/W2138419633","doi":"https://doi.org/10.1109/icassp.1981.1171139","title":"A new prime factor FFT algorithm","display_name":"A new prime factor FFT algorithm","publication_year":2005,"publication_date":"2005-03-24","ids":{"openalex":"https://openalex.org/W2138419633","doi":"https://doi.org/10.1109/icassp.1981.1171139","mag":"2138419633"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.1981.1171139","doi":"https://doi.org/10.1109/icassp.1981.1171139","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1981.1171139","pdf_url":null,"source":{"id":"https://openalex.org/S4363607879","display_name":"IEEE International Conference on Acoustics Speech and Signal Processing","issn_l":"1520-6149","issn":["1520-6149","2379-190X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-2","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '81. IEEE International Conference on Acoustics, Speech, and Signal Processing","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5020160495","display_name":"Charles S. Burrus","orcid":null,"observed_orcids":[]},"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":true,"raw_author_name":"C. Burrus","raw_affiliation_strings":["E.E. Department, Rice University, Houston, TX, USA","Rice Univ., Houston, TX, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"E.E. Department, Rice University, Houston, TX, USA","institution_ids":["https://openalex.org/I74775410"]},{"raw_affiliation_string":"Rice Univ., Houston, TX, USA#TAB#","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020160495"],"corresponding_institution_ids":["https://openalex.org/I74775410"],"apc_list":null,"apc_paid":null,"fwci":0.4462,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.5023118,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"335","last_page":"338"},"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.9990000128746033,"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.9990000128746033,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":9.999999747378752e-05,"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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-algorithm","display_name":"prime factor algorithm","score":0.9620000123977661},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"fast Fourier transform","score":0.503000020980835},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"discrete Fourier transform","score":0.9570000171661377},{"id":"https://openalex.org/keywords/in-place-computation","display_name":"in-place computation","score":0.9369999766349792},{"id":"https://openalex.org/keywords/indexing-schemes","display_name":"indexing schemes","score":0.8019999861717224},{"id":"https://openalex.org/keywords/winograd-algorithm","display_name":"Winograd algorithm","score":0.6899999976158142},{"id":"https://openalex.org/keywords/cooley-tukey-algorithm","display_name":"Cooley-Tukey algorithm","score":0.9919999837875366},{"id":"https://openalex.org/keywords/computational-speed-comparison","display_name":"computational speed comparison","score":0.5049999952316284},{"id":"https://openalex.org/keywords/fortran-implementation","display_name":"FORTRAN implementation","score":0.753000020980835}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.8563766479492188},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.8552658557891846},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.7043372988700867},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6984226703643799},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6841861009597778},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6673723459243774},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.6428194642066956},{"id":"https://openalex.org/C1370844","wikidata":"https://www.wikidata.org/wiki/Q5167446","display_name":"Cooley\u2013Tukey FFT algorithm","level":3,"score":0.6229831576347351},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.5913133025169373},{"id":"https://openalex.org/C2778241615","wikidata":"https://www.wikidata.org/wiki/Q83303","display_name":"Fortran","level":2,"score":0.5878428220748901},{"id":"https://openalex.org/C69598009","wikidata":"https://www.wikidata.org/wiki/Q7280126","display_name":"Rader's FFT algorithm","level":5,"score":0.5652382969856262},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.5424083471298218},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5246087312698364},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.5240281224250793},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5182521343231201},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.48692333698272705},{"id":"https://openalex.org/C30860621","wikidata":"https://www.wikidata.org/wiki/Q49008","display_name":"Prime factor","level":3,"score":0.41437503695487976},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36642587184906006},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.3160146176815033},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2510146498680115},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.16369402408599854},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1068430244922638},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.1981.1171139","doi":"https://doi.org/10.1109/icassp.1981.1171139","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1981.1171139","pdf_url":null,"source":{"id":"https://openalex.org/S4363607879","display_name":"IEEE International Conference on Acoustics Speech and Signal Processing","issn_l":"1520-6149","issn":["1520-6149","2379-190X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-2","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '81. IEEE International Conference on Acoustics, Speech, and Signal Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1544000257","https://openalex.org/W1985765205","https://openalex.org/W2073373260","https://openalex.org/W2121362046","https://openalex.org/W2162611351"],"related_works":["https://openalex.org/W2121362046","https://openalex.org/W2154907044","https://openalex.org/W2066431770","https://openalex.org/W29235628","https://openalex.org/W2043080420","https://openalex.org/W2031015570","https://openalex.org/W2049998498","https://openalex.org/W2137279816","https://openalex.org/W2540619838","https://openalex.org/W1577505653"],"abstract_inverted_index":{"This":[0,62],"paper":[1],"presents":[2],"an":[3],"approach":[4],"to":[5,97],"calculating":[6],"the":[7,36,50,94,102,105],"discrete":[8],"Fourier":[9],"transform":[10],"(DFT)":[11],"using":[12],"a":[13,28,46,57,71,85],"prime":[14],"factor":[15],"algorithm":[16,48,96],"(PFA).":[17],"A":[18,39,90],"very":[19,33],"simple":[20],"indexing":[21,43],"scheme":[22,44],"is":[23,68,79,88],"employed":[24],"that":[25,32],"results":[26],"in":[27,60],"flexible,":[29],"modular":[30],"program":[31,87],"efficiently":[34],"calculates":[35],"DFT":[37],"in-place.":[38],"modification":[40],"of":[41,84],"this":[42],"gives":[45],"new":[47,95],"with":[49],"output":[51],"both":[52,101],"in-place":[53],"and":[54,76,104],"in-order":[55],"at":[56],"slight":[58],"cost":[59],"flexibility.":[61],"means":[63],"only":[64],"2N":[65],"data":[66],"storage":[67],"needed":[69],"for":[70],"length":[72],"N":[73],"complex":[74],"FFT":[75],"no":[77],"unscrambling":[78],"necessary.":[80],"The":[81],"basic":[82],"part":[83],"FORTRAN":[86],"given.":[89],"speed":[91],"comparison":[92],"shows":[93],"be":[98],"faster":[99],"than":[100],"Cooley-Tukey":[103],"nested":[106],"Winograd":[107],"algorithms.":[108]},"counts_by_year":[],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2016-06-24T00:00:00"}