CAPACITY THEOREMS FOR THE RELAY CHANNEL
CAPACITY THEOREMS FOR THE RELAY CHANNEL
复制标题
DOI：
10.1109/tit.1979.1056084
复制
发表时间：
1979-01-01
影响因子：
2.5
通讯作者：
ELGAMAL, AA
中科院分区：
文献类型：
--
作者：
COVER, TM;ELGAMAL, AA
中继通道由输入、中继输出、通道输出和中继发送器（允许其传输依赖于过去的符号）组成。接收到的符号对输入的依赖性由。通道被假定为无内存的。本文证明了下列容量定理。1)如果是退化形式，则C \: = \: \max \！_ {p(间的{1},间的{2})}\敏\,{我(间的{1},间的{2};Y),我(间的{1};Y_{1} |间的{2})}。那么，它是……的一种退化形式。3)国际金融机构任意传递与反馈通道fromto两间的{1}\和间的{2},然后C \: = \: \ max_ {p(间的{1},间的{2})}\敏\,{我(间的{1},间的{2};Y),我\(间的{1};Y, Y_{1} |间的{2})}。4)对于一般的传递通道,C \: \ leq \: \ max_ {p(间的{1},间的{2})}\敏\,{我\(间的{1},间的{2};Y),我(间的{1};Y, Y_{1} |间的{2})。采用叠加分块马尔可夫编码来表示算法的可实现性，并建立了逆变器。对高斯中继信道和某些离散中继信道的容量进行了评估。最后，建立了一个可实现的一般中继信道容量下界。
A relay channel consists of an input, a relay output, a channel output, and a relay sender(whose transmission is allowed to depend on the past symbols. The dependence of the received symbols upon the inputs is given by. The channel is assumed to be memoryless. In this paper the following capacity theorems are proved. 1)Ifis a degraded form of, then C \: = \: \max \!_{p(x_{1},x_{2})} \min \,{I(X_{1},X_{2};Y), I(X_{1}; Y_{1}|X_{2})} . 2)Ifis a degraded form of, then. 3)Ifis an arbitrary relay channel with feedback fromto both x_{1} \and x_{2} , then C\: = \: \max_{p(x_{1},x_{2})} \min \,{I(X_{1},X_{2};Y),I \,(X_{1};Y,Y_{1}|X_{2})} . 4)For a general relay channel, C \: \leq \: \max_{p(x_{1},x_{2})} \min \,{I \,(X_{1}, X_{2};Y),I(X_{1};Y,Y_{1}|X_{2}) . Superposition block Markov encoding is used to show achievability of, and converses are established. The capacities of the Gaussian relay channel and certain discrete relay channels are evaluated. Finally, an achievable lower bound to the capacity of the general relay channel is established.