On the complexity of ml lattice decoders for decoding linear full rate space-time codes

We present a study and a comparison in terms of complexity of two ML-lattice decoders, the Sphere-Decoder (SD) and the Schnorr-Euchner de- coder (SE), when used to decode multi-antenna trans- mission schemes, using full rate space-time codes, over a Rayleigh fading channel.

[1]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.

[2]  B. Hassibi,et al.  On the expected complexity of sphere decoding , 2001, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).

[3]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

[4]  Mohamed Oussama Damen,et al.  Universal space-time coding , 2003, IEEE Trans. Inf. Theory.

[5]  M. O. Damen,et al.  Generalised sphere decoder for asymmetrical space-time communication architecture , 2000 .

[6]  Sandra Galliou,et al.  A new family of full rate, fully diverse space-time codes based on Galois theory , 2002, Proceedings IEEE International Symposium on Information Theory,.

[7]  Mohamed Oussama Damen,et al.  Lattice code decoder for space-time codes , 2000, IEEE Communications Letters.

[8]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..