Capacity of a Class of Diamond Channels

Details Capacity of a Class of Diamond Channels Capacity of a Class of Diamond Channels

2008-08-07

arxiv.org/abs/0808.0948v1

Computer Science

Information Theory

15 pages, 3 figures, submitted to IEEE Trans. on Information Theory

Scientific paper

We study a special class of diamond channels which was introduced by Schein in 2001. In this special class, each diamond channel consists of a transmitter, a noisy relay, a noiseless relay and a receiver. We prove the capacity of this class of diamond channels by providing an achievable scheme and a converse. The capacity we show is strictly smaller than the cut-set bound. Our result also shows the optimality of a combination of decode-and-forward (DAF) and compress-and-forward (CAF) at the noisy relay node. This is the first example where a combination of DAF and CAF is shown to be capacity achieving. Finally, we note that there exists a duality between this diamond channel coding problem and the Kaspi-Berger source coding problem.

Affiliated with

Also associated with

No associations

Rating

Capacity of a Class of Diamond Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Capacity of a Class of Diamond Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capacity of a Class of Diamond Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-213214