高斯近似辅助下速率适配的缩短极化码算法  

An algorithm for rate-compatible shortened polar code based on Gaussian approximation-aided

作　　者：王留洋 陈海强[1,2] 孙友明 黎相成[1,2] 方毅仁 WANG Liu-yang;CHEN Hai-qiang;SUN You-ming;LI Xiang-cheng;FANG Yi-ren(School of Computer, Electronics and Information, Guangxi University, Nanning 530004, China;Guangxi Key Laboratory of Multimedia Communications and Network Technology, Nanning 530004, China)

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004 [2]广西多媒体通信与网络技术重点实验室,广西南宁530004

出　　处：《广西大学学报（自然科学版）》2020年第2期306-312,共7页Journal of Guangxi University（Natural Science Edition）

基　　金：国家自然科学基金资助项目(61761006,61961004);广西自然科学基金资助项目(2017GXNSFAA198263,2017GXNSFAA198276,2018GXNSFAA138079)。

摘　　要：在传统缩短方案的基础上,提出一种基于高斯近似辅助筛选凿孔位的缩短算法,可方便得到速率兼容的缩短凿孔极化码(RCSPP)。该算法分为三阶段:①根据实际传输长度M构造码长为N的Polar母码;②在生成矩阵中结合高斯近似信息及|Q(Np)|最小化原则依次选出(N-M)个凿孔位,并将其对应列号添加入凿孔向量Np中得到补充冻结集;③译码时,将凿孔向量中传输冻结比特的对数似然比(LLR)接收值设置为无穷大(或无穷小)值。仿真结果表明:在误比特率(BER)为10^-5时,本文算法与传统的缩短方案及准均匀凿孔(QUP)方案相比,分别能获得0.1 dB及0.3 dB的性能增益。On the basis of the traditional shortening scheme,a new algorithm based on Gaussian approximation-aided is proposed to filter the puncture position,which can easily obtain the rate-compatible shortened punctured polar code(RCSPP).The presented algorithm consists of three steps:①the Polar code with length N is constructed according to the actual transmission length M;②by combining the Gaussian approximation information and the|Q(Np)|minimization principle,(N-M)punctured positions are selected in order in the generation matrix,and the corresponding column numbers are added to the hole vector Np to obtain the supplementary freezing set;③the LLR receiving value of transmission frozen bits in the punctured vector is set to infinite(or infinitesimal)value in the decoding procedure.Simulation result shows that the proposed algorithm can achieve about 0.1 dB and 0.3 dB performance gains at a BER of 10^-5,compared to the traditional shortened algorithm and the quasi-uniform(QUP)algorithm,respectively.

关 键 词：极化码 高斯近似 速率兼容 缩短 凿孔 

分 类 号：TN911.22[电子电信—通信与信息系统]