Compute-Compress-and-Forward: Exploiting Asymmetry of Wireless Relay Networks
Yihua Tan, Xiaojun Yuan

TL;DR
This paper introduces compute-compress-and-forward (CCF), a novel relay strategy that reduces redundancy and improves spectrum efficiency in wireless relay networks by adding a compression stage to the compute-and-forward scheme.
Contribution
The paper proposes a new CCF scheme with a compression stage, including lattice-based quantization and modulo operations, and develops algorithms for lattice design and message recovery.
Findings
CCF outperforms traditional CF in simulations.
The proposed algorithms effectively recover source messages.
Numerical results show improved sum-rate performance.
Abstract
Compute-and-forward (CF) harnesses interference in a wireless networkby allowing relays to compute combinations of source messages. The computed message combinations at relays are correlated, and so directly forwarding these combinations to a destination generally incurs information redundancy and spectrum inefficiency. To address this issue, we propose a novel relay strategy, termed compute-compress-and-forward (CCF). In CCF, source messages are encoded using nested lattice codes constructed on a chain of nested coding and shaping lattices. A key difference of CCF from CF is an extra compressing stage inserted in between the computing and forwarding stages of a relay, so as to reduce the forwarding information rate of the relay. The compressing stage at each relay consists of two operations: first to quantize the computed message combination on an appropriately chosen lattice (referred…
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.
