{"id":"https://openalex.org/W2752855532","doi":"https://doi.org/10.1109/tit.2017.2746568","title":"FFAST: An Algorithm for Computing an Exactly $ k$ -Sparse DFT in $O( k\\log k)$ Time","display_name":"FFAST: An Algorithm for Computing an Exactly $ k$ -Sparse DFT in $O( k\\log k)$ Time","publication_year":2017,"publication_date":"2017-08-30","ids":{"openalex":"https://openalex.org/W2752855532","doi":"https://doi.org/10.1109/tit.2017.2746568","mag":"2752855532"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2017.2746568","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2746568","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/A5030647153","display_name":"Sameer Pawar","orcid":"https://orcid.org/0000-0001-8954-7747"},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sameer Pawar","raw_affiliation_strings":["Intel, Santa Clara, CA, USA"],"raw_orcid":"https://orcid.org/0000-0001-8954-7747","affiliations":[{"raw_affiliation_string":"Intel, Santa Clara, CA, USA","institution_ids":["https://openalex.org/I1343180700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030620564","display_name":"Kannan Ramchandran","orcid":"https://orcid.org/0000-0002-4567-328X"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kannan Ramchandran","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.9861,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.94271384,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"64","issue":"1","first_page":"429","last_page":"450"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"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":1.0,"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/T11447","display_name":"Blind Source Separation Techniques","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/T12131","display_name":"Wireless Signal Modulation Classification","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.6165609359741211},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.5631759762763977},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5572322010993958},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.538910448551178},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.49918365478515625},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.48858532309532166},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.47123584151268005},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.426664263010025},{"id":"https://openalex.org/keywords/aliasing","display_name":"Aliasing","score":0.4195525050163269},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4144560396671295},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4113216996192932},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.4074181318283081},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.3747444748878479},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.20921540260314941},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20770078897476196},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.19785556197166443},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.17772862315177917}],"concepts":[{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.6165609359741211},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.5631759762763977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5572322010993958},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.538910448551178},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.49918365478515625},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.48858532309532166},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.47123584151268005},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.426664263010025},{"id":"https://openalex.org/C4069607","wikidata":"https://www.wikidata.org/wiki/Q868732","display_name":"Aliasing","level":3,"score":0.4195525050163269},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4144560396671295},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4113216996192932},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.4074181318283081},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.3747444748878479},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.20921540260314941},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20770078897476196},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.19785556197166443},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.17772862315177917},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2017.2746568","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2746568","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3074473257","display_name":"EAGER: Ultra-FFAST Alias Codes for Sparse Spectrum Estimation: Next Generation Compressed Sensing","funder_award_id":"1439725","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7554253775","display_name":"CIF:Small:Next-Generation Compressive Phase-Retrieval Using Sparse-Graph Codes: Theory, Design and Applications","funder_award_id":"1527767","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"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":39,"referenced_works":["https://openalex.org/W1494749725","https://openalex.org/W1501755821","https://openalex.org/W1511864029","https://openalex.org/W1537824340","https://openalex.org/W1595409123","https://openalex.org/W1983695700","https://openalex.org/W1986545790","https://openalex.org/W1999763281","https://openalex.org/W2004450282","https://openalex.org/W2009918297","https://openalex.org/W2012365979","https://openalex.org/W2019833178","https://openalex.org/W2030348437","https://openalex.org/W2031425559","https://openalex.org/W2060469182","https://openalex.org/W2076762350","https://openalex.org/W2082051116","https://openalex.org/W2107625832","https://openalex.org/W2112094394","https://openalex.org/W2113638573","https://openalex.org/W2115104320","https://openalex.org/W2128131274","https://openalex.org/W2128765501","https://openalex.org/W2129638195","https://openalex.org/W2137699000","https://openalex.org/W2146509513","https://openalex.org/W2154296304","https://openalex.org/W2169732368","https://openalex.org/W2296125569","https://openalex.org/W2296616510","https://openalex.org/W2395231588","https://openalex.org/W2546166905","https://openalex.org/W2592585592","https://openalex.org/W2899702797","https://openalex.org/W2963358127","https://openalex.org/W3017247523","https://openalex.org/W4242004838","https://openalex.org/W4250955649","https://openalex.org/W6776280882"],"related_works":["https://openalex.org/W90906771","https://openalex.org/W2018828772","https://openalex.org/W2529185025","https://openalex.org/W2809723425","https://openalex.org/W2052708136","https://openalex.org/W2005302727","https://openalex.org/W3082028334","https://openalex.org/W1973725449","https://openalex.org/W1941306591","https://openalex.org/W150528880"],"abstract_inverted_index":{"It":[0],"is":[1,44,64,86,158,187,198,225,248,282,305],"a":[2,34,148,181,190,208,268,296],"well-known":[3],"fact":[4],"that":[5,56,168,276,346],"the":[6,24,41,79,82,89,106,125,128,155,169,172,177,185,204,218,232,240,244,255,259,278,301,309,312,329],"Discrete":[7],"Fourier":[8,36],"Transform":[9,37],"(DFT)":[10],"X\u0305":[11,43,112,261,281],"of":[12,81,111,116,151,171,184,203,210,254,258,267,286,331],"an":[13,287],"arbitrary":[14],"n-length":[15],"input":[16,205],"signal":[17,173,206,246],"x\u0305,":[18],"can":[19,50],"be":[20],"computed":[21],"from":[22,113,338],"all":[23],"n":[25,67],"time-domain":[26,245],"samples":[27,115,170],"in":[28,58,66,98,118,127,163,189,307,348],"O(n":[29],"log":[30,120],"n)":[31],"operations":[32],"via":[33],"Fast":[35],"(FFT)":[38],"algorithm.":[39],"If":[40],"spectrum":[42,260],"k-sparse":[45],"(where":[46],"k":[47,59,63,69,107],"\u226a":[48],"n),":[49],"we":[51,166,274],"do":[52],"better?":[53],"We":[54,315,341],"show":[55,275],"asymptotically":[57,103],"and":[60,78,135,311,327],"n,":[61],"when":[62,141],"sub-linear":[65],"(precisely,":[68],"=":[70],"O(n\u03b4),":[71],"where":[72],"0":[73],"\u2264":[74],"\u03b4":[75,142],"<;":[76,143],"1),":[77],"support":[80],"non-zero":[83,108,256],"DFT":[84,109,280,303],"coefficients":[85,110,257],"uniformly":[87],"random,":[88],"fast":[90,297],"fourier":[91],"aliasing-based":[92],"sparse":[93,279],"transform":[94],"(FFAST)":[95],"algorithm,":[96],"proposed":[97,319],"this":[99,164],"paper,":[100],"computes,":[101],"with":[102,351],"high":[104],"probability,":[105],"O(k)":[114],"x\u0305":[117,174,247],"O(k":[119],"k)":[121],"arithmetic":[122],"operations.":[123],"Further,":[124],"constants":[126],"big":[129],"Oh":[130],"notation":[131],"for":[132],"both":[133,308],"sample":[134,156,310],"computational":[136],"cost":[137,157],"are":[138,179,347],"small,":[139],"e.g.,":[140],"0.99,":[144],"which":[145],"essentially":[146],"covers":[147],"wide":[149],"range":[150],"sublinear":[152],"sparsity":[153],"cases,":[154],"less":[159],"than":[160,230],"4k.":[161],"Although,":[162],"paper":[165,194],"assume":[167],"observed":[175],"by":[176,217,237],"FFAST":[178,186],"noise-free,":[180],"noise-robust":[182],"extension":[183],"provided":[188],"companion":[191],"(Part":[192],"II)":[193],"[1].":[195],"Our":[196],"approach":[197],"based":[199],"on":[200,243],"filter-less":[201],"sub-sampling":[202,214,241],"using":[207,334],"set":[209],"carefully":[211],"chosen":[212],"uniform":[213],"patterns":[215,253],"guided":[216],"Chinese":[219],"Remainder":[220],"Theorem":[221],"(CRT).":[222],"The":[223,291],"idea":[224],"to":[226,250,262,284,323],"cleverly":[227],"exploit,":[228],"rather":[229],"avoid,":[231],"resulting":[233,302],"aliasing":[234,252,321],"artifacts":[235],"induced":[236],"sub-sampling.":[238],"Specifically,":[239],"operation":[242],"designed":[249],"create":[251],"\u201clook":[263],"like\u201d":[264],"paritycheck":[265],"constraints":[266],"good":[269],"erasure-correcting":[270],"sparse-graph":[271,289,292,325],"code.":[272,290],"Next,":[273],"computing":[277],"equivalent":[283],"decoding":[285,313],"appropriate":[288],"codes":[293],"further":[294],"permit":[295],"peeling-style":[298],"decoding.":[299],"Consequently,":[300],"computation":[304],"low":[306],"complexity.":[314],"analytically":[316],"connect":[317],"our":[318,332,352],"CRTbased":[320],"framework":[322],"random":[324],"codes,":[326],"analyze":[328],"performance":[330],"algorithm":[333],"density":[335],"evolution":[336],"techniques":[337],"coding":[339],"theory.":[340],"provide":[342],"extensive":[343],"simulation":[344],"results,":[345],"tight":[349],"agreement":[350],"theoretical":[353],"findings.":[354]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-08-14T07:06:38.338062","created_date":"2025-10-10T00:00:00"}