{"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":"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/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":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":13.5816,"has_fulltext":false,"cited_by_count":64,"citation_normalized_percentile":{"value":0.98965847,"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,104,173],"signal":[4,105,174],"x,":[5],"it":[6],"is":[7,32,53,78,166,199,227,236],"well":[8],"known":[9],"that":[10,45,209,301],"its":[11],"Discrete":[12],"Fourier":[13,26,253],"Transform":[14],"(DFT),":[15],"X,":[16],"can":[17,39,82,122],"be":[18],"computed":[19],"in":[20,47,55,86,136,157,238,298],"O(nlogn)":[21],"complexity":[22,241],"using":[23,128,176,286],"a":[24,177,275],"Fast":[25],"Transform.":[27],"If":[28],"the":[29,71,74,103,125,134,137,149,158,172,188,206,223,250,280,284,308,312],"spectrum":[30,207],"X":[31,127,208,226],"exactly":[33],"k-sparse":[34],"(where":[35,107],"k":[36,48,52,58],"<;<;":[37],"n),":[38],"we":[40,81,93,121,261],"do":[41],"better?":[42],"We":[43,219,245,294],"show":[44,220],"asymptotically":[46,156],"and":[49,70,117,235,242,278,306],"n,":[50],"when":[51,111],"sub-linear":[54],"n":[56,60],"(i.e.,":[57],"\u221d":[59],"<sup":[61],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[62],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u03b4</sup>":[63],"where":[64,133],"0":[65,112],"<;":[66,68,109,113,115],"\u03b4":[67,114],"1),":[69],"support":[72],"of":[73,102,151,160,171,180,214,231,283,311],"non-zero":[75],"DFT":[76,126,225],"coefficients":[77],"uniformly":[79],"random,":[80],"exploit":[83],"this":[84],"sparsity":[85],"two":[87],"fundamental":[88],"ways":[89],"(i)":[90],"sample":[91,240],"complexity:":[92,120],"need":[94],"only":[95],"M":[96],"=":[97],"rk":[98],"deterministically":[99],"chosen":[100,182],"samples":[101,161],"x":[106,175,198],"r":[108],"4":[110],"0.99);":[116],"(ii)":[118],"computational":[119],"reliably":[123],"compute":[124],"O(k":[129],"log":[130],"k)":[131],"operations,":[132],"constants":[135],"big":[138],"Oh":[139],"are":[140],"small.":[141],"Our":[142,164],"algorithm":[143,249],"succeeds":[144],"with":[145,148],"high":[146],"probability,":[147],"probability":[150],"failure":[152],"vanishing":[153],"to":[154,201,229,269],"zero":[155],"number":[159],"acquired,":[162],"M.":[163],"approach":[165],"based":[167,266,273],"on":[168,197,205,274],"filterless":[169],"subsampling":[170,184,195],"small":[178],"set":[179],"carefully":[181],"uniform":[183],"patterns":[185,204],"guided":[186],"by":[187],"Chinese":[189],"Remainder":[190],"Theorem":[191],"(CRT).":[192],"Specifically,":[193],"our":[194,248,259,264,303],"operation":[196],"designed":[200],"create":[202],"aliasing":[203],"\"look":[210],"like\"":[211],"parity-check":[212],"constraints":[213],"good":[215],"erasure-correcting":[216],"sparse-graph":[217,233,271],"codes.":[218],"how":[221],"computing":[222],"sparse":[224],"equivalent":[228],"decoding":[230,243],"these":[232],"codes":[234,272],"low":[237],"both":[239],"complexity.":[244],"accordingly":[246],"dub":[247],"FFAST":[251,313],"(Fast":[252],"Aliasing-based":[254],"Sparse":[255],"Transform)":[256],"algorithm.":[257,314],"In":[258],"analysis,":[260],"rigorously":[262],"connect":[263],"CRT":[265],"graph":[267],"constructions":[268],"random":[270],"balls-and-bins":[276],"model":[277],"analyze":[279],"convergence":[281],"behavior":[282],"latter":[285],"well-studied":[287],"density":[288],"evolution":[289],"techniques":[290],"from":[291],"coding":[292],"theory.":[293],"provide":[295],"simulation":[296],"results":[297],"Section":[299],"IV":[300],"corroborate":[302],"theoretical":[304],"findings,":[305],"validate":[307],"empirical":[309],"performance":[310]},"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-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}