Wireless Network-Coded Three-Way Relaying Using Latin Cubes

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 Pages, 16 Figures. Some mistakes in the previous version have been fixed

Scientific paper

The design of modulation schemes for the physical layer network-coded three-way wireless relaying scenario is considered. The protocol employs two phases: Multiple Access (MA) phase and Broadcast (BC) phase with each phase utilizing one channel use. For the two-way relaying scenario, it was observed by Koike-Akino et al. \cite{KPT}, that adaptively changing the network coding map used at the relay according to the channel conditions greatly reduces the impact of multiple access interference which occurs at the relay during the MA phase and all these network coding maps should satisfy a requirement called \textit{exclusive law}. This paper does the equivalent for the three-way relaying scenario. We show that when the three users transmit points from the same 4-PSK constellation, every such network coding map that satisfies the exclusive law can be represented by a Latin Cube of Second Order. The network code map used by the relay for the BC phase is explicitly obtained and is aimed at reducing the effect of interference at the MA stage.

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

Wireless Network-Coded Three-Way Relaying Using Latin Cubes 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 Wireless Network-Coded Three-Way Relaying Using Latin Cubes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Wireless Network-Coded Three-Way Relaying Using Latin Cubes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-596224

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