Related papers: Fundamental Limits of Cache-Aided Interference Man…
We consider a single hop wireless X network with $K$ transmitters and $J$ receivers, all with single antenna. Each transmitter conveys for each receiver an independent message. The channel is assumed to have constant coefficients. We…
In this paper, we propose a novel joint caching and massive multiple-input multiple-output (MIMO) transmission scheme, referred to as cache-aided massive MIMO, for advanced downlink cellular communications. In addition to reaping the…
This work presents a new way of exploiting non-uniform file popularity in coded caching networks. Focusing on a fully-connected fully-interfering wireless setting with multiple cache-enabled transmitters and receivers, we show how…
In this paper, we study the degrees of freedom (DoF) region and sum DoF of the time-selective $K$-user interference channel in the presence of intelligent reflecting surfaces (IRSs). We consider four types of IRSs, namely 1) active IRSs,…
We consider capacity maximization in wireless networks under adversarial interference conditions. There are n links, each consisting of a sender and a receiver, which repeatedly try to perform a successful transmission. In each time step,…
A multi-antenna broadcast channel scenario is considered where a base station delivers contents to cache-enabled user terminals. A joint design of coded caching (CC) and multigroup multicast beamforming is proposed to benefit from spatial…
In this work, we explore the potential and optimal use of transmitter cooperation in wireless interference networks with deep fading conditions. We consider a linear interference network with K transmitter-receiver pairs, where each…
This paper proposes a linear interference alignment (IA) scheme which can be used for uplink channels in a general multicell multiuser MIMO cellular network. The proposed scheme aims to align interference caused by signals from a set of…
The problem of interference management is considered in the context of a linear interference network that is subject to long term channel fluctuations due to shadow fading. The fading model used is one where each link in the network is…
Degrees of freedom (DoF) is studied in the downlink of a heterogenous wireless network modeled as a two-layered interference network. The first layer of the interference network is the backhaul layer between macro base stations (MB) and…
The nested array, which is implemented by nonuniform antenna placement, is an effective approach to achieve O(N^2) degrees of freedom (DoF) with an antenna array of N antennas. Such DoF refers to the number of directions of incoming signals…
Caching is an approach to smoothen the variability of traffic over time. Recently it has been proved that the local memories at the users can be exploited for reducing the peak traffic in a much more efficient way than previously believed.…
We consider the problem of delivering content cached in a wireless network of n nodes randomly located on a square of area n. The network performance is described by the n2^n-dimensional caching capacity region of the wireless network. We…
We consider the canonical {\em shared link network} formed by a source node, hosting a library of $m$ information messages (files), connected via a noiseless common link to $n$ destination nodes (users), each with a cache of size M files.…
Coded caching is a promising technique to create coded multicast opportunities for cache-aided networks. By splitting each file into $F$ equal packets (i.e., the subpacketization level $F$) and letting each user cache a set of packets, the…
The characterization of fundamental performance bounds of many-to-many communication systems in which participating nodes are active in an intermittent way is one of the major challenges in communication theory. In order to address this…
A new scheme for the problem of centralized coded caching with non-uniform demands is proposed. The distinguishing feature of the proposed placement strategy is that it admits equal sub-packetization for all files while allowing the users…
This work explores coded caching in the symmetric $K$-user cache-aided MISO BC with imperfect CSIT-type feedback, for the specific case where the cache size is much smaller than the library size. Building on the recently explored synergy…
We study information theoretic models of interference networks that consist of K Base Station (BS) - Mobile Terminal (MT) pairs. Each BS is connected to the MT carrying the same index as well as L following MTs. We fix the value of L and…
Although interference alignment (IA) can theoretically achieve the optimal degrees of freedom (DoFs) in the $K$-user Gaussian interference channel, its direct application comes at the prohibitive cost of precoding over exponentially-many…