{"id":"https://openalex.org/W2116598382","doi":"https://doi.org/10.1109/icc.2011.5962688","title":"Efficient Tree-Search MIMO Detection with Probabilistic Node Ordering","display_name":"Efficient Tree-Search MIMO Detection with Probabilistic Node Ordering","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2116598382","doi":"https://doi.org/10.1109/icc.2011.5962688","mag":"2116598382"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2011.5962688","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2011.5962688","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Communications (ICC)","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/A5052576795","display_name":"Ronald Y. Chang","orcid":"https://orcid.org/0000-0003-4620-6824"},"institutions":[{"id":"https://openalex.org/I29955533","display_name":"Center for Information Technology","ror":"https://ror.org/03jh5a977","country_code":"US","type":"facility","lineage":["https://openalex.org/I1299022934","https://openalex.org/I1299303238","https://openalex.org/I29955533"]},{"id":"https://openalex.org/I4210086894","display_name":"Research Center for Information Technology Innovation, Academia Sinica","ror":"https://ror.org/000zgvm20","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210086894","https://openalex.org/I84653119"]}],"countries":["TW","US"],"is_corresponding":false,"raw_author_name":"Ronald Y. Chang","raw_affiliation_strings":["Research Center of Information Technology Innovation, Academia Sinica, Taiwan","Res. Center for Inf. Technol. Innovation, Acad. Sinica, Taipei, Taiwan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Center of Information Technology Innovation, Academia Sinica, Taiwan","institution_ids":["https://openalex.org/I4210086894"]},{"raw_affiliation_string":"Res. Center for Inf. Technol. Innovation, Acad. Sinica, Taipei, Taiwan#TAB#","institution_ids":["https://openalex.org/I29955533"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035844880","display_name":"Wei\u2010Ho Chung","orcid":"https://orcid.org/0000-0002-3041-7398"},"institutions":[{"id":"https://openalex.org/I29955533","display_name":"Center for Information Technology","ror":"https://ror.org/03jh5a977","country_code":"US","type":"facility","lineage":["https://openalex.org/I1299022934","https://openalex.org/I1299303238","https://openalex.org/I29955533"]},{"id":"https://openalex.org/I4210086894","display_name":"Research Center for Information Technology Innovation, Academia Sinica","ror":"https://ror.org/000zgvm20","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210086894","https://openalex.org/I84653119"]}],"countries":["TW","US"],"is_corresponding":false,"raw_author_name":"Wei-Ho Chung","raw_affiliation_strings":["Research Center of Information Technology Innovation, Academia Sinica, Taiwan","Res. Center for Inf. Technol. Innovation, Acad. Sinica, Taipei, Taiwan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Center of Information Technology Innovation, Academia Sinica, Taiwan","institution_ids":["https://openalex.org/I4210086894"]},{"raw_affiliation_string":"Res. Center for Inf. Technol. Innovation, Acad. Sinica, Taipei, Taiwan#TAB#","institution_ids":["https://openalex.org/I29955533"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7586,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.87431376,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"57","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9864000082015991,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9864000082015991,"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/T10521","display_name":"RNA and protein synthesis mechanisms","score":0.9829999804496765,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9794999957084656,"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/sorting","display_name":"Sorting","score":0.6864373683929443},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6810010671615601},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.64311283826828},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.596297025680542},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5422194600105286},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5115369558334351},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.48734840750694275},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4655417203903198},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4429614543914795},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43698781728744507},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.434016615152359},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4240763187408447},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.42185020446777344},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4166230261325836},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3325827717781067},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31018078327178955},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2891005575656891},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.22486776113510132},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1646389365196228}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6864373683929443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6810010671615601},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.64311283826828},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.596297025680542},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5422194600105286},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5115369558334351},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.48734840750694275},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4655417203903198},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4429614543914795},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43698781728744507},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.434016615152359},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4240763187408447},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.42185020446777344},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4166230261325836},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3325827717781067},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31018078327178955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2891005575656891},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.22486776113510132},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1646389365196228},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icc.2011.5962688","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2011.5962688","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.679.2771","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.679.2771","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.citi.sinica.edu.tw/papers/whc/3016-F.pdf","raw_type":"text"}],"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/W1683834415","https://openalex.org/W2004733253","https://openalex.org/W2050308627","https://openalex.org/W2062378043","https://openalex.org/W2111613656","https://openalex.org/W2111626380","https://openalex.org/W2432517183","https://openalex.org/W2917308058","https://openalex.org/W3100867750","https://openalex.org/W3127111995","https://openalex.org/W4239146293","https://openalex.org/W6676435401","https://openalex.org/W6947679438"],"related_works":["https://openalex.org/W2081821176","https://openalex.org/W2402589461","https://openalex.org/W1548704524","https://openalex.org/W2166539025","https://openalex.org/W3097309452","https://openalex.org/W2962893049","https://openalex.org/W2131923625","https://openalex.org/W4322703856","https://openalex.org/W2890346000","https://openalex.org/W1971267722"],"abstract_inverted_index":{"The":[0,104,125],"tree":[1,29,38,44],"representation":[2],"of":[3,16,37,80,95,119,127],"the":[4,11,24,56,60,71,78,92,96,107,111,120,128,137,141,158],"MIMO":[5],"detection":[6,18,148],"problem":[7],"is":[8,53,87,114,131],"illuminating":[9],"for":[10],"development,":[12],"interpretation,":[13],"and":[14,46,110,116,150],"classification":[15],"various":[17],"methods.":[19],"One":[20],"method,":[21,51],"based":[22],"on":[23],"Dijkstra's":[25],"search":[26],"algorithm,":[27,73],"pursues":[28],"exploration":[30,45],"according":[31,64],"to":[32,55,65,99,157],"a":[33,82],"bounded,":[34],"sorted":[35],"list":[36],"nodes.":[39],"Since":[40],"sorting":[41,63,85,109,122],"directly":[42],"affects":[43],"truncation":[47],"in":[48,70,145],"this":[49],"tree-search":[50,143,160],"it":[52],"critical":[54],"performance.":[57],"Motivated":[58],"by":[59,89,133],"observation":[61],"that":[62],"nodes'":[66],"path":[67,97],"metric,":[68],"as":[69],"conventional":[72,112],"does":[74],"not":[75],"adequately":[76],"represent":[77],"\"goodness\"":[79],"nodes,":[81],"new":[83,117,138],"probabilistic":[84,108,121],"rule":[86],"developed":[88],"innovatively":[90],"exploiting":[91],"statistical":[93],"properties":[94],"metric":[98],"yield":[100],"more":[101],"effective":[102],"sorting.":[103],"relationship":[105],"between":[106],"one":[113],"established,":[115],"features":[118],"are":[123],"presented.":[124],"effectiveness":[126],"proposed":[129],"method":[130,139,144],"demonstrated":[132],"computer":[134],"simulation,":[135],"where":[136],"outperforms":[140],"previous":[142,159],"achieving":[146],"near-ML":[147],"performance,":[149],"meanwhile":[151],"offers":[152],"significant":[153],"complexity":[154],"reduction":[155],"compared":[156],"method.":[161]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}