{"id":"https://openalex.org/W2152388061","doi":"https://doi.org/10.1109/jstsp.2009.2039657","title":"Memory-Constrained Tree Search Detection and New Ordering Schemes","display_name":"Memory-Constrained Tree Search Detection and New Ordering Schemes","publication_year":2009,"publication_date":"2009-12-01","ids":{"openalex":"https://openalex.org/W2152388061","doi":"https://doi.org/10.1109/jstsp.2009.2039657","mag":"2152388061"},"language":"en","primary_location":{"id":"doi:10.1109/jstsp.2009.2039657","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jstsp.2009.2039657","pdf_url":null,"source":{"id":"https://openalex.org/S42167783","display_name":"IEEE Journal of Selected Topics in Signal Processing","issn_l":"1932-4553","issn":["1932-4553","1941-0484"],"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 Journal of Selected Topics in Signal Processing","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/A5108212013","display_name":"Yongmei Dai","orcid":null},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yongmei Dai","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101582861","display_name":"Zhiyuan Yan","orcid":"https://orcid.org/0000-0003-2286-2771"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhiyuan Yan","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I186143895"],"apc_list":null,"apc_paid":null,"fwci":3.7015,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.92955919,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"3","issue":"6","first_page":"1026","last_page":"1037"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9994999766349792,"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.9962000250816345,"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/computational-complexity-theory","display_name":"Computational complexity theory","score":0.7744212746620178},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7321287989616394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5879430770874023},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5878793001174927},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4911660850048065},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4801168441772461},{"id":"https://openalex.org/keywords/qr-decomposition","display_name":"QR decomposition","score":0.4524385929107666},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18595975637435913}],"concepts":[{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.7744212746620178},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7321287989616394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5879430770874023},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5878793001174927},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4911660850048065},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4801168441772461},{"id":"https://openalex.org/C188060507","wikidata":"https://www.wikidata.org/wiki/Q653242","display_name":"QR decomposition","level":3,"score":0.4524385929107666},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18595975637435913},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/jstsp.2009.2039657","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jstsp.2009.2039657","pdf_url":null,"source":{"id":"https://openalex.org/S42167783","display_name":"IEEE Journal of Selected Topics in Signal Processing","issn_l":"1932-4553","issn":["1932-4553","1941-0484"],"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 Journal of Selected Topics in Signal Processing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1683834415","https://openalex.org/W1934949969","https://openalex.org/W2006789412","https://openalex.org/W2013586629","https://openalex.org/W2054620919","https://openalex.org/W2098007188","https://openalex.org/W2103005479","https://openalex.org/W2106345859","https://openalex.org/W2111626380","https://openalex.org/W2112772743","https://openalex.org/W2116536782","https://openalex.org/W2116631972","https://openalex.org/W2118425896","https://openalex.org/W2121322812","https://openalex.org/W2127359267","https://openalex.org/W2130664336","https://openalex.org/W2134760266","https://openalex.org/W2138293524","https://openalex.org/W2140940105","https://openalex.org/W2141451835","https://openalex.org/W2147031540","https://openalex.org/W2148907454","https://openalex.org/W2156787051","https://openalex.org/W2160423353","https://openalex.org/W2160897074","https://openalex.org/W2171470636","https://openalex.org/W2541204438","https://openalex.org/W2798909945","https://openalex.org/W6675492391","https://openalex.org/W6676435401","https://openalex.org/W6680205502","https://openalex.org/W6681720923"],"related_works":["https://openalex.org/W1485846902","https://openalex.org/W3037218165","https://openalex.org/W1980464854","https://openalex.org/W2982181895","https://openalex.org/W2161045342","https://openalex.org/W2142609060","https://openalex.org/W2943002782","https://openalex.org/W2005169228","https://openalex.org/W2586951184","https://openalex.org/W1971246756"],"abstract_inverted_index":{"Hardware":[0],"implementations":[1],"of":[2,22,134,170],"tree":[3,33,65,171],"search-based":[4,34,172],"multiple-input":[5],"multiple-output":[6],"(MIMO)":[7],"detection":[8,25,35,174],"often":[9],"have":[10],"limited":[11],"performance":[12,41],"due":[13],"to":[14,86,121,150,211,229],"large":[15],"memory":[16,45,89,100,109,127,141],"requirement":[17,101],"or":[18],"high":[19],"computational":[20,50,97,132,157,168,214],"complexity":[21,98,133,158,169,215],"sophisticated":[23],"MIMO":[24],"algorithms.":[26,80],"In":[27],"this":[28,53],"paper,":[29],"we":[30,55,61,176],"propose":[31,62,177],"new":[32],"algorithms":[36],"that":[37,69,181,206],"achieve":[38],"maximum-likelihood":[39],"(ML)":[40],"under":[42],"any":[43,87],"given":[44],"constraints":[46],"and":[47,78,91,99,190,198,219,222],"with":[48],"reduced":[49,212],"complexity.":[51],"To":[52,164],"end,":[54],"make":[56],"two":[57],"main":[58],"contributions.":[59],"First,":[60],"a":[63,93],"memory-constrained":[64],"search":[66],"(MCTS)":[67],"algorithm":[68,83,118,137,147],"bridges":[70],"the":[71,74,104,108,114,122,126,130,140,151,167,187,195,199,217,223],"gap":[72],"between":[73,96],"sphere":[75],"decoding":[76],"(SD)":[77],"stack":[79,152],"Our":[81],"MCTS":[82,117,136,146,220],"dynamically":[84],"adapts":[85],"pre-specified":[88],"constraint":[90],"offers":[92],"graceful":[94],"tradeoff":[95],"while":[102],"maintaining":[103],"ML":[105,173],"performance.":[106],"When":[107,139],"size":[110,128,142],"is":[111,119,148,225],"set":[112],"as":[113],"minimum,":[115],"our":[116,135,145,207],"similar":[120,149,155],"SD":[123,218],"algorithm.":[124],"As":[125],"increases,":[129],"average":[131,156,213],"decreases.":[138],"becomes":[143],"large,":[144],"algorithm,":[153],"having":[154],"but":[159],"requiring":[160],"significantly":[161],"less":[162],"memory.":[163],"further":[165],"reduce":[166],"algorithms,":[175,221],"novel":[178],"ordering":[179,208],"schemes":[180,209],"can":[182],"be":[183],"easily":[184],"embedded":[185],"in":[186],"QR":[188],"decomposition":[189],"take":[191],"into":[192],"account":[193],"both":[194],"channel":[196],"matrix":[197],"received":[200],"signal":[201],"(noise);":[202],"simulation":[203],"results":[204],"show":[205],"lead":[210],"for":[216],"reduction":[224],"significant":[226],"at":[227],"low":[228],"medium":[230],"signal-to-noise":[231],"ratio":[232],"region.":[233]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}