Differential Coding for MIMO and Cooperative Communications

Multiple-input multiple-output (MIMO) wireless communication systems have been studied a lot in the last ten years. They have many promising features like array gain, diversity gain, spatial multiplexing gain, interference reduction, and improved capacity as compared to a single-input single-output (SISO) systems. However, the increasing demand of high data-rate in current wireless communications systems motivated us to investigate new rate-efficient channel coding techniques. In this dissertation, we study differential modulation for MIMO systems. Differential modulation is useful since it avoids the need of channel estimation by the receiver and saves valuable bandwidth with a slight symbol error-rate (SER) performance loss. The effect of channel correlation over differential MIMO system has not been studied in detail so far. It has been shown in the literature that a linear memoryless precoder can be used to improve the performance of coherent MIMO system over correlated channels. In this work, we implement precoded differential modulation for non-orthogonal and orthogonal space-time blocks codes (STBCs) over arbitrarily correlated channels. We design precoders based on pair-wise error probability (PEP) and approximate SER for differential MIMO system. The carrier offsets, which result because of the movement of the receiver or transmitter and/or scatterers, and mismatch between the transmit and receive oscillators, are a big challenge for the differential MIMO system. The carrier offsets make the flat fading channel behave as a time-varying channel. Hence, the channel does not remain constant over two consecutive STBC block transmission time-intervals, which is a basic assumption for differential systems and the differential systems break down. Double-differential coding is a key technique which could be used to avoid the need of both carrier offset and channel estimation. In this work, we propose a double-differential coding for full-rank and square orthogonal space-time block codes (OSTBC) with M-PSK constellation. A suboptimal decoder for the double-differentially encoded OSTBC is obtained. We also derive a simple PEP upper bound for the double-differential OSTBC. A precoder is also designed based on the PEP upper bound for the double-differential OSTBC to make it more robust against arbitrary MIMO channel correlations. Cooperative communication has several promising features to become a main technology in future wireless communications systems. It has been shown in the literature that the cooperative communication can avoid the difficulties of implementing actual antenna array and convert the SISO system into a virtual MIMO system. In this way, cooperation between the users allows them to exploit the diversity gain and other advantages of MIMO system at a SISO wireless network. A cooperative communication system is difficult to implement in practice because it generally requires that all cooperating nodes must have the perfect knowledge of the channel gains of all the links in the network. This is infeasible in a large wireless network like cellular system. If the users are moving and there is mismatch between the transmit and receive oscillators, the resulting carrier offset may further degrade the performance of a cooperative system. In practice, it is very difficult to estimate the carrier offset perfectly over SISO links. A very small residual offset error in the data may degrade the system performance substantially. Hence, to exploit the diversity in a cooperative system in the presence of carrier offsets is a big challenge. In this dissertation, we propose double-differential modulation for cooperative communication systems to avoid the need of the knowledge of carrier offset and channel gain at the cooperating nodes (relays) and the destination. We derive few useful SER/bit error rate (BER) expressions for double-differential cooperative communication systems using decode-and-forward and amplify-and-forward protocols. Based on these SER/BER expressions, power allocations are also proposed to further improve the performance of these systems. List of papers included in the dissertation This dissertation is based on the following five papers, referred to in the text by letters (A-E)

Precoded DOSTBC over Rayleigh Channels

Differential orthogonal space-time block codes (DOSTBC) sent over correlated Rayleigh fading channels are considered in this paper. Approximate expressions for the symbol error rate (SER) are derived for DOSTBC with M-PSK, M-PAM, and M-QAM constellations assuming arbitrary correlation between the transmit and receive antennas. A full memoryless precoder is designed to improve the performance of the DOSTBC over correlated Rayleigh MIMO channels. The proposed precoder design differs from the previous work: (1) our precoder design considers arbitrary correlation in the channels, whereas the previously proposed precoder design considers only transmit correlations in the Kronecker correlation model; (2) the proposed precoder is based on minimizing proposed SER, whereas the previously proposed precoder is based on minimizing the Chernoff bound of approximate SER; (3) we propose precoder design for DOSTBC with M-PSK, M-PAM, and M-QAM constellations, whereas the previously proposed precoder works for DOSTBC with M-PSK only. Additionally, the proposed precoded DOSTBC outperforms the conventional eigenbeamforming-based precoded DOSTBC for the Kronecker model with only transmit correlation

