{"id":"https://openalex.org/W1655136192","doi":"https://doi.org/10.1109/isit.2015.7282921","title":"Robust sublinear complexity Walsh-Hadamard transform with arbitrary sparse support","display_name":"Robust sublinear complexity Walsh-Hadamard transform with arbitrary sparse support","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1655136192","doi":"https://doi.org/10.1109/isit.2015.7282921","mag":"1655136192"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282921","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282921","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","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/A5100385726","display_name":"Xu Chen","orcid":"https://orcid.org/0000-0002-6010-320X"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xu Chen","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Northwestern University, USA","Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, 60208, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Northwestern University, USA","institution_ids":["https://openalex.org/I111979921"]},{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, 60208, USA","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081342685","display_name":"Dongning Guo","orcid":"https://orcid.org/0000-0001-9000-3480"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dongning Guo","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Northwestern University, USA","Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, 60208, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Northwestern University, USA","institution_ids":["https://openalex.org/I111979921"]},{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, 60208, USA","institution_ids":["https://openalex.org/I111979921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100385726"],"corresponding_institution_ids":["https://openalex.org/I111979921"],"apc_list":null,"apc_paid":null,"fwci":0.9864,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.78477172,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2573","last_page":"2577"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998999834060669,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9998000264167786,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6934692859649658},{"id":"https://openalex.org/keywords/hadamard-transform","display_name":"Hadamard transform","score":0.6017590165138245},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5716981887817383},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.460137277841568},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44247156381607056},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.437601238489151},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42980048060417175},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4135953485965729},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3612120449542999},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3546628952026367},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09998694062232971}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6934692859649658},{"id":"https://openalex.org/C60292330","wikidata":"https://www.wikidata.org/wiki/Q1014065","display_name":"Hadamard transform","level":2,"score":0.6017590165138245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5716981887817383},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.460137277841568},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44247156381607056},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.437601238489151},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42980048060417175},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4135953485965729},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3612120449542999},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3546628952026367},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09998694062232971},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2015.7282921","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282921","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","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":13,"referenced_works":["https://openalex.org/W1536930200","https://openalex.org/W1965084720","https://openalex.org/W1974131077","https://openalex.org/W1992209321","https://openalex.org/W2000096140","https://openalex.org/W2046115679","https://openalex.org/W2076762350","https://openalex.org/W2116962375","https://openalex.org/W2134809980","https://openalex.org/W2395231588","https://openalex.org/W2526265786","https://openalex.org/W2963213854","https://openalex.org/W4242004838"],"related_works":["https://openalex.org/W2027624900","https://openalex.org/W1769967269","https://openalex.org/W2963903795","https://openalex.org/W2008470896","https://openalex.org/W2039347386","https://openalex.org/W4377371889","https://openalex.org/W1673132890","https://openalex.org/W2952190127","https://openalex.org/W3109861677","https://openalex.org/W2113623403"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"algorithms":[5,27],"for":[6],"computing":[7],"Walsh-Hadamard":[8],"transform":[9],"with":[10,175],"arbitrary":[11],"K-sparse":[12],"support.":[13],"When":[14],"K":[15,33,62,97,108],"is":[16,56,86,128],"sublinear":[17,39,176],"in":[18,120],"the":[19,23,26,44,72,76,83,116,131,154,158,172],"dimension":[20],"N":[21],"of":[22,71,157],"time-domain":[24],"signal,":[25],"achieve":[28],"vanishing":[29],"error":[30],"probability":[31],"as":[32],"increases":[34],"without":[35],"bound":[36],"and":[37,53,101],"involve":[38],"computational":[40],"complexity.":[41,177],"Specifically,":[42],"under":[43],"noiseless":[45],"setting,":[46,78],"an":[47],"algorithm":[48,81,114],"based":[49],"on":[50,66,153],"random":[51,132],"hashing":[52,133],"successive":[54],"cancellation":[55],"proposed,":[57,88],"where":[58],"O":[59,91,102],"(K":[60,92,103],"log":[61,63,68,93,98,104,109],"N/K)":[64,69,99,110],"operations":[65,100],"O(K":[67],"samples":[70],"signal":[73,174],"suffice.":[74],"Under":[75],"noisy":[77],"a":[79,138,143],"fast":[80],"using":[82],"same":[84],"framework":[85],"also":[87],"which":[89],"needs":[90],"<sup":[94,105],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[95,106],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">3</sup>":[96],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[107],"samples.":[111],"The":[112,125],"latter":[113],"reduces":[115],"complexity":[117],"from":[118],"superlinear":[119],"existing":[121],"work":[122],"to":[123,129,135,165,170],"sublinear.":[124],"enabling":[126],"idea":[127],"relate":[130],"design":[134],"coding":[136],"over":[137],"binary":[139],"symmetric":[140],"channel":[141],"or":[142],"binary-input":[144],"additive":[145],"white":[146],"Gaussian":[147],"noise":[148,155],"channel,":[149],"whose":[150],"quality":[151],"depends":[152],"level":[156],"observations.":[159],"Such":[160],"inherent":[161],"connection":[162],"allows":[163],"us":[164],"leverage":[166],"well-established":[167],"capacity-approaching":[168],"codes":[169],"obtain":[171],"transform-domain":[173]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}