Abstract:
We characterize the capacity of a class of primitive relay channels. The primitive relay channel considered in this paper consists of a semi-deterministic broadcast chann...Show MoreMetadata
Abstract:
We characterize the capacity of a class of primitive relay channels. The primitive relay channel considered in this paper consists of a semi-deterministic broadcast channel to the relay and the decoder. The relay can help the message transmission through an orthogonal finite capacity link to the decoder. We show that the capacity of this class of primitive relay channels is given by the cut-set upper bound, and it can be achieved by the partial decode-and-forward scheme. We also show that the rate achievable by the compress-and-forward scheme is strictly smaller than the capacity.
Published in: 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Date of Conference: 29 September 2010 - 01 October 2010
Date Added to IEEE Xplore: 04 February 2011
ISBN Information: