Turbo space-time coded modulation : principle and performance analysis

A breakthrough in coding was achieved with the invention of turbo codes. Turbo codes approach Shannon capacity by displaying the properties of long random codes, yet allowing efficient decoding. Coding alone, however, cannot fully address the problem of multipath fading channel. Recent advances in information theory have revolutionized the traditional view of multipath channel as an impairment. New results show that high gains in capacity can be achieved through the use of multiple antennas at the transmitter and the receiver. To take advantage of these new results in information theory, it is necessary to devise methods that allow communication systems to operate close to the predicted capacity. One such method recently invented is space-time coding, which provides both coding gain and diversity advantage. In this dissertation, a new class of codes is proposed that extends the concept of turbo coding to include space-time encoders as constituent building blocks of turbo codes. The codes are referred to as turbo spacetime coded modulation (turbo-STCM). The motivation behind the turbo-STCM concept is to fuse the important properties of turbo and space-time codes into a unified design framework. A turbo-STCM encoder is proposed, which consists of two space-time codes in recursive systematic form concatenated in parallel. An iterative symbol-by-symbol maximum a posteriori algorithm operating in the log domain is developed for decoding turbo-STCM. The decoder employs two a posteriori probability (APP) computing modules concatenated in parallel; one module for each constituent code. The analysis of turbo-STCM is demonstrated through simulations and theoretical closed-form expressions. Simulation results are provided for 4-PSK and 8-PSK schemes over the Rayleigh block-fading channel. It is shown that the turbo-STCM scheme features full diversity and full coding rate. The significant gain can be obtained in performance over conventional space-time codes of similar complexity. The analytical union bound to the bit error probability is derived for turbo-STCM over the additive white Gaussian noise (AWGN) and the Rayleigh block-fading channels. The bound makes it possible to express the performance analysis of turbo-STCM in terms of the properties of the constituent space-time codes. The union bound is demonstrated for 4-PSK and 8-PSK turbo-STCM with two transmit antennas and one/two receive antennas. Information theoretic bounds such as Shannon capacity, cutoff rate, outage capacity and the Fano bound, are computed for multiantenna systems over the AWGN and fading channels. These bounds are subsequently used as benchmarks for demonstrating the performance of turbo-STCM

Space-Time Codes Concatenated with Turbo Codes over Fading Channels

The uses of space-time code (STC) and iterative processing have enabled robust communications over fading channels at previously unachievable signal-to-noise ratios. Maintaining desired transmission rate while improving the diversity from STC is challenging, and the performance of the STC suffers considerably due to lack of channel state information (CSI). This dissertation research addresses issues of considerable importance in the design of STC with emphasis on efficient concatenation of channel coding and STC with theoretical bound derivation of the proposed schemes, iterative space-time trellis coding (STTC), and differential space-time codes. First, we concatenate space-time block code (STBC) with turbo code for improving diversity gain as well as coding gain. Proper soft-information sharing is indispensable to the iterative decoding process. We derive the required soft outputs from STBC decoders for passing to outer turbo code. Traditionally, the performance of STBC schemes has been evaluated under perfect channel estimation. For fast time-varying channel, obtaining the CSI is tedious if not impossible. We introduce a scheme of calculating the CSI at the receiver from the received signal without the explicit channel estimation. The encoder of STTC, which is generally decoded using Viterbi like algorithm, is based on a trellis structure. This trellis structure provides an inherent advantage for the STTC scheme that an iterative decoding is feasible with the minimal addition computational complexity. An iteratively decoded space-time trellis coding (ISTTC) is proposed in this dissertation, where the STTC schemes are used as constituent codes of turbo code. Then, the performance upper bound of the proposed ISTTC is derived. Finally, for implementing STBC without channel estimation and maintaining trans- mission rate, we concatenate differential space-time block codes (DSTBC) with ISTTC. The serial concatenation of DSTBC or STBC with ISTTC offers improving performance, even without an outer channel code. These schemes reduce the system complexity com- pared to the standalone ISTTC and increase the transmission rate under the same SNR condition. Detailed design procedures of these proposed schemes are analyzed

Super-orthogonal space-time turbo coded OFDM systems.

