{"id":"https://openalex.org/W2086890109","doi":"https://doi.org/10.1109/isit.2014.6875154","title":"A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes","display_name":"A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2086890109","doi":"https://doi.org/10.1109/isit.2014.6875154","mag":"2086890109"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6875154","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 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":["Dept. of EECS, University of California, Berkeley","Dept. of EECS, Univ. of California-Berkeley, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of EECS, University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Dept. of EECS, Univ. of California-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":["Dept. of EECS, University of California, Berkeley","Dept. of EECS, Univ. of California-Berkeley, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of EECS, University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Dept. of EECS, Univ. of California-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":4.3123,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.94900165,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9998999834060669,"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.9998999834060669,"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/T12131","display_name":"Wireless Signal Modulation Classification","score":0.9957000017166138,"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"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9954000115394592,"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/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.6491894721984863},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5210627913475037},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5191116333007812},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.4798135757446289},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42121466994285583},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.369013249874115},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.3649086356163025},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3600701093673706},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35047370195388794},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.17942339181900024},{"id":"https://openalex.org/keywords/short-time-fourier-transform","display_name":"Short-time Fourier transform","score":0.12143763899803162},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10949632525444031}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.6491894721984863},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5210627913475037},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5191116333007812},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.4798135757446289},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42121466994285583},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.369013249874115},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.3649086356163025},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3600701093673706},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35047370195388794},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.17942339181900024},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.12143763899803162},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10949632525444031}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2014.6875154","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W2012365979","https://openalex.org/W2031425559","https://openalex.org/W2107625832","https://openalex.org/W2112094394","https://openalex.org/W2113638573","https://openalex.org/W2127271355","https://openalex.org/W2128131274","https://openalex.org/W2129131372","https://openalex.org/W2145096794","https://openalex.org/W2146509513","https://openalex.org/W2158537680","https://openalex.org/W2773550080","https://openalex.org/W2963302510","https://openalex.org/W4250955649"],"related_works":["https://openalex.org/W2095636570","https://openalex.org/W1966131088","https://openalex.org/W2181738541","https://openalex.org/W2029394316","https://openalex.org/W1990333983","https://openalex.org/W2083788924","https://openalex.org/W2152751081","https://openalex.org/W1481532171","https://openalex.org/W2137148376","https://openalex.org/W1967374108"],"abstract_inverted_index":{"The":[0],"Fast":[1],"Fourier":[2,15,99],"Transform":[3,16],"(FFT)":[4],"is":[5],"the":[6,13,33,37,67,83,106],"most":[7],"efficiently":[8],"known":[9],"way":[10],"to":[11],"compute":[12],"Discrete":[14],"(DFT)":[17],"of":[18,28,36,66],"an":[19,96],"arbitrary":[20],"n-length":[21],"signal,":[22],"and":[23,71],"has":[24,40],"a":[25,62,102],"computational":[26],"complexity":[27],"O(n":[29,50],"log":[30,51],"n).":[31],"If":[32],"DFT":[34,69,108],"X\u20d7":[35],"signal":[38],"x\u20d7":[39],"only":[41],"k":[42],"non-zero":[43,68],"coefficients":[44,70],"(where":[45],"k1noise-corrupted":[46],"time-domain":[47],"samples,":[48],"in":[49],"n)":[52],"computations2.":[53],"While":[54],"our":[55],"theoretical":[56],"results":[57,79],"are":[58],"for":[59,89,105],"signals":[60,90],"with":[61,101],"uniformly":[63],"random":[64],"support":[65,104],"additive":[72],"white":[73],"Gaussian":[74],"noise,":[75],"we":[76],"provide":[77],"simulation":[78],"which":[80],"demonstrates":[81],"that":[82,94],"R-FFAST":[84],"algorithm":[85],"performs":[86],"well":[87],"even":[88],"like":[91],"MR":[92],"images,":[93],"have":[95],"approximately":[97],"sparse":[98],"spectrum":[100],"non-uniform":[103],"dominant":[107],"coefficients.":[109]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-14T07:06:38.338062","created_date":"2025-10-10T00:00:00"}