Capacity of a Class of Deterministic Relay Channels

@article{Kim2006CapacityOA,
  title={Capacity of a Class of Deterministic Relay Channels},
  author={Young-Han Kim},
  journal={2007 IEEE International Symposium on Information Theory},
  year={2006},
  pages={591-595}
}
  • Young-Han Kim
  • Published 13 November 2006
  • Computer Science
  • 2007 IEEE International Symposium on Information Theory
The capacity of a class of deterministic relay channels with the transmitter input X, the receiver output Y, the relay output Y1 = f(X,Y), and a separate communication link from the relay to the receiver with capacity R0, is shown to be C(R0) =max min{I(X;Y) + R0, I(X;Y,Y1)}. p(x) Thus every bit from the relay is worth exactly one bit to the receiver. Two alternative coding schemes are presented that achieve this capacity. The first scheme, "hash-and-forward", is based on a variation of the… 

Figures from this paper

A new upper bound on the capacity of a class of primitive relay channels

  • R. TandonS. Ulukus
  • Computer Science
    2008 46th Annual Allerton Conference on Communication, Control, and Computing
  • 2008
The upper bound on the capacity of a class of discrete memoryless relay channels, namely when T = g(X, Y ), for some deterministic function g, is obtained and lies strictly above the rates yielded by the CAF achievability scheme.

The Capacity of a Class of Mixture Semi-Deterministic Relay Channels

This report combines a degraded semi-Deterministic relay channel with a semi-deterministic orthogonal relay channel to obtain a new mixture relay channel and finds a combination of the compress-and-forward strategy and the partial decode- and-forw ard strategy achieves the capacity.

Capacity of a Class of Modulo-Sum Relay Channels

The capacity of a class of modular additive noise relay channels, in which the relay observes a corrupted version of the noise and has a separate channel to the destination, is shown to be strictly below the cut-set bound in general and achievable using a quantize-and-forward strategy at the relay.

Capacity of a Class of State-Dependent Orthogonal Relay Channels

To the best of the authors' knowledge, this is the first single relay channel model for which the capacity is achieved by pDCF, while pDF and CF schemes are both suboptimal.

Capacity of a Modulo-Sum Simple Relay Network

After deriving the achievable capacity theorem (i.e., the forward theorem) for the binary symmetric simple relay network, this paper proves that the capacity is strictly below the cut- set bound.

A New Upper Bound on the Capacity of a Primitive Relay Channel Based on Channel Simulation

  • F. Xue
  • Computer Science
    IEEE Transactions on Information Theory
  • 2014
An upper bound on the capacity of a primitive three-node discrete memoryless relay channel is considered, where a source X wants to send information to destination Y with the help of a relay Z. The

Capacity of a Class of State-Dependent Relay Channels

To the best of the authors' knowledge, this is the first single relay model for which the capacity is achieved by pDCF, while pDF and CF schemes are both suboptimal in general.

Diamond channel with partially separated relays

  • R. TandonS. Ulukus
  • Computer Science
    2010 IEEE International Symposium on Information Theory
  • 2010
It is shown that even partial feedback from the decoder to relays strictly increases the capacity of the diamond channel, and the capacity is equal to the cut-set bound.

Capacity of a class of relay channels with state

The class of orthogonal relay channels with state in which the source and the relay are connected through a channel that depends on a state sequence is considered and the capacity is shown to be achieved by the partial decode-compress-and-forward (pDCF) scheme.

Universal relaying for the interference channel

  • P. RazaghiWei Yu
  • Computer Science
    2010 Information Theory and Applications Workshop (ITA)
  • 2010
This paper considers a Gaussian relay-interference channel and introduces a generalized hash-and-forward relay strategy, where the relay sends out a bin index of its quantized observation, and the
...

References

SHOWING 1-10 OF 17 REFERENCES

Capacity of a Class of Modulo-Sum Relay Channels

The capacity of a class of modular additive noise relay channels, in which the relay observes a corrupted version of the noise and has a separate channel to the destination, is shown to be strictly below the cut-set bound in general and achievable using a quantize-and-forward strategy at the relay.

Partial converse for a relay channel

  • Zhen Zhang
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1988
A special case of the general discrete memoryless relay channel is studied. This channel consists of an input x, a relay output z, a channel output y, and a noiseless channel of capacity C/sub r/

Coding Techniques for Primitive Relay Channels

A comprehensive discussion on coding techniques for the primitive relay channel, in which the channel input X is transmitted to the relay Y1 and the ultimate receiver Y over a channel p(y, y1|x), and three known coding schemes are compared.

Cooperative strategies and capacity theorems for relay networks

The capacity results generalize broadly, including to multiantenna transmission with Rayleigh fading, single-bounce fading, certain quasi-static fading problems, cases where partial channel knowledge is available at the transmitters, and cases where local user cooperation is permitted.

Relay Networks With Delays

It is shown that capacity is determined only by the relative delays of paths from the sender to the receiver and not by their absolute delays, and a new cut-set upper bound that generalizes both the classical cut- set bound for the classical relay and the upper bound forThe relay-without-delay on capacity is established.

Capacity theorems for the relay channel

An achievable lower bound to the capacity of the general relay channel is established and superposition block Markov encoding is used to show achievability of C, and converses are established.

The Capacity of the Relay Channel

Consider the following seemingly simple discrete memoryless relay channel, where Y 1, Y 2 are conditionally independent and conditionally identically distributed given X, and W is uniformly distributed over 2nR.

The capacity of the semideterministic relay channel

The capacity of the class of relay channels with sender x_{1} , a relay sender x_{2} , a relay receiver y_{1}=f(x_{1},x_{2}) , and ultimate receiver y is proved to be C = \max\min_{p(x_{1},x_{2})}

On source coding with side information via a multiple-access channel and related problems in multi-user information theory

A coding theorem is introduced and established for another type of source-channel matching problem, i.e., a system of source coding with side information via a MAC, which can be regarded as an extension of the Ahlswede-Korner-Wyner type noiseless coding system.

Noiseless coding of correlated information sources

The minimum number of bits per character R_X and R_Y needed to encode these sequences so that they can be faithfully reproduced under a variety of assumptions regarding the encoders and decoders is determined.