{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:51:29Z","timestamp":1730274689471,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523632","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"1686-1690","source":"Crossref","is-referenced-by-count":15,"title":["A near maximum likelihood decoding algorithm for MIMO systems based on semi-definite programming"],"prefix":"10.1109","author":[{"given":"A.","family":"Mobasher","sequence":"first","affiliation":[]},{"given":"M.","family":"Taherzadeh","sequence":"additional","affiliation":[]},{"given":"R.","family":"Sotirov","sequence":"additional","affiliation":[]},{"given":"A.K.","family":"Khandani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805761"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"14","article-title":"MMSE-GDFE lattice decoding for under-determined linear channels","author":"damen","year":"2004","journal-title":"Conference on Information Sciences and Systems"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805766"},{"key":"12","article-title":"SDPA(SemiDefinite Programming Algorithm) users mannual version 6.00","author":"kojima","year":"2002","journal-title":"Tech Rep"},{"key":"3","article-title":"On sphere decoding algorithm. Part I. expected complexity","author":"hassibi","year":"2003","journal-title":"IEEE Transaction on Signal Processing"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/4234.846498"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460100604"},{"key":"10","article-title":"DSDP5 user guide the dual-scaling algorithm for semidefinite programming","volume":"anl mcs tm 255","author":"benson","year":"2004","journal-title":"Tech Rep"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00102-X"},{"journal-title":"Handbook of Semidefinite Programming Theory Algorithms and Applications","year":"2000","author":"saigal","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2003.818203"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.843746"},{"key":"9","article-title":"An efficient quasi-maximum likelihood decoding for finite constellations","author":"mobasher","year":"2005","journal-title":"University of Waterloo Technical Report"},{"key":"8","article-title":"Bounds for the quadratic assignment problem using the bundle method","author":"sotirov","year":"2003","journal-title":"Tech Rep"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","start":{"date-parts":[[2005,9,4]]},"location":"Adelaide, Australia","end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523632.pdf?arnumber=1523632","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T00:53:18Z","timestamp":1489539198000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523632\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523632","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}