Reduced Complexity Detection Schemes for Golden Code Systems

Abstract

The Golden code has full-rate and full-diversity. However, its applications are limited because of the very high detection complexity. The complexity of sphere decoding depends on the size of signal set, $M^{2}$ , and the depth of search. Meanwhile, the complexity of fast essentially maximum likelihood (ML) detection is still $\mathcal {O}(M^{2})$ for $M$ -ary quadrature amplitude modulation ( $M$ QAM). In this paper, we propose two reduced complexity detection schemes, fast essentially ML with detection subset and sphere decoding with detection subset. Two theoretical bounds on the average bit error probability for the Golden code with $M$ QAM are also formulated in this paper. Simulation results demonstrate that both the fast essentially ML with detection subset and sphere decoding with detection subset agree well with the formulated theoretical bounds and can achieve the error performance of the conventional fast essentially ML detector and sphere decoding.