Strengthened Cutset Upper Bounds on the Capacity of the Relay Channel and Applications

01/27/2021
by   Abbas El Gamal, et al.
0

We establish new upper bounds on the capacity of the relay channel which are tighter than all previous bounds. The upper bounds use traditional weak converse techniques involving mutual information inequalities and identification of auxiliary random variables via past and future channel random variable sequences. For the relay channel without self-interference, we show that the new bound is strictly tighter than all previous bounds for the Gaussian relay channel for every set of non-zero channel gains. When specialized to the class of relay channels with orthogonal receiver components, the bound resolves a conjecture by Kim on a class of deterministic relay channels. When further specialized to the class of product-form relay channels with orthogonal receiver components, the bound resolves a generalized version of Cover's relay channel problem, recovers the recent upper bound for the Gaussian case by Wu et al. and extends it to the non-symmetric case, and improves upon the recent bounds for the binary symmetric case by Wu et al. and Barnes et al., which are all obtained using non-traditional geometric proof techniques.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/29/2018

The Arbitrarily Varying Gaussian Relay Channel with Sender Frequency Division

We consider the arbitrarily varying Gaussian relay channel with sender f...
research
01/05/2018

The Arbitrarily Varying Relay Channel

We study the arbitrarily varying relay channel, and establish the cutset...
research
11/27/2018

Capacity Upper Bounds for the Relay Channel via Reverse Hypercontractivity

The primitive relay channel, introduced by Cover in 1987, is the simples...
research
05/03/2022

Bounds on the Capacity of the Multiple Access Diamond Channel with Cooperating Base-Stations

A diamond network is considered in which the central processor is connec...
research
12/28/2020

Minoration via Mixed Volumes and Cover's Problem for General Channels

We propose a method for establishing lower bounds on the supremum of pro...
research
01/03/2018

The Capacity on Degraded Relay Broadcast Channel

The relay broadcast channel (RBC) is considered, in which a transmitter ...
research
01/27/2021

Non-Asymptotic Converse Bounds Via Auxiliary Channels

This paper presents a new derivation method of converse bounds on the no...

Please sign up or login with your details

Forgot password? Click here to reset