Sula, ErixhenZhu, JinggePastore, AdrianoLim, Sung HoonGastpar, Michael2019-03-112019-03-112019-03-11201910.1109/TCOMM.2018.2874240https://infoscience.epfl.ch/handle/20.500.14299/155473We 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 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 dB of the theoretical limits, without explicit optimization on the off-the-self LDPC codes.Compute–forward multiple access (CFMA)multiple access channellow density parity check codes (LDPC)sequential decodingsum-product algorithmDecodingInterference channelsFaceComplexity theoryParity check codesStandardsReceiverstext::journal::journal article::research article