Achieving low-complexity maximum-likelihood detection for the 3D MIMO code

Abstract

The 3D Multiple-input multiple-output (MIMO) code is a robust and efficient space-time block code (STBC) for the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML) decoding complexity. In this paper, we first analyze some properties of the 3D MIMO code to show that the 3D MIMO code is fast decodable. It is proven that the ML decoding performance can be achieved with a complexity of O(M 4.5 ) instead of O(M 8 ) in quasi-static channel with M-ary square QAM modulations. Consequently, we propose a simplified ML decoder exploiting the unique properties of the 3D MIMO code. Simulation results show that the proposed simplified ML decoder can achieve much lower processing time latency compared to the classical sphere decoder with Schnorr-Euchner enumeration.

Optimal reception of sub-sampled time-domain sparse signals in wired/wireless OFDM transceivers

“…Similarly, the symbol error rate (SER) of space time space (3D) MIMO STBC systems with 4 transmit antennas is presented in [26]. As can be seen from the results listed in Table 2, a BER around 10 −4 (achieved in many cases in this work when channel SNR is above 30 dB), is acceptable compared either to the reference [25], or the most relevant approaches like [11].…”