English
Related papers

Related papers: The Gaussian Multiple Access Diamond Channel

200 papers

This paper considers reliable communications over a multiple-input multiple-output (MIMO) Gaussian channel, where the channel matrix is within a bounded channel uncertainty region around a nominal channel matrix, i.e., an instance of the…

Information Theory · Computer Science 2013-06-05 Yin Sun , C. Emre Koksal , Ness B. Shroff

Upper bounds for private communication over quantum channels can be derived by adopting channel simulation, protocol stretching, and relative entropy of entanglement. All these ingredients have led to single-letter upper bounds to the…

In this paper, we investigate the sum-capacity of the two-user Gaussian interference channel with Gaussian superposition coding and successive decoding. We first examine an approximate deterministic formulation of the problem, and introduce…

Information Theory · Computer Science 2011-03-30 Yue Zhao , Chee Wei Tan , A. Salman Avestimehr , Suhas N. Diggavi , Gregory J. Pottie

Interference alignment has emerged as a powerful tool in the analysis of multi-user networks. Despite considerable recent progress, the capacity region of the Gaussian K-user interference channel is still unknown in general, in part due to…

Information Theory · Computer Science 2016-11-15 Or Ordentlich , Uri Erez , Bobak Nazer

This work considers a binomial noise channel. The paper can be roughly divided into two parts. The first part is concerned with the properties of the capacity-achieving distribution. In particular, for the binomial channel, it is not known…

Information Theory · Computer Science 2024-01-24 Ian Zieder , Antonino Favano , Luca Barletta , Alex Dytso

A two-user symmetric Gaussian Interference Channel (IC) is considered in which a noiseless unidirectional link connects one encoder to the other. Having a constant capacity, the additional link provides partial cooperation between the…

Information Theory · Computer Science 2009-09-16 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani

Uplink-downlink duality refers to the fact that under a sum-power constraint, the capacity regions of a Gaussian multiple-access channel and a Gaussian broadcast channel with Hermitian transposed channel matrices are identical. This paper…

Information Theory · Computer Science 2021-08-27 Liang Liu , Ya-Feng Liu , Pratik Patil , Wei Yu

We introduce the two user finite state compound Gaussian interference channel and characterize its capacity region to within one bit. The main contributions involve both novel inner and outer bounds. The inner bound is multilevel…

Information Theory · Computer Science 2008-05-01 Adnan Raja , Vinod M. Prabhakaran , Pramod Viswanath

This work considers a Poisson noise channel with an amplitude constraint. It is well-known that the capacity-achieving input distribution for this channel is discrete with finitely many points. We sharpen this result by introducing upper…

Information Theory · Computer Science 2021-07-30 Alex Dytso , Luca Barletta , Shlomo Shamai

Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is proposed for general discrete memoryless sources and channels.…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Elza Erkip , Andrea J. Goldsmith , H. Vincent Poor

This paper considers the partial decode-and-forward (PDF) strategy for the Gaussian multiple-input multiple-output (MIMO) relay channel. Unlike for the decode-and-forward (DF) strategy or point-to-point (P2P) transmission, for which…

Information Theory · Computer Science 2014-10-01 Lennart Gerdes , Christoph Hellings , Lorenz Weiland , Wolfgang Utschick

Standard upper and lower bounds on the capacity of relay channels are cut-set (CS), decode-forward (DF), and quantize-forward (QF) rates. For real additive white Gaussian noise (AWGN) multicast relay channels with one source node and one…

Information Theory · Computer Science 2019-01-28 Mohit Thakur , Gerhard Kramer

In this paper, we derive the capacity of a special class of mesh networks. A mesh network is defined as a heterogeneous wireless network in which the transmission among power limited nodes is assisted by powerful relays, which use the same…

Information Theory · Computer Science 2010-04-15 Lawrence Ong , Mehul Motani

We prove that a broad array of capacities of a quantum channel are continuous. That is, two channels that are close with respect to the diamond norm have correspondingly similar communication capabilities. We first show that the classical…

Quantum Physics · Physics 2009-09-09 Debbie Leung , Graeme Smith

We consider an additive Gaussian channel with additive Gaussian noise feedback. We derive an upper bound on the n-block capacity (defined by Cover [1]). It is shown that this upper bound can be obtained by solving a convex optimization…

Information Theory · Computer Science 2015-03-19 Chong Li , Nicola Elia

A standard assumption in the design of ultra-reliable low-latency communication systems is that the duration between message arrivals is larger than the number of channel uses before the decoding deadline. Nevertheless, this assumption…

Information Theory · Computer Science 2025-01-31 Homa Nikbakht , Malcolm Egan , Jean-Marie Gorce , H. Vincent Poor

An upper bound on the capacity of multiple-input multiple-output (MIMO) Gaussian fading channels is derived under peak amplitude constraints. The upper bound is obtained borrowing concepts from convex geometry and it extends to MIMO…

Information Theory · Computer Science 2021-11-29 Antonino Favano , Marco Ferrari , Maurizio Magarini , Luca Barletta

We study deterministic approximations of the Gaussian two-user multiple access wiretap channel (G-MAC-WT) and the Gaussian wiretap channel with a helper (G-WT-H). These approximations enable results beyond the recently shown 2/3 and 1/2…

Information Theory · Computer Science 2018-04-24 Rick Fritschek , Gerhard Wunder

In this paper, we study the interference relay-without-delay channel which is an interference channel with a relay helping the communication. We assume the relay's transmit symbol depends not only on its past received symbols but also on…

Information Theory · Computer Science 2011-08-16 Hyunseok Chang , Sae-Young Chung

The purpose of this work is to extend the result of previous papers quant-ph/9611023, quant-ph/9703013 to quantum channels with additive constraints onto the input signal, by showing that the capacity of such channel is equal to the…

Quantum Physics · Physics 2007-05-23 A. S. Holevo
‹ Prev 1 4 5 6 7 8 10 Next ›