{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:24:37Z","timestamp":1740133477835,"version":"3.37.3"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100012913","name":"Tata Consultancy Services Ltd","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100012913","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Wireless Commun."],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1109\/twc.2016.2620978","type":"journal-article","created":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T14:20:55Z","timestamp":1477405255000},"page":"169-179","source":"Crossref","is-referenced-by-count":2,"title":["Stopping Rule-Based Iterative Tree Search for Low-Complexity Detection in MIMO Systems"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3101-6852","authenticated-orcid":false,"given":"Abhay Kumar","family":"Sah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. K.","family":"Chaturvedi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.890912"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2012.2233226"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2008.080406"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595342"},{"key":"ref14","first-page":"1993","article-title":"Low-complexity near-ML decoding of large non-orthogonal STBCs using reactive tabu search","author":"sundar rajan","year":"2009","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2011.070511.110058"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.2377215"},{"journal-title":"E-Handbook of Statistical Methods","year":"2013","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/APCCAS.2010.5774735"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.809789"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/WCL.2012.070312.120472"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.862402"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.817444"},{"key":"ref5","first-page":"942","article-title":"A low complexity near ML V-BLAST algorithm","volume":"2","author":"lei","year":"2005","journal-title":"Proc IEEE 62nd Veh Technol Conf (VTC)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2009.5426105"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.06.070102"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/VETECS.2005.1543595"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2008.060813"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.850352"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2014.2313021"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2011.2178495"}],"container-title":["IEEE Transactions on Wireless Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7693\/7809190\/07676400.pdf?arnumber=7676400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:10Z","timestamp":1641987550000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7676400\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":21,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/twc.2016.2620978","relation":{},"ISSN":["1536-1276"],"issn-type":[{"type":"print","value":"1536-1276"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}