English
Related papers

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

200 papers

In this paper, we introduce an efficient interference alignment (IA) algorithm exploiting partially coordinated transmit precoding to improve the number of concurrent interference-free transmissions, i.e., the multiplexing gain, in…

Information Theory · Computer Science 2011-03-24 Aimal Khan Yousafzai , Mohammad Reza Nakhai

Achievable degrees-of-freedom (DoF) of the large-scale interfering two-way relay network is investigated. The network consists of $K$ pairs of communication nodes (CNs) and $N$ relay nodes (RNs). It is assumed that $K\ll N$ and each pair of…

Information Theory · Computer Science 2016-11-17 Hyun Jong Yang , Won-Yong Shin , Bang Chul Jung

We provide innerbound and outerbound for the total number of degrees of freedom of the $K$ user multiple input multiple output (MIMO) Gaussian interference channel with $M$ antennas at each transmitter and $N$ antennas at each receiver if…

Information Theory · Computer Science 2008-09-02 Tiangao Gou , Syed A. Jafar

Recent works on MIMO interference channels have shown that interference alignment can significantly increase the achievable degrees of freedom (DoF) of the network. However, most of these works have assumed a fully connected interference…

Information Theory · Computer Science 2016-08-24 Liangzhong Ruan , Vincent K. N. Lau

In this work, we consider the use of interference alignment (IA) in a MIMO interference channel (IC) under the assumption that each transmitter (TX) has access to channel state information (CSI) that generally differs from that available to…

Information Theory · Computer Science 2013-05-08 Paul de Kerret , Maxime Guillaud , David Gesbert

This paper focuses on $ K $-receiver discrete-time memoryless broadcast channels (DM-BCs) with private messages, where the transmitter wishes to convey $K$ private messages to $K$ receivers respectively. A general inner bound on the…

Information Theory · Computer Science 2021-11-10 Rui Tang , Songjie Xie , Youlong Wu

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…

Signal Processing · Electrical Eng. & Systems 2018-03-28 Sudip Biswas , Tong Zhang , Keshav Singh , Satyanarayana Vuppala , Tharmalingam Ratnarajah

MIMO systems in the lower part of the millimeter-wave spectrum band (i.e., below 28 GHz) do not exhibit enough directivity and selectively, as their counterparts in higher bands of the spectrum (i.e., above 60 GHz), and thus still suffer…

Information Theory · Computer Science 2018-03-01 Hadi Ghauch , Taejoon Kim , Mats Bengtsson , Mikael Skoglund

Centralized coded caching and delivery is studied for a radio access combination network (RACN), whereby a set of $H$ edge nodes (ENs), connected to a cloud server via orthogonal fronthaul links with limited capacity, serve a total of $K$…

Information Theory · Computer Science 2019-10-01 Ahmed Roushdy , Abolfazl Seyed Motahari , Mohammed Nafie , Deniz Gunduz

This paper considers a K-user Multiple-Input-Single-Output (MISO) Interference Channel (IC), where the channel state information obtained by the transmitters (CSIT) is perfect, but completely outdated. A Retrospective Interference Alignment…

Information Theory · Computer Science 2015-02-26 Chenxi Hao , Bruno Clerckx

We analyze a novel architecture for caching popular video content to enable wireless device-to-device collaboration. We focus on the asymptotic scaling characteristics and show how they depends on video content popularity statistics. We…

Networking and Internet Architecture · Computer Science 2012-08-18 Negin Golrezaei , Alexandros G. Dimakis , Andreas F. Molisch

We investigate the fundamental information theoretic limits of cache-aided wireless networks, in which edge nodes (or transmitters) are endowed with caches that can store popular content, such as multimedia files. This architecture aims to…

Information Theory · Computer Science 2015-12-25 Avik Sengupta , Ravi Tandon , Osvaldo Simeone

Data shuffling between distributed cluster of nodes is one of the critical steps in implementing large-scale learning algorithms. Randomly shuffling the data-set among a cluster of workers allows different nodes to obtain fresh data…

Information Theory · Computer Science 2018-01-08 Mohamed A. Attia , Ravi Tandon

We consider {\it i)} the overhead minimization of maximum-distance separable (MDS) storage codes for the repair of a single failed node and {\it ii)} the total secure degrees-of-freedom (S-DoF) maximization in a multiple-access compound…

Information Theory · Computer Science 2015-03-17 Dimitris S. Papailiopoulos , Alexandros G. Dimakis

In this paper, we consider multiple-antenna $K$-user interference channels with backhaul collaboration in one side (among the transmitters or among the receivers) and investigate the trade-off between the rate in the channel versus the…

Information Theory · Computer Science 2018-07-24 Borna Kananian , Mohammad Ali Maddah-ali , Babak Hossein Khalaj

We establish the DoF region for the MIMO 2x2 interference network with a general message set, consisting of nine messages, one for each pair of a subset of transmitters at which that message is known and a subset of receivers where that…

Information Theory · Computer Science 2016-03-08 Yao Wang , Mahesh K. Varanasi

We consider a wireless device-to-device (D2D) network where $n$ nodes are uniformly distributed at random over the network area. We let each node with storage capacity $M$ cache files from a library of size $m \geq M$. Each node in the…

Information Theory · Computer Science 2016-11-17 Sang-Woon Jeon , Song-Nam Hong , Mingyue Ji , Giuseppe Caire , Andreas F. Molisch

This paper studies the sum Degrees of Freedom (DoF) of $K$-user {\em asymmetric} MIMO Interference Channel (IC) with square direct link channel matrices, that is, the $u$-th transmitter and its intended receiver have $M_u\in\mathbb{N}$…

Information Theory · Computer Science 2014-10-21 Tang Liu , Daniela Tuninetti , Syed A. Jafar

We consider a dense $K$ user Gaussian interference network formed by paired transmitters and receivers placed independently at random in a fixed spatial region. Under natural conditions on the node position distributions and signal…

Information Theory · Computer Science 2011-09-12 Oliver Johnson , Matthew Aldridge , Robert Piechocki

We consider the problem of private information retrieval (PIR) from $N$ non-colluding and replicated databases when the user is equipped with a cache that holds an uncoded fraction $r$ from each of the $K$ stored messages in the databases.…

Information Theory · Computer Science 2017-09-05 Yi-Peng Wei , Karim Banawan , Sennur Ulukus
‹ Prev 1 8 9 10 Next ›