Coding for the Non-Orthogonal Amplify-and-Forward Cooperative Channel
Ghassan M. Kraidy, Nicolas Gresset, and Joseph J. Boutros

TL;DR
This paper develops coding strategies for the non-orthogonal amplify-and-forward cooperative channel, deriving bounds on diversity order and designing precoders to maximize diversity and coding gains, with performance close to outage limits.
Contribution
It introduces a distributed space-time coding scheme with precoders for NAF channels, achieving maximum diversity and high coding gains, validated through performance comparisons.
Findings
Bounds on diversity order achieved by D-ST-BICM
Design of space-time precoders for maximum diversity
Performance close to outage probability limits
Abstract
In this work, we consider the problem of coding for the half-duplex non-orthogonal amplify-and-forward (NAF) cooperative channel where the transmitter to relay and the inter-relay links are highly reliable. We derive bounds on the diversity order of the NAF protocol that are achieved by a distributed space-time bit-interleaved coded modulation (D-ST-BICM) scheme under iterative APP detection and decoding. These bounds lead to the design of space-time precoders that ensure maximum diversity order and high coding gains. The word error rate performance of D-ST-BICM are also compared to outage probability limits.
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.
