Clustering with Multiple Receiving Antennas and Imperfect CSI in Downlink CoMP Systems

  • Baracca P.
  • Boccardi F.
  • Prof. Nevio Benvenuto

The impact of inter-cell interference in the downlink can be limited by allowing cooperation among base stations (BSs). Coordinated multi point (CoMP) schemes with joint processing (JP) assumes that BSs share data and channel state information (CSI) to serve the user equipments (UEs) by using joint precoders. By assuming perfect CSI and sharing of UE data among all the BSs in the network, CoMP provides a huge gain with respect to a baseline non-cooperative scheme. Although CoMP-JP is a promising technique, many practical constraints make its implementation still challenging. CSI at the BSs is subject to imperfections due to either limited bandwidth available for feedback in frequency division duplex (FDD) systems or noise on channel estimation in time division duplex (TDD) systems. Then, latency and throughput constraints on the backhaul links do not allow the sharing of data among all the BSs. To deal with these issues, clusters of BSs are organized and JP is implemented within the cluster. To improve fairness among the UEs, dynamic clustering has been proposed, where clusters of BSs change over time adapting to the network conditions. However, most of the works on CoMP-JP with clustering focus on systems where UEs are equipped with only one antenna, although already with LTE-Advanced UEs may be equipped with up to eight antennas. Hence, it has been recognized the importance of developing algorithms for CoMP-JP that explicitly takes into account these additional UE capabilities: clusters should be organized by considering that multiple antenna UEs can either use an interference rejection combiner (IRC) to partially suppress the residual inter-cluster interference (ICI) or be served by means of a multi-rank transmission. In this work we consider a downlink homogenous scenario and propose an algorithm to perform jointly dynamic clustering and UE scheduling. We assume rank-1 transmission and UEs suppress the ICI by using IRC. By assuming a maximum cluster size of 3 BSs, we show that by increasing the number of receive antennas a considerable gain is achieved by using IRC at the UEs. However, the gain of dynamic clustering with respect to SCP falls down as the benefits of IRC are more important with SCP, where the ICI is higher with respect to CoMP. Then, we consider a TDD system where CSI at the BSs depend on pilot sequences sent by the UE. In such a scenario we show that if the channel changes slowly in the time and in the frequency domain, performance close to the perfect CSI case can be achieved. If we increase either the Doppler frequency or the delay spread of the channel, there is a decrease in the gain achieved by CoMP with respect to SCP.

Recent Publications

August 09, 2017

A Cloud Native Approach to 5G Network Slicing

  • Francini A.
  • Miller R.
  • Sharma S.

5G networks will have to support a set of very diverse and often extreme requirements. Network slicing offers an effective way to unlock the full potential of 5G networks and meet those requirements on a shared network infrastructure. This paper presents a cloud native approach to network slicing. The cloud ...

August 01, 2017

Modeling and simulation of RSOA with a dual-electrode configuration

  • De Valicourt G.
  • Liu Z.
  • Violas M.
  • Wang H.
  • Wu Q.

Based on the physical model of a bulk reflective semiconductor optical amplifier (RSOA) used as a modulator in radio over fiber (RoF) links, the distributions of carrier density, signal photon density, and amplified spontaneous emission photon density are demonstrated. One of limits in the use of RSOA is the lower ...

July 12, 2017

PrivApprox: Privacy-Preserving Stream Analytics

  • Chen R.
  • Christof Fetzer
  • Le D.
  • Martin Beck
  • Pramod Bhatotia
  • Thorsten Strufe

How to preserve users' privacy while supporting high-utility analytics for low-latency stream processing? To answer this question: we describe the design, implementation and evaluation of PRIVAPPROX, a data analytics system for privacy-preserving stream processing. PRIVAPPROX provides three properties: (i) Privacy: zero-knowledge privacy (ezk) guarantees for users, a privacy bound tighter ...