DeepAI AI Chat
Log In Sign Up

Compute--Forward Multiple Access (CFMA): Practical Code Design

by   Erixhen Sula, et al.
berkeley college

We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and Gastpar on compute-forward multiple access (CFMA) which achieves the capacity of the multiple access channel using a sequential decoder. We illustrate this strategy with off-the-shelf LDPC codes. In the first stage of decoding, the receiver first recovers a linear combination of the transmitted codewords using the sum-product algorithm (SPA). In the second stage, by using the recovered sum-of-codewords as side information, the receiver recovers one of the two codewords using a modified SPA, ultimately recovering both codewords. The main benefit of recovering the sum-of-codewords instead of the codeword itself is that it allows to attain points on the dominant face of the multiple access channel capacity without the need of rate-splitting or time sharing while maintaining a low complexity in the order of a standard point-to-point decoder. This property is also shown to be crucial for some applications, e.g., interference channels. For all the simulations with single-layer binary codes, our proposed practical strategy is shown to be within 1.7 of the theoretical limits, without explicit optimization on the off-the-self LDPC codes.


page 1

page 2

page 3

page 4


CFMA for Gaussian MIMO Multiple Access Channels

Compute-forward multiple access (CFMA) is a multiple access transmission...

Near Gaussian Multiple Access Channel Capacity Detection and Decoding

We consider the design of low-density parity-check (LDPC) codes with clo...

On Lattice-Code based Multiple Access: Uplink Architecture and Algorithms

This paper studies a lattice-code based multiple-access (LCMA) framework...

Secure Modulo Sum via Multiple Access Channel

We discuss secure computation of modular sum when multiple access channe...

Unsourced Multiuser Sparse Regression Codes achieve the Symmetric MAC Capacity

Unsourced random-access (U-RA) is a type of grant-free random access wit...

Rate-Splitting Multiple Access: Finite Constellations, Receiver Design, and SIC-free Implementation

Rate-Splitting Multiple Access (RSMA) has emerged as a novel multiple ac...

On the separation of correlation-assisted sum capacities of multiple access channels

The capacity of a channel characterizes the maximum rate at which inform...