ISSN: 1673-825X    Imprint: Chongqing University of Posts and Telecommunications Journal
Volume listings
  • Current volume
  •  
  • Search by keywords:
  • Search by 
  • Keywords
  • To
  • Journal archive
Related Links
一种简化的极化码串行消除列表译码算法
A simplified successive cancellation list decoding algorithm for polar codes
DOI:10.3979/j.issn.1673-825X.2019.04.008
Received:January 31, 2018  Revised:March 10, 2019
中文关键词:极化码  SCL译码  简化SCL译码  时间步数
英文关键词:polar codes  SCL decoding  simplified SCL decoding  time steps
基金项目:国家科技重大专项(2012ZX03001024,2017ZX03001021)
Author NameAffiliationE-mail
LI Xiaowen Chongqing Key Lab of Mobile Communications, Chongqing University of Posts and Telecommunications, Chongqing 400065, P. R. China lixw@cqupt.edu.cn 
LI Wenbin Chongqing Key Lab of Mobile Communications, Chongqing University of Posts and Telecommunications, Chongqing 400065, P. R. China 532486118@qq.com 
Hits: 39
Download times: 25
中文摘要:
      在未来5G通信技术中,3GPP组织已经确定将极化码作为增强移动宽带场景下的信道编码,但在其译码算法中,由于前景较好的串行消除列表(successive cancellation list, SCL)译码算法存在多余的计算,导致整个译码所需的时间步数大量增加。基于快速简化串行消除(fast simplified successive cancellation, Fast-SSC)译码算法,提出对传统SCL译码算法进行简化。通过串行消除(successive cancellation,SC)译码算法的译码过程,明确译码树的结构和分类。同时,对传统SCL译码树中特殊节点的路径度量值重新计算与证明,使得其值仅依赖于各自父节点的对数似然比值,避免对整个译码树遍历,从而消除冗余。通过仿真和实验结果表明,在保证纠错性能的前提下,简化后的SCL译码算法其特殊节点的路径度量值的计算复杂度更低,且整个译码所需的时间步数更少。
英文摘要:
      In the future of 5G communication technologies, the 3GPP has determined to use polar codes as channel coding under enhanced mobile broadband scenarios. However, there are extra calculations in the promising successive cancellation list (SCL) decoding algorithm which result in a rapid increase in time steps required for the entire decoding. Therefore, based on fast simplified successive cancellation (Fast-SSC), the simplification of the traditional SCL decoding algorithm is proposed. Through the decoding process of a successive cancellation (SC) decoding algorithm, the structure and classification of the decoding tree are clearly defined. Meanwhile, the path metrics of the special nodes in the traditional SCL coding tree are recalculated and proved so that the values only depend on the log likelihood ratios of the respective parent nodes so as to avoid traversing the entire coding tree, thereby eliminating redundancy. Finally, the simulation and experimental results show that under the premise of guaranteeing the error correction performance, the simplified SCL decoding algorithm has lower computational complexity of the path metrics of special nodes. In addition, the entire decoding requires fewer time steps than before.
HTML    View PDF   View/Add Comment  Download reader