Achieving Low-Complexity Maximum-Likelihood Detection for the 3D MIMO Code

@article{Liu2014AchievingLM,
  title={Achieving Low-Complexity Maximum-Likelihood Detection for the 3D MIMO Code},
  author={Ming Liu and Matthieu Crussi{\`e}re and Maryline H{\'e}lard and Jean-François H{\'e}lard},
  journal={EURASIP J. Wireless Comm. and Networking},
  year={2014},
  volume={2014},
  pages={20}
}
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(M4.5) instead of O(M8) in quasi-static channel withM-ary square QAMmodulations… CONTINUE READING
2
Twitter Mentions

Figures, Tables, and Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 30 REFERENCES

Fast maximum-likelihood decoding of the golden code

  • IEEE Transactions on Wireless Communications
  • 2010
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

On Fast-Decodable Space–Time Block Codes

  • IEEE Transactions on Information Theory
  • 2008
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

A new family of low - complexity STBCs for four transmit antennas

MO Sinnokrot, J Fiorina, H Sari
  • IEEE Trans . Wireless Commun .
  • 2013

Reduced complexity space-time coding in single-frequency networks

  • 2011 IEEE Wireless Communications and Networking Conference
  • 2011
VIEW 1 EXCERPT

A 4×4 64-QAM reduced-complexity K-best MIMO detector up to 1.5Gbps

  • Proceedings of 2010 IEEE International Symposium on Circuits and Systems
  • 2010
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…