BP Decoding Algorithm for 3×3 Kernel Matrix Polar Codes
Compared with 2×2 kernel polar codes,3×3 kernel polar codes have richer code lengths and higher polarization rates.At the same time,Belief Propagation(BP)algorithm for polar codes,as opposed to the traditional Successive Cancellation(SC)decoding algorithm,demonstrates lower latency.In this paper,the BP decoding algorithm of 2×2 kernel polar codes is extended to 3×3 kernel po-lar codes.Firstly,the information update formula for the minimal computing unit within the 3×3 kernel is derived.Then,based on the in-formation update formula,a 3×3 kernel BP decoding algorithm is given.Subsequently,based on this update formula,the BP decoding al-gorithm for the 3×3 kernel is presented.Simulation results indicate that,for 3×3 kernel polar codes,the BP decoding algorithm outper-forms the SC decoding algorithm at medium to low signal-to-noise ratios.Moreover,under comparable decoding performance conditions,the BP decoding algorithm exhibits lower decoding latency.
polar codesbelief propagation algorithmdecoding time delaydecoding performance
万方数据
维普
