{"id":"https://openalex.org/W2116962375","doi":"https://doi.org/10.1109/isit.2013.6620269","title":"Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity","display_name":"Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2116962375","doi":"https://doi.org/10.1109/isit.2013.6620269","mag":"2116962375"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620269","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"conference-paper","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/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":"Sameer Pawar","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, USA","Dept. of Electr. Eng. & Comput. Sci.`, U. C. Berkeley, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Comput. Sci.`, U. C. Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"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 Sciences, University of California, Berkeley, USA","Dept. of Electr. Eng. & Comput. Sci.`, U. C. Berkeley, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Comput. Sci.`, U. C. Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":9.6593,"has_fulltext":false,"cited_by_count":64,"citation_normalized_percentile":{"value":0.98974469,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"464","last_page":"468"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.5890188813209534},{"id":"https://openalex.org/keywords/aliasing","display_name":"Aliasing","score":0.5759949684143066},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5608669519424438},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5018761157989502},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4891805946826935},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.46730729937553406},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4590661823749542},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4486874043941498},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4425176978111267},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.4333666265010834},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4113364815711975},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4022394120693207},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2811657786369324},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.22070735692977905},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.18983855843544006},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1310807168483734}],"concepts":[{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.5890188813209534},{"id":"https://openalex.org/C4069607","wikidata":"https://www.wikidata.org/wiki/Q868732","display_name":"Aliasing","level":3,"score":0.5759949684143066},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5608669519424438},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5018761157989502},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4891805946826935},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.46730729937553406},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4590661823749542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4486874043941498},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4425176978111267},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.4333666265010834},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4113364815711975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4022394120693207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2811657786369324},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.22070735692977905},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.18983855843544006},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1310807168483734},{"id":"https://openalex.org/C136536468","wikidata":"https://www.wikidata.org/wiki/Q1225894","display_name":"Undersampling","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2013.6620269","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","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":19,"referenced_works":["https://openalex.org/W252853867","https://openalex.org/W1511864029","https://openalex.org/W1999763281","https://openalex.org/W2031425559","https://openalex.org/W2107625832","https://openalex.org/W2113638573","https://openalex.org/W2115104320","https://openalex.org/W2116962375","https://openalex.org/W2127271355","https://openalex.org/W2128131274","https://openalex.org/W2128765501","https://openalex.org/W2129638195","https://openalex.org/W2137699000","https://openalex.org/W2146509513","https://openalex.org/W2158537680","https://openalex.org/W2169732368","https://openalex.org/W2296616510","https://openalex.org/W2554333597","https://openalex.org/W4250955649"],"related_works":["https://openalex.org/W4327521644","https://openalex.org/W2978884468","https://openalex.org/W2154006536","https://openalex.org/W2348800014","https://openalex.org/W2365391860","https://openalex.org/W1820187807","https://openalex.org/W2085939569","https://openalex.org/W2134026188","https://openalex.org/W1941306591","https://openalex.org/W150528880"],"abstract_inverted_index":{"Given":[0],"an":[1],"n-length":[2],"input":[3,76,145],"signal":[4,77,146],"x,":[5],"it":[6],"is":[7,32,50,138,171,199,208],"well":[8],"known":[9],"that":[10,181,273],"its":[11],"Discrete":[12],"Fourier":[13,26,225],"Transform":[14],"(DFT),":[15],"X,":[16],"can":[17,54,94],"be":[18],"computed":[19],"in":[20,58,108,129,210,270],"O(nlogn)":[21],"complexity":[22,213],"using":[23,100,148,258],"a":[24,149,247],"Fast":[25],"Transform.":[27],"If":[28],"the":[29,43,46,75,97,106,109,121,130,144,160,178,195,222,252,256,280,284],"spectrum":[30,179],"X":[31,99,180,198],"exactly":[33],"k-sparse":[34],"(where":[35,79],"k\u03b4where":[36],"0":[37,84],"<;":[38,40,81,85,87],"\u03b4":[39,86],"1),":[41],"and":[42,89,207,214,250,278],"support":[44],"of":[45,74,123,132,143,152,186,203,255,283],"non-zero":[47],"DFT":[48,98,197],"coefficients":[49],"uniformly":[51],"random,":[52],"we":[53,65,93,233],"exploit":[55],"this":[56],"sparsity":[57],"two":[59],"fundamental":[60],"ways":[61],"(i)":[62],"sample":[63,212],"complexity:":[64,92],"need":[66],"only":[67],"M":[68],"=":[69],"rk":[70],"deterministically":[71],"chosen":[72,154],"samples":[73,133],"x":[78,147,170],"r":[80],"4":[82],"when":[83],"0.99);":[88],"(ii)":[90],"computational":[91],"reliably":[95],"compute":[96],"O(k":[101],"log":[102],"k)":[103],"operations,":[104],"where":[105],"constants":[107],"big":[110],"Oh":[111],"are":[112],"small.":[113],"Our":[114,136],"algorithm":[115,221],"succeeds":[116],"with":[117,120],"high":[118],"probability,":[119],"probability":[122],"failure":[124],"vanishing":[125],"to":[126,173,201,241],"zero":[127],"asymptotically":[128],"number":[131],"acquired,":[134],"M.":[135],"approach":[137],"based":[139,238,245],"on":[140,169,177,246],"filterless":[141],"subsampling":[142,156,167],"small":[150],"set":[151],"carefully":[153],"uniform":[155],"patterns":[157,176],"guided":[158],"by":[159],"Chinese":[161],"Remainder":[162],"Theorem":[163],"(CRT).":[164],"Specifically,":[165],"our":[166,220,231,236,275],"operation":[168],"designed":[172],"create":[174],"aliasing":[175],"\"look":[182],"like\"":[183],"parity-check":[184],"constraints":[185],"good":[187],"erasure-correcting":[188],"sparse-graph":[189,205,243],"codes.":[190],"We":[191,217,266],"show":[192],"how":[193],"computing":[194],"sparse":[196],"equivalent":[200],"decoding":[202,215],"these":[204],"codes":[206,244],"low":[209],"both":[211],"complexity.":[216],"accordingly":[218],"dub":[219],"FFAST":[223,285],"(Fast":[224],"Aliasing-based":[226],"Sparse":[227],"Transform)":[228],"algorithm.":[229,286],"In":[230],"analysis,":[232],"rigorously":[234],"connect":[235],"CRT":[237],"graph":[239],"constructions":[240],"random":[242],"balls-and-bins":[248],"model":[249],"analyze":[251],"convergence":[253],"behavior":[254],"latter":[257],"well-studied":[259],"density":[260],"evolution":[261],"techniques":[262],"from":[263],"coding":[264],"theory.":[265],"provide":[267],"simulation":[268],"results":[269],"Section":[271],"IV":[272],"corroborate":[274],"theoretical":[276],"findings,":[277],"validate":[279],"empirical":[281],"performance":[282]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":8}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}