Thesis (Ph.D.)-University of KwaZulu-Natal, Durban, 2012.The ever increasing demand for fast and efficient broadband wireless communication services requires future broadband communication systems to provide a high data rate, robust performance and low complexity within the limited available electromagnetic spectrum. One of the identified, most-promising techniques to support high performance and high data rate communication for future wireless broadband services is the deployment of multi-input multi-output (MIMO) antenna systems with orthogonal frequency division multiplexing (OFDM). The combination of MIMO and OFDM techniques guarantees a much more reliable and robust transmission over a hostile wireless channel through coding over the space, time and frequency domains. In this thesis, two full-rate space-time coded OFDM systems are proposed. The first one, designed for two transmit antennas, is called extended super-orthogonal space-time trellis coded OFDM (ESOSTTC-OFDM), and is based on constellation rotation. The second one, called super-quasi-orthogonal space-time trellis coded OFDM (SQOSTTCOFDM), combines a quasi-orthogonal space-time block code with a trellis code to provide a full-rate code for four transmit antennas. The designed space-time coded MIMO-OFDM systems achieve a high diversity order with high coding gain by exploiting the diversity advantage of frequency-selective fading channels. Concatenated codes have been shown to be an effective technique of achieving reliable communication close to the Shannon limit, provided that there is sufficient available diversity. In a bid to improve the performance of the super orthogonal space-time trellis code (SOSTTC) in frequency selective fading channels, five distinct concatenated codes are proposed for MIMO-OFDM over frequency-selective fading channels in the second part of this thesis. Four of the coding schemes are based on the concatenation of convolutional coding, interleaving, and space-time coding, along multiple-transmitter diversity systems, while the fifth coding scheme is based on the concatenation of two space-time codes and interleaving. The proposed concatenated Super-Orthogonal Space-Time Turbo-Coded OFDM System I. B. Oluwafemi 2012 vii coding schemes in MIMO-OFDM systems achieve high diversity gain by exploiting available diversity resources of frequency-selective fading channels and achieve a high coding gain through concatenations by employing the turbo principle. Using computer software simulations, the performance of the concatenated SOSTTC-OFDM schemes is compared with those of concatenated space-time trellis codes and those of conventional SOSTTC-OFDM schemes in frequency-selective fading channels. Simulation results show that the concatenated SOSTTC-OFDM system outperformed the concatenated space-time trellis codes and the conventional SOSTTC-OFDM system under the various channel scenarios in terms of both diversity order and coding gain

Pré-filtragem no espaço-frequência para o sistema MC-CDMA

Doutoramento em Engenharia ElectrotécnicaO trabalho desta tese enquadra-se na área de comunicações móveis, mais especificamente em sistemas de portadora múltipla. O MC-CDMA, que combina a modulação OFDM com o espalhamento na frequência, é um dos candidatos mais promissores para a interface-ar dos futuros sistemas de comunicações móveis – 4G. O objectivo desta tese é propor e avaliar técnicas de pré-filtragem e de codificação, projectadas no espaço-frequência/tempo para o sistema MC-CDMA, no sentido descendente (Downlink). Inicialmente, são discutidos conceitos teóricos fundamentais para se compreender o mecanismo físico de propagação inerente às comunicações móveis, apresentando-se depois vários sistemas de portadora múltipla. É dada especial atenção ao sistema convencional MC-CDMA. Este sistema é importante porque serve de referência ao desempenho obtido com as técnicas de transmissão propostas nesta tese. Estas técnicas são projectadas tendo em conta as restrições em termos de complexidade do terminal móvel. Assim, a estação base é equipada com um agregado de antenas e o terminal móvel com uma antena, sendo neste último, apenas implementadas técnicas de detecção mono-utilizador. Assumindo, que a estação base conhece a resposta do canal antes da transmissão, são propostas diferentes estratégias de transmissão: os filtros são projectados no espaço-frequência para o sistema MC-CDMA combinados com ou sem equalização no terminal móvel; e o filtro é projectado apenas na frequência para o sistema MC-CDMA com codificação no espaço-frequência/tempo. O algoritmo é baseado na minimização da potência transmitida sujeita à total eliminação da interferência de acesso múltiplo e das distorções provocadas pelo canal rádio móvel. Todos os esquemas propostos são validados e comparados, através de simulações, em cenários típicos de interiores e exteriores. Como principal conclusão desta tese, destaca-se a significativa melhoria de desempenho obtido com estas técnicas, relativamente ao sistema convencional MC-CDMA. Além disso, este desempenho é conseguido com um terminal móvel de reduzida complexidade. Assim, estas técnicas permitem aumentar significativamente a capacidade do sistema e, simultaneamente, transferir grande parte da complexidade do terminal móvel para a estação base.The scope of this thesis targets multi-carrier modulation techniques for mobile radio communications system. MC-CDMA combining multi-carrier modulation and spreading in the frequency domain is widely viewed as a promising candidate for 4G air interfaces. The aim of this thesis is to propose and evaluate pre-filtering and coding techniques designed in space and frequency/time for the downlink MC-CDMA system. Initially, the fundamental propagation mechanisms inherent to mobile radio communications are discussed and then several multi-carrier schemes are presented. Furthermore, special attention is given to the conventional MCCDMA system, since it can be used as the reference benchmark performance for the advanced transmission techniques proposed in this thesis. These transmission schemes are designed taking into account the complexity constraints at the mobile terminal. Hence, the basestation is equipped with an antenna array and the mobile terminal comprises a single antenna and single user detection scheme. Based on the assumption that the basestation has prior channel knowledge, different transmission strategies are proposed: spacefrequency pre-filtering schemes combined with single user equalizers at the MT for the MC-CDMA system; frequency pre-filtering scheme for spacefrequency/ time coding MC-CDMA system. The algorithm is based on the minimization of the transmitted power subject to MAI and channel distortion elimination. The proposed pre-filtering schemes are assessed and compared through simulations in typical indoor and pedestrian scenarios. This work concluded that with the proposed pre-filtering schemes, we obtain a considerable performance improvement in typical indoor and outdoor scenarios with a low complexity mobile terminal design and allow a transfer of implementation complexity from the mobile to the basestation