arXiv subjects

David Gesbert

Publications and source records attributed to David Gesbert.

At least 91 records · Page 5Linked to original sources

arXiv2016

Efficient Feedback Mechanisms for FDD Massive MIMO under User-level Cooperation

Channel state information (CSI) feedback is a challenging issue in frequency division multiplexing (FDD) massive MIMO systems. This paper studies a cooperative feedback scheme, where the users first exchange their CSI with each other by exploiting device-to-device (D2D) communications, then compute the precoder by themselves, and feed back the precoder to the base station (BS). Analytical results are derived to show that the cooperative precoder feedback is more efficient than the CSI feedback in terms of interference mitigation. Under the constraint of limited D2D communication capacity, we develop an adaptive CSI exchange strategy based on signal subspace projection and optimal bit partition. Numerical results demonstrate that the proposed cooperative precoder feedback scheme with adaptive CSI exchange significantly outperforms the CSI feedback scheme, even when the CSI is exchanged via rate-limited D2D communications.

cs.IT↗

arXiv2016

Optimal DoF of the K-User Broadcast Channel with Delayed and Imperfect Current CSIT

This work studies the optimal Degrees-of-Freedom (DoF) of the $K$-User MISO Broadcast Channel (BC) with delayed Channel-State Information at the Transmitter (CSIT) and with additional current noisy CSIT where the current channel estimation error scales in~$P^{-α}$ for $α\in[0,1]$. This papers establishes for the first time the optimal DoF in this setting thanks to a new transmission scheme which achieves the elusive DoF-optimal combining of the Maddah-Ali and Tse scheme (MAT) introduced in their seminal work in $2010$ with Zero-Forcing (ZF) for an arbitrary number of users. The derived sum DoF takes the surprisingly simple form $(1-α) K/H_K+αK$ where $H_K\triangleq \sum_{k=1}^K \frac{1}{k}$ is the sum-DoF achieved using solely MAT.

cs.IT↗

arXiv2016

Robust Pilot Decontamination Based on Joint Angle and Power Domain Discrimination

We address the problem of noise and interference corrupted channel estimation in massive MIMO systems. Interference, which originates from pilot reuse (or contamination), can in principle be discriminated on the basis of the distributions of path angles and amplitudes. In this paper we propose novel robust channel estimation algorithms exploiting path diversity in both angle and power domains, relying on a suitable combination of the spatial filtering and amplitude based projection. The proposed approaches are able to cope with a wide range of system and topology scenarios, including those where, unlike in previous works, interference channel may overlap with desired channels in terms of multipath angles of arrival or exceed them in terms of received power. In particular we establish analytically the conditions under which the proposed channel estimator is fully decontaminated. Simulation results confirm the overall system gains when using the new methods.

cs.IT↗

arXiv2015

A Rate Splitting Strategy for Massive MIMO with Imperfect CSIT

In a multiuser MIMO broadcast channel, the rate performance is affected by the multiuser interference when the Channel State Information at the Transmitter (CSIT) is imperfect. To tackle the detrimental effect of the multiuser interference, a Rate-Splitting (RS) approach has been proposed recently, which splits one selected user's message into a common and a private part, and superimposes the common message on top of the private messages. The common message is drawn from a public codebook and should be decoded by all users. In this paper, we generalize the idea of RS into the large-scale array regime with imperfect CSIT. By further exploiting the channel second-order statistics, we propose a novel and general framework Hierarchical-Rate-Splitting (HRS) that is particularly suited to massive MIMO systems. HRS simultaneously transmits private messages intended to each user and two kinds of common messages that can be decoded by all users and by a subset of users, respectively. We analyse the asymptotic sum rate of RS and HRS and optimize the precoders of the common messages. A closed-form power allocation is derived which provides insights into the effects of system parameters. Finally, simulation results validate the significant sum rate gain of RS and HRS over various baselines.

cs.IT↗

arXiv2015

Joint Sensing and Reception Design of SIMO Hybrid Cognitive Radio Systems

In this paper, the problem of joint design of Spectrum Sensing (SS) and receive beamforming (BF), with reference to a Cognitive Radio (CR) system, is considered. The aim of the proposed design is the maximization of the achievable average uplink rate of a Secondary User (SU), subject to an outage-based Quality-of-Service (QoS) constraint for primary communication. A hybrid CR system approach is studied, according to which, the system either operates as an interweave (i.e., opportunistic) or as an underlay (i.e., spectrum sharing) CR system, based on SS results. A realistic Channel State Information (CSI) framework is assumed, according to which, the direct channel links are known by the multiple antenna receivers (RXs), while, merely statistical (covariance) information is available for the interference links. A new, closed form approximation is derived for the outage probability of primary communication, and the problem of rate-optimal selection of SS parameters and receive beamformers is addressed for hybrid, interweave and underlay CR systems. It is proven that our proposed system design outperforms both underlay and interweave CR systems for a range of system scenarios.

