A complexity-reduced fast successive cancellation list decoder for polar codes

被引:0
作者
Qingyun XU [1 ]
Zhiwen PAN [1 ]
Nan LIU [1 ]
Xiaohu YOU [1 ]
机构
[1] National Mobile Communications Research Laboratory, Southeast University
关键词
polar codes; low-complexity decoder; splitting-reduced; multi-bit decision; list decoder;
D O I
暂无
中图分类号
TN911.22 [信道编码理论];
学科分类号
070104 ; 081101 ;
摘要
A multi-bit decision for polar codes based on a simplified successive cancellation(SSC) decoding algorithm can improve the throughput of polar decoding. A list algorithm is used to improve the errorcorrecting performance. However, list decoders are highly complex compared with decoders without a list algorithm. In this paper, a low-complexity list decoder is proposed, where path-splitting operations for a multi-bit decision can be avoided, if the decoding reliability exceeds a threshold. The threshold is determined based on the reliability of subchannels and positions of decoding nodes. Path splitting rules are designed for multi-bit decision processes, and a complexity-reduced list decoder is proposed based on this. Results show that the number of survival paths can be greatly reduced at the cost of negligible deterioration in block error performance. Thus, the computational complexity can be significantly reduced, especially for a high signal-to-noise ratio(SNR) region.
引用
收藏
页码:138 / 148
页数:11
相关论文
共 15 条
  • [1] Construction and block error rate analysis of polar codes over AWGN channel based on gaussian approximation. Wu Daolong,Li Ying,Sun Yue. IEEE Communications Letters . 2014
  • [2] Guest editorial recent advances in capacity approaching codes. Arikan E,Costello D J,Kliewer J,et al. IEEE Journal of Selected Areas in Communications . 2016
  • [3] Polar codes with dynamic frozen symbols and their decoding by directed search. Trifonov P,Miloslavskaya V. Proceedings of IEEE Information Theory Work . 2013
  • [4] Increasing the speed of polar list decoders. Sarkis G,Giard P,Vardy A,et al. Proceedings of IEEE Work Signal Process Syst . 2014
  • [5] Reduce the complexity of list decoding of polar codes by tree-pruning. Chen K,Li B,Shen H,et al. IEEE Communications Letters . 2016
  • [6] LLR-based successive-cancellation list decoder for polar codes with multi-bit decision. Yuan B,Parhi K K. IEEE Trans Circuits Syst II Express Briefs . 2016
  • [7] A Simplified Successive-Cancellation Decoder for Polar Codes. Amin Alamdar-Yazdi,Frank R. Kschischang. IEEE Communications Letters . 2011
  • [8] Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. Arikan,Erdal. IEEE Transactions on Information Theory . 2009
  • [9] CRC-Aided Decoding of Polar Codes. Kai Niu,Kai Chen. IEEE Communications Letters . 2012
  • [10] An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy Check. Bin Li,Hui Shen,Tse, D. Communications Letters, IEEE . 2012