A Crc-Aided Sr-Scl Decoding Algorithm For Polar Codes

2019 IEEE MTT-S INTERNATIONAL WIRELESS SYMPOSIUM (IWS 2019)(2019)

引用 1|浏览5
暂无评分
摘要
In order to make a better trade-off between computational complexity and decoding performance, a cyclic redundancy check (CRC)-aided split-reduced successive cancellation list (CA-SR-SCL) algorithm is proposed in this paper. Based on the splitting rule defined in split-reduced SCL (SR-SCL) algorithm and enhanced-SR-SCL (ESR-SCL) algorithm, the splitting characteristics of the correct decoding path are calculated. In addition, a new pruning rule is proposed to timely delete the candidate paths that split frequently, and a CRC detector is appended to improve the error correction performance. Compared to the ESR-SCL algorithm, simulation results demonstrate that the proposed algorithm can achieve better performance with lower computational complexity.
更多
查看译文
关键词
Polar codes, successive cancellation, list decoding, split-reduced, tree-pruning
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要