The Three-User Finite Field Multi-Way Relay Channel with Correlated Sources

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

submitted to IEEE Transactions on Information Theory

Scientific paper

This paper studies the three-user finite field multi-way relay channel with correlated sources, where three users exchange possibly correlated messages via a relay. Full data exchange is considered where each user is to decode the messages from the other two users. There is no direct link among the users; the uplink from the users to the relay and the downlinks from the relay to the users are finite field adder channels with independent additive noise of arbitrary distributions. The problem is to determine the set of all achievable rates, defined as channel uses per source symbol for reliable communication. Using the Slepian-Wolf source coding and a functional-decode-forward channel coding scheme, the solution is obtained for two classes of source and channel combinations. Furthermore, for correlated sources with common cores, two new functional-decode-forward coding schemes are constructed and are shown to obtain the set of all achievable rates for any source and channel combination.

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

The Three-User Finite Field Multi-Way Relay Channel with Correlated Sources 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 The Three-User Finite Field Multi-Way Relay Channel with Correlated Sources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Three-User Finite Field Multi-Way Relay Channel with Correlated Sources will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-642050

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