{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:08:41Z","timestamp":1648746521405},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Ser. F-Inf. Sci."],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s11432-008-0022-4","type":"journal-article","created":{"date-parts":[[2008,2,1]],"date-time":"2008-02-01T14:11:18Z","timestamp":1201875078000},"page":"306-319","source":"Crossref","is-referenced-by-count":1,"title":["Maximum-likelihood detection based on branch and bound algorithm for MIMO systems"],"prefix":"10.1007","volume":"51","author":[{"given":"Zi","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YueMing","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1109\/26.898258","volume":"49","author":"P. H. Tan","year":"2001","unstructured":"Tan P H, Rasmussen L K, Lim T J. Constrained maximum-likelihood detection in CDMA. IEEE Trans Commu, 2001, 49(1): 142\u2013153","journal-title":"IEEE Trans Commu"},{"issue":"5","key":"22_CR2","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1109\/18.771234","volume":"45","author":"E. Viterbo","year":"1999","unstructured":"Viterbo E, Boutros J. A universal lattice code decoder for fading channels. IEEE Trans Info Theory, 1999, 45(5): 1639\u20131642","journal-title":"IEEE Trans Info Theory"},{"issue":"4","key":"22_CR3","doi-asserted-by":"crossref","first-page":"1474","DOI":"10.1109\/TSP.2005.843746","volume":"53","author":"J. Jalden","year":"2005","unstructured":"Jalden J, Ottersten B. On the complexity of sphere decoding in digital communications. IEEE Trans Signal Proc, 2005, 53(4): 1474\u20131484","journal-title":"IEEE Trans Signal Proc"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Luo J, Pattipati K, Willett P, et al. Branch-and-bound-based fast optimal algorithm for multiuser detection in synchronous CDMA. In: Proc IEEE Inter Confer Commu, US, Alaska: Anchorage, 2003. 3336\u20133340","DOI":"10.1109\/ICC.2003.1204072"},{"issue":"3","key":"22_CR5","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1109\/TIT.2005.864418","volume":"52","author":"A. D. Murugan","year":"2006","unstructured":"Murugan A D, Gamal H E, Damen M O, et al. A unified framework for tree search decoding: rediscovering the sequential decoder. IEEE Trans Info Theory, 2006, 52(3): 933\u2013953","journal-title":"IEEE Trans Info Theory"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Stojnic M, Vikalo H, Hassibi B. A branch and bound approach to speed up the sphere decoder. In: Proc IEEE Inter Confer Acoustics, Speech, and Signal Processing, Philadelphia, PA, 2005: 429\u2013432","DOI":"10.1109\/ICASSP.2005.1415738"},{"issue":"11","key":"22_CR7","doi-asserted-by":"crossref","first-page":"2710","DOI":"10.1109\/TSP.2003.818203","volume":"51","author":"B. Steingrimsson","year":"2003","unstructured":"Steingrimsson B, Luo T, Wong K M. Soft quasi-maximum-likelihood detection for multiple-antenna wireless channels. IEEE Trans Sig Proc, 2003, 51(11): 2710\u20132719","journal-title":"IEEE Trans Sig Proc"},{"issue":"9","key":"22_CR8","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1109\/LSP.2005.853044","volume":"12","author":"A. Wiesel","year":"2005","unstructured":"Wiesel A, Eldar Y C, Shamai S. Semidefinite relaxation for detection of 16-QAM signaling in mimo channels. IEEE Sig Proc Lett, 2005, 12(9): 653\u2013656","journal-title":"IEEE Sig Proc Lett"},{"key":"22_CR9","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G. L. Nemhauser","year":"1988","unstructured":"Nemhauser G L, Wolsey L A. Integer and Combinatorial Optimization. New York: Wiley, 1988"},{"key":"22_CR10","volume-title":"Matrix computations","author":"G. H. Golub","year":"1996","unstructured":"Golub G H, Van Loan C F. Matrix computations. Baltimore MD: John Hopkins University Press, 1996"},{"key":"22_CR11","volume-title":"Computers and Intractability, A guide to the Theory of NP Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey M R, Johnson D S. Computers and Intractability, A guide to the Theory of NP Completeness, New York: W. H. Freeman and Company, 1979"},{"issue":"3","key":"22_CR12","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A. H. Land","year":"1960","unstructured":"Land A H, Doig A G. An automatic method for solving discrete programming problems. Econo, 1960, 28(3): 497\u2013520","journal-title":"Econo"},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/opre.18.1.24","volume":"18","author":"L. G. Mitten","year":"1970","unstructured":"Mitten L G. Branch-and-bound methods: general formulation and properties. Oper Res, 1970, 18: 24\u201334","journal-title":"Oper Res"},{"key":"22_CR14","volume-title":"Practical Optimization","author":"P. E. Gill","year":"1981","unstructured":"Gill P E, Murray W, Wright M H. Practical Optimization. New York: Academic Press, 1981"},{"issue":"4","key":"22_CR15","doi-asserted-by":"crossref","first-page":"1040","DOI":"10.1137\/S1052623494240456","volume":"6","author":"T. Coleman","year":"1996","unstructured":"Coleman T, Li Y. A reflective Newton method for minimizing a quadratic function subject to bounds on some of the variables. SIAM J Optim, 1996, 6(4): 1040\u20131058","journal-title":"SIAM J Optim"},{"issue":"4","key":"22_CR16","doi-asserted-by":"crossref","first-page":"3387","DOI":"10.1023\/A:1024029423064","volume":"116","author":"W. Li","year":"2003","unstructured":"Li W, Nijs J de. An implementation of QSPLINE method for solving convex quadratic programming problems with simple bound constraints. J Math Sci, 2003, 116(4): 3387\u20133410","journal-title":"J Math Sci"},{"key":"22_CR17","unstructured":"Dai Y H, Fletcher R. Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming. University of Dundee Report NA\/215, 2003"},{"issue":"8","key":"22_CR18","doi-asserted-by":"crossref","first-page":"2819","DOI":"10.1109\/TSP.2005.850350","volume":"53","author":"V. Vikalo","year":"2005","unstructured":"Vikalo V, Hassibi B. On the sphere-decoding algorithm II. generalizations, second-order statistics, and applications to communications. IEEE Trans Sig Proc, 2005, 53(8): 2819\u20132834","journal-title":"IEEE Trans Sig Proc"}],"container-title":["Science in China Series F: Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-008-0022-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-008-0022-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-008-0022-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:35:54Z","timestamp":1559403354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-008-0022-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["22"],"URL":"https:\/\/doi.org\/10.1007\/s11432-008-0022-4","relation":{},"ISSN":["1009-2757","1862-2836"],"issn-type":[{"value":"1009-2757","type":"print"},{"value":"1862-2836","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3]]}}}