{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:40:46Z","timestamp":1730223646689,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1109\/glocom.2008.ecp.781","type":"proceedings-article","created":{"date-parts":[[2010,12,8]],"date-time":"2010-12-08T14:51:12Z","timestamp":1291819872000},"page":"1-4","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Tree Search for Reduced Complexity Sphere Decoding"],"prefix":"10.1109","author":[{"given":"Luay","family":"Azzam","sequence":"first","affiliation":[]},{"given":"Ender","family":"Ayanoglu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1985-0777278-8"},{"key":"2","article-title":"on the complexity of sphere decoding","author":"zimmermann","year":"2004","journal-title":"Proc Int Symp Wireless Pers Multimedia Commun"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2007.807"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2005.847505"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.851590"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/18.771234"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.850352"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.843746"},{"key":"9","first-page":"2864","article-title":"reduced complexity sphere decoding and application to interfering ieee 802.15.3a piconets","volume":"5","author":"tang","year":"2004","journal-title":"IEEEICCV"},{"key":"8","first-page":"273","article-title":"a vlsi architecture of a k-best lattice decoding algorithm for mimo channels","volume":"3","author":"wong","year":"2002","journal-title":"Proc IEEE ISCAS"},{"key":"11","first-page":"1497","article-title":"on the expected complexity of integer least-squares problems","author":"hassibi","year":"2002","journal-title":"IEEE ICASSP"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228220"}],"event":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","start":{"date-parts":[[2008,11,30]]},"location":"New Orleans, LA, USA","end":{"date-parts":[[2008,12,4]]}},"container-title":["IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4697774\/4697775\/04698556.pdf?arnumber=4698556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T16:43:00Z","timestamp":1489768980000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4698556\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/glocom.2008.ecp.781","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}