Journal on Communications ›› 2018, Vol. 39 ›› Issue (7): 132-138.doi: 10.11959/j.issn.1000-436x.2018127

• Papers • Previous Articles     Next Articles

Optimizing low complexity encoding method for systematic polar code

Linhua MA1,2,Shiping LIU1,Xing HU1,Tianyu HUANG1,Bin XU3   

  1. 1 Aeronautics and Astronautics Engineering College,Air Force Engineering University,Xi’an 710038,China
    2 The State Key Laboratory of Integrated Services Networks,Xidian University,Xi’an 710071,China
    3 Air Force Aviation University Primary Training Base,Harbin 150100,China
  • Revised:2018-05-19 Online:2018-07-01 Published:2018-08-08
  • Supported by:
    The National Natural Science Foundation of China(61472442);Shaanxi Province Scientific and Technological Project(2017GY-049);Aviation Science Foundation(20155896025)

Abstract:

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.

Key words: polar code, systematic polar code, parallel encoding, complexity, splitting decomposition, bit error rate

CLC Number: 

No Suggested Reading articles found!