TY - GEN
T1 - Capacity of a class of semi-deterministic primitive relay channels
AU - Tandon, Ravi
AU - Ulukus, Sennur
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=79952390236&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79952390236&partnerID=8YFLogxK
U2 - 10.1109/ALLERTON.2010.5707008
DO - 10.1109/ALLERTON.2010.5707008
M3 - Conference contribution
AN - SCOPUS:79952390236
SN - 9781424482146
T3 - 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
SP - 931
EP - 935
BT - 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
T2 - 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
Y2 - 29 September 2010 through 1 October 2010
ER -