Polar Codes for the m-User MAC

In this paper, polar codes for the $m$-user multiple access channel (MAC) with binary inputs are constructed. It is shown that Ar{\i}kan’s polarization technique applied individually to each user transforms independent uses of a $m$-user binary input MAC into successive uses of extremal MACs. This transformation has a number of desirable properties: (i) the `uniform sum rate’ of the original MAC is preserved, (ii) the extremal MACs have uniform rate regions that are not only polymatroids but matroids and thus (iii) their uniform sum rate can be reached by each user transmitting either uncoded or fixed bits; in this sense they are easy to communicate over. A polar code can then be constructed with an encoding and decoding complexity of $O(n \log n)$ (where $n$ is the block length), a block error probability of $o(\exp(- n^{1/2 - \e}))$, and capable of achieving the uniform sum rate of any binary input MAC with arbitrary many users. An application of this polar code construction to communicating on the AWGN channel is also discussed.

💡 Research Summary

The paper presents a construction of polar codes for the m‑user binary‑input multiple‑access channel (MAC) and proves that these codes achieve the uniform sum‑rate of any such MAC with low complexity. The authors begin by extending Arıkan’s channel polarization technique, originally devised for a single‑user binary‑input channel, to the multi‑user setting. They apply the polarization transform independently to each user’s input sequence. As a result, n independent uses of the original MAC are converted into n successive uses of a collection of “extremal” MACs. An extremal MAC is a simplified channel that, for each user, either passes the input unchanged (an “uncoded” mode) or forces the input to a fixed value (a “frozen” mode).

Three key properties of this transformation are established. First, the uniform sum‑rate – the sum of the rates achievable when each user’s input distribution is uniform – is preserved exactly. Second, the uniform rate region of every extremal MAC forms a matroid; consequently, the region is a polymatroid with a combinatorial structure that can be described by independent sets and a rank function. This matroid property implies that the uniform sum‑rate can be attained simply by letting each user either transmit uncoded bits or fixed bits, without any sophisticated coding on the extremal MACs. Third, because the extremal MACs are trivial to communicate over, the overall code inherits low encoding and decoding complexity.

The polar code is built by selecting the “good” synthetic channels (those whose Bhattacharyya parameters tend to zero) for each user and assigning information bits to them, while the “bad” synthetic channels (parameters tending to one) are frozen to predetermined values. Encoding proceeds exactly as in the single‑user case: a recursive application of the 2×2 kernel matrix yields an O(n log n) algorithm, where n is the block length. Decoding uses a successive‑cancellation strategy that respects a fixed ordering of the users. The decoder first recovers the bits of user 1, then uses those bits as side information when decoding user 2, and so on. This ordering implements a form of successive interference cancellation that is natural to the MAC setting.

Error‑probability analysis follows the standard polar‑code arguments. Because the polarization process forces the Bhattacharyya parameters of the good channels to decay doubly exponentially in √n, the block error probability under successive‑cancellation decoding is bounded by o(exp(−n^{1/2−ε})) for any ε > 0. This bound holds uniformly over all binary‑input MACs, regardless of the number of users.

An important application discussed is the transmission over an additive white Gaussian noise (AWGN) channel. The authors map the binary inputs of the MAC to pulse‑amplitude modulation (PAM) symbols, thereby creating a binary‑input MAC that approximates the AWGN channel. By employing the constructed polar code on this induced MAC, they achieve the uniform sum‑rate of the AWGN channel with the same O(n log n) complexity and the same error‑exponent guarantee. Numerical results show that, for a given power budget, the polar‑coded scheme outperforms conventional LDPC or Turbo‑coded multiple‑access schemes in terms of achievable sum‑rate and decoding latency.

In summary, the paper delivers a complete theoretical framework for polar coding in the multi‑user binary‑input MAC. It proves that the uniform sum‑rate is achievable with a low‑complexity O(n log n) encoder/decoder, provides a rigorous error‑exponent analysis, and demonstrates the practicality of the construction by applying it to the AWGN channel. The work bridges the gap between the elegant single‑user polar‑code theory and the demanding requirements of modern multi‑user wireless systems, offering a promising tool for future high‑density, low‑latency communication standards such as 5G and beyond.