计算机工程 ›› 2019, Vol. 45 ›› Issue (9): 76-81.doi: 10.19678/j.issn.1000-3428.0052038

• 移动互联与通信技术 • 上一篇    下一篇

一种基于蒙特卡洛的快速极化码构造方法

张施怡, 黄志亮, 周水红, 钟发荣   

  1. 浙江师范大学 数学与计算机科学学院, 浙江 金华 321004
  • 收稿日期:2018-07-09 修回日期:2018-09-14 出版日期:2019-09-15 发布日期:2019-09-03
  • 作者简介:张施怡(1996-),女,硕士研究生,主研方向为极化码构造;黄志亮(通信作者),讲师、博士;周水红,实验师、硕士;钟发荣,教授、博士
  • 基金项目:
    国家自然科学基金(61401399);浙江省自然科学基金(LY18F010017)。

A Fast Polar Code Construction Method Based on Monte Carlo

ZHANG Shiyi, HUANG Zhiliang, ZHOU Shuihong, ZHONG Farong   

  1. College of Mathematics and Computer Science, Zhejiang Normal University, Jinhua, Zhejiang 321004, China
  • Received:2018-07-09 Revised:2018-09-14 Online:2019-09-15 Published:2019-09-03
  • Supported by:
    This work is supported by Science and Technology Project of SGCC (No.521104170013).

摘要: 为快速构造高维核矩阵极化码,提出一种基于蒙特卡洛(MC)的两阶段极化码构造方法TPMC。在第1阶段,利用具有线性复杂度的高斯近似方法获取最可靠和最不可靠的2种位。在第2阶段,将上述2种位固定为冻结位并执行MC方法,以衡量剩余位信道的差错概率,从剩余位中挑选差错概率较低的位并与第1阶段中最可靠的位组成极化码的信息位集合。仿真结果表明,与MC方法相比,TPMC方法能够降低计算复杂度,提高译码效率。

关键词: 两阶段蒙特卡洛, 高维核矩阵, 极化码构造, 连续消去译码, 高斯近似

Abstract: In order to construct high-dimensional core matrix polar codes quickly,a two-stage polar code construction method TPMC based on Monte Carlo(MC) is proposed.In the first stage,the most reliable and unreliable bits are obtained by using the Gauss approximation method with linear complexity.In the second stage,the above bits are fixed as frozen bits and MC method is implemented to measure the error rate of the remaining bit channels.The bits with a lower error rate are selected from the remaining bits,and are combined with most reliable information bits in the first stage to form an information bits set.Simulation results show that compared with MC method,TPMC method can reduce the computational complexity and improve the decoding efficiency.

Key words: two-stage Monte Carlo(MC), high-dimensional core matrix, polar code construction, Successive Cancellation(SC) decoding, Gauss approximation

中图分类号: