Distributed Coded Modulation Schemes for Multiple Access Relay Channels
Zihuai Lin

TL;DR
This paper explores distributed coded modulation schemes for multiple access relay channels, deriving tight upper bounds on bit error probability with MLSD, advancing understanding of performance limits in such systems.
Contribution
It introduces and analyzes network nest coded modulation schemes for relay channels, providing analytical bounds and demonstrating their asymptotic tightness at high SNR.
Findings
Derived upper bounds on bit error probability with MLSD
Showed bounds are asymptotically tight at high SNR
Analyzed performance of distributed convolutional coding schemes
Abstract
In this paper, we investigate network nest coded modulation schemes for multiple access relay channels. The performance of the distributed systems which are based on distributed convolutional codes with network coded modulation is presented. An analytical upper bound on bit error probability performance for the studied distributed systems with Maximum Likelihood Sequence Detection (MLSD) is derived. The constructured bounds for the investigated systems are shown to be asymptotically tight for increasing channel Signal-to-Noise Ratio (SNR) values
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Error Correcting Code Techniques · Advanced Wireless Communication Techniques
