{"id":"https://openalex.org/W2002658497","doi":"https://doi.org/10.1109/glocom.2011.6133967","title":"A General MIMO Detection Scheme and Its Performance-Complexity Tradeoff","display_name":"A General MIMO Detection Scheme and Its Performance-Complexity Tradeoff","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2002658497","doi":"https://doi.org/10.1109/glocom.2011.6133967","mag":"2002658497"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2011.6133967","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2011.6133967","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","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/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"],"is_corresponding":true,"raw_author_name":"R. Y. Chang","raw_affiliation_strings":["Research Center for Information Technology Innovation, Academia Sinica, Taiwan","Research Center for Information Technology Innovation, Taipei, Taiwan"],"affiliations":[{"raw_affiliation_string":"Research Center for Information Technology Innovation, Academia Sinica, Taiwan","institution_ids":["https://openalex.org/I4210086894"]},{"raw_affiliation_string":"Research Center for Information Technology Innovation, Taipei, Taiwan","institution_ids":["https://openalex.org/I4210086894"]}]},{"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/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"],"is_corresponding":false,"raw_author_name":"Wei-Ho Chung","raw_affiliation_strings":["Research Center for Information Technology Innovation, Academia Sinica, Taiwan","Research Center for Information Technology Innovation, Taipei, Taiwan"],"affiliations":[{"raw_affiliation_string":"Research Center for Information Technology Innovation, Academia Sinica, Taiwan","institution_ids":["https://openalex.org/I4210086894"]},{"raw_affiliation_string":"Research Center for Information Technology Innovation, Taipei, Taiwan","institution_ids":["https://openalex.org/I4210086894"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052576795"],"corresponding_institution_ids":["https://openalex.org/I4210086894"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07460114,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9991000294685364,"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.9991000294685364,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9988999962806702,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7749313116073608},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7377776503562927},{"id":"https://openalex.org/keywords/mimo","display_name":"MIMO","score":0.707531213760376},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6371095180511475},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6124239563941956},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.602379560470581},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.6021541357040405},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44308993220329285},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3840786814689636},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.34191393852233887},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2230590581893921},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15558135509490967},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.08664602041244507}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7749313116073608},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7377776503562927},{"id":"https://openalex.org/C207987634","wikidata":"https://www.wikidata.org/wiki/Q176862","display_name":"MIMO","level":3,"score":0.707531213760376},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6371095180511475},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6124239563941956},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.602379560470581},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.6021541357040405},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44308993220329285},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3840786814689636},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.34191393852233887},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2230590581893921},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15558135509490967},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.08664602041244507},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/glocom.2011.6133967","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2011.6133967","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.679.1040","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.679.1040","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/1973-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":16,"referenced_works":["https://openalex.org/W1683834415","https://openalex.org/W1991974754","https://openalex.org/W2004733253","https://openalex.org/W2013586629","https://openalex.org/W2050308627","https://openalex.org/W2062378043","https://openalex.org/W2111613656","https://openalex.org/W2111626380","https://openalex.org/W2116598382","https://openalex.org/W2152388061","https://openalex.org/W2156787051","https://openalex.org/W2160897074","https://openalex.org/W2319890895","https://openalex.org/W2432517183","https://openalex.org/W3127111995","https://openalex.org/W6676435401"],"related_works":["https://openalex.org/W2379764279","https://openalex.org/W2360924501","https://openalex.org/W2766237626","https://openalex.org/W2372895815","https://openalex.org/W2167833628","https://openalex.org/W2349474539","https://openalex.org/W2366583813","https://openalex.org/W4224872188","https://openalex.org/W4285223123","https://openalex.org/W4386970495"],"abstract_inverted_index":{"A":[0],"unified":[1],"tree-search":[2],"detection":[3,27],"scheme":[4],"based":[5],"on":[6],"Dijkstra's":[7,20],"algorithm":[8,21,35,67],"is":[9],"developed":[10],"for":[11],"MIMO":[12],"systems.":[13],"The":[14],"proposed":[15,66],"framework":[16],"generalizes":[17],"the":[18,24,34,65],"original":[19],"by":[22],"allowing":[23],"memory":[25],"usage,":[26],"complexity,":[28],"and":[29,49],"sorting":[30],"dynamic":[31],"associated":[32],"with":[33],"to":[36,57,70],"be":[37,55],"customized.":[38],"By":[39],"tuning":[40],"different":[41],"parameters,":[42],"desired":[43],"performance-":[44,74],"complexity":[45,52,75],"tradeoffs":[46],"are":[47],"attained":[48],"a":[50],"fixed-":[51],"version":[53],"can":[54],"produced":[56],"facilitate":[58],"hardware":[59],"implementation.":[60],"Simulation":[61],"results":[62],"demonstrate":[63],"that":[64],"shows":[68],"abilities":[69],"achieve":[71],"highly":[72],"favorable":[73],"tradeoffs.":[76]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}