Fast Symbol Detection for Massive G-STBC MIMO Systems

In this paper, a group-based fast symbol detection scheme is proposed for massive Group-wise Space–Time Block Code Multiple-Input Multiple-Output systems. The proposed scheme first chooses a number G, (e.g. G=4,6,8\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G=4,6,8$$\end{document}) as the size of each group and then conducts the Minimum Mean Square Error (MMSE) detectors to facilitate symbol detection group by group. In particular, instead of directly using huge computational complexity to compute the MMSE detectors, the proposed scheme recursively finds the corresponding assistant matrices to determine the groups and calculate the MMSE detectors. As a result, the transmitted symbols can be recursively estimated group by group. Finally, simulation results and complexity analysis show the proposed scheme performs very close to the existing methods, while using lower computational complexity.