Related papers: Placement Delivery Array for Cache-Aided MIMO Syst…
The tradeoff between the user's memory size and the worst-case download time in the $(H,r,M,N)$ combination network is studied, where a central server communicates with $K$ users through $H$ immediate relays, and each user has local cache…
The coded caching scheme is an efficient technique as a solution to reduce the wireless network burden during the peak times in a Device-to-Device (D2D in short) communications. In a coded caching scheme, each file block should be divided…
We consider a multi-user (MU) full-duplex (FD) multiple-input multiple-output (MIMO) communication system, in which the base station transceiver is equipped with transmit and receive position reconfigurable antennas (PRAs) to mitigate both…
This work considers the coded caching problem with shared caches, where users share the caches, and each user gets access only to one cache. The user-to-cache association is assumed to be known at the server during the placement phase. We…
We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both transmitters and receivers are equipped with caches. We provide a constant-factor…
This paper considers a two-hop network architecture known as a combination network, where a layer of relay nodes connects a server to a set of end users. In particular, a new model is investigated where the intermediate relays employ caches…
Coded caching leverages the differences in user cache memories to achieve gains that scale with the total cache size, alleviating network congestion due to high-quality content requests. Additionally, distributing transmitters over a wide…
This paper studies the achievable degrees of freedom for multi-user MIMO two-way relay channels, where there are $K$ source nodes, each equipped with $M$ antennas, one relay node, equipped with $N$ antennas, and each source node exchanges…
Coded caching (CC) techniques have been shown to be conveniently applicable in multi-input multi-output (MIMO) systems. In a $K$-user network with spatial multiplexing gains of $L$ at the transmitter and $G$ at every receiver, if each user…
In this paper, we consider a multi-access coded caching system with decentralized prefetching, where a server hosts $N$ files, each of size $F$ bits, and is connected to $K$ users through a shared link. There are $c$ caches distributed…
In this paper, we study the coded caching scheme for the $(L, K, M, N)$ multi-user information retrieval (MIR) system, which consists of a content library containing $N$ files, a base station (BS) with $L$ antennas that cannot access the…
In this paper, we consider a hybrid millimeter wave (mmWave) and micro wave ($\mu$Wave) network from the perspective of \emph{wireless caching} and study the optimal probabilistic content/file caching placement at desirable base stations…
This work investigates the degrees of freedom (DoF) of a downlink cache-aided cellular network where the locations of base stations (BSs) are modeled as a grid topology and users within a grid cell can only communicate with four nearby BSs.…
We consider multi-access coded caching problem introduced by Hachem et.al., where each user has access to $L$ neighboring caches in a cyclic wrap-around fashion. We focus on the deterministic schemes for a specific class of multi-access…
We consider the standard broadcast setup with a single server broadcasting information to a number of clients, each of which contains local storage (called cache) of some size, which can store some parts of the available files at the…
When the users in a MIMO broadcast channel experience different spatial transmit correlation matrices, a class of gains is produced that is denoted transmit correlation diversity. This idea was conceived for channels in which transmit…
Massive multiple-input-multiple-output (MIMO) transmission is a promising technology to improve the capacity and reliability of wireless systems. However, the number of antennas that can be equipped at a base station (BS) is limited by the…
We consider the classical coded caching problem as defined by Maddah-Ali and Niesen, where a server with a library of $N$ files of equal size is connected to $K$ users via a shared error-free link. Each user is equipped with a cache with…
In this paper, we study achievable degrees of freedom (DoF) of a multiple-input multiple-output (MIMO) multiway relay channel (mRC) where $K$ users, each equipped with $M$ antennas, exchange messages in a pairwise manner via a common…
Coded caching techniques have received significant attention lately due to their provable gains in reducing the cost of data delivery in wireless networks. These gains, however, have only been demonstrated under the assumption of a free…