Capacity of a Class of Modulo-Sum Relay Channels

被引:54
作者
Aleksic, Marko [1 ]
Razaghi, Peyman [1 ]
Yu, Wei [1 ]
机构
[1] Univ Toronto, Edward S Rogers Sr Dept Elect & Comp Engn, Toronto, ON M5S 3G4, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Channel with side information; cut-set bound; modulo-sum channel; quantize-and-forward; relay channel; SUCCESSIVE REFINEMENT; STATE INFORMATION; THEOREMS;
D O I
10.1109/TIT.2008.2011518
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper characterizes 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. The capacity is shown to be strictly below the cut-set bound in general and achievable using a quantize-and-forward strategy at the relay. This result confirms a previous conjecture on the capacity of channels with rate-limited side information at the receiver for this particular class of modulo-sum channels. This paper also considers a more general setting in which the relay is capable of conveying noncausal rate-limited side information about the noise to both the transmitter and the receiver. The capacity is characterized for the case where the channel is binary symmetric with a crossover probability 1/2. In this case, the rates available for conveying side information to the transmitter and to the receiver can be traded with each other arbitrarily-the capacity is a function of the stun of the two rates.
引用
收藏
页码:921 / 930
页数:10
相关论文
共 16 条
[1]   ON SOURCE-CODING WITH SIDE INFORMATION VIA A MULTIPLE-ACCESS CHANNEL AND RELATED PROBLEMS IN MULTI-USER INFORMATION-THEORY [J].
AHLSWEDE, R ;
HAN, TS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :396-412
[2]  
Cover T. M., 2001, Elements of information theory
[3]  
COVER TM, 1979, IEEE T INFORM THEORY, V25, P572, DOI 10.1109/TIT.1979.1056084
[4]   Capacity of a class of relay channels with orthogonal components [J].
El Gamal, A ;
Zahedi, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (05) :1815-1817
[5]  
ELGAMAL A, 1982, IEEE T INFORM THEORY, V28, P536, DOI 10.1109/TIT.1982.1056502
[6]   SUCCESSIVE REFINEMENT OF INFORMATION [J].
EQUITZ, WHR ;
COVER, TM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (02) :269-275
[7]  
Gel'fand S. I., 1980, Problems of Control and Information Theory, V9, P19
[8]   ON THE CAPACITY OF COMPUTER MEMORY WITH DEFECTS [J].
HEEGARD, C ;
ELGAMAL, AA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (05) :731-739
[9]   Capacity of a class of deterministic relay channels [J].
Kim, Young-Han .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (03) :1328-1329
[10]   Cooperative strategies and capacity theorems for relay networks [J].
Kramer, G ;
Gastpar, M ;
Gupta, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (09) :3037-3063