{"id":"https://openalex.org/W2533831123","doi":"https://doi.org/10.1109/twc.2016.2620978","title":"Stopping Rule-Based Iterative Tree Search for Low-Complexity Detection in MIMO Systems","display_name":"Stopping Rule-Based Iterative Tree Search for Low-Complexity Detection in MIMO Systems","publication_year":2016,"publication_date":"2016-10-25","ids":{"openalex":"https://openalex.org/W2533831123","doi":"https://doi.org/10.1109/twc.2016.2620978","mag":"2533831123"},"language":"en","primary_location":{"id":"doi:10.1109/twc.2016.2620978","is_oa":false,"landing_page_url":"https://doi.org/10.1109/twc.2016.2620978","pdf_url":null,"source":{"id":"https://openalex.org/S63459445","display_name":"IEEE Transactions on Wireless Communications","issn_l":"1536-1276","issn":["1536-1276","1558-2248"],"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 Wireless Communications","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/A5042506488","display_name":"Abhay Kumar Sah","orcid":"https://orcid.org/0000-0002-3101-6852"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Abhay Kumar Sah","raw_affiliation_strings":["Department of Electrical Engineering, IIT Kanpur, Kanpur, India"],"raw_orcid":"https://orcid.org/0000-0002-3101-6852","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, IIT Kanpur, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088125758","display_name":"A. K. Chaturvedi","orcid":"https://orcid.org/0000-0002-8253-852X"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"A. K. Chaturvedi","raw_affiliation_strings":["Department of Electrical Engineering, IIT Kanpur, Kanpur, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, IIT Kanpur, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I94234084"],"apc_list":null,"apc_paid":null,"fwci":0.3564,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6562649,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"16","issue":"1","first_page":"169","last_page":"179"},"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.9990000128746033,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6719790697097778},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6192718744277954},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6100948452949524},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5933135747909546},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5741424560546875},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5652663707733154},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5042778253555298},{"id":"https://openalex.org/keywords/mimo","display_name":"MIMO","score":0.49570906162261963},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.48825883865356445},{"id":"https://openalex.org/keywords/iterative-deepening-depth-first-search","display_name":"Iterative deepening depth-first search","score":0.4468761086463928},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.4249500036239624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3490331172943115},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3458872437477112},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3115442991256714},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.21331238746643066},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.18782097101211548},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.1845623254776001},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12890061736106873}],"concepts":[{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6719790697097778},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6192718744277954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6100948452949524},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5933135747909546},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5741424560546875},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5652663707733154},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5042778253555298},{"id":"https://openalex.org/C207987634","wikidata":"https://www.wikidata.org/wiki/Q176862","display_name":"MIMO","level":3,"score":0.49570906162261963},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.48825883865356445},{"id":"https://openalex.org/C14362708","wikidata":"https://www.wikidata.org/wiki/Q1675274","display_name":"Iterative deepening depth-first search","level":5,"score":0.4468761086463928},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.4249500036239624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3490331172943115},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3458872437477112},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3115442991256714},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.21331238746643066},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.18782097101211548},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.1845623254776001},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12890061736106873},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/twc.2016.2620978","is_oa":false,"landing_page_url":"https://doi.org/10.1109/twc.2016.2620978","pdf_url":null,"source":{"id":"https://openalex.org/S63459445","display_name":"IEEE Transactions on Wireless Communications","issn_l":"1536-1276","issn":["1536-1276","1558-2248"],"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 Wireless Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320313903","display_name":"Tata Consultancy Services","ror":"https://ror.org/01b9n8m42"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1966605367","https://openalex.org/W1973641217","https://openalex.org/W1992994630","https://openalex.org/W2031557991","https://openalex.org/W2065489737","https://openalex.org/W2077976567","https://openalex.org/W2098268810","https://openalex.org/W2101870477","https://openalex.org/W2102774572","https://openalex.org/W2103557131","https://openalex.org/W2112772743","https://openalex.org/W2114373312","https://openalex.org/W2120681221","https://openalex.org/W2128513990","https://openalex.org/W2136478158","https://openalex.org/W2138293524","https://openalex.org/W2140079649","https://openalex.org/W2147031540","https://openalex.org/W2156787051","https://openalex.org/W2160897074","https://openalex.org/W3106282754","https://openalex.org/W6681720923"],"related_works":["https://openalex.org/W2379239606","https://openalex.org/W2376570066","https://openalex.org/W2224555876","https://openalex.org/W3098335909","https://openalex.org/W2166539025","https://openalex.org/W2402589461","https://openalex.org/W1745899943","https://openalex.org/W2789480285","https://openalex.org/W183780713","https://openalex.org/W2131923625"],"abstract_inverted_index":{"Breadth":[0],"first":[1,171],"tree":[2,172],"search":[3,173],"(BFTS)":[4],"algorithms":[5,174],"are":[6],"known":[7],"to":[8,12,47,53,67,188],"provide":[9],"a":[10,18,50,95,110,132,136,143,148],"close":[11],"maximum":[13],"likelihood":[14],"(quasi-ML)":[15],"solution":[16,97],"at":[17,147],"low-complexity":[19,149],"if":[20,86],"the":[21,27,33,62,75,90,115,119,139,161,167],"received":[22],"sequence":[23,29,35,55],"is":[24,65,98,125,186],"detected":[25],"in":[26,192],"right":[28,34],"order.":[30],"However,":[31,71],"finding":[32],"order":[36],"has":[37],"an":[38],"exponential":[39],"overhead.":[40],"In":[41],"view":[42],"of":[43,78,121,138,169,194],"this,":[44,101],"we":[45,87,102],"propose":[46,103],"repeatedly":[48],"apply":[49],"BFTS":[51],"algorithm":[52],"all":[54,61],"orders.":[56],"Since":[57],"it":[58,64,185],"will":[59,73],"test":[60],"orders,":[63],"expected":[66],"achieve":[68],"quasi-ML":[69,96,144],"performance.":[70],"this":[72],"increase":[74],"complexity":[76,82,129,168],"because":[77],"redundant":[79],"iterations.":[80],"The":[81],"can":[83,88,165],"be":[84,189],"reduced":[85],"stop":[89],"iterations":[91],"as":[92,94,152,154],"soon":[93],"achieved.":[99],"For":[100],"two":[104,140],"stopping":[105,163],"rules,":[106],"one":[107,117],"relies":[108],"on":[109],"constellation":[111],"based":[112],"heuristic":[113],"and":[114,198],"other":[116],"uses":[118],"distribution":[120],"ML":[122],"cost.":[123],"It":[124],"found":[126,187],"that":[127,160],"their":[128],"curves":[130],"have":[131],"cross-over":[133],"point.":[134],"Thus,":[135],"combination":[137],"rules":[141],"provides":[142],"error":[145,196],"performance":[146,197],"for":[150,177],"uncoded":[151],"well":[153],"coded":[155],"systems.":[156],"We":[157],"further":[158],"show":[159],"proposed":[162],"rule":[164],"reduce":[166],"depth":[170],"also.":[175],"Last,":[176],"large":[178],"MIMO":[179],"systems,":[180],"compared":[181],"with":[182],"existing":[183],"algorithms,":[184],"exceptionally":[190],"better":[191],"terms":[193],"both":[195],"complexity.":[199]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}