{"id":"https://openalex.org/W4372260258","doi":"https://doi.org/10.1109/icassp49357.2023.10096394","title":"Fast Convolution Algorithm for Real-Valued Finite Length Sequences","display_name":"Fast Convolution Algorithm for Real-Valued Finite Length Sequences","publication_year":2023,"publication_date":"2023-05-05","ids":{"openalex":"https://openalex.org/W4372260258","doi":"https://doi.org/10.1109/icassp49357.2023.10096394"},"language":"en","primary_location":{"id":"doi:10.1109/icassp49357.2023.10096394","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp49357.2023.10096394","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","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/A5103325594","display_name":"Weiwei Wang","orcid":"https://orcid.org/0000-0002-6970-3789"},"institutions":[{"id":"https://openalex.org/I103163165","display_name":"Florida State University","ror":"https://ror.org/05g3dte14","country_code":"US","type":"education","lineage":["https://openalex.org/I103163165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Weiwei Wang","raw_affiliation_strings":["Florida State University,Department of Electrical and Computer Engineering","Department of Electrical and Computer Engineering, Florida State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Florida State University,Department of Electrical and Computer Engineering","institution_ids":["https://openalex.org/I103163165"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Florida State University","institution_ids":["https://openalex.org/I103163165"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035366862","display_name":"Victor DeBrunner","orcid":"https://orcid.org/0000-0003-2198-2552"},"institutions":[{"id":"https://openalex.org/I103163165","display_name":"Florida State University","ror":"https://ror.org/05g3dte14","country_code":"US","type":"education","lineage":["https://openalex.org/I103163165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Victor DeBrunner","raw_affiliation_strings":["Florida State University,Department of Electrical and Computer Engineering","Department of Electrical and Computer Engineering, Florida State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Florida State University,Department of Electrical and Computer Engineering","institution_ids":["https://openalex.org/I103163165"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Florida State University","institution_ids":["https://openalex.org/I103163165"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006876328","display_name":"Linda S. DeBrunner","orcid":"https://orcid.org/0000-0001-9926-8602"},"institutions":[{"id":"https://openalex.org/I103163165","display_name":"Florida State University","ror":"https://ror.org/05g3dte14","country_code":"US","type":"education","lineage":["https://openalex.org/I103163165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Linda S. DeBrunner","raw_affiliation_strings":["Florida State University,Department of Electrical and Computer Engineering","Department of Electrical and Computer Engineering, Florida State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Florida State University,Department of Electrical and Computer Engineering","institution_ids":["https://openalex.org/I103163165"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Florida State University","institution_ids":["https://openalex.org/I103163165"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I103163165"],"apc_list":null,"apc_paid":null,"fwci":1.0954,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76777867,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"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.9997000098228455,"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.9997000098228455,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9984999895095825,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9904999732971191,"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/convolution","display_name":"Convolution (computer science)","score":0.9004801511764526},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.8645466566085815},{"id":"https://openalex.org/keywords/overlap\u2013add-method","display_name":"Overlap\u2013add method","score":0.8366803526878357},{"id":"https://openalex.org/keywords/raders-fft-algorithm","display_name":"Rader's FFT algorithm","score":0.8079330325126648},{"id":"https://openalex.org/keywords/convolution-theorem","display_name":"Convolution theorem","score":0.7499009966850281},{"id":"https://openalex.org/keywords/circular-convolution","display_name":"Circular convolution","score":0.7249828577041626},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6615187525749207},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.6465652585029602},{"id":"https://openalex.org/keywords/convolution-power","display_name":"Convolution power","score":0.5775989294052124},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.5541255474090576},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.543428361415863},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.541344165802002},{"id":"https://openalex.org/keywords/discrete-time-fourier-transform","display_name":"Discrete-time Fourier transform","score":0.4922105371952057},{"id":"https://openalex.org/keywords/cyclotomic-fast-fourier-transform","display_name":"Cyclotomic fast Fourier transform","score":0.4850248694419861},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43887609243392944},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.4057338237762451},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38078078627586365},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14783117175102234},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.14224761724472046},{"id":"https://openalex.org/keywords/short-time-fourier-transform","display_name":"Short-time Fourier transform","score":0.09968328475952148},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09421956539154053},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.07946857810020447}],"concepts":[{"id":"https://openalex.org/C45347329","wikidata":"https://www.wikidata.org/wiki/Q5166604","display_name":"Convolution (computer science)","level":3,"score":0.9004801511764526},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.8645466566085815},{"id":"https://openalex.org/C181002996","wikidata":"https://www.wikidata.org/wiki/Q1611641","display_name":"Overlap\u2013add method","level":5,"score":0.8366803526878357},{"id":"https://openalex.org/C69598009","wikidata":"https://www.wikidata.org/wiki/Q7280126","display_name":"Rader's FFT algorithm","level":5,"score":0.8079330325126648},{"id":"https://openalex.org/C79587385","wikidata":"https://www.wikidata.org/wiki/Q2638931","display_name":"Convolution theorem","level":5,"score":0.7499009966850281},{"id":"https://openalex.org/C194980680","wikidata":"https://www.wikidata.org/wiki/Q245450","display_name":"Circular convolution","level":5,"score":0.7249828577041626},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6615187525749207},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.6465652585029602},{"id":"https://openalex.org/C86254553","wikidata":"https://www.wikidata.org/wiki/Q5166605","display_name":"Convolution power","level":5,"score":0.5775989294052124},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.5541255474090576},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.543428361415863},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.541344165802002},{"id":"https://openalex.org/C122444316","wikidata":"https://www.wikidata.org/wiki/Q1440048","display_name":"Discrete-time Fourier transform","level":5,"score":0.4922105371952057},{"id":"https://openalex.org/C43060483","wikidata":"https://www.wikidata.org/wiki/Q17006372","display_name":"Cyclotomic fast Fourier transform","level":5,"score":0.4850248694419861},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43887609243392944},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.4057338237762451},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38078078627586365},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14783117175102234},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.14224761724472046},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.09968328475952148},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09421956539154053},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.07946857810020447},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp49357.2023.10096394","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp49357.2023.10096394","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","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":10,"referenced_works":["https://openalex.org/W2096121910","https://openalex.org/W2107868713","https://openalex.org/W2134128809","https://openalex.org/W2216224011","https://openalex.org/W2343225447","https://openalex.org/W2904838066","https://openalex.org/W3133671857","https://openalex.org/W3205470954","https://openalex.org/W4214816946","https://openalex.org/W4250640407"],"related_works":["https://openalex.org/W2267589039","https://openalex.org/W4363675452","https://openalex.org/W2361284596","https://openalex.org/W2143803328","https://openalex.org/W2033203427","https://openalex.org/W2362962213","https://openalex.org/W4372260258","https://openalex.org/W2759540840","https://openalex.org/W2160855435","https://openalex.org/W2349703589"],"abstract_inverted_index":{"The":[0,77,88],"Fast":[1],"Fourier":[2],"Transform":[3,21],"(FFT)-based":[4],"convolution":[5,11,32],"is":[6,51,90],"the":[7,18,27,35,63,74,85],"most":[8],"popular":[9],"fast":[10,91],"algorithm.":[12],"In":[13,57],"past":[14],"work,":[15],"we":[16,42,60],"developed":[17,43],"Discrete":[19],"Hirschman":[20],"(DHT)-based":[22],"convolution.":[23,69,76],"When":[24],"compared":[25],"to":[26,67],"FFT-based":[28],"convolution,":[29],"our":[30],"DHT-based":[31],"can":[33],"reduce":[34],"computational":[36],"complexity":[37],"by":[38],"a":[39,44],"third.":[40],"Recently,":[41],"comprehensive":[45],"DFT":[46,66],"algorithm":[47,89],"where":[48],"every":[49],"calculation":[50],"natively":[52,64],"real-valued":[53,65],"(RV)":[54],"dot":[55],"products.":[56],"this":[58,72],"paper,":[59],"first":[61],"apply":[62],"linear":[68],"We":[70],"call":[71],"method":[73],"RV-based":[75],"arithmetic":[78],"analysis":[79],"reveals":[80],"that":[81],"it":[82],"efficiently":[83],"reduces":[84],"operation":[86],"counts.":[87],"regardless":[92],"of":[93],"length.":[94]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}