An Optimal Complex Precoder for Quasi-Orthogonal Space-Time Block Codes with reduced Decoding Complexity

In this paper, we present an optimal linear complex precoder for quasi-orthogonal space-time block codes (QoSTBC). The advantage of the proposed coding scheme is that the diversity product can be maximized. Moreover, the smaller kissing number is achieved. The performance of the proposed coding scheme is studied in comparison with that of signal-constellation space-time block code (SC-QoSTBC) and space-time linear constellation precoder (ST-LCP). And our study shows that the proposed coding scheme offers full rate and outperforms SC-QoSTBC and ST-LCP.