Mohamed Oussama Damen

TL;DR: A novel algorithm is developed that is inspired by the Pohst enumeration strategy and is shown to offer a significant reduction in complexity compared to the Viterbo-Boutros sphere decoder and is supported by intuitive arguments and simulation results in many relevant scenarios.

TL;DR: A universal framework is developed for constructing full-rate and full-diversity coherent space-time codes for systems with arbitrary numbers of transmit and receive antennas, which subsumes many of the existing codes in the literature, extends naturally to time- selective and frequency-selective channels, and allows for more flexibility in the tradeoff between power efficiency, bandwidth efficiency, and receiver complexity.

TL;DR: The class of LAttice Space-Time (LAST) codes are introduced and it is shown that these codes achieve the optimal diversity-multiplexing tradeoff defined by Zheng and Tse under generalized minimum Euclidean distance lattice decoding.

TL;DR: A new family of linear space-time block codes is constructed by the combination of rotated constellations and the Hadamard transform, and it is shown that using the proposed codes in a multiantenna system yields good performances with high spectral efficiency and moderate decoding complexity.

TL;DR: The excellent performance-complexity tradeoff achieved by the proposed MMSE-DFE Fano decoder is established via simulation results and analytical arguments in several multiple-input multiple-output (MIMO) and intersymbol interference (ISI) scenarios.