A Lattice Compress-and-Forward Scheme
Yiwei Song, Natasha Devroye

TL;DR
This paper introduces a lattice-code-based Compress-and-Forward scheme for Gaussian relay channels, demonstrating that structured lattice codes can achieve classical rates and potentially improve network communication efficiency.
Contribution
It presents a novel lattice-based CF scheme that achieves the classic Gaussian relay channel rate, extending lattice code applications to larger relay networks.
Findings
Lattice codes can achieve the CF rate in Gaussian relay channels.
Structured lattice schemes simplify decoding compared to random coding.
Potential for lattice codes to enhance larger network communication schemes.
Abstract
We present a nested lattice-code-based strategy that achieves the random-coding based Compress-and-Forward (CF) rate for the three node Gaussian relay channel. To do so, we first outline a lattice-based strategy for the Wyner-Ziv lossy source-coding with side-information problem in Gaussian noise, a re-interpretation of the nested lattice-code-based Gaussian Wyner-Ziv scheme presented by Zamir, Shamai, and Erez. We use the notation Wyner-Ziv to mean that the source is of the form and the side-information at the receiver is of the form , for independent Gaussian and . We next use this Wyner-Ziv scheme to implement a "structured" or lattice-code-based CF scheme which achieves the classic CF rate for Gaussian relay channels. This suggests that lattice codes may not only be useful in point-to-point single-hop…
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 · Wireless Communication Security Techniques · Advanced MIMO Systems Optimization
