首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于奇偶校验码级联极化码的低复杂度译码算法
引用本文:刘顺兰,王燕.一种基于奇偶校验码级联极化码的低复杂度译码算法[J].电子与信息学报,2022,44(2):637-645.
作者姓名:刘顺兰  王燕
作者单位:杭州电子科技大学电子信息学院 杭州 310018
基金项目:国家自然科学基金(U1809201),浙江省自然科学基金(LY18F010013)
摘    要:极化码作为一种纠错码,具有较好的编译码性能,已成为5G短码控制信道的标准编码方案.但在码长较短时,其性能不够优异.作为一种新型级联极化码,奇偶校验码与极化码的级联方案提高了有限码长的性能,但是其译码算法有着较高的复杂度.该文针对这一问题,提出一种基于奇偶校验码级联极化码的串行抵消局部列表译码(PC-PSCL)算法,该算...

关 键 词:极化码  奇偶校验码  串行抵消列表  复杂度
收稿时间:2020-09-28

A Low-complexity Decoding Algorithm Based on Parity-Check-Concatenated Polar Codes
LIU Shunlan,WANG Yan.A Low-complexity Decoding Algorithm Based on Parity-Check-Concatenated Polar Codes[J].Journal of Electronics & Information Technology,2022,44(2):637-645.
Authors:LIU Shunlan  WANG Yan
Affiliation:School of Electronic Information, Hangzhou Dianzi University, Hangzhou 310018, China
Abstract:Polar codes have perfect coding and decoding performance as a kind of error correction code, which have become a standard coding scheme for 5G short code control channel. While the length of polar codes is short, its performance is not good enough. A novel concatenating scheme, parity check codes concatenating polar codes, has improved the performance of the limited length of polar codes. However, its decoding algorithm has high complexity. In order to solve the problem, a Parity Check aided Partial Successive Cancellation List(PC-PSCL) algorithm based on parity-check-concatenated polar codes is proposed. In this algorithm, outer codes are constructed before encoding and the information bits with not enough reliability are selected through sub-channel error probability obtained by Gaussian Approximation (GA), which perform Successive Cancellation List (SCL) decoding with the help of parity check codes, while the remaining bits just perform Successive Cancellation (SC) decoding. The simulations in additive white Gaussian noise channel reveal that when the codes length is 512, the codes rate is 1/2, the frame error rate is \begin{document}$ {10}^{-3} $\end{document} and the maximum list length is 8, the proposed low-complexity decoding algorithm achieves a gain of about 0.5 dB over the SCL decoding algorithm, keeps the similar performance compared with the original decoding algorithm, and the space complexity and time complexity of the decoding algorithm are reduced by 38.09% and 15.63% respectively.
Keywords:Polar codes  Parity Check (PC) code  Successive Cancellation List (SCL)  Complexity
本文献已被 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号