Channel Estimation for Frequency-Selective Two-Way MIMO Relay Systems

In this paper, we investigate the channel estimation problem for two-way multiple-input multiple-output (MIMO) relay communication systems in frequency-selective fading environments. We propose a superimposed channel training algorithm to estimate the individual channel state information(CSI) of the first-hop and second-hop links for two-way MIMO relay systems with frequency-selective fading channels. In this algorithm, a relay training sequence is superimposed on the received signals at the relay node to assist the estimation of the second-hop channel matrices. The optimal structure of the source and relay training sequences is derived to minimize the mean-squared error (MSE) of channel estimation. We also derive the optimal power allocation between the source and relay trainingsequences. Numerical examples are shown to demonstrate the performance of the proposed algorithm

Channel estimation for two-way MIMO relay systems in frequency-selective fading environments

In this paper, we investigate the channel estimation problem for two-way multiple-input multiple-output(MIMO) relay communication systems in frequency-selective fading environments. We apply themethod of superimposed channel training to estimate the individual channel state information (CSI) ofthe first-hop and second-hop links for two-way MIMO relay systems with frequency-selective fadingchannels. In this algorithm, a relay training sequence is superimposed on the received signals at the relay node to assist the estimation of the second-hop channel matrices. The optimal structure of the source and relay training sequences is derived to minimize the mean-squared error (MSE) of channel estimation. Moreover, the optimal power allocation between the source and relay training sequences is derived to improve the performance of channel estimation. Numerical examples are shown to demonstrate the performance of the proposed superimposed channel training algorithm for two-way MIMO relay systems in frequency-selective fading environments

Collaborative modulation multiple access for single hop and multihop networks

While the bandwidth available for wireless networks is limited, the world has seen an unprecedented growth in the number of mobile subscribers and an ever increasing demand for high data rates. Therefore efficient utilisation of bandwidth to maximise link spectral efficiency and number of users that can be served simultaneously are primary goals in the design of wireless systems. To achieve these goals, in this thesis, a new non-orthogonal uplink multiple access scheme which combines the functionalities of adaptive modulation and multiple access called collaborative modulation multiple access (CMMA) is proposed. CMMA enables multiple users to access the network simultaneously and share the same bandwidth even when only a single receive antenna is available and in the presence of high channel correlation. Instead of competing for resources, users in CMMA share resources collaboratively by employing unique modulation sets (UMS) that differ in phase, power, and/or mapping structure. These UMS are designed to insure that the received signal formed from the superposition of all users’ signals belongs to a composite QAM constellation (CC) with a rate equal to the sum rate of all users. The CC and its constituent UMSs are designed centrally at the BS to remove ambiguity, maximize the minimum Euclidian distance (dmin) of the CC and insure a minimum BER performance is maintained. Users collaboratively precode their transmitted signal by performing truncated channel inversion and phase rotation using channel state information (CSI ) obtained from a periodic common pilot to insure that their combined signal at the BS belongs to the CC known at the BS which in turn performs a simple joint maximum likelihood detection without the need for CSI. The coherent addition of users’ power enables CMMA to achieve high link spectral efficiency at any time without extra power or bandwidth but on the expense of graceful degradation in BER performance. To improve the BER performance of CMMA while preserving its precoding and detection structure and without the need for pilot-aided channel estimation, a new selective diversity combining scheme called SC-CMMA is proposed. SC-CMMA optimises the overall group performance providing fairness and diversity gain for various users with different transmit powers and channel conditions by selecting a single antenna out of a group of L available antennas that minimises the total transmit power required for precoding at any one time. A detailed study of capacity and BER performance of CMMA and SC-CMMA is carried out under different level of channel correlations which shows that both offer high capacity gain and resilience to channel correlation. SC-CMMA capacity even increase with high channel correlation between users’ channels. CMMA provides a practical solution for implementing the multiple access adder channel (MAAC) in fading environments hence a hybrid approach combining both collaborative coding and modulation referred to as H-CMMA is investigated. H-CMMA divides users into a number of subgroups where users within a subgroup are assigned the same modulation set and different multiple access codes. H-CMMA adjusts the dmin of the received CC by varying the number of subgroups which in turn varies the number of unique constellation points for the same number of users and average total power. Therefore H-CMMA can accommodate many users with different rates while flexibly managing the complexity, rate and BER performance depending on the SNR. Next a new scheme combining CMMA with opportunistic scheduling using only partial CSI at the receiver called CMMA-OS is proposed to combine both the power gain of CMMA and the multiuser diversity gain that arises from users’ channel independence. To avoid the complexity and excessive feedback associated with the dynamic update of the CC, the BS takes into account the independence of users’ channels in the design of the CC and its constituent UMSs but both remain unchanged thereafter. However UMS are no longer associated with users, instead channel gain’s probability density function is divided into regions with identical probability and each UMS is associated with a specific region. This will simplify scheduling as users can initially chose their UMS based on their CSI and the BS will only need to resolve any collision when the channels of two or more users are located at the same region. Finally a high rate cooperative communication scheme, called cooperative modulation (CM) is proposed for cooperative multiuser systems. CM combines the reliability of the cooperative diversity with the high spectral efficiency and multiple access capabilities of CMMA. CM maintains low feedback and high spectral efficiency by restricting relaying to a single route with the best overall channel. Two possible variations of CM are proposed depending on whether CSI available only at the users or just at the BS and the selected relay. The first is referred to Precode, Amplify, and Forward (PAF) while the second one is called Decode, Remap, and Forward (DMF). A new route selection algorithm for DMF based on maximising dmin of random CC is also proposed using a novel fast low-complexity multi-stage sphere based algorithm to calculate the dmin at the relay of random CC that is used for both relay selection and detection

