{"id":"https://openalex.org/W4404954119","doi":"https://doi.org/10.1109/dcis62603.2024.10769152","title":"A Hardware-Efficient 1200-point FFT Architecture that Combines the Prime Factor and Cooley-Tukey Algorithms","display_name":"A Hardware-Efficient 1200-point FFT Architecture that Combines the Prime Factor and Cooley-Tukey Algorithms","publication_year":2024,"publication_date":"2024-11-13","ids":{"openalex":"https://openalex.org/W4404954119","doi":"https://doi.org/10.1109/dcis62603.2024.10769152"},"language":"en","primary_location":{"id":"doi:10.1109/dcis62603.2024.10769152","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcis62603.2024.10769152","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 39th Conference on Design of Circuits and Integrated Systems (DCIS)","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/A5038272861","display_name":"V\u00edctor Manuel Bautista","orcid":"https://orcid.org/0000-0002-5077-4210"},"institutions":[{"id":"https://openalex.org/I88060688","display_name":"Universidad Polit\u00e9cnica de Madrid","ror":"https://ror.org/03n6nwv02","country_code":"ES","type":"education","lineage":["https://openalex.org/I88060688"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"V\u00edctor Manuel Bautista","raw_affiliation_strings":["Universidad Politécnica de Madrid,Department of Electronic Engineering,Madrid,Spain"],"affiliations":[{"raw_affiliation_string":"Universidad Politécnica de Madrid,Department of Electronic Engineering,Madrid,Spain","institution_ids":["https://openalex.org/I88060688"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059222971","display_name":"Mario Garrido","orcid":"https://orcid.org/0000-0001-5739-3544"},"institutions":[{"id":"https://openalex.org/I88060688","display_name":"Universidad Polit\u00e9cnica de Madrid","ror":"https://ror.org/03n6nwv02","country_code":"ES","type":"education","lineage":["https://openalex.org/I88060688"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Mario Garrido","raw_affiliation_strings":["Universidad Politécnica de Madrid,Department of Electronic Engineering,Madrid,Spain"],"affiliations":[{"raw_affiliation_string":"Universidad Politécnica de Madrid,Department of Electronic Engineering,Madrid,Spain","institution_ids":["https://openalex.org/I88060688"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038272861"],"corresponding_institution_ids":["https://openalex.org/I88060688"],"apc_list":null,"apc_paid":null,"fwci":0.7471,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.72174332,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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.9933000206947327,"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.9933000206947327,"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/T10741","display_name":"Video Coding and Compression Technologies","score":0.9851999878883362,"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/T11105","display_name":"Advanced Image Processing Techniques","score":0.9790999889373779,"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/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.7024437189102173},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6798663139343262},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.6344931125640869},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.6001489758491516},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5108558535575867},{"id":"https://openalex.org/keywords/architecture","display_name":"Architecture","score":0.4905935823917389},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.4641600251197815},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4604511857032776},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3709881901741028},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3589898943901062},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.25318312644958496},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23392486572265625},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.11278176307678223}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.7024437189102173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6798663139343262},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.6344931125640869},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.6001489758491516},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5108558535575867},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.4905935823917389},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.4641600251197815},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4604511857032776},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3709881901741028},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3589898943901062},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25318312644958496},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23392486572265625},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.11278176307678223},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dcis62603.2024.10769152","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcis62603.2024.10769152","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 39th Conference on Design of Circuits and Integrated Systems (DCIS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1966904279","https://openalex.org/W1987741783","https://openalex.org/W2042527476","https://openalex.org/W2121362046","https://openalex.org/W2516775472","https://openalex.org/W2759713288","https://openalex.org/W2897669092","https://openalex.org/W2918547626","https://openalex.org/W2982447857","https://openalex.org/W4231896027","https://openalex.org/W4254389654","https://openalex.org/W4323521107","https://openalex.org/W4367182313","https://openalex.org/W4385486174","https://openalex.org/W4389600110","https://openalex.org/W4400524666","https://openalex.org/W4407403533"],"related_works":["https://openalex.org/W2031343199","https://openalex.org/W2356814585","https://openalex.org/W2012363129","https://openalex.org/W3046688035","https://openalex.org/W2042527476","https://openalex.org/W1984254719","https://openalex.org/W2977460836","https://openalex.org/W1975692575","https://openalex.org/W2144412928","https://openalex.org/W2978884468"],"abstract_inverted_index":{"In":[0],"this":[1,77,141,145],"paper,":[2],"we":[3,143],"present":[4],"a":[5,29,59,89],"hardware-efficient":[6],"1200-point":[7,96],"single-path":[8],"delay":[9],"feedback":[10],"(SDF)":[11],"fast":[12],"Fourier":[13],"transform":[14],"(FFT)":[15],"architecture.":[16,47],"Contrary":[17],"to":[18,94,151],"previous":[19,95,115],"FFT":[20,112],"architectures":[21],"for":[22],"non-power-of-two":[23],"(NP2)":[24],"sizes,":[25],"which":[26],"usually":[27],"require":[28],"large":[30],"number":[31,105],"of":[32,72,76,100,106],"hardware":[33,101],"resources,":[34],"the":[35,40,46,53,61,73,85,104,110],"proposed":[36,62,86,111],"approach":[37,87],"reduces":[38],"significantly":[39],"rotators":[41],"that":[42],"are":[43],"required":[44],"in":[45,69,98,109,114],"This":[48,121],"is":[49,79,119,123],"achieved":[50],"by":[51],"combining":[52],"prime-factor":[54],"and":[55,113],"Cooley-Tukey":[56],"algorithms.":[57],"As":[58],"result,":[60],"architecture":[63],"has":[64],"only":[65],"one":[66],"non-trivial":[67],"rotator":[68],"between":[70],"stages":[71],"architecture.The":[74],"effectiveness":[75],"optimization":[78],"demonstrated":[80],"through":[81],"experimental":[82],"results,":[83],"where":[84],"achieves":[88],"significant":[90],"improvement":[91],"with":[92,140,153,159],"respect":[93],"FFTs":[97,118,128],"terms":[99],"resources.":[102],"Furthermore,":[103],"resources":[107],"used":[108],"optimized":[116],"1024-point":[117],"comparable.":[120],"fact":[122],"highly":[124],"relevant":[125],"since":[126],"NP2":[127,154],"have":[129],"traditionally":[130],"been":[131],"much":[132],"less":[133],"efficient":[134],"than":[135],"power-of-two":[136],"(P2)":[137],"FFTs.":[138],"Thus,":[139],"paper":[142],"break":[144],"old":[146],"paradigm,":[147],"making":[148],"it":[149],"possible":[150],"achieve":[152],"sizes":[155],"similar":[156],"efficiency":[157],"as":[158],"P2":[160],"ones.":[161]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-12-21T23:12:01.093139","created_date":"2025-10-10T00:00:00"}