{"id":"https://openalex.org/W4281654586","doi":"https://doi.org/10.1145/3526241.3530329","title":"A Tutorial-style Single-cycle Fast Fourier Transform Processor","display_name":"A Tutorial-style Single-cycle Fast Fourier Transform Processor","publication_year":2022,"publication_date":"2022-06-02","ids":{"openalex":"https://openalex.org/W4281654586","doi":"https://doi.org/10.1145/3526241.3530329"},"language":"en","primary_location":{"id":"doi:10.1145/3526241.3530329","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3526241.3530329","pdf_url":null,"source":{"id":"https://openalex.org/S4363608736","display_name":"Proceedings of the Great Lakes Symposium on VLSI 2022","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"Proceedings of the Great Lakes Symposium on VLSI 2022","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/A5026059072","display_name":"Alec Vercruysse","orcid":"https://orcid.org/0000-0002-2599-3753"},"institutions":[{"id":"https://openalex.org/I133543626","display_name":"Harvey Mudd College","ror":"https://ror.org/025ecfn45","country_code":"US","type":"education","lineage":["https://openalex.org/I133543626"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alec Vercruysse","raw_affiliation_strings":["Harvey Mudd College, Claremont, CA, USA"],"affiliations":[{"raw_affiliation_string":"Harvey Mudd College, Claremont, CA, USA","institution_ids":["https://openalex.org/I133543626"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065753272","display_name":"M. Weston Miller","orcid":null},"institutions":[{"id":"https://openalex.org/I133543626","display_name":"Harvey Mudd College","ror":"https://ror.org/025ecfn45","country_code":"US","type":"education","lineage":["https://openalex.org/I133543626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Weston Miller","raw_affiliation_strings":["Harvey Mudd College, Claremont, CA, USA"],"affiliations":[{"raw_affiliation_string":"Harvey Mudd College, Claremont, CA, USA","institution_ids":["https://openalex.org/I133543626"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060827676","display_name":"Joshua Brake","orcid":"https://orcid.org/0000-0002-5113-6886"},"institutions":[{"id":"https://openalex.org/I133543626","display_name":"Harvey Mudd College","ror":"https://ror.org/025ecfn45","country_code":"US","type":"education","lineage":["https://openalex.org/I133543626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joshua Brake","raw_affiliation_strings":["Harvey Mudd College, Claremont, CA, USA"],"affiliations":[{"raw_affiliation_string":"Harvey Mudd College, Claremont, CA, USA","institution_ids":["https://openalex.org/I133543626"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080622014","display_name":"David L. Harris","orcid":null},"institutions":[{"id":"https://openalex.org/I133543626","display_name":"Harvey Mudd College","ror":"https://ror.org/025ecfn45","country_code":"US","type":"education","lineage":["https://openalex.org/I133543626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Harris","raw_affiliation_strings":["Harvey Mudd College, Claremont, CA, USA"],"affiliations":[{"raw_affiliation_string":"Harvey Mudd College, Claremont, CA, USA","institution_ids":["https://openalex.org/I133543626"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5026059072"],"corresponding_institution_ids":["https://openalex.org/I133543626"],"apc_list":null,"apc_paid":null,"fwci":0.518,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.50412541,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"525","last_page":"530"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.996999979019165,"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"}},"topics":[{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.996999979019165,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9962999820709229,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.9029381275177002},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7758175134658813},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.6861402988433838},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6006789207458496},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.5124247670173645},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.4841388165950775},{"id":"https://openalex.org/keywords/computational-science","display_name":"Computational science","score":0.4787956178188324},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.44496041536331177},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.44366729259490967},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.4421709179878235},{"id":"https://openalex.org/keywords/cooley\u2013tukey-fft-algorithm","display_name":"Cooley\u2013Tukey FFT algorithm","score":0.4220023453235626},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4179800748825073},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35715338587760925},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.3308815360069275},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15233296155929565},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.14984381198883057},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.1278916299343109},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10079938173294067}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.9029381275177002},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7758175134658813},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.6861402988433838},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6006789207458496},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.5124247670173645},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.4841388165950775},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.4787956178188324},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.44496041536331177},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.44366729259490967},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.4421709179878235},{"id":"https://openalex.org/C1370844","wikidata":"https://www.wikidata.org/wiki/Q5167446","display_name":"Cooley\u2013Tukey FFT algorithm","level":3,"score":0.4220023453235626},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4179800748825073},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35715338587760925},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.3308815360069275},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15233296155929565},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.14984381198883057},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.1278916299343109},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10079938173294067},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3526241.3530329","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3526241.3530329","pdf_url":null,"source":{"id":"https://openalex.org/S4363608736","display_name":"Proceedings of the Great Lakes Symposium on VLSI 2022","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"Proceedings of the Great Lakes Symposium on VLSI 2022","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2117639037","https://openalex.org/W2488643219"],"related_works":["https://openalex.org/W2154006536","https://openalex.org/W2042527476","https://openalex.org/W2348800014","https://openalex.org/W4246835537","https://openalex.org/W2066431770","https://openalex.org/W3046243388","https://openalex.org/W4362564158","https://openalex.org/W2155491755","https://openalex.org/W2365391860","https://openalex.org/W2085939569"],"abstract_inverted_index":{"The":[0],"Fast":[1],"Fourier":[2,24],"Transform":[3],"(FFT)":[4],"is":[5,104],"one":[6],"of":[7,12,30,40,43,81,91],"the":[8,13,22,41,52,82,114],"most":[9],"important":[10,67,78],"algorithms":[11],"past":[14],"century.":[15],"It":[16],"presents":[17,86],"a":[18,27,72,87],"way":[19],"to":[20,109],"compute":[21],"discrete":[23],"transform":[25],"with":[26,106],"computational":[28],"complexity":[29],"O(N":[31],"log2(N)).":[32],"Its":[33],"structure":[34],"also":[35],"provides":[36],"an":[37,92,101],"excellent":[38],"example":[39],"power":[42],"custom":[44],"hardware":[45,94],"accelerators.":[46],"However,":[47],"current":[48],"tutorial-style":[49],"papers":[50],"implementing":[51],"FFT":[53,93],"are":[54,62],"not":[55],"well-suited":[56],"for":[57],"undergraduate":[58],"students":[59],"since":[60],"they":[61],"either":[63],"too":[64],"vague":[65],"on":[66,100],"implementation":[68],"details":[69],"or":[70],"use":[71],"pipelined":[73],"architecture":[74],"which":[75],"can":[76,97],"obscure":[77],"fundamental":[79],"concepts":[80],"accelerator.":[83],"This":[84],"paper":[85],"simple,":[88],"single-cycle":[89],"version":[90],"accelerator":[95],"that":[96],"be":[98],"implemented":[99],"FPGA":[102],"and":[103,112],"accompanied":[105],"source":[107],"code":[108],"easily":[110],"simulate":[111],"synthesize":[113],"design":[115],"available":[116],"at":[117],"https://doi.org/10.5281/zenodo.6219524.":[118]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}