English
Related papers

Related papers: Multiple Unicast Capacity of 2-Source 2-Sink Netwo…

200 papers

In this paper, we study upper bounds on the sum capacity of the downlink multicell processing model with finite backhaul capacity for the simple case of 2 base stations and 2 mobile users. It is modelled as a two-user multiple access…

Information Theory · Computer Science 2016-09-06 Tianyu Yang , Nan Liu , Wei Kang , Shlomo Shamai

We study the symmetric degrees-of-freedom (DoF) of partially connected interference networks under linear coding strategies at transmitters without channel state information beyond topology. We assume that the receivers are equipped with…

Information Theory · Computer Science 2016-11-15 Heecheol Yang , Navid Naderializadeh , Amir Salman Avestimehr , Jungwoo Lee

We consider multi--hop networks comprising Binary Symmetric Channels ($\mathsf{BSC}$s). The network carries unicast flows for multiple users. The utility of the network is the sum of the utilities of the flows, where the utility of each…

Information Theory · Computer Science 2015-03-19 Premkumar Karumbu , Xiaomin Chen , Douglas J. Leith

This paper investigates the sum-capacity of two-user optical intensity multiple access channels with per-user peak- or/and average-intensity constraints. By leveraging tools from the decomposition of certain maxentropic distributions, we…

Information Theory · Computer Science 2023-03-24 Longguang Li , Ru-Han Chen , Jing Zhou

In this paper, the degrees of freedom (DoF) regions of constant coefficient multiple antenna interference channels are investigated. First, we consider a $K$-user Gaussian interference channel with $M_k$ antennas at transmitter $k$, $1\le…

Information Theory · Computer Science 2014-02-18 Mahdi Zamanighomi , Zhengdao Wang

We consider the capacity problem for wireless networks. Networks are modeled as random unit-disk graphs, and the capacity problem is formulated as one of finding the maximum value of a multicommodity flow. In this paper, we develop a proof…

Information Theory · Computer Science 2007-07-13 Christina Peraki , Sergio D. Servetto

Aligned-Images Sumset Inequalities are used in this work to study the Generalized Degrees of Freedom (GDoF) of the symmetric layered multi-hop interference channel under the robust assumption that the channel state information at the…

Information Theory · Computer Science 2021-03-16 Junge Wang , Syed Ali Jafar

The availability of very wide spectrum in millimeter wave bands combined with large antenna arrays and ultra dense networks raises two basic questions: What is the true value of overly abundant degrees of freedom and how can networks be…

Information Theory · Computer Science 2020-02-21 Felipe Gómez-Cuba , Elza Erkip , Sundeep Rangan , Francisco J. González-Castaño

This paper studies cache-aided interference networks with arbitrary number of transmitters and receivers, whereby each transmitter has a cache memory of finite size. Each transmitter fills its cache memory from a content library of files in…

Information Theory · Computer Science 2017-12-19 Antonious M. Girgis , Ozgur Ercetin , Mohammed Nafie , Tamer ElBatt

We revisit the recent secure degrees of freedom (s.d.o.f.) results for one-hop multi-user wireless networks by considering three fundamental wireless network structures: Gaussian wiretap channel with helpers, Gaussian multiple access…

Information Theory · Computer Science 2015-07-09 Jianwei Xie , Sennur Ulukus

We study the sum degrees of freedom (DoF) of the bursty MIMO X channel without feedback, where the four transmitter-receiver links are intermittently on-and-off, controlled by four Bernoulli random sequences which may be arbitrarily…

Information Theory · Computer Science 2018-01-03 Shih-Yi Yeh , I-Hsiang Wang

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…

Information Theory · Computer Science 2018-02-21 Kangqi Liu , Meixia Tao

The question of whether the degrees of freedom (DoF) of multi-user networks can be enhanced even under isotropic fading and no channel state information (or output feedback) at the transmitters (CSIT) is investigated. Toward this end, the…

Information Theory · Computer Science 2012-09-07 Chinmay S. Vaze , Mahesh K. Varanasi

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

The sum secure degrees of freedom (s.d.o.f.) of two fundamental multi-user network structures, the K-user Gaussian multiple access (MAC) wiretap channel and the K-user interference channel (IC) with secrecy constraints, have been determined…

Information Theory · Computer Science 2016-11-17 Jianwei Xie , Sennur Ulukus

The $K\times 2$ and $2\times K$, Multiple-Input Multiple-Output (MIMO) X channel with constant channel coefficients available at all transmitters and receivers is considered. A new alignment scheme, named \emph{layered interference…

Information Theory · Computer Science 2014-12-24 Seyyed Hassan Mahboubi , Mumtaz Hussain , Abolfazl Seyed Motahari , Amir Keyvan Khandani

We consider the multiple unicast problem with three source-terminal pairs over directed acyclic networks with unit-capacity edges. The three $s_i-t_i$ pairs wish to communicate at unit-rate via network coding. The connectivity between the…

Information Theory · Computer Science 2013-02-20 Shurui Huang , Aditya Ramamoorthy

In this paper, the degrees of freedom (DoF) of the two-user single input single output (SISO) X-channel are investigated. Three cases are considered for the availability of channel state information at the transmitters (CSIT); perfect,…

Information Theory · Computer Science 2014-04-28 Ahmed Wagdy , Amr El-Keyi , Tamer Khattab , Mohammed Nafie

We study in this paper a two-hop relaying network consisting of one source, one destination, and three amplify-and-forward (AF) relays operating in a half-duplex mode. In order to compensate for the inherent loss of capacity pre-log factor…

Information Theory · Computer Science 2012-07-17 Ki-Hong Park , Mohamed-Slim Alouini

We present a new outer bound for the sum capacity of general multi-unicast deterministic networks. Intuitively, this bound can be understood as applying the cut-set bound to concatenated copies of the original network with a special…

Information Theory · Computer Science 2014-04-22 Ilan Shomorony , A. Salman Avestimehr