Abstract

We consider binary multiway relaying with $N$ nodes where each node demands messages of all other nodes and can only communicate via a relay. The nodes use binary transmissions. We propose two schemes requiring a maximum of $2\lceil \frac {N}{2} \rceil + 2$ channel uses (CUs) for full data exchange, which is lesser than previously published schemes for many values of $N$ . Physical layer network coding is employed at the relay with message dependent node transmissions. The schemes have lower decoding complexities, better bit error rates, and are more energy efficient compared to other schemes requiring nearly same number of CUs.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.