English
Related papers

Related papers: Fundamental Limits of Cache-Aided Interference Man…

200 papers

Coded caching (CC) can transform cache memory at network devices into an active communication resource. Prior studies have shown that CC can significantly enhance the achievable Degrees of Freedom (DoF) in multi-input multi-output (MIMO)…

Information Theory · Computer Science 2026-03-09 Mohammad NaseriTehrani , MohammadJavad Salehi , Antti Tölli

Coordinated Multi-Point (CoMP) transmission is an infrastructural enhancement under consideration for next generation wireless networks. In this work, the capacity gain achieved through CoMP transmission is studied in various models of…

Information Theory · Computer Science 2013-10-10 Aly El Gamal , V. Sreekanth Annapureddy , Venugopal V. Veeravalli

Coded caching can create coded multicasting thus significantly accelerates content delivery in broadcast channels with receiver caches. While the original delivery scheme in coded caching multicasts each coded message sequentially, it is…

Information Theory · Computer Science 2019-04-09 Youlong Cao , Meixia Tao

The correlation among the content distributed across a cache-aided broadcast network can be exploited to reduce the delivery load on the shared wireless link. This paper considers a two-user three-file network with correlated content, and…

Information Theory · Computer Science 2017-12-06 Parisa Hassanzadeh , Antonia M. Tulino , Jaime Llorca , Elza Erkip

The degrees of freedom (DoF) number of the fully connected K-user Gaussian interference channel is known to be K/2. In [1], the DoF for the same channel model was studied while allowing each message to be available at its own transmitter as…

Information Theory · Computer Science 2012-02-29 Aly El Gamal , V. Sreekanth Annapureddy , Venugopal V. Veeravalli

We consider a single hop interference network with $K$ transmitters and $J$ receivers, all having $M$ antennas. Each transmitter emits an independent message and each receiver requests an arbitrary subset of the messages. This generalizes…

Information Theory · Computer Science 2011-11-01 Lei Ke , Aditya Ramamoorthy , Zhengdao Wang , Huarui Yin

In this paper, the scheduling of downlink file transmission in one cell with the assistance of cache nodes with finite cache space is studied. Specifically, requesting users arrive randomly and the base station (BS) reactively multicasts…

Information Theory · Computer Science 2020-01-15 Bojie Lv , Rui Wang , Ying Cui , Yi Gong , Haisheng Tan

The degrees of freedom (DoF) of the $K$-user multiple-input multiple-output (MIMO) interference channel are studied when perfect, but delayed channel state information is available at the transmitter side (delayed CSIT). Recent works have…

Information Theory · Computer Science 2016-11-18 Marc Torrellas , Adrian Agustin , Josep Vidal

The work explores the fundamental limits of coded caching in heterogeneous networks where multiple ($N_0$) senders/antennas, serve different users which are associated (linked) to shared caches, where each such cache helps an arbitrary…

Information Theory · Computer Science 2018-11-16 Emanuele Parrinello , Ayse Unsal , Petros Elia

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…

Information Theory · Computer Science 2021-04-21 Fan Zhang , Khac-Hoang Ngo , Sheng Yang , Aria Nosratinia

In this paper, we consider a cache-aided relay network, where a single server consisting of a library of N files connects with K1 relays through a shared noiseless link, and each relay connects with K2 users through a shared noiseless link.…

Information Theory · Computer Science 2020-10-20 Ke Wang , Youlong Wu , Shujie Cao , Jiahui Chen

This paper studies the fundamental limits of caching in a network with two receivers and two files generated by a two-component discrete memoryless source with arbitrary joint distribution. Each receiver is equipped with a cache of equal…

Information Theory · Computer Science 2017-05-15 Parisa Hassanzadeh , Antonia Tulino , Jaime Llorca , Elza Erkip

In this paper, we consider the K-user interference channel with partial cooperation, where a strict subset of the K users cooperate. For the K-user interference channel with cooperating subsets of length M, the outer bound of the total…

Information Theory · Computer Science 2011-06-02 Ahmed A. Naguib , Khaled Elsayed , Mohammed Nafie

In this paper we determine the delivery time for a multi-server coded caching problem when the cache size of each user is small. We propose an achievable scheme based on coded cache content placement, and employ zero-forcing techniques at…

Information Theory · Computer Science 2018-03-22 Seyed Pooya Shariatpanahi , Babak Hossein Khalaj

We show that the 3 user M_T x M_R MIMO interference channel has d(M,N)=min(M/(2-1/k),N/(2+1/k)) degrees of freedom (DoF) normalized by time, frequency, and space dimensions, where M=min(M_T,M_R), N=max(M_T,M_R), k=ceil{M/(N-M)}. While the…

Information Theory · Computer Science 2011-09-21 Chenwei Wang , Tiangao Gou , Syed A. Jafar

We introduce an opportunistic interference mitigation (OIM) protocol, where a user scheduling strategy is utilized in $K$-cell uplink networks with time-invariant channel coefficients and base stations (BSs) having $M$ antennas. Each BS…

Information Theory · Computer Science 2016-11-15 Bang Chul Jung , Dohyung Park , Won-Yong Shin

The considered problem is that of maximizing the degrees of freedom (DoF) in cellular downlink, under a backhaul load constraint that limits the number of messages that can be delivered from a centralized controller to the base station…

Information Theory · Computer Science 2014-01-16 Aly El Gamal , Venugopal V. Veeravalli

This paper studies the problem of sum-secure degrees of freedom (SDoF) of the (M,M,N,N) multiple-input multiple-output (MIMO) interference channel with local output feedback, so as to build an information-theoretic foundation and provide…

Information Theory · Computer Science 2021-02-16 Tong Zhang , Yinfei Xu , Shuai Wang , Miaowen Wen , Rui Wang

We study the Degrees-of-Freedom (DoF) in a wireless setting in which K Transmitters (TXs) aim at jointly serving K users. The performance is studied when the TXs are faced with a distributed Channel State Information (CSI) configuration in…

Information Theory · Computer Science 2020-05-14 Antonio Bazco-Nogueras , Paul de Kerret , David Gesbert , Nicolas Gresset

This paper studies the storage-latency tradeoff in the $3\times3$ wireless interference network with caches equipped at all transmitters and receivers. The tradeoff is characterized by the so-called fractional delivery time (FDT) at given…

Information Theory · Computer Science 2016-11-17 Fan Xu , Kangqi Liu , Meixia Tao