cs.IT↗

arXiv2015

Coordinated Shared Spectrum Precoding with Distributed CSIT

In this paper, the operation of a Licensed Shared Access (LSA) system is investigated, considering downlink communication. The system comprises of a Multiple-Input-Single-Output (MISO) incumbent transmitter (TX) - receiver (RX) pair, which offers a spectrum sharing opportunity to a MISO licensee TX-RX pair. Our main contribution is the design of a coordinated transmission scheme, inspired by the underlay Cognitive Radio (CR) approach, with the aim of maximizing the average rate of the licensee, subject to an average rate constraint for the incumbent. In contrast to most prior works on underlay CR, the coordination of the two TXs takes place under a realistic Channel State Information (CSI) scenario, where each TX has sole access to the instantaneous direct channel of its served terminal. Such a CSI knowledge setting brings about a formulation based on the theory of Team Decisions, whereby the TXs aim at optimizing a common objective given the same constraint set, on the basis of individual channel information. Consequently, a novel set of applicable precoding schemes is proposed. Relying on statistical coordination criteria, the two TXs cooperate in the lack of any instantaneous CSI exchange. We verify by simulations that our novel coordinated precoding scheme outperforms the standard underlay CR approach.

cs.IT↗

arXiv2015

A Hierarchical Rate Splitting Strategy for FDD Massive MIMO under Imperfect CSIT

In a multiuser MIMO broadcast channel, the rate performance is affected by the multiuser interference when the Channel State Information at the Transmitter (CSIT) is imperfect. To tackle the interference problem, a Rate-Splitting (RS) approach has been proposed recently, which splits one user's message into a common and a private part, and superimposes the common message on top of the private messages. The common message is drawn from a public codebook and should be decoded by all users. In this paper, we propose a novel and general framework, denoted as Hierarchical Rate Splitting (HRS), that is particularly suited to FDD massive MIMO systems. HRS simultaneously transmits private messages intended to each user and two kinds of common messages that can be decoded by all users and by a subset of users, respectively. We analyse the asymptotic sum rate of HRS under imperfect CSIT. A closed-form power allocation is derived which provides insights into the effects of system parameters. Finally, simulation results validate the significant sum rate gain of HRS over various baselines.

cs.IT↗

arXiv2015

The Impact of Physical Channel on Performance of Subspace-Based Channel Estimation in Massive MIMO Systems

A subspace method for channel estimation has been recently proposed [1] for tackling the pilot contamination effect, which is regarded by some researchers as a bottleneck in massive MIMO systems. It was shown in [1] that if the power ratio between the desired signal and interference is kept above a certain value, the received signal spectrum splits into signal and interference eigenvalues, namely, the "pilot contamination" effect can be completely eliminated. However, [1] assumes an independently distributed (i.d.) channel, which is actually not much the case in practice. Considering this, a more sensible finite-dimensional physical channel model (i.e., a finite scattering environment, where signals impinge on the base station (BS) from a finite number of angles of arrival (AoA)) is employed in this paper. Via asymptotic spectral analysis, it is demonstrated that, compared with the i.d. channel, the physical channel imposes a penalty in the form of an increased power ratio between the useful signal and the interference. Furthermore, we demonstrate an interesting "antenna saturation" effect, i.e., when the number of the BS antennas approaches infinity, the performance under the physical channel with P AoAs is limited by and nearly the same as the performance under the i.d. channel with P receive antennas.

cs.IT↗

arXiv2015

Regularized ZF in Cooperative Broadcast Channels under Distributed CSIT: A Large System Analysis

Obtaining accurate Channel State Information (CSI) at the transmitters (TX) is critical to many cooperation schemes such as Network MIMO, Interference Alignment etc. Practical CSI feedback and limited backhaul-based sharing inevitably creates degradations of CSI which are specific to each TX, giving rise to a distributed form of CSI. In the Distributed CSI (D-CSI) broadcast channel setting, the various TXs design elements of the precoder based on their individual estimates of the global multiuser channel matrix, which intuitively degrades performance when compared with the commonly used centralized CSI assumption. This paper tackles this challenging scenario and presents a first analysis of the rate performance for the distributed CSI multi-TX broadcast channel setting, in the large number of antenna regime. Using Random Matrix Theory (RMT) tools, we derive deterministic equivalents of the Signal to Interference plus Noise Ratio (SINR) for the popular regularized Zero-Forcing (ZF) precoder, allowing to unveil the price of distributedness for such cooperation methods.

cs.IT↗

arXiv2015

Optimization of Energy Harvesting MISO Communication System with Feedback

