期刊文献+

Multiple CRC-aided variable successive cancellation list decoder of polar codes 被引量:4

Multiple CRC-aided variable successive cancellation list decoder of polar codes
原文传递
导出
摘要 In order to change the path candidates, reduce the average list size, and make more paths pass cyclic redundancy check (CRC), multiple CRC-aided variable successive cancellation list (SCL) decoding algorithm is proposed. In the decoding algorithm, the whole unfrozen bits are divided into several parts and each part is concatenated with a corresponding CRC code, except the last part which is concatenated with a whole unfrozen CRC code. Each CRC detection is performed, and only those satisfying each part CRC become the path candidates. A variable list is setup for each part to reduce the time complexity. Variable list size is setup for each part to reduce the time complexity until one survival path in each part can pass its corresponding CRC. The results show that the proposed algorithm can reduce the average list size, and the frame error rate (FER) performance, and has a better performance with the increase of the part number. In order to change the path candidates, reduce the average list size, and make more paths pass cyclic redundancy check (CRC), multiple CRC-aided variable successive cancellation list (SCL) decoding algorithm is proposed. In the decoding algorithm, the whole unfrozen bits are divided into several parts and each part is concatenated with a corresponding CRC code, except the last part which is concatenated with a whole unfrozen CRC code. Each CRC detection is performed, and only those satisfying each part CRC become the path candidates. A variable list is setup for each part to reduce the time complexity. Variable list size is setup for each part to reduce the time complexity until one survival path in each part can pass its corresponding CRC. The results show that the proposed algorithm can reduce the average list size, and the frame error rate (FER) performance, and has a better performance with the increase of the part number.
出处 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2017年第2期83-88,共6页 中国邮电高校学报(英文版)
基金 supported by the National Natural Science Foundation of China (61475075,61271238) the Open Research Fund of Key Laboratory of Broadband Wireless Communication and Sensor Network Technology,Ministry of Education (NYKL2015011)
关键词 polar codes successive cancellation list decoder cyclic redundancy check list path variable list size polar codes, successive cancellation list decoder, cyclic redundancy check, list path, variable list size
  • 相关文献

参考文献1

二级参考文献13

  • 1Wyner A D. The wiretap channel[ J ]. Bell System Technical Jour- nal, 1975, 54(8) : 1355-1387. 被引量:1
  • 2Thangaraj A, Dihidar S, Calderbank A R, et al. On achieving ca- pacity on the wire tap channel using LDPC codes[ C ]//Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on. IEEE, 2005: 1498-1502. 被引量:1
  • 3Rathi V, Urbanke R, Andersson M, et al. Rate-equivocation opti- mal spatially coupled LDPC codes for the BEC wiretap channel [ C]//Information Theory Proceedings ( IS1T), 2011 IEEE Inter- national Symposium on. IEEE, 2011: 2393-2397. 被引量:1
  • 4Oggier F, Hassibi B. The secrecy capacity of the MIMO wiretap channel[ J]. Information Theory, IEEE Transactions on, 2011, 57(8) : 4961-4972. 被引量:1
  • 5Arikan E. Systematic polar coding [ J ]. IEEE Communications Letters, 2011, 15(8) : 860-862. 被引量:1
  • 6Arikan E. Channel polarization: A method for constructing capacity-a- chieving codes for symmetric binary-input memoryless channels [ J ]. Information Theory, IEEE Transactions on, 2009, 55(7) : 3051-3073. 被引量:1
  • 7Mahdavifar H, Vardy A. Achieving the secrecy capacity of wiretap channels using polar codes [ J ]. Information Theory, IEEE Transac- tions on, 2011, 57(10): 6428-6443. 被引量:1
  • 8Hof E, Shamai S. Secrecy-achieving polar-coding[ C ]//Information Theory Workshop (ITW), 2010 IEEE. IEEE, 2010: 1-5. 被引量:1
  • 9Sasoglu E, Vardy A. A new polar coding scheme for strong security on wiretap channels[ C] //Information Theory Proceedings ( ISIT), 2013 IEEE International Symposium on. IEEE, 2013: 1117-1121. 被引量:1
  • 10Hagenauer J. Rate-compatible punctured convolutional codes ( RCPC codes) and their applications [ J ]. Communications, IEEE Transactions on, 1988, 36(4) : 389-400. 被引量:1

共引文献5

同被引文献7

引证文献4

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部