User/relay selection is a simple technique that achieves spatial diversity in multiuser networks. However, for user/relay selection algorithms to make a selection decision, channel state information (CSI) from all cooperating users/relays is usually required at a central node. This requirement poses two important challenges. Firstly, CSI acquisition generates a great deal of feedback overhead (air-time) that could result in significant transmission delays. Secondly, the fed-back channel information is usually corrupted by additive noise. This could lead to transmission outages if the central node selects the set of cooperating relays based on inaccurate feedback information.
Motivated by the aforementioned challenges, we propose a limited feedback user/relay selection scheme that is based on the theory of compressed sensing. Firstly, we introduce a limited feedback relay selection algorithm for a multicast relay network. The proposed algorithm exploits the theory of compressive sensing to first obtain the identity of the “strong” relays with limited feedback air-time. Following that, the CSI of the selected relays is estimated using minimum mean square error estimation without any additional feedback. To minimize the effect of noise on the fed-back CSI, we introduce a back-off strategy that optimally backs-off on the noisy received CSI.
In the second part of the thesis, we propose a feedback reduction scheme for full-duplex relay-aided multiuser networks. The proposed scheme permits the base station (BS) to obtain channel state information (CSI) from a subset of strong users under substantially reduced feedback overhead. More specifically, we cast the problem of user identification and CSI estimation as a block sparse signal recovery problem in compressive sensing (CS). Using existing CS block recovery algorithms, we first obtain the identity of the strong users and then estimate their CSI using the best linear unbiased estimator (BLUE). Moreover, we derive the error covariance matrix of the post-detection noise to be used in the back-off strategy. In addition to this, we provide exact closed form expressions for the average maximum equivalent SNR at the destination user.
The last part of the thesis treats the problem of user selection in a network MIMO setting. We propose a distributed user selection strategy that is based on a well known technique called semi-orthogonal user selection when the zero-forcing beamforming (ZFBF) is adopted. Usually this technique requires perfect channel state information at the transmitter (CSIT) which might not be available or need large feedback overhead. Instead, we propose a distributed user selection technique where no communication between base stations is needed. In order to reduce the feedback overhead, each user set a timer that is inversely proportional to his channel quality indicator (CQI). This technique will allow only the user with the highest CQI to feedback provided that the transmission time is shorter than the difference between his timer and the second strongest user timer, otherwise a collision will occur. In the case of collision, we propose another feedback strategy that is based on the theory of compressive sensing, where collision is allowed and each user encode its feedback using Gaussian codewords and feedback the combination at the same time with other users. We prove that the problem can be formulated as a block sparse recovery problem and that this approach is agnostic on the transmission time, thus it could be a good alternative to the timer approach when collision is dominant. Simulation results show that the proposed CS-based selection algorithms yield a rate performance that is close to the ones achieved when perfect CSI is available while consuming a small amount of feedback.
|Date of Award||May 2015|
- Computer, Electrical and Mathematical Science and Engineering
|Supervisor||Tareq Al-Naffouri (Supervisor)|
- multiuser networks
- Compressive Sensing