MAC polar codes and matroids

Emmanuel Abbe, Emre Telatar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Scopus citations

Abstract

In this paper, a polar code for the m-user multiple access channel (MAC) with binary inputs is constructed. In particular, Arikan's polarization technique applied individually to each user polarizes any m-user binary input MAC into a finite collection of extremal MACs. The extremal MACs have a number of desirable properties: (i) the 'uniform sum rate'1 of the original channel is not lost, (ii) the extremal MACs have 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(-n1/2-ε)), 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 a coding scheme for the AWGN channel is also discussed.

Original languageEnglish (US)
Title of host publication2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings
Pages8-15
Number of pages8
DOIs
StatePublished - 2010
Event2010 Information Theory and Applications Workshop, ITA 2010 - San Diego, CA, United States
Duration: Jan 31 2010Feb 5 2010

Publication series

Name2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings

Other

Other2010 Information Theory and Applications Workshop, ITA 2010
Country/TerritoryUnited States
CitySan Diego, CA
Period1/31/102/5/10

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Information Systems

Fingerprint

Dive into the research topics of 'MAC polar codes and matroids'. Together they form a unique fingerprint.

Cite this