Capacity of a Class of Multicast Tree Networks

Details Capacity of a Class of Multicast Tree Networks Capacity of a Class of Multicast Tree Networks

2010-05-15

arxiv.org/abs/1005.2710v2

Computer Science

Information Theory

27 pages, 2 figures, 1 table. Revised version in response to referee comments (in revision for IEEE Transactions on Informatio

Scientific paper

In this paper, we characterize the capacity of a new class of single-source multicast discrete memoryless relay networks having a tree topology in which the root node is the source and each parent node in the graph has at most one noisy child node and any number of noiseless child nodes. This class of multicast tree networks includes the class of diamond networks studied by Kang and Ulukus as a special case, where they showed that the capacity can be strictly lower than the cut-set bound. For achievablity, a novel coding scheme is constructed where each noisy relay employs a combination of decode-and-forward (DF) and compress-and-forward (CF) and each noiseless relay performs a random binning such that codebook constructions and relay operations are independent for each node and do not depend on the network topology. For converse, a new technique of iteratively manipulating inequalities exploiting the tree topology is used.

Affiliated with

Also associated with

No associations

Rating

Capacity of a Class of Multicast Tree Networks 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 Multicast Tree Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capacity of a Class of Multicast Tree Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-671840