{"id":"https://openalex.org/W2051374549","doi":"https://doi.org/10.1109/ciss.2008.4558671","title":"Memory-constrained ML-optimal tree search detection","display_name":"Memory-constrained ML-optimal tree search detection","publication_year":2008,"publication_date":"2008-03-01","ids":{"openalex":"https://openalex.org/W2051374549","doi":"https://doi.org/10.1109/ciss.2008.4558671","mag":"2051374549"},"language":"en","primary_location":{"id":"doi:10.1109/ciss.2008.4558671","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2008.4558671","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 42nd Annual Conference on Information Sciences and Systems","raw_type":"proceedings-article"},"type":"conference-paper","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, PA, USA","Dept. of Electr. & Comput. Eng., Lehigh Univ., Lehigh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, PA, USA","institution_ids":["https://openalex.org/I186143895"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Lehigh Univ., Lehigh, PA","institution_ids":["https://openalex.org/I186143895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102760713","display_name":"Zhiyuan Yan","orcid":"https://orcid.org/0009-0002-7242-5828"},"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, PA, USA","Dept. of Electr. & Comput. Eng., Lehigh Univ., Lehigh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Lehigh University, PA, USA","institution_ids":["https://openalex.org/I186143895"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Lehigh Univ., Lehigh, PA","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":2.3722,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.87080809,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":null,"first_page":"1037","last_page":"1041"},"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.9986000061035156,"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.9983999729156494,"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/computer-science","display_name":"Computer science","score":0.7720874547958374},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5566427111625671},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5551950335502625},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5303918719291687},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.5172879695892334},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5093377828598022},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41599246859550476},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15826719999313354},{"id":"https://openalex.org/keywords/semiconductor-memory","display_name":"Semiconductor memory","score":0.13135036826133728}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7720874547958374},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5566427111625671},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5551950335502625},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5303918719291687},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.5172879695892334},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5093377828598022},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41599246859550476},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15826719999313354},{"id":"https://openalex.org/C98986596","wikidata":"https://www.wikidata.org/wiki/Q1143031","display_name":"Semiconductor memory","level":2,"score":0.13135036826133728},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ciss.2008.4558671","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2008.4558671","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 42nd Annual Conference on Information Sciences and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1683834415","https://openalex.org/W1934949969","https://openalex.org/W2013586629","https://openalex.org/W2032412427","https://openalex.org/W2054620919","https://openalex.org/W2103005479","https://openalex.org/W2116536782","https://openalex.org/W2116631972","https://openalex.org/W2118425896","https://openalex.org/W2138293524","https://openalex.org/W2140940105","https://openalex.org/W2148907454"],"related_works":["https://openalex.org/W2161474341","https://openalex.org/W4302615923","https://openalex.org/W1974101135","https://openalex.org/W3203142394","https://openalex.org/W2351061015","https://openalex.org/W4220731478","https://openalex.org/W2017509870","https://openalex.org/W4251141768","https://openalex.org/W2542937328","https://openalex.org/W4360952157"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,23],"memory-constrained":[6],"tree":[7],"search":[8],"(MCTS)":[9],"algorithm":[10,21,50,67,82,101],"for":[11],"the":[12,39,45,48,65,78,84,99,103],"detection":[13],"in":[14,61,83,102],"multiple-input":[15],"multiple-output":[16],"(MIMO)":[17],"systems.":[18],"The":[19],"MCTS":[20,49,66],"offers":[22],"wide":[24],"range":[25],"of":[26,91],"trade-offs":[27],"between":[28],"computational":[29],"complexity":[30],"and":[31,34,72,87,93],"memory":[32,46,76,97],"requirement,":[33],"is":[35],"guaranteed":[36],"to":[37,55],"achieve":[38],"exact":[40],"maximum-likelihood":[41],"performance.":[42],"By":[43],"tuning":[44],"size,":[47],"ranges":[51],"from":[52],"being":[53,56],"memory-efficient":[54,85],"computation-efficient":[57,104],"with":[58],"abundant":[59],"choices":[60],"between.We":[62],"show":[63],"that":[64],"visits":[68,88],"slightly":[69,74],"fewer":[70],"nodes":[71,92],"requires":[73,94],"less":[75,96],"than":[77,98],"sphere":[79],"decoding":[80],"(SD)":[81],"case,":[86],"similar":[89],"number":[90],"significantly":[95],"stack":[100],"case.":[105]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}