Técnicas de pré-codificação para sistemas multicelulares coordenados

Doutoramento em TelecomunicaçõesCoordenação Multicélula é um tópico de investigação em rápido crescimento e uma solução promissora para controlar a interferência entre células em sistemas celulares, melhorando a equidade do sistema e aumentando a sua capacidade. Esta tecnologia já está em estudo no LTEAdvanced sob o conceito de coordenação multiponto (COMP). Existem várias abordagens sobre coordenação multicélula, dependendo da quantidade e do tipo de informação partilhada pelas estações base, através da rede de suporte (backhaul network), e do local onde essa informação é processada, i.e., numa unidade de processamento central ou de uma forma distribuída em cada estação base. Nesta tese, são propostas técnicas de pré-codificação e alocação de potência considerando várias estratégias: centralizada, todo o processamento é feito na unidade de processamento central; semidistribuída, neste caso apenas parte do processamento é executado na unidade de processamento central, nomeadamente a potência alocada a cada utilizador servido por cada estação base; e distribuída em que o processamento é feito localmente em cada estação base. Os esquemas propostos são projectados em duas fases: primeiro são propostas soluções de pré-codificação para mitigar ou eliminar a interferência entre células, de seguida o sistema é melhorado através do desenvolvimento de vários esquemas de alocação de potência. São propostas três esquemas de alocação de potência centralizada condicionada a cada estação base e com diferentes relações entre desempenho e complexidade. São também derivados esquemas de alocação distribuídos, assumindo que um sistema multicelular pode ser visto como a sobreposição de vários sistemas com uma única célula. Com base neste conceito foi definido uma taxa de erro média virtual para cada um desses sistemas de célula única que compõem o sistema multicelular, permitindo assim projectar esquemas de alocação de potência completamente distribuídos. Todos os esquemas propostos foram avaliados em cenários realistas, bastante próximos dos considerados no LTE. Os resultados mostram que os esquemas propostos são eficientes a remover a interferência entre células e que o desempenho das técnicas de alocação de potência propostas é claramente superior ao caso de não alocação de potência. O desempenho dos sistemas completamente distribuídos é inferior aos baseados num processamento centralizado, mas em contrapartida podem ser usados em sistemas em que a rede de suporte não permita a troca de grandes quantidades de informação.Multicell coordination is a promising solution for cellular wireless systems to mitigate inter-cell interference, improving system fairness and increasing capacity and thus is already under study in LTE-A under the coordinated multipoint (CoMP) concept. There are several coordinated transmission approaches depending on the amount of information shared by the transmitters through the backhaul network and where the processing takes place i.e. in a central processing unit or in a distributed way on each base station. In this thesis, we propose joint precoding and power allocation techniques considering different strategies: Full-centralized, where all the processing takes place at the central unit; Semi-distributed, in this case only some process related with power allocation is done at the central unit; and Fulldistributed, where all the processing is done locally at each base station. The methods are designed in two phases: first the inter-cell interference is removed by applying a set of centralized or distributed precoding vectors; then the system is further optimized by centralized or distributed power allocation schemes. Three centralized power allocation algorithms with per-BS power constraint and different complexity tradeoffs are proposed. Also distributed power allocation schemes are proposed by considering the multicell system as superposition of single cell systems, where we define the average virtual bit error rate (BER) of interference-free single cell system, allowing us to compute the power allocation coefficients in a distributed manner at each BS. All proposed schemes are evaluated in realistic scenarios considering LTE specifications. The numerical evaluations show that the proposed schemes are efficient in removing inter-cell interference and improve system performance comparing to equal power allocation. Furthermore, fulldistributed schemes can be used when the amounts of information to be exchanged over the backhaul is restricted, although system performance is slightly degraded from semi-distributed and full-centralized schemes, but the complexity is considerably lower. Besides that for high degrees of freedom distributed schemes show similar behaviour to centralized ones