{"id":"https://openalex.org/W2121551448","doi":"https://doi.org/10.1109/tvt.2011.2160464","title":"Hybrid Tree Search Algorithms for Detection in Spatial Multiplexing Systems","display_name":"Hybrid Tree Search Algorithms for Detection in Spatial Multiplexing Systems","publication_year":2011,"publication_date":"2011-06-28","ids":{"openalex":"https://openalex.org/W2121551448","doi":"https://doi.org/10.1109/tvt.2011.2160464","mag":"2121551448"},"language":"en","primary_location":{"id":"doi:10.1109/tvt.2011.2160464","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvt.2011.2160464","pdf_url":null,"source":{"id":"https://openalex.org/S10936095","display_name":"IEEE Transactions on Vehicular Technology","issn_l":"0018-9545","issn":["0018-9545","1939-9359"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Vehicular Technology","raw_type":"journal-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/A5047361744","display_name":"Kuei-Chiang Lai","orcid":"https://orcid.org/0000-0001-6319-0620"},"institutions":[{"id":"https://openalex.org/I91807558","display_name":"National Cheng Kung University","ror":"https://ror.org/01b8kcc49","country_code":"TW","type":"education","lineage":["https://openalex.org/I91807558"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Kuei-Chiang Lai","raw_affiliation_strings":["Department of Electrical Engineering, Institute of Computer and Communication Engineering, National Cheng Kung University, Tainan, Taiwan","[Dept. of Electr. Eng., Nat. Cheng-Kung Univ., Tainan, Taiwan]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Institute of Computer and Communication Engineering, National Cheng Kung University, Tainan, Taiwan","institution_ids":["https://openalex.org/I91807558"]},{"raw_affiliation_string":"[Dept. of Electr. Eng., Nat. Cheng-Kung Univ., Tainan, Taiwan]","institution_ids":["https://openalex.org/I91807558"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061297129","display_name":"Jiun-Jie Jia","orcid":null},"institutions":[{"id":"https://openalex.org/I91807558","display_name":"National Cheng Kung University","ror":"https://ror.org/01b8kcc49","country_code":"TW","type":"education","lineage":["https://openalex.org/I91807558"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Jiun-Jie Jia","raw_affiliation_strings":["Department of Electrical Engineering, Institute of Computer and Communication Engineering, National Cheng Kung University, Tainan, Taiwan","[Dept. of Electr. Eng., Nat. Cheng-Kung Univ., Tainan, Taiwan]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Institute of Computer and Communication Engineering, National Cheng Kung University, Tainan, Taiwan","institution_ids":["https://openalex.org/I91807558"]},{"raw_affiliation_string":"[Dept. of Electr. Eng., Nat. Cheng-Kung Univ., Tainan, Taiwan]","institution_ids":["https://openalex.org/I91807558"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100383258","display_name":"Liwei Lin","orcid":"https://orcid.org/0000-0001-7083-624X"},"institutions":[{"id":"https://openalex.org/I91807558","display_name":"National Cheng Kung University","ror":"https://ror.org/01b8kcc49","country_code":"TW","type":"education","lineage":["https://openalex.org/I91807558"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Li-Wei Lin","raw_affiliation_strings":["Department of Electrical Engineering, Institute of Computer and Communication Engineering, National Cheng Kung University, Tainan, Taiwan","[Dept. of Electr. Eng., Nat. Cheng-Kung Univ., Tainan, Taiwan]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Institute of Computer and Communication Engineering, National Cheng Kung University, Tainan, Taiwan","institution_ids":["https://openalex.org/I91807558"]},{"raw_affiliation_string":"[Dept. of Electr. Eng., Nat. Cheng-Kung Univ., Tainan, Taiwan]","institution_ids":["https://openalex.org/I91807558"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047361744"],"corresponding_institution_ids":["https://openalex.org/I91807558"],"apc_list":null,"apc_paid":null,"fwci":0.5299,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71536935,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"60","issue":"7","first_page":"3503","last_page":"3509"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9994000196456909,"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.9994000196456909,"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.9968000054359436,"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.9952999949455261,"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/algorithm","display_name":"Algorithm","score":0.7323013544082642},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6538755893707275},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.6287714242935181},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5547093152999878},{"id":"https://openalex.org/keywords/multiplexing","display_name":"Multiplexing","score":0.5523058176040649},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5396933555603027},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.5197219848632812},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.498424768447876},{"id":"https://openalex.org/keywords/spatial-multiplexing","display_name":"Spatial multiplexing","score":0.4950034022331238},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47364890575408936},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.44505321979522705},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44407761096954346},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.443676233291626},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42993324995040894},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.41123971343040466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39554041624069214},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.26589852571487427},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.2257116436958313},{"id":"https://openalex.org/keywords/mimo","display_name":"MIMO","score":0.21967557072639465},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.1371344029903412}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7323013544082642},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6538755893707275},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.6287714242935181},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5547093152999878},{"id":"https://openalex.org/C19275194","wikidata":"https://www.wikidata.org/wiki/Q222903","display_name":"Multiplexing","level":2,"score":0.5523058176040649},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5396933555603027},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5197219848632812},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.498424768447876},{"id":"https://openalex.org/C85884896","wikidata":"https://www.wikidata.org/wiki/Q7574075","display_name":"Spatial multiplexing","level":4,"score":0.4950034022331238},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47364890575408936},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.44505321979522705},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44407761096954346},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.443676233291626},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42993324995040894},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.41123971343040466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39554041624069214},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.26589852571487427},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.2257116436958313},{"id":"https://openalex.org/C207987634","wikidata":"https://www.wikidata.org/wiki/Q176862","display_name":"MIMO","level":3,"score":0.21967557072639465},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.1371344029903412},{"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},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tvt.2011.2160464","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvt.2011.2160464","pdf_url":null,"source":{"id":"https://openalex.org/S10936095","display_name":"IEEE Transactions on Vehicular Technology","issn_l":"0018-9545","issn":["0018-9545","1939-9359"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Vehicular Technology","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1683834415","https://openalex.org/W2063652955","https://openalex.org/W2098249016","https://openalex.org/W2103750818","https://openalex.org/W2115237178","https://openalex.org/W2118425896","https://openalex.org/W2125526602","https://openalex.org/W2131296973","https://openalex.org/W2131387488","https://openalex.org/W2152388061"],"related_works":["https://openalex.org/W2037710955","https://openalex.org/W2008046591","https://openalex.org/W2376570066","https://openalex.org/W1593855989","https://openalex.org/W1967528652","https://openalex.org/W3098335909","https://openalex.org/W96515380","https://openalex.org/W2605620386","https://openalex.org/W2166539025","https://openalex.org/W2354057059"],"abstract_inverted_index":{"Hybrid":[0],"tree":[1,18],"search":[2,17,87],"algorithms":[3,74,112],"are":[4],"described":[5],"for":[6],"maximum-likelihood":[7],"symbol":[8],"detection":[9],"in":[10,22,94,106,122],"spatial":[11],"multiplexing":[12],"(SM)":[13],"systems.":[14],"Essentially,":[15],"the":[16,27,30,38,44,52,55,60,69,72,76,81,84,91,95,107,110,119],"is":[19,35,48],"iteratively":[20],"expanded":[21],"breadth-first":[23],"(BF)":[24],"manner":[25],"until":[26],"probability":[28],"that":[29],"current":[31],"most":[32],"likely":[33],"path":[34],"correct":[36],"exceeds":[37],"specified":[39],"threshold,":[40],"at":[41],"which":[42,65],"point,":[43],"depth-first":[45],"(DF)":[46],"stage":[47,78],"initiated":[49],"to":[50,79],"traverse":[51],"rest":[53],"of":[54,83],"tree.":[56],"In":[57],"contrast":[58],"with":[59,68,102],"sphere":[61],"decoding":[62],"(SD)":[63],"algorithm,":[64],"starts":[66],"off":[67],"DF":[70,86],"search,":[71],"proposed":[73,111],"use":[75],"BF":[77],"enhance":[80],"accuracy":[82],"initial":[85],"direction":[88],"by":[89],"exploiting":[90],"diversity":[92],"inherent":[93],"SM":[96],"scheme.":[97],"Simulation":[98],"results":[99],"demonstrate":[100],"that,":[101],"a":[103,114],"moderate":[104],"increase":[105],"memory":[108],"requirement,":[109],"achieve":[113],"significantly":[115],"lower":[116],"complexity":[117],"than":[118],"SD":[120],"algorithm":[121],"many":[123],"scenarios.":[124]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}