The Component-Interleaved Golden Code and Its Low-Complexity Detection

In this paper, component interleaving for the Golden code is investigated. The proposed component-interleaved Golden code (CI-Golden code) not only preserves the full rate and full diversity of the conventional Golden code, but also achieves signal space diversity. The maximum-likelihood detection complexity of the CI-Golden code is proportional to $\mathcal {O}(M^{8})$ for $M$ -ary quadrature amplitude modulation ($M$ QAM) and is extremely high. Hence, two low-complexity detection schemes, a QR decomposition-based detection scheme and sphere decoding with detection subset, are proposed. Furthermore, the bound on average bit error probability (ABEP) for the $M$ QAM CI-Golden code, which is valid for more than 2 receive antennas is formulated. Simulation results show that the two proposed low-complexity detection schemes can converge to the ABEP for more than two receive antennas. Both the ABEP and simulation results show that the proposed CI-Golden code with three and four receive antennas can achieve a signal-to-noise ratio gain of more than 1.6 dB at a bit error rate of $1\times 10^{-5}$ for 16QAM and 64QAM, respectively, compared to the conventional Golden code. The computational complexity for the proposed schemes is further discussed.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.