Turbo-MIMO for wireless communications

This article reviews an important class of MIMO wireless communications, known collectively as turbo-MIMO systems. A distinctive property of turbo-MIMO wireless communication systems is that they can attain a channel capacity close to the Shannon limit and do so in a computationally manageable manner. The article focuses attention on a subclass of turbo-MIMO systems that use space-time coding based on bit-interleaved coded modulation. Different computationally manageable decoding (detection) strategies are briefly discussed. The article also includes computer experiments that are intended to improve the understanding of specific issues involved in the design of turbo-MIMO systems.

Power Allocation Strategies across N Orthogonal Channels at Both Source and Relay

A wireless relay network with one source, one relay and one destination is considered, where nodes communicate via N orthogonal channels. We develop optimal power allocation strategies at both the source and relay for maximizing the overall source-destination capacity under individual power constraints at the source and relay. Some properties of the optimal solution are studied. © 2012 IEEE.

Power allocation strategies across N orthogonal channels for single-relay networks at both source and relay

We consider a wireless relay network with one source, one relay and one destination, where communications between nodes are preformed over N orthogonal channels. This, for example, is the case when orthogonal frequency division multiplexing is employed for data communications. Since the power available at the source and relay is limited, we study optimal power allocation strategies at the source and relay in order to maximize the overall source-destination capacity. Depending on the availability of the channel state information at both the source and relay or only at the relay, power allocation is performed at both the source and relay or only at the relay. Considering different setups for the problem, various optimization problems are formulated and solved. Some properties of the optimal solution are also proved.

Investigation of AIMD based charging strategies for EVs connected to a low-voltage distribution network

In this paper we consider charging strategies that mitigate the impact of domestic charging of EVs on low-voltage distribution networks and which seek to reduce peak power by responding to time-ofday pricing. The strategies are based on the distributed Additive Increase and Multiplicative Decrease (AIMD) charging algorithms proposed in [5]. The strategies are evaluated using simulations conducted on a custom OpenDSS-Matlab platform for a typical low voltage residential feeder network. Results show that by using AIMD based smart charging 50% EV penetration can be accommodated on our test network, compared to only 10% with uncontrolled charging, without needing to reinforce existing network infrastructure. © Springer-Verlag Berlin Heidelberg 2013.

Beamforming and interference cancellation schemes for D2D communications

We investigate device-to-device (D2D) communication underlaying cellular networks with M-antenna base stations. We consider both beamforming (BF) and interference cancellation (IC) strategies under quantized channel state information (CSI), as well as, perfect CSI. We derive tight closed-form approximations of the ergodic achievable rate which hold for arbitrary transmit power, location of users and number of antennas. Based on these approximations, we derive insightful asymptotic expressions for three special cases namely high signal-to-noise (SNR), weak interference, and large M. In particular, we show that in the high SNR regime a ceiling effect exists which depends on the received signal-to-interference ratio and the number of antennas. Moreover, the achievable rate scales logarithmically with M. The ergodic achievable rate is shown to scale logarithmically with SNR and the antenna number in the weak interference case. When the BS is equipped with large number of antennas, we find that the ergodic achievable rate under quantized CSI reaches a saturated value, whilst it scales as log2M under perfect CSI.