Yongmei Dai

TL;DR: A comparative study of two tree search based detection algorithms, namely, the M-algorithm combined with QR decomposition (QRD-M) and the sphere decoding (SD) algorithms, for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems shows that nodes ordering before and during the tree search are important for both algorithms.

TL;DR: The proposed algorithm can effectively mitigate the detrimental effect of MIMO channel ill-conditions on the bit error rate (BER) performance and the number of retained branches can be reduced to half of the original QRD-M algorithm in Kyeong Jin Kim and R.A. Iltis (2002).

TL;DR: A list sphere decoder (LSD) based turbo receiver is introduced for groupwise space time trellis coded (GSTTC) systems and shows that good FER and BER performances as well as fast convergence can be achieved with a very small list for simple STT codes with a small number of states.

TL;DR: A low complexity MIMO detection scheme is proposed to achieve near optimal maximum likelihood (ML) detection performance, which is especially efficient in high data rate packet transmission systems, such as wireless LAN based hotspots, fixed broadband wireless access systems, or 4G cellular based hotspot etc.

TL;DR: An ordered detection algorithm which compensates the diversity loss by always detecting the group with the strongest post-nulling signal-to-noise ratio is proposed.