Channel Estimation for Time-Varying MIMO Relay Systems

In this paper, we investigate the channel estimation problem for multiple-input multiple-output (MIMO) relay communication systems with time-varying channels. The time-varying characteristic of the channels is described by the complexexponential basis expansion model (CE-BEM). We propose a superimposed channel training algorithm to estimate the individual first-hop and second-hop time-varying channel matrices for MIMO relay systems. In particular, the estimation of the secondhop time-varying channel matrix is performed by exploiting the superimposed training sequence at the relay node, while the first-hop time-varying channel matrix is estimated through the source node training sequence and the estimated second-hop channel. To improve the performance of channel estimation, we derive the optimal structure of the source and relay training sequences that minimize the mean-squared error (MSE) of channel estimation. We also optimize the relay amplification factor that governs the power allocation between the source and relay training sequences. Numerical simulations demonstrate that the proposed superimposed channel training algorithm for MIMO relay systems with time-varying channels outperforms the conventional two-stage channel estimation scheme

Cooperative diversity for the cellular uplink: Sharing strategies, performance analysis, and receiver design

In this thesis, we propose data sharing schemes for the cooperative diversity in a cellular uplink to exploit diversity and enhance throughput performance of the system. Particularly, we consider new two and three-or-more user decode and forward (DF) protocols using space time block codes. We discuss two-user and three-user amplify and forward (AF) protocols and evaluate the performance of the above mentioned data sharing protocols in terms of the bit error rate and the throughput in an asynchronous code division multiple access (CDMA) cellular uplink. We develop a linear receiver for joint space-time decoding and multiuser detection that provides full diversity and near maximum-likelihood performance.;We also focus on a practical situation where inter-user channel is noisy and cooperating users can not successfully estimate other user\u27s data. We further design our system model such that, users decide not to forward anything in case of symbol errors. Channel estimation plays an important role here, since cooperating users make random estimation errors and the base station can not have the knowledge of the errors or the inter-user channels. We consider a training-based approach for channel estimation. We provide an information outage probability analysis for the proposed multi-user sharing schemes. (Abstract shortened by UMI.)