{"id":"https://openalex.org/W4319870705","doi":"https://doi.org/10.1145/3543622.3573139","title":"An Efficient High-Speed FFT Implementation","display_name":"An Efficient High-Speed FFT Implementation","publication_year":2023,"publication_date":"2023-02-10","ids":{"openalex":"https://openalex.org/W4319870705","doi":"https://doi.org/10.1145/3543622.3573139"},"language":"en","primary_location":{"id":"doi:10.1145/3543622.3573139","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3543622.3573139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM/SIGDA International Symposium on Field Programmable Gate Arrays","raw_type":"proceedings-article"},"type":"conference-abstract","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/A5011606445","display_name":"Ross Martin","orcid":"https://orcid.org/0000-0002-2696-8744"},"institutions":[{"id":"https://openalex.org/I4210121626","display_name":"Signal Processing (United States)","ror":"https://ror.org/021gzyw51","country_code":"US","type":"company","lineage":["https://openalex.org/I4210121626"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ross Martin","raw_affiliation_strings":["Bit by Bit Signal Processing LLC, Peoria, AZ, USA"],"raw_orcid":"https://orcid.org/0000-0002-2696-8744","affiliations":[{"raw_affiliation_string":"Bit by Bit Signal Processing LLC, Peoria, AZ, USA","institution_ids":["https://openalex.org/I4210121626"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5011606445"],"corresponding_institution_ids":["https://openalex.org/I4210121626"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"50","last_page":"50"},"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.983299970626831,"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.983299970626831,"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/T11749","display_name":"Iterative Learning Control Systems","score":0.978600025177002,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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.9732999801635742,"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/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.8938260078430176},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7139120101928711},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.5113177299499512},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4940362572669983},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.4889289438724518},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.28987380862236023},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23128917813301086},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.10423743724822998},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10025948286056519}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.8938260078430176},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7139120101928711},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.5113177299499512},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4940362572669983},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.4889289438724518},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.28987380862236023},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23128917813301086},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.10423743724822998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10025948286056519},{"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/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"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.1145/3543622.3573139","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3543622.3573139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM/SIGDA International Symposium on Field Programmable Gate Arrays","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2185259940","https://openalex.org/W2113951268","https://openalex.org/W2031343199","https://openalex.org/W2168413811","https://openalex.org/W4226515754","https://openalex.org/W2977460836","https://openalex.org/W2144412928","https://openalex.org/W2356814585","https://openalex.org/W2948041274","https://openalex.org/W2004315237"],"abstract_inverted_index":{"This":[0,235],"poster":[1],"introduces":[2],"the":[3,29,40,93,144,152,157,168,178],"\"BxBFFT\"":[4],"parallel-pipelined":[5],"Fast":[6],"Fourier":[7],"Transform":[8],"(FFT),":[9],"which":[10],"gives":[11,195],"higher":[12],"clock":[13,43],"speeds":[14,44],"(Fmax)":[15],"than":[16,92,102],"competitors":[17],"with":[18,28,134,156],"substantial":[19],"savings":[20],"in":[21,47,80,115,125,237],"power":[22,59],"and":[23,37,58,73,83,110,166,202,217],"logic":[24],"resources.":[25],"In":[26],"comparisons":[27],"Xilinx":[30,94,145,153],"SSR":[31,95,146,154],"FFT,":[32,34,36,39],"Spiral":[33],"Astron":[35],"ZipCPU":[38],"BxBFFT":[41,68,85,98,158,233],"had":[42,69,131],"above":[45],"650MHz":[46],"cases":[48],"where":[49],"all":[50],"others":[51],"were":[52,60,87],"below":[53],"300MHz.":[54],"The":[55,67,97,118,175,191],"BxBFFT's":[56,119,179,192],"LUTs":[57],"lower":[61],"by":[62,162],"a":[63,135,238],"factor":[64],"of":[65,143,151,177,184,208],"~1.5.":[66],"faster":[70,74,91],"Vivado":[71],"implementation":[72],"RTL":[75],"simulation,":[76],"for":[77,112,215,221,231],"improved":[78,120],"productivity":[79],"design,":[81],"testing,":[82],"verification.":[84],"simulations":[86],"over":[88,198],"10":[89],"times":[90],"FFT.":[96,147,241],"supports":[99,211],"more":[100],"features":[101,111],"other":[103],"FFTs,":[104,107,109],"including":[105],"real-to-complex":[106],"non-power-of-2":[108],"high":[113],"reliability":[114],"adverse":[116],"environments.":[117],"performance":[121,180,204],"has":[122],"been":[123],"verified":[124],"real":[126],"applications.":[127],"One":[128],"customer":[129],"design":[130,169],"to":[132,139,170,200,227],"operate":[133,171],"reduced":[136],"workload":[137],"due":[138],"excessive":[140],"current":[141],"draw":[142],"A":[148],"quick":[149],"replacement":[150],"FFT":[155,186],"lowered":[159],"die":[160],"temperature":[161],"34.8":[163],"degree":[164],"Celsius":[165],"allowed":[167],"under":[172],"full":[173],"load.":[174],"source":[176],"is":[181],"intensive":[182],"optimization":[183],"well-known":[185],"algorithms,":[187],"not":[188],"new":[189],"algorithms.":[190],"coding":[193],"style":[194],"better":[196],"control":[197],"synthesis":[199],"avoid":[201],"resolve":[203],"bottlenecks.":[205],"Automated":[206],"generation":[207],"top-level":[209],"code":[210],"13":[212],"different":[213,219],"choices":[214,220,230],"radix":[216],"2":[218],"data":[222],"flow":[223],"at":[224],"each":[225,232],"stage,":[226],"make":[228],"optimal":[229],"size.":[234],"results":[236],"highly":[239],"efficient":[240]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}