Optimization of a point-to-point (p2p) multipleinput single-output (MISO) communication system is considered when both the transmitter (TX) and the receiver (RX) have energy harvesting (EH) capabilities. The RX is interested in feeding back the channel state information (CSI) to the TX to help improve the transmission rate. The objective is to maximize the throughput by a deadline, subject to the EH constraints at the TX and the RX. The throughput metric considered is an upper bound on the ergodic rate of the MISO channel with beamforming and limited feedback. Feedback bit allocation and transmission policies that maximize the upper bound on the ergodic rate are obtained. Tools from majorization theory are used to simplify the formulated optimization problems. Optimal policies obtained for the modified problem outperform the naive scheme in which no intelligent management of energy is performed.

cs.IT↗

arXiv2014

Topological Interference Management with Transmitter Cooperation

Interference networks with no channel state information at the transmitter (CSIT) except for the knowledge of the connectivity graph have been recently studied under the topological interference management (TIM) framework. In this paper, we consider a similar problem with topological knowledge but in a distributed broadcast channel setting, i.e. a network where transmitter cooperation is enabled. We show that the topological information can also be exploited in this case to strictly improve the degrees of freedom (DoF) as long as the network is not fully connected, which is a reasonable assumption in practice. Achievability schemes based on selective graph coloring, interference alignment, and hypergraph covering, are proposed. Together with outer bounds built upon generator sequence, the concept of compound channel settings, and the relation to index coding, we characterize the symmetric DoF for so-called regular networks with constant number of interfering links, and identify the sufficient and/or necessary conditions for the arbitrary network topologies to achieve a certain amount of symmetric DoF.

cs.IT↗

arXiv2014

Space-Time Encoded MISO Broadcast Channel with Outdated CSIT: An Error Rate and Diversity Performance Analysis

Studies of the MISO Broadcast Channel (BC) with delayed Channel State Information at the Transmitter (CSIT) have so far focused on the sum-rate and Degrees-of-Freedom (DoF) region analysis. In this paper, we investigate for the first time the error rate performance at finite SNR and the diversity-multiplexing tradeoff (DMT) at infinite SNR of a space-time encoded transmission over a two-user MISO BC with delayed CSIT. We consider the so-called MAT protocol obtained by Maddah-Ali and Tse, which was shown to provide 33% DoF enhancement over TDMA. While the asymptotic DMT analysis shows that MAT is always preferable to TDMA, the Pairwise Error Probability analysis at finite SNR shows that MAT is in fact not always a better alternative to TDMA. Benefits can be obtained over TDMA only at very high rate or once concatenated with a full-rate full-diversity space-time code. The analysis is also extended to spatially correlated channels and the influence of transmit correlation matrices and user pairing strategies on the performance are discussed. Relying on statistical CSIT, signal constellations are further optimized to improve the error rate performance of MAT and make it insensitive to user orthogonality. Finally, other transmission strategies relying on delayed CSIT are discussed.

cs.IT↗

arXiv2014

Robust Precoding for Network MIMO with Hierarchical CSIT

In this work, we consider a wireless network with K cooperating transmitters (TXs) serving jointly K receivers (RXs). Due to the practical limitations of the backhaul network, it is relevant to consider a setting where each TX receives its own imperfect estimate of the multi-user channel state, denoted as the distributed channel state information (CSI) setting. We focus in this work on a particular distributed CSI configuration called hierarchical CSI configuration in which the TXs can be ordered by increasing level of CSI. This scenario is particularly relevant for future networks with heterogeneous backhaul where the TXs connected with a weak backhaul link will receive only a coarse estimate while the TXs with a stronger backhaul will have a more accurate CSI. In that scenario, we formulate the optimal precoding as a team decision problem. Solving optimally this problem is extremely challenging such that we propose a heuristic approach allowing to obtain a simple, yet efficient and practical, precoding algorithm. The proposed precoding algorithm exploits the hierarchical structure of the CSI to make the transmission more robust to the imperfect CSI knowledge at the TXs.

cs.IT↗

arXiv2014

Dealing with Interference in Distributed Large-scale MIMO Systems: A Statistical Approach

This paper considers the problem of interference control through the use of second-order statistics in massive MIMO multi-cell networks. We consider both the cases of co-located massive arrays and large-scale distributed antenna settings. We are interested in characterizing the low-rankness of users' channel covariance matrices, as such a property can be exploited towards improved channel estimation (so-called pilot decontamination) as well as interference rejection via spatial filtering. In previous work, it was shown that massive MIMO channel covariance matrices exhibit a useful finite rank property that can be modeled via the angular spread of multipath at a MIMO uniform linear array. This paper extends this result to more general settings including certain non-uniform arrays, and more surprisingly, to two dimensional distributed large scale arrays. In particular our model exhibits the dependence of the signal subspace's richness on the scattering radius around the user terminal, through a closed form expression. The applications of the low-rankness covariance property to channel estimation's denoising and low-complexity interference filtering are highlighted.

