A Reduced-Complexity Successive Cancellation List Decoding of Polar Codes

Author

Kai Chen ; Kai Niu ; Jiaru Lin

Author_Institution

Key Lab. of Universal Wireless Commun., Beijing Univ. of Posts & Telecommun., Beijing, China

fYear

2013

fDate

2-5 June 2013

Firstpage

1

Lastpage

5

Abstract

Polar codes are the first constructive and provable capacity-achieving codes. In finite code length cases, successive cancellation list (SCL) decoding algorithm is reported to have performance very close to maximum-likelihood (ML) decoding. In this paper, a reduced-complexity version of SCL decoding algorithm is proposed to boost the finite- length performance of polar codes. By regarding the SCL decoding algorithm as a path searching procedure in a code tree representation, a tree-pruning technique is used to avoid unnecessary path searching operations. With only a negligible loss of performance, the computational complexity of pruned SCL decoder can be very close to that of the successive cancellation (SC) decoder in the moderate and high signal-to- noise ratio (SNR) regime.

Keywords

computational complexity; maximum likelihood decoding; trees (mathematics); SCL decoding algorithm; code tree representation; computational complexity; finite code length; maximum-likelihood decoding; path searching procedure; polar codes; signal-to-noise ratio regime; successive cancellation list decoding algorithm; tree-pruning technique; Computational complexity; Maximum likelihood decoding; Measurement; Signal to noise ratio; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference (VTC Spring), 2013 IEEE 77th

Conference_Location

Dresden

ISSN

1550-2252

Type

conf

DOI

10.1109/VTCSpring.2013.6691844

Filename

6691844