{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T16:41:03Z","timestamp":1779295263291,"version":"3.51.4"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,6,3]],"date-time":"2020-06-03T00:00:00Z","timestamp":1591142400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,6,3]],"date-time":"2020-06-03T00:00:00Z","timestamp":1591142400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Reducing the computational complexity of the modern wireless communication systems such as massive MIMO configurations is of utmost interest. In this paper, we propose algorithms which can be used to accelerate matrix inversion and reduce the complexity of common spatial multiplexing schemes in massive MIMO systems. Here, we specifically investigate the performance of the proposed methods in systems that utilize STBC (Space-Time Block Code) in the uplink of dynamic massive MIMO systems for different scenarios. A multi-user system in which the base station is equipped with a large number of antennas and each user has two antennas is considered. In addition, users can enter or exit the system dynamically. For a given space-time block coding\/decoding scheme, the computational complexity of the receiver will be significantly reduced by employing the proposed methods. The first approach is utilizing Neumann series to approximate the inverse matrix for linear decoders. The second tactic is reducing the computational complexity of the STBC decoders when a user is added to system or removed from it. In the proposed schemes, the matrix inversion for ZF and MMSE decoding is derived from inversing a partitioned matrix and Woodbury matrix identity. Furthermore, the suggested techniques can be utilized when the number of users is fixed but the CSI changes for a particular user. The mathematical equations for both approaches are derived and the complexity of the suggested methods is compared to the direct computation of the inverse matrix. Moreover, the performance of the proposed algorithms is evaluated in terms of the system BER (bit error rate). Evaluations confirm the effectiveness of the proposed approaches.<\/jats:p>","DOI":"10.1186\/s13638-020-01739-9","type":"journal-article","created":{"date-parts":[[2020,6,3]],"date-time":"2020-06-03T14:34:16Z","timestamp":1591194856000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Low computational complexity methods for decoding of STBC in the uplink of a massive MIMO system"],"prefix":"10.1186","volume":"2020","author":[{"given":"Seyed Hosein","family":"Mousavi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7457-7169","authenticated-orcid":false,"given":"Jafar","family":"Pourrostam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,3]]},"reference":[{"key":"1739_CR1","doi-asserted-by":"crossref","unstructured":"E. G. Larsson, O. Edfors, F Tufvensson, and T. L. Marzetta, Massive MIMO for next generation wireless systems, IEEE Comm. Mag. Vol. 52, No.2, pp. 186\u2013195, 2014.","DOI":"10.1109\/MCOM.2014.6736761"},{"issue":"11","key":"1739_CR2","doi-asserted-by":"publisher","first-page":"7112","DOI":"10.1109\/TIT.2014.2354403","volume":"60","author":"E Bj\u00f6rnson","year":"2014","unstructured":"E. Bj\u00f6rnson, J. Hoydis, M. Kountouris, M. Debbah, Massive MIMO systems with non-ideal hardware: Energy efficiency, estimation, and capacity limits. IEEE Trans. Inform. Theory. 60(11), 7112\u20137139 (2014)","journal-title":"IEEE Trans. Inform. Theory."},{"issue":"4","key":"1739_CR3","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1109\/TCOMM.2013.020413.110848","volume":"61","author":"HQ Ngo","year":"2013","unstructured":"H.Q. Ngo, E.G. Larsson, T.L. Marzetta, Energy and spectral efficiency of very large multiuser MIMO systems. IEEE Trans. Comm. 61(4), 1436\u20131449 (2013)","journal-title":"IEEE Trans. Comm."},{"key":"1739_CR4","doi-asserted-by":"crossref","unstructured":"H. Wang, X. Yue, D. Qiao, W. Zhang, A Massive MIMO System with Space-Time Block Codes, in Proc. IEEE Inter. Conf. Communications (ICCC), Chengdu, China, 2016.","DOI":"10.1109\/ICCChina.2016.7636853"},{"issue":"4","key":"1739_CR5","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1109\/TIT.2005.844069","volume":"51","author":"JC Belfiore","year":"2005","unstructured":"J.C. Belfiore, G. Rekaya, E. Viterbo, The Golden code: A 2\u00d72 full rate space time code with non-vanishing determinants. IEEE Trans. Inform. Theory. 51(4), 1432\u20131436 (2005)","journal-title":"IEEE Trans. Inform. Theory."},{"issue":"4","key":"1739_CR6","doi-asserted-by":"publisher","first-page":"1814","DOI":"10.1109\/TIT.2008.917688","volume":"54","author":"H Wang","year":"2008","unstructured":"H. Wang, X.G. Xia, Optimal normalized diversity product of 2\u00d72 lattice-based diagonal space-time codes from QAM signal constellations. IEEE Trans. Inform. Theory. 54(4), 1814\u20131818 (2008)","journal-title":"IEEE Trans. Inform. Theory."},{"issue":"2","key":"1739_CR7","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1109\/TIT.2011.2173268","volume":"58","author":"W Zhang","year":"2012","unstructured":"W. Zhang, T. Xu, X.G. Xia, Two designs of space-time block codes achieving full diversity with partial interference cancellation group decoding. IEEE Trans. Inform. Theory. 58(2), 747\u2013764 (2012)","journal-title":"IEEE Trans. Inform. Theory."},{"issue":"9","key":"1739_CR8","doi-asserted-by":"publisher","first-page":"3806","DOI":"10.1109\/TCOMM.2013.080613.120972","volume":"61","author":"L Shi","year":"2013","unstructured":"L. Shi, W. Zhang, X.G. Xia, Space-time block code designs for two-user MIMO X channels. IEEE Trans. Comm. 61(9), 3806\u20133815 (2013)","journal-title":"IEEE Trans. Comm."},{"key":"1739_CR9","doi-asserted-by":"crossref","unstructured":"D. Zhu, B. Li, and P. Liang, On the matrix inversion approximation based on Neumann series in massive MIMO systems , in Proc. IEEE Int. Conf. Communications (ICC), pp. 1763\u20131769, 2015.","DOI":"10.1109\/ICC.2015.7248580"},{"issue":"1","key":"1739_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/LSP.2015.2500682","volume":"23","author":"F Ros\u00e0rio","year":"2016","unstructured":"F. Ros\u00e0rio, F.A. Monteiro, A. Rodrigues, Fast matrix inversion updates for massive MIMO detection and precoding. IEEE Signal Proc Lett 23(1), 75\u201379 (2016)","journal-title":"IEEE Signal Proc Lett"},{"issue":"14","key":"1739_CR11","doi-asserted-by":"publisher","first-page":"2228","DOI":"10.1049\/iet-com.2016.0743","volume":"11","author":"Q Deng","year":"2017","unstructured":"Q. Deng, L. Guo, C. Dong, J. Lin, D. Meng, X. Chen, High-throughput signal detection based on fast matrix inversion updates for uplink massive multiuser multiple-input multi-output systems. IET Commun. 11(14), 2228\u20132235 (2017)","journal-title":"IET Commun."},{"key":"1739_CR12","doi-asserted-by":"crossref","unstructured":"Q.Deng, L.Guo, Ch.Dong, X. Liang and J. Lin Hybrid Iterative Updates Detection Scheme for Uplink Dynamic Multiuser Massive MIMO Systems, in Proc. IEEE. Conf. (GC Wkshps), Singapore, 2017.","DOI":"10.1109\/GLOCOMW.2017.8269176"},{"key":"1739_CR13","doi-asserted-by":"crossref","unstructured":"T. Taniguchi and Y.K.N. Nakajima Partial update of antenna weight in multiuser MIMO for time-variant propagation channel, in Proc. Conf. Antennas and Propagation(EUCAP), Paris, Mar 2017.","DOI":"10.23919\/EuCAP.2017.7928162"},{"key":"1739_CR14","unstructured":"C. Chuan Yeh, K. N. Hsu and Y. H. Huang A low-complexity partially updated beam tracking algorithm for mmWave MIMO systems, in Proc. IEEE Glob. Conf. Sig. & Inf. Proc. (GlobalSIP), Washington, DC, 2016."},{"key":"1739_CR15","doi-asserted-by":"crossref","unstructured":"J. Eilert, D. Wu, D. Liu, Efficient Complex Matrix Inversion for MIMO Software Defined Radio (Proc. IEEE International Symposium on Circuits and Systems, LA, USA, May, 2007)","DOI":"10.1109\/ISCAS.2007.377850"},{"key":"1739_CR16","unstructured":"Burian A, Takala J, and M. Ylinen, a fixed-point implementation of matrix inversion using cholesky decomposition, in proc. IEEE 46th Midwest Symp. Circuits and Systems (MWSCAS) 3, 1431\u20131434 (2003)"},{"issue":"5","key":"1739_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1109\/LSP.2006.870373","volume":"13","author":"A Rontogiannis","year":"2006","unstructured":"A. Rontogiannis, V. Kekatos, K. Berberidis, A square-root adaptive V-BLAST algorithm for fast time-varying MIMO channels. IEEE Signal Process. Lett. 13(5), 265\u2013268 (2006)","journal-title":"IEEE Signal Process. Lett."},{"key":"1739_CR18","doi-asserted-by":"crossref","unstructured":"M. Wu, B. Yin, A. Vosoughi, C. Studer, J. R. Cavallaro, and C. Dick, Approximate matrix inversion for high-throughput data detection in the large-scale MIMO uplink, in Proc. IEEE Int. Symp. Circuits and Systems (ISCAS), 2013, pp. 2155\u20132158.","DOI":"10.1109\/ISCAS.2013.6572301"},{"key":"1739_CR19","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1109\/JSTSP.2014.2313021","volume":"8","author":"M Wu","year":"2014","unstructured":"M. Wu, B. Yin, G. Wang, C. Dick, J.R. Cavallaro, C. Studer, Large-scale MIMO detection for 3GPP LTE: Algorithms and FPGA implementations0. IEEE J. Sel. Top. Signal Process. 8, 916\u2013929 (2014)","journal-title":"IEEE J. Sel. Top. Signal Process."}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-020-01739-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13638-020-01739-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-020-01739-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T02:25:20Z","timestamp":1622687120000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-020-01739-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["1739"],"URL":"https:\/\/doi.org\/10.1186\/s13638-020-01739-9","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,3]]},"assertion":[{"value":"16 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"111"}}