List successive cancellation decoding of polar codes

被引：137

作者：

Chen, K. ^{[1
]}

Niu, K. ^{[1
]}

Lin, J. R. ^{[1
]}

机构：

[1] Beijing Univ Posts & Telecommun, Minist Educ, Key Lab Universal Wireless Commun, Beijing 100876, Peoples R China

来源：

ELECTRONICS LETTERS | 2012年 / 48卷 / 09期

基金：

中国国家自然科学基金;

关键词：

D O I：

10.1049/el.2011.3334

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

A list successive cancellation (LSC) decoding algorithm to boost the performance of polar codes is proposed. Compared with traditional successive cancellation decoding algorithms, LSC simultaneously produces at most L locally best candidates during the decoding process to reduce the chance of missing the correct codeword. The complexity of the proposed algorithm is O(LNlog N), where N and L are the code length and the list size, respectively. Simulation results of LSC decoding in the binary erasure channel and binary-input additive white Gaussian noise channel show a significant performance improvement.

引用

页码：500 / U52

页数：2

共 6 条

[1]

Arikan E., 2009, P IEEE INT S INF THE

[2]

Arikan E., 2009, ICT MOB SUMM 2009 C

[3] A performance comparison of polar codes and reed-muller codes [J].

Arikan, Erdal .

IEEE COMMUNICATIONS LETTERS, 2008, 12 (06) :447-449

[4] Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels [J].

Arikan, Erdal .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3051-3073

[5]

Goela N., 2010, IEEE INF THEOR WORKS

[6]

Hussami N., 2009, P IEEE INT S INF THE

← 1 →