Adaptive Randomized Distributed Space-Time Coding in Cooperative MIMO Relay Systems

An adaptive randomized distributed space-time coding (DSTC) scheme and algorithms are proposed for two-hop cooperative MIMO networks. Linear minimum mean square error (MMSE) receivers and an amplify-and-forward (AF) cooperation strategy are considered. In the proposed DSTC scheme, a randomized matrix obtained by a feedback channel is employed to transform the space-time coded matrix at the relay node. Linear MMSE expressions are devised to compute the parameters of the adaptive randomized matrix and the linear receive filter. A stochastic gradient algorithm is also developed to compute the parameters of the adaptive randomized matrix with reduced computational complexity. We also derive the upper bound of the error probability of a cooperative MIMO system employing the randomized space-time coding scheme first. The simulation results show that the proposed algorithms obtain significant performance gains as compared to existing DSTC schemes.Comment: 4 figure

Space time transceiver design over multipath fading channels

Imperial Users onl

Distributed Space-Time Coding Based on Adjustable Code Matrices for Cooperative MIMO Relaying Systems

An adaptive distributed space-time coding (DSTC) scheme is proposed for two-hop cooperative MIMO networks. Linear minimum mean square error (MMSE) receive filters and adjustable code matrices are considered subject to a power constraint with an amplify-and-forward (AF) cooperation strategy. In the proposed adaptive DSTC scheme, an adjustable code matrix obtained by a feedback channel is employed to transform the space-time coded matrix at the relay node. The effects of the limited feedback and the feedback errors are assessed. Linear MMSE expressions are devised to compute the parameters of the adjustable code matrix and the linear receive filters. Stochastic gradient (SG) and least-squares (LS) algorithms are also developed with reduced computational complexity. An upper bound on the pairwise error probability analysis is derived and indicates the advantage of employing the adjustable code matrices at the relay nodes. An alternative optimization algorithm for the adaptive DSTC scheme is also derived in order to eliminate the need for the feedback. The algorithm provides a fully distributed scheme for the adaptive DSTC at the relay node based on the minimization of the error probability. Simulation results show that the proposed algorithms obtain significant performance gains as compared to existing DSTC schemes.Comment: 6 figure

Reducing Multiple Access Interference in Broadband Multi-User Wireless Networks

This dissertation is devoted to developing multiple access interference (MAI) reduction techniques for multi-carrier multi-user wireless communication networks. In multi-carrier code division multiple access (MC-CDMA) systems, a full multipath diversity can be achieved by transmitting one symbol over multiple orthogonal subcarriers by means of spreading codes. However, in frequency selective fading channels, orthogonality among users can be destroyed leading to MAI. MAI represents the main obstacle to support large number of users in multi-user wireless systems. Consequently, MAI reduction becomes a main challenge when designing multi-carrier multi-user wireless networks. In this dissertation, first, we study MC-CDMA systems with different existing MAI reduction techniques. The performance of the studied systems can be further improved by using a fractionally spaced receivers instead of using symbol spaced receivers. A fractionally spaced receiver is obtained by oversampling received signals in a time domain. Second, a novel circular-shift division multiple access (CSDMA) scheme for multi-carrier multi-user wireless systems is developed. In CSDMA, each symbol is first spread onto multiple orthogonal subcarriers in the frequency domain through repetition codes. The obtained frequency-domain signals are then converted to a time-domain representation. The time-domain signals of different users are then circularly shifted by different numbers of locations. The time-domain circular shifting enables the receiver to extract signals from different users with zero or a small amount of MAI. Our results show that the CSDMA scheme can achieve a full multipath diversity with a performance outperforms that of orthogonal frequency division multiple access (OFDMA). Moreover, multipath diversity of CSDMA can be further improved by employing the time-domain oversampling. Performance fluctuations due to a timing offset between transmitter and receiver clocks in MC-CDMA and CSDMA systems can be removed by employing the time-domain oversampling. Third, we study the theoretical error performance of high mobility single-user wireless communication system with doubly selective (time-varying and frequency-selective) fading channel under impacts of imperfect channel state information (CSI). Throughout this dissertation, intensive computer simulations are performed under various system configurations to investigate the obtained theoretical results, excellent agreements between simulation and theoretical results were observed in this dissertation

Low Complexity Scalable Iterative Algorithms for IEEE 802.11p Receivers

In this paper, we investigate receivers for Vehicular to Vehicular (V2V) and Vehicular to Infrastructure (V2I) communications. Vehicular channels are characterized by multiple paths and time variations, which introduces challenges in the design of receivers. We propose an algorithm for IEEE 802.11p compliant receivers, based on Orthogonal Frequency Division Multiplexing (OFDM). We employ iterative structures in the receiver as a way to estimate the channel despite variations within a frame. The channel estimator is based on factor graphs, which allow the design of soft iterative receivers while keeping an acceptable computational complexity. Throughout this work, we focus on designing a receiver offering a good complexity performance trade-off. Moreover, we propose a scalable algorithm in order to be able to tune the trade-off depending on the channel conditions. Our algorithm allows reliable communications while offering a considerable decrease in computational complexity. In particular, numerical results show the trade-off between complexity and performance measured in computational time and BER as well as FER achieved by various interpolation lengths used by the estimator which both outperform by decades the standard least square solution. Furthermore our adaptive algorithm shows a considerable improvement in terms of computational time and complexity against state of the art and classical receptors whilst showing acceptable BER and FER performance