Space-time-frequency block codes for MIMO-OFDM in next generation wireless systems

In this thesis the use of space-frequency block codes (SFBC) and space-time-frequency block codes (STFBC) in wireless systems are investigated. A variety of SFBC and STFBC schemes are proposed for particular propagation scenarios and system settings where each has its own advantages and disadvantages. The objective is to pro-pose coding strategies with improved flexibility, feasibility and spectral efficiency,and reduce the decoding complexity in an MIMO-OFDM system. Firstly an efficient SFBC with improved system performance is proposed for MIMO-OFDM systems. The proposed SFBC incorporates the concept of matched rotation precoding (MRP) to achieve full transmit diversity and optimal system performance foran arbitrary numberoftransmitantennas,subcarrierinterval andsubcarriergrouping. The MRP is proposed to exploit the inherent rotation and repetition properties of SFBC, arising from the channel power delay profile, in order to fully capture both space and frequency diversity of SFBC in a MIMO-OFDM system. It is able to relax restrictions on subcarrier interval and subcarrier grouping, making it ideal for adaptive/time-varying systems or multiuser systems. The SFBC without an optimization process is unstable in terms of achievable system performance and diversity order, and also risks diversity loss within a specific propagation scenario. Such loss or risk is prominent while wireless propagation channel has a limited number of dominant paths, e.g. relatively close to transmitters or relatively flat topography. Hence in orderto improve the feasibility of SFBC in dynamic scenarios, the lower bound of the coding gain for MRP is derived. The SFBC with MRP is proposed for more practical scenarios when only partial channel power delay profile information is known at the transmit end, for example the wireless channel has dominant propagation paths. The proposed rate one MRP has a relatively simple optimization process that can be transformed into an explicit diagram and hence an optimal result can be derived intuitively without calculations. Next, a multi-rate transmission strategy is proposed for both SFBCand STFBC to balance the system performance and transmission rate. A variety of rate adaptive coding matrices are obtained by a simple truncation of the coding matrix, or by parameter optimization for coding matrices for a given transmission rate and constellation. Pro-posed strategy can easily and gradually adjust the achievable diversity order. As a result it is capable of achieving a relatively smooth balance between system performance and transmission rate in both SFBC and STFBC, without a significant change of coding structure or constellation size. Such tradeoff would be useful to maintain stable Quality of Service (QoS) for users by providing more scalability of achievable performance in a time-varying channel. Finally the decoding procedure of space-time block code (STBC), SFBCand STFBC is discussed. The decoding of all existing STBC/SFBC/STFBC is unified at first, in order to show a concise procedure and make fair comparisons. Then maximum likelihood decoding (MLD) and arbitrary sphere decoding (SD) can be adopted. To reduce the complexity of decoding further, a novel decoding method called compensation de-coding (CD) is presented for a given space-time-frequency coding scheme. By taking advantage of the simplicity of zero-forcing decoding (ZFD) we are able to calculate a compensation vector for the output of ZFD. After modification by utilizing the com-pensation vector, the BER performance can be improved significantly. The decoding procedure is relatively simple and is independent of the constellation size. The per-formance of the proposed decoding method is close to maximum-likelihood decoding for low to medium SNR. A low complexity detection scheme, classifier based decoding (CBD), is further proposed for MIMO systems incorporating spatial multiplexing. The CBD is a hybrid of an equalizer-based technique and an algorithmic search stage. Based on an error matrix and its probability density functions for different classes of error, a particular search region is selected for the algorithmic stage. As the probability of occurrence of error classes with larger search regions is small, overall complexity of the proposed technique remains low, whilst providing a significant improvement in the bit error rate performance