Efficient Pruning for Successive-Cancellation Decoding of Polar Codes

被引：9

作者：

Yoo, Hoyoung ^{[1
]}

Park, In-Cheol ^{[2
]}

机构：

[1] Chungnam Natl Univ, Dept Elect Engn, Taejon 305764, South Korea

[2] Korea Adv Inst Sci & Technol, Sch Elect Engn, Taejon 305701, South Korea

来源：

IEEE COMMUNICATIONS LETTERS | 2016年 / 20卷 / 12期

基金：

新加坡国家研究基金会;

关键词：

Polar codes; successive-cancellation decoding; syndrome check; parity check matrix; low latency; DECODERS;

D O I：

10.1109/LCOMM.2016.2607167

中图分类号：

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

学科分类号：

0809 ;

摘要：

This letter presents an efficient pruning method for the successive-cancellation (SC) decoding of polar codes. In the proposed method, unnecessary sub-trees are pruned if the syndrome check of a constituent code is satisfied. Without sacrificing the error-rate performance, the recursive operation associated with such a constituent code is replaced with simple computations. Compared with the traditional SC decoding, the proposed pruning decreases the decoding latency by 85% on the average for the polar (1024, 512) code.

引用

页码：2362 / 2365

页数：4

共 6 条

[1] A Simplified Successive-Cancellation Decoder for Polar Codes [J].