Binary Polar Codes(BPCs)have advantages of high-efficiency and capacity-achieving but suffer from large latency due to the Successive-Cancellation List(SCL)decoding.Non-Binary Polar Codes(NBPCs)have been investigated to obtain the performance gains and reduce latency under the implementation of parallel architectures for multi-bit decoding.However,most of the existing works only focus on the Reed-Solomon matrix-based NBPCs and the probability domain-based non-binary polar decoding,which lack flexible structure and have a large computation amount in the decoding process,while little attention has been paid to general non-binary kernel-based NBPCs and Log-Likelihood Ratio(LLR)based decoding methods.In this paper,we consider a scheme of NBPCs with a general structure over GF(2m).Specifically,we pursue a detailed Monte-Carlo simulation implementation to determine the construction for proposed NBPCs.For non-binary polar decoding,an SCL decoding based on LLRs is proposed for NBPCs,which can be implemented with non-binary kernels of arbitrary size.Moreover,we propose a Perfect Polarization-Based SCL(PPB-SCL)algorithm based on LLRs to reduce decoding complexity by deriving a new update function of path metric for NBPCs and eliminating the path splitting process at perfect polarized(i.e.,highly reliable)positions.Simulation results show that the bit error rate of the proposed NBPCs significantly outperforms that of BPCs.In addition,the proposed PPB-SCL decoding obtains about a 40％complexity reduction of SCL decoding for NBPCs.

Shufeng Li;Mingyu Cai;Robert Edwards;Yao Sun;Libiao Jin

The State Key Laboratory of Media Convergence and Communication,School of Information and Engineering,Communication University of China,Beijing,100024,China;The Wolfson School of Mechanical Electrical and Manufacturing Engineering,Loughborough University,Leicestershire,LE11 3TE,UK;James Watt School of Engineering,University of Glasgow,G12 8QQ,Scotland,UK

数字通信与网络（英文）

[1]Shufeng Li;Mingyu Cai;Robert Edwards;Yao Sun;Libiao Jin-.Research on encoding and decoding of non-binary polar codes over GF(2m))[J].数字通信与网络（英文）,2022(03):359-372

BPCs,NBPCs,LLRs

Research,encoding,decoding,binary,codes,GF,2m,Binary,Codes,have,advantages,efficiency,capacity,achieving,but,suffer,from,large,latency,due,Successive,Cancellation,List,SCL,Non,been,investigated,performance,gains,reduce,under,implementation,parallel,architectures,multi,However,most,existing,works,only,focus,Reed,Solomon,matrix,probability,domain,which,lack,flexible,structure,computation,amount,process,while,little,attention,has,paid,general,Log,Likelihood,Ratio,methods,In,this,paper,consider,scheme,Specifically,pursue,detailed,Monte,Carlo,simulation,determine,construction,proposed,For,implemented,kernels,arbitrary,size,Moreover,Perfect,Polarization,Based,PPB,algorithm,complexity,by,deriving,new,update,function,path,metric,eliminating,splitting,perfect,polarized,highly,reliable,positions,Simulation,results,show,that,error,rate,significantly,outperforms,addition,obtains,about,reduction

0.488201