English
Related papers

Related papers: Upper Bounds and Duality Relations of the Linear D…

200 papers

A basic setup of a two-tier network, where two mobile users exchange messages with a multi-antenna macrocell basestation, is studied from a rate perspective subject to beamforming and power constraints. The communication is facilitated by…

Information Theory · Computer Science 2016-10-21 Dennis Michaelis , Aydin Sezgin , Eduard Jorswieck

In this paper, we first present an outer bound for a general interference channel with a cognitive relay, i.e., a relay that has non-causal knowledge of both independent messages transmitted in the interference channel. This outer bound…

Information Theory · Computer Science 2015-03-17 Stefano Rini , Daniela Tuninetti , Natasha Devroye

The uplink of interference-limited cellular networks with base stations that have large numbers of antennas and use linear Minimum-Mean-Square Error (MMSE) processing with power control is analyzed. Simple approximations, which are exact in…

Information Theory · Computer Science 2015-06-22 Siddhartan Govindasamy

We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error…

Information Theory · Computer Science 2021-02-16 Ehsan Asadi Kangarshahi , Albert Guillén i Fàbregas

With the unprecedented growth of signal processing and machine learning application domains, there has been a tremendous expansion of interest in distributed optimization methods to cope with the underlying large-scale problems.…

Optimization and Control · Mathematics 2022-10-25 Hansi Abeynanda , Chathuranga Weeraddana , G. H. J. Lanel , Carlo Fischione

In wireless communication-based formation control systems, the control performance is significantly impacted by the channel capacity of each communication link between agents. This relationship, however, remains under-investigated in the…

Multiagent Systems · Computer Science 2025-01-07 Yaru Chen , Yirui Cong , Xiangyun Zhou , Long Cheng , Xiangke Wang

We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is…

Information Theory · Computer Science 2014-01-22 Quan Geng , Tie Liu

Linear processing in the spatial domain at the base stations (BSs) and at the users of MIMO cellular systems enables the control of both inter-cell and intra-cell interference. A number of iterative algorithms have been proposed that allow…

Information Theory · Computer Science 2014-08-25 Tariq Elkourdi , Osvaldo Simeone , Onur Sahin , Shlomo Shamai

The two-user computation broadcast problem is introduced as the setting where User $1$ wants message $W_1$ and has side-information $W_1'$, User $2$ wants message $W_2$ and has side-information $W_2'$, and $(W_1, W_1', W_2, W_2')$ may have…

Information Theory · Computer Science 2019-03-19 Hua Sun , Syed A. Jafar

We study the converse and achievability for the degrees of freedom of the multicellular multiple-input multiple-output (MIMO) multiple access channel (MAC) with constant channel coefficients. We assume L>1 homogeneous cells with K>0 users…

Information Theory · Computer Science 2016-10-04 Taejoon Kim , David J. Love , Bruno Clerckx

We study opportunistic scheduling and the sum capacity of cellular networks with a full-duplex multi-antenna base station and a large number of single-antenna half-duplex users. Simultaneous uplink and downlink over the same band results in…

Information Theory · Computer Science 2016-11-17 Can Karakus , Suhas Diggavi

We derive bounds on the noncoherent capacity of a very general class of multiple-input multiple-output channels that allow for selectivity in time and frequency as well as for spatial correlation. The bounds apply to peak-constrained…

Information Theory · Computer Science 2008-01-29 Ulrich G. Schuster , Giuseppe Durisi , Helmut Bölcskei , H. Vincent Poor

This paper considers the two-way relay channel (TWRC) where two users communicate via a relay. For the restricted TWRC where the uplink from the users to the relay is any deterministic function and the downlink from the relay to the users…

Information Theory · Computer Science 2012-03-13 Lawrence Ong , Sarah J. Johnson

In this paper, we present a new technique to obtain upper bounds on undirected unicast network information capacity. Using this technique, we characterize an upper bound, called partition bound, on the symmetric rate of information flow in…

Information Theory · Computer Science 2020-10-27 Satyajit Thakor , Mohammad Ishtiyaq Qureshi

We study the problem of associating mobile terminals to base stations in a linear interference network, with the goal of maximizing the average rate achieved over both the uplink and downlink sessions. The cell association decision is made…

Information Theory · Computer Science 2016-05-17 Aly El Gamal

In layered communication networks there are only connections between intermediate nodes in adjacent layers. Applying network coding to such networks provides a number of benefits in theory as well as in practice. We propose a "layering…

Information Theory · Computer Science 2016-02-10 Michael Cyran , Birgit Schotsch , Johannes B. Huber , Robert F. H. Fischer , Vahid Forutan

We study achievable rates of reliable communication in a power-constrained two-way additive interference channel over the real alphabet where communication is disrupted by a power-constrained jammer. This models the wireless communication…

Information Theory · Computer Science 2020-01-10 Yihan Zhang , Shashank Vatedka , Sidharth Jaggi

In this paper, new upper and lower bounds are proposed for the capacity of discrete-time Laguerre channel. Laguerre behavior is used to model various types of optical systems and networks such as optical amplifiers, short distance visible…

Information Theory · Computer Science 2017-01-02 Hossein Esmaeili , Jawad Salehi

Consider the broadcast relay channel (BRC) which consists of a source sending information over a two user broadcast channel in presence of two relay nodes that help the transmission to the destinations. Clearly, this network with five nodes…

Information Theory · Computer Science 2010-05-05 Arash Behboodi , Pablo Piantanida

We derive an upper bound on the capacity of non-binary deletion channels. Although binary deletion channels have received significant attention over the years, and many upper and lower bounds on their capacity have been derived, such…

Information Theory · Computer Science 2013-10-10 Mojtaba Rahmati , Tolga M. Duman
‹ Prev 1 4 5 6 7 8 10 Next ›