A Unified Discretization Approach to Compute-Forward: From Discrete to Continuous Inputs

Compute-forward is a coding technique that enables receiver(s) in a network to directly decode one or more linear combinations of the transmitted codewords. Initial efforts focused on Gaussian channels and derived achievable rate regions via nested lattice codes and single-user (lattice) decoding as...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 69; no. 1; pp. 1 - 46
Main Authors: Pastore, Adriano, Lim, Sung Hoon, Feng, Chen, Nazer, Bobak, Gastpar, Michael
Format: Journal Article
Language:English
Published: New York IEEE 01.01.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Channels
Codes
Coding
compute–forward
Decoding
Discretization
Entropy
information dimension
Lattices
Linear codes
multiple-access channel
physical-layer network coding
Receivers
Source coding
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Compute-forward is a coding technique that enables receiver(s) in a network to directly decode one or more linear combinations of the transmitted codewords. Initial efforts focused on Gaussian channels and derived achievable rate regions via nested lattice codes and single-user (lattice) decoding as well as sequential (lattice) decoding. Recently, these results have been generalized to discrete memoryless channels via nested linear codes and joint typicality coding, culminating in a simultaneous-decoding rate region for recovering one or more linear combinations from <inline-formula> <tex-math notation="LaTeX">K </tex-math></inline-formula> users. Using a discretization approach, this paper translates this result into a simultaneous-decoding rate region for a wide class of continuous memoryless channels, including the important special case of Gaussian channels. Additionally, this paper derives a single, unified expression for both discrete and continuous rate regions via an algebraic generalization of Rényi's information dimension.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2022.3197592