Title :
Capacity of a Class of Modulo-Sum Relay Channels
Author :
Aleksic, Marko ; Razaghi, Peyman ; Yu, Wei
Author_Institution :
Edward S. Rogers Sr. Dept. of Electr. & Comput. Eng., Univ. of Toronto, Toronto, ON
fDate :
3/1/2009 12:00:00 AM
Abstract :
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 sum of the two rates.
Keywords :
channel capacity; quantisation (signal); cut-set bound; modular additive noise relay channel; modulo-sum relay channel capacity; quantize-and-forward strategy; rate-limited side information; Additive noise; Capacity planning; Channel capacity; Decoding; Degradation; Digital relays; Fading; Helium; Information theory; Transmitters; Channel with side information; cut-set bound; modulo-sum channel; quantize-and-forward; relay channel;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2008.2011518