Skip to content

Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels

Erdal Arıkan

IEEE Transactions on Information Theory · 2009 · 4,589 citationsOpen access

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Arıkan, E. (2009). Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Transactions on Information Theory, 55(7), 3051–3073. https://doi.org/10.1109/tit.2009.2021379

In text: (Arıkan, 2009)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity$I(W)$of any given binary-input discrete memoryless channel (B-DMC)$W$. The symmetric capacity is the highest rate achievable subject to using the input letters of the channel with equal probability. Channel polarization refers to the fact that it is possible to synthesize, out of$N$independent copies of a given B-DMC$W$, a second set of$N$binary-input channels$\{W_N^{(i)}:1\le i\le N\}$such that, as$N$becomes large, the fraction of indices$i$for which$I(W_N^{(i)})$is near$1$approaches$I(W)$and the fraction for which$I(W_N^{(i)})$is near$0$approaches$1-I(W)$. The polarized channels$\{W_N^{(i)}\}$are well-conditioned for channel coding: one need only send data at rate$1$through those with capacity near$1$and at rate$0$through the remaining. Codes constructed on the basis of this idea are called polar codes. The paper proves that, given any B-DMC$W$with$I(W)> 0$and any target rate$R ≪ I(W)$, there exists a sequence of polar codes$\{{\Fraktur {C}}_n;n\ge 1\}$such that${\Fraktur {C}}_n$has block-length$N=2^n$, rate$\ge R$, and probability of block error under successive cancellation decoding bounded as$P_{e}(N,R) \le O(N^{-{1\over 4}})$independently of the code rate. This performance is achievable by encoders and decoders with complexity$O(N\log N)$for each.

  1. A Mathematical Theory of Communication1948
  2. Low-density parity-check codes1962
  3. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm1967
  4. Communication in the Presence of Noise1949
  5. Factor graphs and the sum-product algorithm2001

Metadata from OpenAlex (CC0). Citations are generated from the published record.