A Discretization Approach to Compute-Forward
- 1. Centro Tecnológico de Telecomunicaciones de Cataluña (CTTC)
- 2. Hallym University
- 3. University of British Columbia
- 4. Boston University
- 5. School of Computer and Communication Sciences
Description
We present a novel unified framework of compute- forward achievable rate regions for simultaneous decoding of multiple linear codeword combinations. This framework covers a wide class of discrete and continuous-input channels, and computation over finite fields, integers, and reals. The resulting rate regions recover several well-known achievability results, and in some cases extend them. The framework is built upon a recently established achievable rate region based on linear codes and joint typicality decoding. The latter is extended from finite fields to computation over the integers and, via a discretization approach, to computation over the reals with integer coefficients and continuous inputs. Evaluating the latter with Gaussian distributions, we obtain a closed-form rate region which generalizes the classic compute-forward rates originally derived by means of lattice codes by Nazer and Gastpar.
Notes
Files
main.pdf
Files
(563.0 kB)
Name | Size | Download all |
---|---|---|
md5:60417d1776498327e65e23460a78f28f
|
563.0 kB | Preview Download |