{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T04:36:29Z","timestamp":1685162189828},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,6,28]],"date-time":"2016-06-28T00:00:00Z","timestamp":1467072000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Chinese National Science Foundation","doi-asserted-by":"crossref","award":["11401485","71331004."],"award-info":[{"award-number":["11401485","71331004."]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10878-016-0045-5","type":"journal-article","created":{"date-parts":[[2016,6,28]],"date-time":"2016-06-28T09:25:19Z","timestamp":1467105919000},"page":"1395-1410","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A new effective branch-and-bound algorithm to the high order MIMO detection problem"],"prefix":"10.1007","volume":"33","author":[{"given":"Ye","family":"Tian","sequence":"first","affiliation":[]},{"given":"Ke","family":"Li","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Zhiyong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A Billionnet","year":"2007","unstructured":"Billionnet A, Elloumi S (2007) Using a mixed integer quadratic programming solver for the unconstrained quadratic 0\u20131 problem. Math Program 109:55\u201368","journal-title":"Math Program"},{"key":"45_CR2","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1016\/j.cam.2008.12.029","volume":"233","author":"A Bunse-Gerstner","year":"2010","unstructured":"Bunse-Gerstner A, Kubali\u0144 D, Vossen G, Wilczek D (2010) $$h_2$$ h 2 -norm optimal model reduction for large scale discrete dynamical MIMO systems. J Comput Appl Math 233:1202\u20131216","journal-title":"J Comput Appl Math"},{"key":"45_CR3","doi-asserted-by":"crossref","first-page":"2389","DOI":"10.1109\/TIT.2003.817444","volume":"49","author":"M Damen","year":"2003","unstructured":"Damen M, El Gamal H, Caire G (2003) On maximum-likelihood detection and the search for the closest lattice point. IEEE Trans Inf Theory 49:2389\u20132402","journal-title":"IEEE Trans Inf Theory"},{"key":"45_CR4","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1090\/S0025-5718-1985-0777278-8","volume":"44","author":"U Fincke","year":"1985","unstructured":"Fincke U, Pohst M (1985) Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Math Computat 44:463\u2013471","journal-title":"Math Computat"},{"key":"45_CR5","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1109\/TIT.2004.828067","volume":"50","author":"H Gamal El","year":"2004","unstructured":"El Gamal H, Caire G, Damen M (2004) Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels. IEEE Trans Inf Theory 50:968\u2013985","journal-title":"IEEE Trans Inf Theory"},{"key":"45_CR6","doi-asserted-by":"crossref","first-page":"4973","DOI":"10.1109\/TIT.2011.2159037","volume":"57","author":"J Goldberger","year":"2011","unstructured":"Goldberger J, Leshem A (2011) MIMO detection for high-order QAM based on a Gaussian tree approximation. IEEE Trans Inf Theory 57:4973\u20134982","journal-title":"IEEE Trans Inf Theory"},{"key":"45_CR7","unstructured":"Grant M, Boyd S (2010) CVX: matlab Software for Disciplined Programming. Version 1.2. http:\/\/cvxr.com\/cvx"},{"key":"45_CR8","doi-asserted-by":"crossref","first-page":"4765","DOI":"10.1109\/TIT.2010.2059493","volume":"56","author":"J Jald\u00e9n","year":"2010","unstructured":"Jald\u00e9n J, Elia P (2010) DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system models. IEEE Trans Inf Theory 56:4765\u20134780","journal-title":"IEEE Trans Inf Theory"},{"key":"45_CR9","doi-asserted-by":"crossref","first-page":"1474","DOI":"10.1109\/TSP.2005.843746","volume":"53","author":"J Jald\u00e9n","year":"2005","unstructured":"Jald\u00e9n J, Ottersten B (2005) On the complexity of sphere decoding in digital communications. IEEE Trans Signal Process 53:1474\u20131484","journal-title":"IEEE Trans Signal Process"},{"key":"45_CR10","unstructured":"Kisialiou M, Luo Z (2005) Performance Analysis of Quasi-Maximum-Likelihood Detector Based on Semidefinite Programming. In: Proceedings of the IEEE International Conference on Acoustics Speech and Signal Process, vol III, pp 433\u2013436"},{"key":"45_CR11","doi-asserted-by":"crossref","first-page":"5933","DOI":"10.1109\/TIT.2011.2162180","volume":"57","author":"S Liu","year":"2011","unstructured":"Liu S, Ling C, Stehl\u00e9 D (2011) Decoding by sampling: A randomized lattice algorithm for bounded-distance decoding. IEEE Trans Inf Theory 57:5933\u20135945","journal-title":"IEEE Trans Inf Theory"},{"key":"45_CR12","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s11590-014-0768-0","volume":"9","author":"C Lu","year":"2015","unstructured":"Lu C, Guo X (2015) Convex reformulation for binary quadratic programming problems via average objective value maximization. Optim Lett 9:523\u2013535","journal-title":"Optim Lett"},{"key":"45_CR13","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1109\/TIT.2012.2236144","volume":"59","author":"L Luzzi","year":"2013","unstructured":"Luzzi L, Stehl\u00e9 D, Ling C (2013) Decoding by embedding: Correct decoding radius and DMT optimality. IEEE Trans Inf Theory 59:960\u20132973","journal-title":"IEEE Trans Inf Theory"},{"key":"45_CR14","doi-asserted-by":"crossref","first-page":"2600","DOI":"10.1109\/TSP.2004.832062","volume":"52","author":"W Ma","year":"2004","unstructured":"Ma W, Davidson T, Wong K, Ching P (2004) A block alternating likelihood maximization approach to multiuser detection. IEEE Trans Signal Process 52:2600\u20132611","journal-title":"IEEE Trans Signal Process"},{"key":"45_CR15","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1109\/JSTSP.2009.2035798","volume":"3","author":"W Ma","year":"2009","unstructured":"Ma W, Su C, Jald\u00e9m J, Chang T, Chi C (2009) The equivalence of semidefinite relaxation MIMO detectors for higher-order QAM. IEEE J Select Top Signal Process 3:1038\u20131052","journal-title":"IEEE J Select Top Signal Process"},{"key":"45_CR16","doi-asserted-by":"crossref","first-page":"4275","DOI":"10.1109\/TWC.2007.060418","volume":"6","author":"Z Mao","year":"2007","unstructured":"Mao Z, Wang X, Wang X (2007) Semidefinite programming relaxation approach for multiuser detection of QAM signals. IEEE Trans Wire Commun 6:4275\u20134279","journal-title":"IEEE Trans Wire Commun"},{"key":"45_CR17","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1109\/TSP.2013.2292040","volume":"62","author":"J Pan","year":"2014","unstructured":"Pan J, Ma W, Jald\u00e9m J (2014) MIMO detection by Lagrangian dual maximum-likilihood relaxation: Reinterpreting regularized lattice decoding. IEEE Trans Signal Process 62:511\u2013524","journal-title":"IEEE Trans Signal Process"},{"key":"45_CR18","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"P Pardalos","year":"1990","unstructured":"Pardalos P, Rodgers G (1990) Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45:131\u2013144","journal-title":"Computing"},{"key":"45_CR19","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/LSP.2006.874443","volume":"13","author":"N Sidiropoulos","year":"2006","unstructured":"Sidiropoulos N, Luo Z (2006) A semidefinite relaxation approach to MIMO detection for higher-order constellations. IEEE Signal Process lett 13:525\u2013528","journal-title":"IEEE Signal Process lett"},{"key":"45_CR20","doi-asserted-by":"crossref","first-page":"3692","DOI":"10.1109\/TIT.2012.2190709","volume":"58","author":"A Singh","year":"2012","unstructured":"Singh A, Elia P, Jald\u00e9n J (2012) Achieving a vanishing SNR gap to exact lattice decoding at a subexponential complexity. IEEE Trans Inf Theory 58:3692\u20133707","journal-title":"IEEE Trans Inf Theory"},{"key":"45_CR21","doi-asserted-by":"crossref","first-page":"4820","DOI":"10.1109\/TIT.2010.2059630","volume":"56","author":"M Taherzadeh","year":"2010","unstructured":"Taherzadeh M, Khandani A (2010) On the limitations of the naive lattice decoding. IEEE Trans Inf Theory 56:4820\u20134826","journal-title":"IEEE Trans Inf Theory"},{"key":"45_CR22","doi-asserted-by":"crossref","first-page":"1442","DOI":"10.1109\/49.942507","volume":"19","author":"P Tan","year":"2001","unstructured":"Tan P, Rasmussen L (2001) The application of semidefinite programming for detection in CDMA. IEEE J Select Areas Commun 19:1442\u20131449","journal-title":"IEEE J Select Areas Commun"},{"key":"45_CR23","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/201369","author":"Y Tian","year":"2015","unstructured":"Tian Y, Dang JF (2015) MIMO detection for high order QAM by canonical dual approach. J Appl Math. doi: 10.1155\/2015\/201369","journal-title":"J Appl Math"},{"key":"45_CR24","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807213","volume-title":"Fundamentals of wireless communication","author":"D Tse","year":"2005","unstructured":"Tse D, Viswanath P (2005) Fundamentals of wireless communication. Cambridge University Press, Cambridge"},{"key":"45_CR25","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe L, Boyd S (1996) Semidefinite programming. SIAM Rev 38:49\u201395","journal-title":"SIAM Rev"},{"key":"45_CR26","volume-title":"Multiuser detectection","author":"S Verd\u00fa","year":"1998","unstructured":"Verd\u00fa S (1998) Multiuser detectection. Cambridge University Press, Cambridge"},{"key":"45_CR27","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1109\/18.771234","volume":"45","author":"E Viterbo","year":"1999","unstructured":"Viterbo E, Boutros J (1999) A universal lattice code decoder for fading channels. IEEE Trans Inform Theory 45:1639\u20131642","journal-title":"IEEE Trans Inform Theory"},{"key":"45_CR28","doi-asserted-by":"crossref","first-page":"213","DOI":"10.3934\/jimo.2008.4.213","volume":"4","author":"Z Wang","year":"2008","unstructured":"Wang Z, Fang SC, Gao D, Xing W (2008) Global extremal conditions for multi-integer quadratic programming. J Ind Manage Optim 4:213\u2013225","journal-title":"J Ind Manage Optim"},{"key":"45_CR29","first-page":"525","volume":"13","author":"A Wiesel","year":"2005","unstructured":"Wiesel A, Eldar Y, Shamai S (2005) Semidefinite relaxation for detection of 16-QAM signaling in MIMO channels. IEEE Signal Process Lett 13:525\u2013528","journal-title":"IEEE Signal Process Lett"},{"key":"45_CR30","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/MSP.2010.938758","volume":"28","author":"D W\u00fcbben","year":"2011","unstructured":"W\u00fcbben D, Seethaler D, Jald\u00e9n J, Matz G (2011) Lattice reduction. IEEE Signal Process Mag 28:70\u201391","journal-title":"IEEE Signal Process Mag"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0045-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0045-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0045-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0045-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T00:19:39Z","timestamp":1589674779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0045-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,28]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["45"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0045-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,28]]}}}