Reduced-complexity maximum-likelihood decoding for 3D MIMO code - Université de Rennes Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Reduced-complexity maximum-likelihood decoding for 3D MIMO code

Résumé

The 3D MIMO code is a robust and efficient space-time coding scheme for the distributed MIMO broadcasting. However, it suffers from the high computational complexity if the optimal maximum-likelihood (ML) decoding is used. In this paper we first investigate the unique properties of the 3D MIMO code and consequently propose a simplified decoding algorithm without sacrificing the ML optimality. Analysis shows that the decoding complexity is reduced from O(M^8) to O(M^{4.5}) in quasi-static channels when M-ary square QAM constellation is used. Moreover, we propose an efficient implementation of the simplified ML decoder which achieves a much lower decoding time delay compared to the classical sphere decoder with Schnorr-Euchner enumeration.
Fichier principal
Vignette du fichier
WCNC2013.pdf (168.39 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00924442 , version 1 (07-01-2014)

Identifiants

Citer

Ming Liu, Jean-François Hélard, Matthieu Crussière, Maryline Hélard. Reduced-complexity maximum-likelihood decoding for 3D MIMO code. IEEE Wireless Communications and Networking Conference (WCNC 2013), Apr 2013, Shanghai, China. pp.4015-4020, ⟨10.1109/WCNC.2013.6555219⟩. ⟨hal-00924442⟩
181 Consultations
200 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More