Optimal diversity performance of space time block codes in correlated distributed MIMO channels

This paper investigates optimal transmission of space-time block codes (STBCs) in distributed multiple-input multiple-output (D-MIMO) Rayleigh fading channels. The optimal diversity performance is achieved through transmit power allocation implemented at the receiver based on transmit and receive correlations to minimize the average symbol error rate (SER). Evaluation of SER performance of uncoded STBCs over a generalized distributed antenna (DA) topology is first presented, with exact analytical SER expressions derived for MQAM and MPSK symbols. SER upper bounds are also derived, based on which two criteria for complexity reduced antenna subset selection with sub-optimal power allocation are further proposed, whose performance approaches optimal over correlated D-MIMO channels. Moreover, a novel simplified but close SER approximation scheme is devised to significantly facilitate optimal SER calculation. We continue to thoroughly analyze how the optimal diversity is affected by large scale fading, targeted data rate, antenna correlations and transmit power. Finally, we develop a surprisingly close and useful analogy between open loop STBCs in co-located MIMO and optimal STBCs in D-MEVIO with minimum feedback (i.e., n bits for n DAs in Criterion 2 with power allocation scheme 2 which equally allocates power to the selected DAs). Extensive simulation results have been presented to demonstrate the effectiveness of our analysis. © 2008 IEEE.published_or_final_versio

Digital signal processing techniques for peak-to-average power ratio mitigation in MIMO–OFDM systems

The focus of this thesis is to mitigate the very large peak-to-average transmit power ratios (PAPRs) inherent to conventional orthogonal frequency division multiplexing (OFDM) systems, particularly in the context of transmission over multi-input multi-output (MIMO) wireless broadband channels. This problem is important as a large PAPR generally needs an expensive radio frequency (RF) power amplifier at the transmitter due to the requirement for linear operation over a wide amplitude range and such a cost would be compounded when multiple transmit antennas are used. Advanced signal processing techniques which can reduce PAPR whilst retain the integrity of digital transmission therefore have considerable potential for application in emergent MIMO–OFDM wireless systems and form the technical contributions of this study. [Continues.

Modified quasi-orthogonal space-time block coding in distributed wireless networks

Cooperative networks have developed as a useful technique that can achieve the same advantage as multi-input and multi-output (MIMO) wireless systems such as spatial diversity, whilst resolving the difficulties of co-located multiple antennas at individual nodes and avoiding the effect of path-loss and shadowing. Spatial diversity in cooperative networks is known as cooperative diversity, and can enhance system reliability without sacrificing the scarce bandwidth resource or consuming more transmit power. It enables single-antenna terminals in a wireless relay network to share their antennas to form a virtual antenna array on the basis of their distributed locations. However, there remain technical challenges to maximize the benefit of cooperative communications, e.g. data rate, asynchronous transmission and outage. In this thesis, therefore, firstly, a modified distributed quasi-orthogonal space-time block coding (M-D-QO-STBC) scheme with increased code gain distance (CGD) for one-way and two-way amplify-and-forward wireless relay networks is proposed. This modified code is designed from set partitioning a larger codebook formed from two quasi-orthogonal space time block codes with different signal rotations then the subcodes are combined and pruned to arrive at the modified codebook with the desired rate in order to increase the CGD. Moreover, for higher rate codes the code distance is maximized by using a genetic algorithm to search for the optimum rotation matrix. This scheme has very good performance and significant coding gain over existing codes such as the open-loop and closed-loop QO-STBC schemes. In addition, the topic of outage probability analysis in the context of multi-relay selection from $N$ available relay nodes for one-way amplify-and-forward cooperative relay networks is considered together with the best relay selection, the $N^{th}$ relay selection and best four relay selection in two-way amplify-and-forward cooperative relay networks. The relay selection is performed either on the basis of a max-min strategy or one based on maximizing exact end-to-end signal-to-noise ratio. Furthermore, in this thesis, robust schemes for cooperative relays based on the M-D-QO-STBC scheme for both one-way and two-way asynchronous cooperative relay networks are considered to overcome the issue of a synchronism in wireless cooperative relay networks. In particular, an orthogonal frequency division multiplexing (OFDM) data structure is employed with cyclic prefix (CP) insertion at the source in the one-way cooperative relay network and at the two terminal nodes in the two-way cooperative network to combat the effects of time asynchronism. As such, this technique can effectively cope with the effects of timing errors. Finally, outage probability performance of a proposed amplify-and-forward cooperative cognitive relay network is evaluated and the cognitive relays are assumed to exploit an overlay approach. A closed form expression for the outage probability for multi-relay selection cooperation over Rayleigh frequency flat fading channels is derived for perfect and imperfect spectrum acquisitions. Furthermore, the M-QO-STBC scheme is also proposed for use in wireless cognitive relay networks. MATLAB and Maple software based simulations are employed throughout the thesis to support the analytical results and assess the performance of new algorithms and methods

Performance Analysis of MIMO-STBC Systems with Higher Coding Rate Using Adaptive Semiblind Channel Estimation Scheme

Semiblind channel estimation method provides the best trade-off in terms of bandwidth overhead, computational complexity and latency. The result after using multiple input multiple output (MIMO) systems shows higher data rate and longer transmit range without any requirement for additional bandwidth or transmit power. This paper presents the detailed analysis of diversity coding techniques using MIMO antenna systems. Different space time block codes (STBCs) schemes have been explored and analyzed with the proposed higher code rate. STBCs with higher code rates have been simulated for different modulation schemes using MATLAB environment and the simulated results have been compared in the semiblind environment which shows the improvement even in highly correlated antenna arrays and is found very close to the condition when channel state information (CSI) is known to the channel

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

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)

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

