English
Related papers

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

200 papers

In this paper, we propose a rate-splitting design and characterize the sum-degrees-of-freedom (DoF) for the K-user multiple-input-single-output (MISO) broadcast channel with mixed channel state information at the transmitter (CSIT) and…

Information Theory · Computer Science 2023-09-12 Shuo Zheng , Tong Zhang , Jingfu Li , Shuai Wang , Weijie Yuan , Gaojie Chen , Rui Wang

We consider cache-aided wireless communication scenarios where each user requests both a file from an a-priori generated cacheable library (referred to as 'content'), and an uncacheable 'non-content' message generated at the start of the…

Information Theory · Computer Science 2021-04-06 Hamdi Joudeh , Eleftherios Lampiris , Petros Elia , Giuseppe Caire

Multiple-antenna broadcast channels with $M$ transmit antennas and $K$ single-antenna receivers is considered, where the channel of receiver $r$ takes one of the $J_r$ finite values. It is assumed that the channel states of each receiver…

Information Theory · Computer Science 2009-10-05 Mohammad Ali Maddah-Ali

The K-user flat fading MIMO interference channel with J instantaneous relays (KICJR) is considered. In the KICJR, the effective channel between sources and destinations including the relays has certain structure and is non-generic. For…

Information Theory · Computer Science 2015-08-17 Amin Azari , Farshad Lahouti , Tobias Weber

This paper considers the K user cognitive interference channel with one primary and K-1 secondary/cognitive transmitters with a cumulative message sharing structure, i.e cognitive transmitter $i\in [2:K]$ knows non-causally all messages of…

Information Theory · Computer Science 2013-01-29 Diana Maamari , Daniela Tuninetti , Natasha Devroye

This paper studies the fundamental limits of content delivery in a cache-aided broadcast network for correlated content generated by a discrete memoryless source with arbitrary joint distribution. Each receiver is equipped with a cache of…

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

We consider a cache network in which a single server is connected to multiple users via a shared error free link. The server has access to a database with $N$ files of equal length $F$, and serves $K$ users each with a cache memory of $MF$…

Information Theory · Computer Science 2017-05-24 Jesús Gómez-Vilardebó

Integrating coded caching (CC) into multi-input multi-output (MIMO) setups significantly enhances the achievable degrees of freedom (DoF). We consider a cache-aided MIMO configuration with a CC gain $t$, where a server with $L$ Tx-antennas…

Information Theory · Computer Science 2023-11-27 Mohammad NaseriTehrani , MohammadJavad Salehi , Antti Tölli

In this paper, the available spatial Degrees-Of-Freedoms (DOF) in single antenna systems is exploited. A new coding scheme is proposed in which several data streams having fractional multiplexing gains are sent by transmitters and…

Information Theory · Computer Science 2016-11-18 Abolfazl Seyed Motahari , Shahab Oveis Gharan , Mohammad-Ali Maddah-Ali , Amir Keyvan Khandani

We study the sum degrees of freedom (DoF) of a class of multi-layer relay-aided MIMO broadcast networks with delayed channel state information at transmitters (CSIT). In the assumed network a K-antenna source intends to communicate to K…

Information Theory · Computer Science 2012-10-15 Zhao Wang , Ming Xiao , Chao Wang , Mikael Skoglund

In this work, we study a large linear interference network with an equal number of transmitters and receivers, where each transmitter is connected to two subsequent receivers. Each transmitter has individual access to a backhaul link…

Information Theory · Computer Science 2019-03-18 Eleftherios Lampiris , Aly El Gamal , Petros Elia

Degree of freedom (DoF) region provides an approximation of capacity region in high signal-to-noise ratio (SNR) regime, while sum DoF gives the scaling factor. In this correspondence, we analyse the DoF region and sum DoF for unicast…

Information Theory · Computer Science 2015-03-17 Feng Liu , Chung Chan , Ying Jun , Zhang

We consider the two-hop interference channel (IC), which consists of two source-destination pairs communicating with each other via two relays. We analyze the degrees of freedom (DoF) of this network when the relays are restricted to…

Information Theory · Computer Science 2016-11-18 Ibrahim Issa , Silas L. Fong , A. Salman Avestimehr

We consider a wireless device-to-device (D2D) caching network where n nodes are placed on a regular grid of area A(n). Each node caches L_C*F (coded) bits from a library of size L*F bits, where L is the number of files and F is the size of…

Information Theory · Computer Science 2016-12-23 An Liu , Vincent Lau , Giuseppe Caire

This paper considers a $K$-user multiple-input-multiple-output (MIMO) interference channel (IC) where 1) the channel state information obtained by the transmitters (CSIT) is completely outdated, and 2) the number of transmit antennas at…

Information Theory · Computer Science 2016-05-06 Chenxi Hao , Bruno Clerckx

In this paper, we explore the benefits, in the sense of total (sum rate) degrees of freedom (DOF), of cooperation and cognitive message sharing for a two-user multiple-input-multiple-output (MIMO) Gaussian interference channel with $M_1$,…

Information Theory · Computer Science 2008-03-13 Chiachi Huang , Syed A. Jafar

In the context of coded caching in the $K$-user BC, our work reveals the surprising fact that having multiple ($L$) transmitting antennas, dramatically ameliorates the long-standing subpacketization bottleneck of coded caching by reducing…

Information Theory · Computer Science 2018-02-12 Eleftherios Lampiris , Petros Elia

Vector space interference alignment (IA) is known to achieve high degrees of freedom (DoF) with infinite independent channel extensions, but its performance is largely unknown for a finite number of possibly dependent channel extensions. In…

Information Theory · Computer Science 2016-11-17 Ruoyu Sun , Zhi-Quan Luo

Recently, it has been shown that in a cache-enabled interference channel, the storage at the transmit and receive sides are of equal value in terms of Degrees of Freedom (DoF). This is derived by assuming full Channel State Information at…

Information Theory · Computer Science 2017-01-24 Mohammad Ali Tahmasbi Nejad , Seyed Pooya Shariatpanahi , Babak Hossein Khalaj

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…

Information Theory · Computer Science 2024-06-25 Monolina Dutta , Anoop Thomas , B. Sundar Rajan