A Fast Polar Code Construction Method Based on Monte Carlo

doi:10.19678/j.issn.1000-3428.0052038

Computer Engineering ›› 2019, Vol. 45 ›› Issue (9): 76-81. doi: 10.19678/j.issn.1000-3428.0052038

Previous Articles Next Articles

A Fast Polar Code Construction Method Based on Monte Carlo

ZHANG Shiyi, HUANG Zhiliang, ZHOU Shuihong, ZHONG Farong

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).

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

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

浙江师范大学数学与计算机科学学院, 浙江金华 321004

作者简介:张施怡(1996-),女,硕士研究生,主研方向为极化码构造;黄志亮(通信作者),讲师、博士;周水红,实验师、硕士;钟发荣,教授、博士
基金资助:
国家自然科学基金（61401399）；浙江省自然科学基金（LY18F010017）。

Abstract

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

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

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

CLC Number:

TN911.2

ZHANG Shiyi, HUANG Zhiliang, ZHOU Shuihong, ZHONG Farong. A Fast Polar Code Construction Method Based on Monte Carlo[J]. Computer Engineering, 2019, 45(9): 76-81.

张施怡, 黄志亮, 周水红, 钟发荣. 一种基于蒙特卡洛的快速极化码构造方法[J]. 计算机工程, 2019, 45(9): 76-81.

/ / Recommend / Download Citations

URL: http://www.ecice06.com/EN/10.19678/j.issn.1000-3428.0052038

http://www.ecice06.com/EN/Y2019/V45/I9/76

Figures/Tables 7

References

[1] ARIKAN E.Channel polarization:a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels[J].IEEE Transactions on Information Theory,2009,55(7):3051-3073.
[2] RICHARDSON T J,URBANKE R.Modern coding theory[M].Cambridge,USA:MIT Press,2008.
[3] MORI R,TANAKA T.Performance of polar codes with the construction using density evolution[J].IEEE Commu-nications Letters,2009,13(7):519-521.
[4] TRIFONOV P.Efficient design and decoding of polar codes[J].IEEE Transactions on Communications,2012,60(11):3221-3227.
[5] 刘亚军,李世宝,刘建航,等.一种低时延极化码列表连续删除译码算法[J].计算机工程,2018,44(3):78-81.
[6] TAL I,VARDY A.How to construct polar codes[J].IEEE Transactions on Information Theory,2013,59(10):6562-6582.
[7] CHUNG S Y,RICHARDSON T,URBANKE R.Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation[J].IEEE Transactions on Information Theory,2001,47(2):657-670.
[8] KORADA S B,SASOGLU E,URBANKE R.Polar codes:characterization of exponent,bounds,and constructions[J].IEEE Transactions on Information Theory,2010,56(12):6253-6264.
[9] PRESMAN N,SHAPIRA O,LITSYN T,et al.Binary polarization kernels from code decompositions[J].IEEE Transactions on Information Theory,2015,61(5):2227-2239.
[10] LIN H P,LIN Shu,ABDEL-GHAFFAR K A S.Linear and nonlinear binary kernels of polar codes of small dimensions with maximum exponents[J].IEEE Transactions on Information Theory,2015,61(10):5253-5270.
[11] WU Dalong,LI Ying,SUN Yue.Construction and block error rate analysis of polar codes over AWGN channel based on Gaussian approximation[J].IEEE Commu-nications Letters,2014,18(7):1099-1102.
[12] SUN Shuanghong,ZHANG Zhengya.Designing practical polar codes using simulation-based bit selection[J].IEEE Journal on Emerging and Selected Topics in Circuits and Systems,2017,7(4):594-603.
[13] ALAMDAR-YAZDI A,KSCHISCHANG F R.A simplied successive cancellation decoder for polar codes[J].IEEE Communications Letters,2011,15(12):1378-1380.
[14] HUANG Zhiliang,ZHANG Shiyi,ZHANG Feiyan,et al.On the successive cancellation decoding of polar codes with arbitrary linear binary kernels[EB/OL].[2018-06-20].http://pdfs.semanticscholar.org/ebf7/58e65c95a81c4ab01494fb70ed535a631846.pdf.
[15] HUANG Zhiliang,ZHANG Shiyi,ZHANG Feiyan,et al.Simplified successive cancellation decoding of polar codes with medium-dimensional binary kernels[J].IEEE Access,2018,6(1):26707-26717.

Please choose a citation manager

Content to export