Gaussian Multiple Access via Compute-and-Forward

Abstract

Lattice codes used under the Compute-and-Forward paradigm suggest an alternative strategy for the standard Gaussian multiple-access channel (MAC): The receiver successively decodes integer linear combinations of the messages until it can invert and recover all messages. In this paper, a multiple-access technique called CFMA (Compute-Forward Multiple Access) is proposed and analyzed. For the two-user MAC, it is shown that without time-sharing, the entire capacity region can be attained using CFMA with a single-user decoder as soon as the signal-to-noise ratios are above $1+\sqrt{2}$. A partial analysis is given for more than two users. Lastly the strategy is extended to the so-called dirty MAC where two interfering signals are known non-causally to the two transmitters in a distributed fashion. Our scheme extends the previously known results and gives new achievable rate regions.

to appear in IEEE Transactions on Information Theory

References in corpus (2)

• Asymmetric Compute-and-Forward with CSIT
• A Joint Typicality Approach to Algebraic Network Information Theory

Cited by in corpus (9)

• Asymptotic Quantum Algorithm for the Toeplitz Systems
• Efficient Scheduling for the Massive Random Access Gaussian Channel
• The Magic of Superposition: A Survey on Simultaneous Transmission Based Wireless Systems
• Fast and efficient long-distance quantum state transfer in long-range spin-$\frac{1}{2}$ models
• Performance of Multi-Cell Massive MIMO Systems With Interference Decoding
• Towards an Algebraic Network Information Theory: Simultaneous Joint Typicality Decoding
• Compute--Forward Multiple Access (CFMA): Practical Code Design
• Rate-Diverse Gaussian Multiple Access: Efficient Encoder and Decoder Designs
• Sparse Signatures with Forward Error Correction Coding for Non-Orthogonal Massive Access