{"id":"https://openalex.org/W7106210063","doi":"https://doi.org/10.1109/itw62417.2025.11240519","title":"Efficient Algorithm for Sparse Fourier Transform of Generalized q-ary Functions","display_name":"Efficient Algorithm for Sparse Fourier Transform of Generalized q-ary Functions","publication_year":2025,"publication_date":"2025-09-29","ids":{"openalex":"https://openalex.org/W7106210063","doi":"https://doi.org/10.1109/itw62417.2025.11240519"},"language":null,"primary_location":{"id":"doi:10.1109/itw62417.2025.11240519","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw62417.2025.11240519","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Information Theory Workshop (ITW)","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":null,"display_name":"Darin Tsui","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Darin Tsui","raw_affiliation_strings":["Georgia Institute of Technology,School of Electrical and Computer Engineering,Atlanta,GA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology,School of Electrical and Computer Engineering,Atlanta,GA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Kunal Talreja","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kunal Talreja","raw_affiliation_strings":["Georgia Institute of Technology,School of Electrical and Computer Engineering,Atlanta,GA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology,School of Electrical and Computer Engineering,Atlanta,GA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":null,"display_name":"Amirali Aghazadeh","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amirali Aghazadeh","raw_affiliation_strings":["Georgia Institute of Technology,School of Electrical and Computer Engineering,Atlanta,GA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology,School of Electrical and Computer Engineering,Atlanta,GA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9845,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.79685689,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.7993999719619751,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.7993999719619751,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T12303","display_name":"Tensor decomposition and applications","score":0.05700000002980232,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11034","display_name":"Digital Filter Design and Implementation","score":0.018699999898672104,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.6037999987602234},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.5631999969482422},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5619999766349792},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.5444999933242798},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.5127000212669373},{"id":"https://openalex.org/keywords/cyclotomic-fast-fourier-transform","display_name":"Cyclotomic fast Fourier transform","score":0.4860999882221222},{"id":"https://openalex.org/keywords/discrete-time-fourier-transform","display_name":"Discrete-time Fourier transform","score":0.4253000020980835},{"id":"https://openalex.org/keywords/harmonic-wavelet-transform","display_name":"Harmonic wavelet transform","score":0.38679999113082886}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6474999785423279},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6065000295639038},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.6037999987602234},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.5631999969482422},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5619999766349792},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.5444999933242798},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.5127000212669373},{"id":"https://openalex.org/C43060483","wikidata":"https://www.wikidata.org/wiki/Q17006372","display_name":"Cyclotomic fast Fourier transform","level":5,"score":0.4860999882221222},{"id":"https://openalex.org/C122444316","wikidata":"https://www.wikidata.org/wiki/Q1440048","display_name":"Discrete-time Fourier transform","level":5,"score":0.4253000020980835},{"id":"https://openalex.org/C1109138","wikidata":"https://www.wikidata.org/wiki/Q3280930","display_name":"Harmonic wavelet transform","level":5,"score":0.38679999113082886},{"id":"https://openalex.org/C62058723","wikidata":"https://www.wikidata.org/wiki/Q7049066","display_name":"Non-uniform discrete Fourier transform","level":5,"score":0.36629998683929443},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3610999882221222},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.35749998688697815},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.3440999984741211},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.3377000093460083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29989999532699585},{"id":"https://openalex.org/C100279318","wikidata":"https://www.wikidata.org/wiki/Q467440","display_name":"Sample space","level":2,"score":0.2978000044822693},{"id":"https://openalex.org/C175146775","wikidata":"https://www.wikidata.org/wiki/Q3984053","display_name":"Fourier inversion theorem","level":5,"score":0.2797999978065491},{"id":"https://openalex.org/C175225751","wikidata":"https://www.wikidata.org/wiki/Q15927242","display_name":"Discrete Fourier series","level":5,"score":0.2782000005245209},{"id":"https://openalex.org/C1370844","wikidata":"https://www.wikidata.org/wiki/Q5167446","display_name":"Cooley\u2013Tukey FFT algorithm","level":3,"score":0.2768999934196472},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.27410000562667847},{"id":"https://openalex.org/C20538924","wikidata":"https://www.wikidata.org/wiki/Q822139","display_name":"Characteristic function (probability theory)","level":3,"score":0.27219998836517334}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw62417.2025.11240519","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw62417.2025.11240519","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1494749725","https://openalex.org/W1526446139","https://openalex.org/W2061171222","https://openalex.org/W2076762350","https://openalex.org/W2104266187","https://openalex.org/W2107625832","https://openalex.org/W2112094394","https://openalex.org/W2115104320","https://openalex.org/W2135046866","https://openalex.org/W2140817291","https://openalex.org/W2145096794","https://openalex.org/W2154296304","https://openalex.org/W2379594833","https://openalex.org/W2483469645","https://openalex.org/W2561492491","https://openalex.org/W2592585592","https://openalex.org/W2620883762","https://openalex.org/W2752855532","https://openalex.org/W3198879354","https://openalex.org/W4225900888","https://openalex.org/W4242004838","https://openalex.org/W4250955649","https://openalex.org/W4386066522","https://openalex.org/W7106210063"],"related_works":[],"abstract_inverted_index":{"Computing":[0],"the":[1,40,43,60,102,157,176,187,228,233],"Fourier":[2,44,104,189,224],"transform":[3,45,105,158,190],"of":[4,70,106,112,116,154,163,170,191,232],"a":[5,65,96,109,119,151,160],"q-ary":[6,13,72,193,236],"function":[7,61],"$f:\\mathbb{Z}_q^n":[8],"\\to":[9,132],"{\\mathbb{R}}$,":[10],"which":[11],"maps":[12],"sequences":[14,73],"to":[15,86,217,222,227],"real":[16],"numbers,":[17],"is":[18,62],"an":[19],"important":[20],"problem":[21],"in":[22,27,56],"mathematics":[23],"with":[24,108,135,159],"wide-ranging":[25],"applications":[26],"biology,":[28],"signal":[29],"processing,":[30],"and":[31,52,118,167,204,211],"machine":[32],"learning.":[33],"Previous":[34],"studies":[35],"have":[36],"shown":[37],"that,":[38],"under":[39,175],"sparsity":[41],"assumption,":[42],"can":[46],"be":[47],"computed":[48],"efficiently":[49],"using":[50,197,215],"fast":[51],"sample-efficient":[53],"algorithms.":[54],"However,":[55],"most":[57,229],"practical":[58],"settings,":[59],"defined":[63],"over":[64],"more":[66],"general":[67],"space\u2014the":[68],"space":[69],"generalized":[71,192],"${\\mathbb{Z}_{{q_1}}}":[74],"\\times":[75,77,79],"{\\mathbb{Z}_{{q_2}}}":[76],"\\cdots":[78],"{\\mathbb{Z}_{{q_n}}}$":[80],"\u2014":[81],"where":[82],"each":[83],"${\\mathbb{Z}_{{q_i}}}$":[84],"corresponds":[85],"integers":[87],"modulo":[88],"q<inf":[89],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[90,139,165,172],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">i</inf>.":[91],"Herein,":[92],"we":[93,182],"develop":[94],"GFast,":[95],"coding":[97],"theoretic":[98],"algorithm":[99],"that":[100,122,150,184],"computes":[101,156,186],"S-sparse":[103],"f":[107],"sample":[110,161],"complexity":[111,115,162,169],"O(Sn),":[113],"computational":[114,168],"O(SnlogN),":[117],"failure":[120],"probability":[121,179],"approaches":[123],"zero":[124],"as":[125,235],"$N":[126],"=":[127,129,137],"\\prod\\nolimits_{i":[128],"1}^n":[130],"{{q_i}}":[131],"\\infty":[133],"$":[134],"S":[136],"N<sup":[138],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u03b4</sup>":[140],"for":[141],"some":[142],"0":[143],"\u2264":[144],"\u03b4":[145],"<":[146],"1.":[147],"We":[148],"show":[149],"noise-robust":[152],"version":[153],"GFast":[155,185],"O(Sn<sup":[164,171],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>)":[166],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[173],"logN)":[174],"same":[177],"high":[178],"guarantees.":[180],"Additionally,":[181],"demonstrate":[183],"sparse":[188],"functions":[194],"8\u00d7":[195],"faster":[196],"16\u00d7":[198],"fewer":[199,219],"samples":[200,220],"on":[201],"synthetic":[202],"experiments,":[203],"enables":[205],"explaining":[206],"real-world":[207],"heart":[208],"disease":[209],"diagnosis":[210],"protein":[212],"fitness":[213],"models":[214,234],"up":[216],"13\u00d7":[218],"compared":[221],"existing":[223],"algorithms":[225],"applied":[226],"efficient":[230],"parameterization":[231],"functions.":[237]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-23T00:00:00"}