This dissertation focuses on three major advances on multiple-input multiple-output (MIMO) systems. The first studies and compares decoding algorithms for multi-layered space time coded (MLSTC) systems. These are single user systems that combine spatial multiplexing and transmit diversity. Each layer consists of a space time code. The detection algorithms are based on multi-user detection theory. We consider joint, interference nulling and cancellation, and spatial sequence estimation algorithms. As part of joint detection algorithms, the sphere decoder is studied and its complexity is evaluated over MIMO channels. The second part contributes to the field of space frequency time (SFT) coding for MIMO-OFDM systems. It proposes a full spatial and frequency diversity codes at much lower number of trellis states. The third part proposes and compares uplink scheduling algorithms for multiuser systems with spatial multiplexing. Several scheduling criteria are examined and compared.
The capacity and error rate study of MLSTBC reveals the performance of the detection algorithms and their advantage over other open loop MIMO schemes. The results show that the nulling and cancellation operations limit the diversity of the system to the first detected layer in serial algorithms. For parallel algorithms, the diversity of the system is dominated by the performance after parallel nulling. Theoretically, parallel cancellation should provide full receive diversity per layer but error propagations as a result of cancellation prevent the system from reaching this goal. However, parallel cancellation provides some gains but it doesn't increase the diversity. On the other hand, joint detection provides full receive diversity per layer. It could be practically implemented with sphere decoding which has a cubic complexity at high SNR.
The results of the SFT coding show the superiority of the IQ-SFT codes over other codes at the same number of sates. The IQ-SFT codes achieve full spatial and frequency diversity at much lower number of trellis states compared to conventional codes. For V-BLAST scheduling, we propose V-BLAST capacity maximizing scheduler and we show that scheduling based on optimal MIMO capacity doesn't work well for V-BLAST. The results also show that maximum minimum singularvalue (MaxMinSV) scheduling performs very close to the V-BLAST capacity maximizing scheduler since it takes into account both the channel power and the orthogonality of the channel. / Ph. D.
| Identifer | oai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/29498 |
| Date | 01 December 2005 |
| Creators | Al-Ghadhban, Samir Naser |
| Contributors | Electrical and Computer Engineering, Buehrer, R. Michael, Holub, James R., Tranter, William H., Riad, Sedki Mohamed, Woerner, Brian D. |
| Publisher | Virginia Tech |
| Source Sets | Virginia Tech Theses and Dissertation |
| Detected Language | English |
| Type | Dissertation |
| Format | application/pdf |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
| Relation | PhD_Diss_FinalDraft2.pdf |
Page generated in 0.0025 seconds