{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:05:51Z","timestamp":1648627551080},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,2,1]],"date-time":"2014-02-01T00:00:00Z","timestamp":1391212800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2014,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>The 3D Multiple-input multiple-output (MIMO) code is a robust and efficient space-time block code (STBC) for the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML) decoding complexity. In this paper, we first analyze some properties of the 3D MIMO code to show that the 3D MIMO code is fast decodable. It is proven that the ML decoding performance can be achieved with a complexity of <jats:italic>O<\/jats:italic>(<jats:italic>M<\/jats:italic>\n            <jats:sup>4.5<\/jats:sup>) instead of <jats:italic>O<\/jats:italic>(<jats:italic>M<\/jats:italic>\n            <jats:sup>8<\/jats:sup>) in quasi-static channel with <jats:italic>M<\/jats:italic>-ary square QAM modulations. Consequently, we propose a simplified ML decoder exploiting the unique properties of the 3D MIMO code. Simulation results show that the proposed simplified ML decoder can achieve much lower processing time latency compared to the classical sphere decoder with Schnorr-Euchner enumeration.<\/jats:p>","DOI":"10.1186\/1687-1499-2014-20","type":"journal-article","created":{"date-parts":[[2014,2,1]],"date-time":"2014-02-01T12:01:30Z","timestamp":1391256090000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Achieving low-complexity maximum-likelihood detection for the 3D MIMO code"],"prefix":"10.1186","volume":"2014","author":[{"given":"Ming","family":"Liu","sequence":"first","affiliation":[]},{"given":"Matthieu","family":"Crussi\u00e8re","sequence":"additional","affiliation":[]},{"given":"Maryline","family":"H\u00e9lard","sequence":"additional","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"H\u00e9lard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,1]]},"reference":[{"issue":"2","key":"871_CR1","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1109\/18.661517","volume":"44","author":"V Tarokh","year":"1998","unstructured":"Tarokh V, Seshadri N, Calderbank A: Space-time codes for high data rate wireless communication: performance criterion and code construction. IEEE Trans. Inf. Theory 1998, 44(2):744-765. 10.1109\/18.661517","journal-title":"IEEE Trans. Inf. Theory"},{"key":"871_CR2","unstructured":"DVB: TM-MIMO. . Accessed 29 Jan 2014 http:\/\/www.dvb.org\/groups\/TM-MIMO"},{"issue":"13","key":"871_CR3","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1049\/el:20080061","volume":"44","author":"Y Nasser","year":"2008","unstructured":"Nasser Y, H\u00e9lard JF, Crussi\u00e8re M: 3D MIMO scheme for broadcasting future digital TV in single-frequency networks. Electron. Lett 2008, 44(13):829-830. 10.1049\/el:20080061","journal-title":"Electron. Lett"},{"key":"871_CR4","volume-title":"Distributed MIMO schemes for the future digital video broadcasting Paper presented at the 20th international conference on telecommunications (ICT)","author":"M Liu","year":"2013","unstructured":"Liu M, Crussi\u00e8re M, H\u00e9lard M, H\u00e9lard JF: Distributed MIMO schemes for the future digital video broadcasting Paper presented at the 20th international conference on telecommunications (ICT). Casablanca, Morocco0; 6\u20138 May 2013."},{"key":"871_CR5","doi-asserted-by":"publisher","first-page":"1246","DOI":"10.1155\/S1110865704402339","volume":"2004","author":"N Sharma","year":"2004","unstructured":"Sharma N, Papadias CB: Full-rate full-diversity linear quasi-orthogonal space-time codes for any number of transmit antennas. EURASIP J. Appl. Signal Process 2004, 2004: 1246-1256. 10.1155\/S1110865704402339","journal-title":"EURASIP J. Appl. Signal Process"},{"key":"871_CR6","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1109\/TSP.2007.906729","volume":"56","author":"DN Dao","year":"2008","unstructured":"Dao DN, Yuen C, Tellambura C, Guan YL, Tjhung TT: Four-group decodable space\u2013time block codes. IEEE Trans. Signal Process 2008, 56: 424-430.","journal-title":"IEEE Trans. Signal Process"},{"issue":"2","key":"871_CR7","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1109\/TIT.2008.2009817","volume":"55","author":"E Biglieri","year":"2009","unstructured":"Biglieri E, Hong Y, Viterbo E: On fast-decodable space-time block codes. IEEE Trans. Inf. Theory 2009, 55(2):524-530.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"871_CR8","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1109\/JSTSP.2009.2038209","volume":"3","author":"K Srinath","year":"2009","unstructured":"Srinath K, Rajan B: Low ML-decoding complexity, large coding gain, full-rate, full-diversity STBCs for 2 \u00d72 and 4 \u00d72 MIMO systems. IEEE J. Sel. Topics Signal Process 2009, 3(6):916-927.","journal-title":"IEEE J. Sel. Topics Signal Process"},{"key":"871_CR9","first-page":"1749","volume-title":"Paper presented at the 42nd Asilomar conference on signals, systems and computers","author":"MO Sinnokrot","year":"2008","unstructured":"Sinnokrot MO, Barry JR, Madisetti VK: Embedded Alamouti space-time codes for high rate and low decoding complexity. In Paper presented at the 42nd Asilomar conference on signals, systems and computers. Pacific Grove, CA, USA; 3\u20136 Nov 2008:1749-1753."},{"key":"871_CR10","volume-title":"Fast-group-decodable space-time block code. Paper presented at the IEEE information theory workshop (ITW)","author":"TP Ren","year":"2010","unstructured":"Ren TP, Guan YL, Yuen C, Shen RJ: Fast-group-decodable space-time block code. Paper presented at the IEEE information theory workshop (ITW). Cairo, Egypt; 6\u20138 Jan 2010."},{"issue":"3","key":"871_CR11","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1109\/TWC.2013.011513.120517","volume":"12","author":"A Ismail","year":"2013","unstructured":"Ismail A, Fiorina J, Sari H: A new family of low-complexity STBCs for four transmit antennas. IEEE Trans. Wireless Commun 2013, 12(3):1208-1219.","journal-title":"IEEE Trans. Wireless Commun"},{"key":"871_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/0470014083","volume-title":"Multi-antenna Transceiver Techniques for 3G and Beyond","author":"A Hottinen","year":"2003","unstructured":"Hottinen A, Tirkkonen O, Wichman R: Multi-antenna Transceiver Techniques for 3G and Beyond. West Sussex, England: Wiley; 2003."},{"issue":"9","key":"871_CR13","doi-asserted-by":"publisher","first-page":"1438","DOI":"10.1109\/TCOMM.2005.855016","volume":"53","author":"L Dai","year":"2005","unstructured":"Dai L, Sfar S, Letaief K: An efficient detector for combined space-time coding and layered processing. IEEE Trans. Commun 2005, 53(9):1438-1442. 10.1109\/TCOMM.2005.855016","journal-title":"IEEE Trans. Commun"},{"issue":"10","key":"871_CR14","doi-asserted-by":"publisher","first-page":"4366","DOI":"10.1109\/TIT.2009.2027502","volume":"55","author":"X Guo","year":"2009","unstructured":"Guo X, Xia XG: On full diversity space-time block codes with partial interference cancellation group decoding. IEEE Trans. Inf. Theory 2009, 55(10):4366-4385.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"871_CR15","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1109\/TIT.2011.2173268","volume":"58","author":"W Zhang","year":"2012","unstructured":"Zhang W, Xu T, Xia XG: Two designs of space-time block codes achieving full diversity with partial interference cancellation group decoding. IEEE Trans. Inf. Theory 2012, 58(2):747-764.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"871_CR16","volume-title":"Reduced complexity space-time coding in single-frequency networks. Paper presented at the IEEE wireless communications and networking conference (WCNC)","author":"K Polonen","year":"2011","unstructured":"Polonen K, Koivunen V: Reduced complexity space-time coding in single-frequency networks. Paper presented at the IEEE wireless communications and networking conference (WCNC). Cancun, Mexico; 28\u201331 March 2011."},{"issue":"17","key":"871_CR17","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1049\/el.2012.1778","volume":"48","author":"M Liu","year":"2012","unstructured":"Liu M, H\u00e9lard M, Crussi\u00e8re M, H\u00e9lard JF: Distributed MIMO coding scheme with low decoding complexity for future mobile TV broadcasting. Electron. Lett 2012, 48(17):1079-1081. 10.1049\/el.2012.1778","journal-title":"Electron. Lett"},{"issue":"8","key":"871_CR18","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1109\/TIT.2002.800499","volume":"48","author":"E Agrell","year":"2002","unstructured":"Agrell E, Eriksson T, Vardy A, Zeger K: Closest point search in lattices. IEEE Trans. Inf. Theory 2002, 48(8):2201-2214. 10.1109\/TIT.2002.800499","journal-title":"IEEE Trans. Inf. Theory"},{"key":"871_CR19","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/TWC.2010.01.081512","volume":"9","author":"M Sinnokrot","year":"2010","unstructured":"Sinnokrot M, Barry J: Fast maximum-likelihood decoding of the golden code. IEEE Trans. Wireless Commun 2010, 9: 26-31.","journal-title":"IEEE Trans. Wireless Commun"},{"issue":"4","key":"871_CR20","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1109\/TIT.2005.844069","volume":"51","author":"J Belfiore","year":"2005","unstructured":"Belfiore J, Rekaya G, Viterbo E: The golden code: a 2 \u00d72 full-rate space-time code with nonvanishing determinants. IEEE Trans. Inf. Theory 2005, 51(4):1432-1436. 10.1109\/TIT.2005.844069","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"871_CR21","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1109\/49.730453","volume":"16","author":"S Alamouti","year":"1998","unstructured":"Alamouti S: A simple transmit diversity technique for wireless communications. IEEE J. Sel. Areas Commun 1998, 16(8):1451-1458. 10.1109\/49.730453","journal-title":"IEEE J. Sel. Areas Commun"},{"key":"871_CR22","volume-title":"Minimizing the complexity of fast sphere decoding of STBCs. Paper presented at the IEEE international symposium on information theory (ISIT)","author":"G Jithamithra","year":"2011","unstructured":"Jithamithra G, Rajan BS: Minimizing the complexity of fast sphere decoding of STBCs. Paper presented at the IEEE international symposium on information theory (ISIT). St. Petersburg, Russia; 31 Jul\u201305 Aug 2011."},{"issue":"3","key":"871_CR23","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1109\/TIT.2009.2039069","volume":"56","author":"S Sirianunpiboon","year":"2010","unstructured":"Sirianunpiboon S, Wu Y, Calderbank A, Howard S: Fast optimal decoding of multiplexed orthogonal designs by conditional optimization. IEEE Trans. Inf. Theory 2010, 56(3):1106-1113.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"871_CR24","doi-asserted-by":"publisher","first-page":"3885","DOI":"10.1109\/TIT.2006.880010","volume":"52","author":"F Oggier","year":"2006","unstructured":"Oggier F, Rekaya G, Belfiore JC, Viterbo E: Perfect space\u2013time block codes. IEEE Trans. Inf. Theory 2006, 52(9):3885-3902.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"871_CR25","volume-title":"A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels. Paper presented at the IEEE international symposium on circuits and systems (ISCAS)","author":"K Wong","year":"2002","unstructured":"Wong K, Tsui C, Cheng R, Mow W: A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels. Paper presented at the IEEE international symposium on circuits and systems (ISCAS). Scottsdale, AZ, USA; 26\u201329 May 2002."},{"issue":"6","key":"871_CR26","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1109\/TWC.2008.060378","volume":"7","author":"L Barbero","year":"2008","unstructured":"Barbero L, Thompson J: Fixing the complexity of the sphere decoder for MIMO detection. IEEE Trans. Wireless Commun 2008, 7(6):2131-2142.","journal-title":"IEEE Trans. Wireless Commun"},{"key":"871_CR27","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C Schnorr","year":"1994","unstructured":"Schnorr C, Euchner M: Math Program. 1994, 66: 181-191. 10.1007\/BF01581144","journal-title":"Math Program"},{"issue":"5","key":"871_CR28","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/LCOMM.2004.827376","volume":"8","author":"Z Guo","year":"2004","unstructured":"Guo Z, Nilsson P: Reduced complexity Schnorr-Euchner decoding algorithms for MIMO systems. IEEE Commun. Lett 2004, 8(5):286-288. 10.1109\/LCOMM.2004.827376","journal-title":"IEEE Commun. Lett"},{"key":"871_CR29","volume-title":"Efficient implementation of sphere demodulation. Paper presented at the 4th IEEE workshop on signal processing advances in wireless communications (SPAWC)","author":"A Wiesel","year":"2003","unstructured":"Wiesel A, Mestre X, Pages A, Fonollosa J: Efficient implementation of sphere demodulation. Paper presented at the 4th IEEE workshop on signal processing advances in wireless communications (SPAWC). Rome, Italy; 15\u201318 June 2003."},{"key":"871_CR30","doi-asserted-by":"crossref","unstructured":"Tsai P, Chen W, Lin X, Huang M: A 4 \u00d74 64-QAM reduced-complexity K-best MIMO detector up to 1.5 Gbps. Paper presented at the IEEE international symposium on circuits and systems (ISCAS), Paris, France, 30 May\u20132 June 2010, pp. 3953\u20133956","DOI":"10.1109\/ISCAS.2010.5537675"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2014-20.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1687-1499-2014-20\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2014-20.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,2]],"date-time":"2021-09-02T02:57:32Z","timestamp":1630551452000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/1687-1499-2014-20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["871"],"URL":"https:\/\/doi.org\/10.1186\/1687-1499-2014-20","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,1]]},"assertion":[{"value":"15 July 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2014","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2014","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"20"}}