Polar Codes for the Two-User Multiple-Access Channel

DOI10.1109/TIT.2013.2268946MaRDI QIDQ5346306zbMATH OpenOpenAlexFDO

Authors Eren Şaşoğlu, İ. Emre Telatar, Edmund M. Yeh

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1006.4255

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Other types of codes (94B60)

Abstract: Arikan's polar coding method is extended to two-user multiple-access channels. It is shown that if the two users of the channel use the Arikan construction, the resulting channels will polarize to one of five possible extremals, on each of which uncoded transmission is optimal. The sum rate achieved by this coding technique is the one that correponds to uniform input distributions. The encoding and decoding complexities and the error performance of these codes are as in the single-user case: $O(nlogn)$ for encoding and decoding, and $o(exp(-n^{1/2-epsilon}))$ for block error probability, where $n$ is the block length.

Cited in

(5)

• A Simple Proof of Polarization and Polarization for Non-Stationary Memoryless Channels
• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• Interleaved Polar (I-Polar) Codes
• Polar Coding for Non-Stationary Channels
• Unsourced random access

This page was built for publication: Polar Codes for the Two-User Multiple-Access Channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346306)