{"id":"https://openalex.org/W2554333597","doi":"https://doi.org/10.1109/allerton.2012.6483460","title":"A hybrid DFT-LDPC framework for fast, efficient and robust compressive sensing","display_name":"A hybrid DFT-LDPC framework for fast, efficient and robust compressive sensing","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W2554333597","doi":"https://doi.org/10.1109/allerton.2012.6483460","mag":"2554333597"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2012.6483460","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2012.6483460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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"],"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"]}]},{"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"],"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"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7999,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.90566187,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"53","issue":null,"first_page":"1943","last_page":"1950"},"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/T11739","display_name":"Microwave Imaging and Scattering Analysis","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T11447","display_name":"Blind Source Separation Techniques","score":0.9984999895095825,"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/compressed-sensing","display_name":"Compressed sensing","score":0.7796639204025269},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6451183557510376},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6262996196746826},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5652016997337341},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.564600944519043},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5123430490493774},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.43204420804977417},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.41019344329833984},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3390198051929474},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3048573434352875},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11474296450614929}],"concepts":[{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.7796639204025269},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6451183557510376},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6262996196746826},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5652016997337341},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.564600944519043},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5123430490493774},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.43204420804977417},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.41019344329833984},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3390198051929474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3048573434352875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11474296450614929},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2012.6483460","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2012.6483460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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":26,"referenced_works":["https://openalex.org/W1635427980","https://openalex.org/W1971402995","https://openalex.org/W1974466705","https://openalex.org/W2029268759","https://openalex.org/W2097323375","https://openalex.org/W2103300762","https://openalex.org/W2107086875","https://openalex.org/W2111855076","https://openalex.org/W2112858600","https://openalex.org/W2113638573","https://openalex.org/W2115104320","https://openalex.org/W2127271355","https://openalex.org/W2128131274","https://openalex.org/W2129638195","https://openalex.org/W2137822056","https://openalex.org/W2140466267","https://openalex.org/W2145096794","https://openalex.org/W2149213383","https://openalex.org/W2158537680","https://openalex.org/W2164452299","https://openalex.org/W2166207339","https://openalex.org/W2296616510","https://openalex.org/W2532988047","https://openalex.org/W2963213854","https://openalex.org/W4250955649","https://openalex.org/W6657651502"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W1531601525","https://openalex.org/W2379256376","https://openalex.org/W2107703637","https://openalex.org/W2381127329","https://openalex.org/W4242191701","https://openalex.org/W3015194228"],"abstract_inverted_index":{"We":[0,224],"use":[1],"a":[2,25,33,54,63,79,91,94,105],"hybrid":[3,50],"mix":[4],"of":[5,44,57,98,101,108,118,134,144,180,189,203,230,240,253,267],"the":[6,67,123,130,137,145,151,173,178,187,201,206,212,219,231,241,265,268,273],"Discrete":[7],"Fourier":[8],"Transform":[9,71],"(DFT),":[10],"an":[11,227,237],"old":[12],"workhorse":[13,27],"in":[14,28,84,172],"digital":[15],"signal":[16,82,147,214],"processing,":[17],"and":[18,61,122,136,153,186,205,221,236,256,277,285],"Low":[19],"Density":[20],"Parity":[21],"Check":[22],"(LDPC)":[23],"codes,":[24],"recent":[26],"coding":[29],"theory,":[30],"to":[31,39],"generate":[32],"linear":[34,102],"measurement":[35,59],"lens":[36],"through":[37],"which":[38,157],"perform":[40],"compressive":[41],"sensing":[42,120,131],"(CS)":[43],"sparse":[45,58],"high-dimensional":[46,80],"signals.":[47],"This":[48,165],"novel":[49],"DFT-LDPC":[51,232],"framework":[52,121,235],"represents":[53],"new":[55],"family":[56],"matrices,":[60],"induces":[62],"fast":[64],"algorithm":[65,126,270],"(dubbed":[66],"Short-and-Wide":[68],"Iterative":[69],"Fast":[70],"based":[72,176,192,233],"or":[73],"SWIFT":[74,124,242,269],"algorithm)":[75],"for":[76,150,196,218,250,257,272],"robustly":[77],"recovering":[78],"k-sparse":[81],"x,":[83],"C":[85],"<sup":[86,169],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[87,170],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sup>":[88],",":[89],"from":[90],"near-optimal":[92],"(upto":[93],"small":[95],"constant":[96],"multiple":[97],"k)":[99],"number":[100,202],"observations,":[103],"with":[104],"decoding":[106,207],"complexity":[107,208],"k":[109,162,282],"steps,":[110],"under":[111],"high":[112,258],"signal-to-noise-ratio":[113],"(SNR).":[114],"A":[115],"key":[116],"attribute":[117],"our":[119,246,261],"recovery":[125,138,243],"is":[127,158,249],"that":[128],"both":[129,197,200,226],"efficiency":[132,139,266],"(number":[133],"measurements)":[135],"(decoding":[140],"complexity)":[141],"are":[142],"independent":[143],"ambient":[146,213],"dimension":[148,215],"n":[149,255,286],"noiseless":[152,220],"high-SNR":[154,222],"noisy":[155],"regimes,":[156],"particularly":[159],"attractive":[160],"when":[161],"<;<;":[163],"n.":[164],"contrasts":[166],"existing":[167],"solutions":[168],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sup>":[171],"CS":[174],"literature":[175],"on":[177,211],"class":[179,188],"Linear":[181],"Programming":[182],"(LP)-based":[183],"optimization":[184],"techniques":[185],"expander":[190],"graph":[191],"greedy-pursuit":[193],"(sketching)":[194],"algorithms;":[195],"these":[198],"classes,":[199],"measurements":[204],"depend":[209],"explicitly":[210],"n,":[216],"even":[217,271],"regimes.":[223],"provide":[225],"explicit":[228],"constructions":[229],"matrix":[234],"analytical":[238,247],"characterization":[239,248],"algorithm.":[244],"Although":[245],"asymptotic":[251],"values":[252],"k,":[254],"SNR":[259,275],"regime,":[260],"simulation":[262],"results":[263],"validate":[264],"low-to-moderate":[274],"regimes":[276],"modest":[278],"problem":[279],"dimensions":[280],"(e.g.,":[281],"=":[283,287],"250":[284],"20000),":[288],"beyond":[289],"what":[290],"we":[291],"can":[292],"currently":[293],"prove":[294],"analytically.":[295]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}