Optimizing low complexity encoding method for systematic polar code
Papers|更新时间:2024-06-05
|
Optimizing low complexity encoding method for systematic polar code
Journal on CommunicationsVol. 39, Issue 7, Pages: 132-138(2018)
作者机构:
1. 空军工程大学航空工程学院,陕西 西安 710038
2. 西安电子科技大学综合业务网国家重点实验室,陕西 西安 710071
3. 空军航空大学初级训练基地,黑龙江 哈尔滨 150100
作者简介:
基金信息:
The National Natural Science Foundation of China(61472442);Shaanxi Province Scientific and Technological Project(2017GY-049);Aviation Science Foundation(20155896025)
In order to solve the delay caused by step-by-step calculation and the computational complexity caused by iterative “exclusive-or” computation during the encoding process
a dimensionality reduction strategy was proposed and defined.Based on this
system polarization code parallel coding algorithm for cracking strategy was proposed.Simulation and computational complexity analysis were carried out on AWGN channel.The results show that the coding gain of the above algorithm is slightly better than the traditional one or almost the same
but the computational complexity is up to 80.92%
which is more suitable for hardware implementation and engineering application.It is more suitable for hardware implementation and has a certain practical value.
关键词
Keywords
references
SHANNON C E . A mathematical theory of communication [J ] . Bell System Technical Journal , 1948 , 19 ( 4 ): 271 - 285 .
ARICAN 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 .
ARICAN E . A performance comparison of polar codes and reedmuller codes [J ] . IEEE Communications Letters , 2008 , 12 ( 6 ): 447 - 449 .
ARICAN E . Channel combining and splitting for cutoff rate improvement [J ] . IEEE Transactions on Information Theory , 2006 , 52 ( 2 ): 628 - 639 .
FENG B , ZHANG Q , JIAO J . An efficient rateless scheme based on the extendibility of systematic polar codes [J ] . IEEE Access , 2017 ,PP( 99 ):1.
YOO H , PARK I C . Partially parallel encoder architecture for long polar codes [J ] . IEEE Transactions on Circuits & Systems II Express Briefs , 2015 , 62 ( 3 ): 306 - 310 .
LI L , ZHANG W . On the encoding complexity of systematic polarcodes [C ] // IEEE International System-on-Chip Conference . 2015 : 415 - 420 .
SARKIS G , TAL I , GIARD P , et al . Flexible and low-complexity encoding and decoding of systematic polar codes [J ] . IEEE Transactions on Communications , 2016 , 7 ( 65 ): 2732 - 2745 .
SARKIS G , GIARD P , VARDY A , et al . Fast polar decoders:algorithm and implementation [J ] . IEEE Journal on Selected Areas in Communications , 2014 , 32 ( 5 ): 946 - 957 .
TAL I , VARDY A . How to construct polar codes [J ] . IEEE Transactions on Information Theory , 2011 , 59 ( 10 ): 6562 - 6582 .
RICHARDSON T J , SHOKROLLAHI M A , URBANKE R . Design of capacity-approaching irregular low-density parity-check codes [J ] . IEEE Transaction on Information Theory , 2001 , 47 ( 2 ): 619 - 637 .
CHUNG S Y , RICHARDISON T J , 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 .
ZHANG Z Y , ZHANG L , WANG X B , et al . A split-reduced successive cancellation list decoder for polar codes [J ] . IEEE Journal on Selected Areas in communications , 2016 , 34 ( 2 ): 292 - 302 .
BALATSOUKAS-STIMMING A , RAYMOND A J , GROSS W J , et al . Hardware architecture for list successive cancellation decoding of polar codes [J ] . IEEE Transactions on Circuits & Systems II Express Briefs , 2014 , 61 ( 8 ): 609 - 613 .