Source-Channel Coding Theorems for the Multiple-Access Relay Channel

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

45 pages, 7 figures, submitted to IEEE Transaction on Information Theory

Scientific paper

Reliable transmission of arbitrarily correlated sources over multiple-access relay channels (MARCs) and multiple-access broadcast relay channels (MABRCs) is considered. In MARCs only the destination is interested in a reconstruction of the sources, while in MABRCs both the relay and the destination want to reconstruct the sources. In addition to arbitrary correlation among the source signals at the users, both the relay and the destination are assumed to have side information correlated with the source signals. Sufficient conditions for reliable communication based on operational separation, as well as necessary conditions on the achievable source-channel rates are characterized. Since operational separation is generally not optimal for MARCs and MABRCs, sufficient conditions for reliable communication using joint source-channel coding schemes based on a combination of the correlation preserving mapping technique with binning are also derived. For correlated sources transmitted over fading Gaussian MARCs and MABRCs, conditions under which informational separation is optimal are found.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Source-Channel Coding Theorems for the Multiple-Access Relay Channel 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 Source-Channel Coding Theorems for the Multiple-Access Relay Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Source-Channel Coding Theorems for the Multiple-Access Relay Channel will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-723072

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.