Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

The Capacity of Several New Classes of Semi-Deterministic Relay Channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hon-Fah Chong ; Electr. & Comput. Eng. Dept., Nat. Univ. of Singapore, Singapore, Singapore ; Motani, M.

The relay channel consists of a transmitter input x1, a relay input x2, a relay output y2 , and a receiver output y3. In this paper, we establish the capacity of three new classes of semi-deterministic relay channels: 1) a class of degraded semi-deterministic relay channels, 2) a class of semi-deterministic orthogonal relay channels, and 3) a class of semi-deterministic relay channels with relay-transmitter feedback. For the first class of relay channels, the output of the relay y2 depends on a deterministic function of the transmitter's input x1, i.e., on s=f1(x1), rather than on x1 directly. In addition, the relay channels satisfy the condition that S → (X2,Y2) → Y3 forms a Markov chain for all input probability distributions p(x1,x2). Hence, the first class of relay channels includes, but is strictly not limited to, the class of degraded relay channels previously considered by Cover and El Gamal. The partial decode-and-forward strategy achieves the capacity of the class of degraded semi-deterministic relay channels. Next, we consider the class of semi-deterministic orthogonal relay channels where there are orthogonal channels from the relay to the receiver and from the transmitter to the receiver. In addition, the output of the relay y2 is a deterministic function of x1, x2 and y3 , i.e., y2=f4(x1,x2,y3). The class of semi-deterministic orthogonal relay channels is a generalization of the class of deterministic relay channels considered by Kim. The compress-and-forward strategy achieves the capacity of the class of semi- - -deterministic orthogonal relay channels. For the third class of relay channels, there is a causal and noiseless feedback from the relay to the transmitter. In addition, similar to the second class of relay channels, the output of the relay y2 is a deterministic function of x1, x2, and y3 . Both the generalized strategy of Gabbai and Bross and the hash-and-forward strategy of Kim achieve the capacity of the class of semi-deterministic relay channels with relay-transmitter feedback.

Published in:

Information Theory, IEEE Transactions on  (Volume:57 ,  Issue: 10 )