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

被引:3110
作者
Arikan, Erdal [1 ]
机构
[1] Bilkent Univ, Dept Elect Elect Engn, TR-06800 Ankara, Turkey
关键词
Capacity-achieving codes; channel capacity; channel polarization; Plotkin construction; polar codes; Reed-Muller (RM) codes; successive cancellation decoding;
D O I
10.1109/TIT.2009.2021379
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 <= i <= 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 {C(n); n >= 1} such that (C(n) has block-length N = 2(n), rate >= R, and probability of block error under successive cancellation decoding bounded as P(e) (N, R) <= O (N(-1/4)) independently of the code rate. This performance is achievable by encoders and decoders with complexity O(N log N) for each.
引用
收藏
页码:3051 / 3073
页数:23
相关论文
共 17 条
[1]  
ANKAN E, 2008, ARXIV08073806V2CSIT
[2]  
[Anonymous], BELL SYST TECH J
[3]   Channel combining and splitting for cutoff rate improvement [J].
Arikan, E .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) :628-639
[4]   A performance comparison of polar codes and reed-muller codes [J].
Arikan, Erdal .
IEEE COMMUNICATIONS LETTERS, 2008, 12 (06) :447-449
[5]  
Blahut R., 1983, Theory and Practice of Error Control Codes
[6]  
Chung K., 1974, A course in probability theory
[7]   AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J].
COOLEY, JW ;
TUKEY, JW .
MATHEMATICS OF COMPUTATION, 1965, 19 (90) :297-&
[8]   Codes on graphs: Normal realizations [J].
Forney, GD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :520-548
[9]  
FORNEY GD, 2005, MIT 6 451 LECT NOTES
[10]  
Gallager R. G., 1968, Information Theory and Reliable Communication, V588