cs.IT↗

arXiv2014

Interference Alignment with Incomplete CSIT Sharing

In this work, we study the impact of having only incomplete channel state information at the transmitters (CSIT) over the feasibility of interference alignment (IA) in a K-user MIMO interference channel (IC). Incompleteness of CSIT refers to the perfect knowledge at each transmitter (TX) of only a sub-matrix of the global channel matrix, where the sub-matrix is specific to each TX. This paper investigates the notion of IA feasibility for CSIT configurations being as incomplete as possible, as this leads to feedback overhead reductions in practice. We distinguish between antenna configurations where (i) removing a single antenna makes IA unfeasible, referred to as tightly-feasible settings, and (ii) cases where extra antennas are available, referred to as super-feasible settings. We show conditions for which IA is feasible in strictly incomplete CSIT scenarios, even in tightly-feasible settings. For such cases, we provide a CSIT allocation policy preserving IA feasibility while reducing significantly the amount of CSIT required. For super-feasible settings, we develop a heuristic CSIT allocation algorithm which exploits the additional antennas to further reduce the size of the CSIT allocation. As a byproduct of our approach, a simple and intuitive algorithm for testing feasibility of single stream IA is provided.

cs.IT↗

arXiv2014

Spatial CSIT Allocation Policies for Network MIMO Channels

In this work, we study the problem of the optimal dissemination of channel state information (CSI) among K spatially distributed transmitters (TXs) jointly cooperating to serve K receivers (RXs). One of the particularities of this work lies in the fact that the CSI is distributed in the sense that each TX obtains its own estimate of the global multi-user MIMO channel with no further exchange of information being allowed between the TXs. Although this is well suited to model the cooperation between non-colocated TXs, e.g., in cellular Coordinated Multipoint (CoMP) schemes, this type of setting has received little attention so far in the information theoretic society. We study in this work what are the CSI requirements at every TX, as a function of the network geometry, to ensure that the maximal number of degrees-of-freedom (DoF) is achieved, i.e., the same DoF as obtained under perfect CSI at all TXs. We advocate the use of the generalized DoF to take into account the geometry of the network in the analysis. Consistent with the intuition, the derived DoF maximizing CSI allocation policy suggests that TX cooperation should be limited to a specific finite neighborhood around each TX. This is in sharp contrast with the conventional (uniform) CSI dissemination policy which induces CSI requirements that grow unbounded with the network size. The proposed CSI allocation policy suggests an alternative to clustering which overcomes fundamental limitations such as (i) edge interference and (ii) unbounded increase of the CSIT requirements with the cluster size. Finally, we show how finite neighborhood CSIT exchange translates into finite neighborhood message exchange so that finally global interference management is possible with only local cooperation

cs.IT↗

arXiv2014

Optimal power control in Cognitive MIMO systems with limited feedback

In this paper, the problem of optimal power allocation in Cognitive Radio (CR) Multiple Input Multiple Output (MIMO) systems is treated. The focus is on providing limited feedback solutions aiming at maximizing the secondary system rate subject to a constraint on the average interference caused to primary communication. The limited feedback solutions are obtained by reducing the information available at secondary transmitter (STx) for the link between STx and the secondary receiver (SRx) as well as by limiting the level of available information at STx that corresponds to the link between the STx and the primary receiver PRx. Monte Carlo simulation results are given that allow to quanitfy the performance achieved by the proposed algorithms.

cs.IT↗

arXiv2013

The Degrees of Freedom Region of Temporally-Correlated MIMO Networks with Delayed CSIT

We consider the temporally-correlated Multiple-Input Multiple-Output (MIMO) broadcast channels (BC) and interference channels (IC) where the transmitter(s) has/have (i) delayed channel state information (CSI) obtained from a latency-prone feedback channel as well as (ii) imperfect current CSIT, obtained, e.g., from prediction on the basis of these past channel samples based on the temporal correlation. The degrees of freedom (DoF) regions for the two-user broadcast and interference MIMO networks with general antenna configuration under such conditions are fully characterized, as a function of the prediction quality indicator. Specifically, a simple unified framework is proposed, allowing to attain optimal DoF region for the general antenna configurations and current CSIT qualities. Such a framework builds upon block-Markov encoding with interference quantization, optimally combining the use of both outdated and instantaneous CSIT. A striking feature of our work is that, by varying the power allocation, every point in the DoF region can be achieved with one single scheme. As a result, instead of checking the achievability of every corner point of the outer bound region, as typically done in the literature, we propose a new systematic way to prove the achievability.

cs.IT↗