Distributed Quasi-Orthogonal Space-Time coding in wireless cooperative relay networks

Cooperative diversity provides a new paradigm in robust wireless re- lay networks that leverages Space-Time (ST) processing techniques to combat the effects of fading. Distributing the encoding over multiple relays that potentially observe uncorrelated channels to a destination terminal has demonstrated promising results in extending range, data- rates and transmit power utilization. Specifically, Space Time Block Codes (STBCs) based on orthogonal designs have proven extremely popular at exploiting spatial diversity through simple distributed pro- cessing without channel knowledge at the relaying terminals. This thesis aims at extending further the extensive design and analysis in relay networks based on orthogonal designs in the context of Quasi- Orthogonal Space Time Block Codes (QOSTBCs). The characterization of Quasi-Orthogonal MIMO channels for cooper- ative networks is performed under Ergodic and Non-Ergodic channel conditions. Specific to cooperative diversity, the sub-channels are as- sumed to observe different shadowing conditions as opposed to the traditional co-located communication system. Under Ergodic chan- nel assumptions novel closed-form solutions for cooperative channel capacity under the constraint of distributed-QOSTBC processing are presented. This analysis is extended to yield closed-form approx- imate expressions and their utility is verified through simulations. The effective use of partial feedback to orthogonalize the QOSTBC is examined and significant gains under specific channel conditions are demonstrated. Distributed systems cooperating over the network introduce chal- lenges in synchronization. Without extensive network management it is difficult to synchronize all the nodes participating in the relaying between source and destination terminals. Based on QOSTBC tech- niques simple encoding strategies are introduced that provide compa- rable throughput to schemes under synchronous conditions with neg- ligible overhead in processing throughout the protocol. Both mutli- carrier and single-carrier schemes are developed to enable the flexi- bility to limit Peak-to-Average-Power-Ratio (PAPR) and reduce the Radio Frequency (RF) requirements of the relaying terminals. The insights gained in asynchronous design in flat-fading cooperative channels are then extended to broadband networks over frequency- selective channels where the novel application of QOSTBCs are used in distributed-Space-Time-Frequency (STF) coding. Specifically, cod- ing schemes are presented that extract both spatial and mutli-path diversity offered by the cooperative Multiple-Input Multiple-Output (MIMO) channel. To provide maximum flexibility the proposed schemes are adapted to facilitate both Decode-and-Forward (DF) and Amplify- and-Forward (AF) relaying. In-depth Pairwise-Error-Probability (PEP) analysis provides distinct design specifications which tailor the distributed- STF code to maximize the diversity and coding gain offered under the DF and AF protocols. Numerical simulation are used extensively to confirm the validity of the proposed cooperative schemes. The analytical and numerical re- sults demonstrate the effective use of QOSTBC over orthogonal tech- niques in a wide range of channel conditions