Journal on Communications ›› 2023, Vol. 44 ›› Issue (5): 158-168.doi: 10.11959/j.issn.1000-436x.2023088

• Papers • Previous Articles     Next Articles

Simplified sequence repetition nodes-based fast successive cancellation decoding algorithm for polar code

Rui GUO, Yang LIU   

  1. School of Communication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China
  • Revised:2023-04-10 Online:2023-05-25 Published:2023-05-01
  • Supported by:
    The Key Research and Development Program of Zhejiang Province(2023C03014)

Abstract:

In order to reduce the decoding latency of the successive cancellation (SC) decoding algorithm further, a kind of fast SC decoding algorithm based on simplified sequence repetition (SR) nodes, namely simplified sequence repetition node-based fast SC (SSRFSC), was proposed to optimize decoding latency issues of SC decoding algorithm.Different types of extended class of generalized parity-check (EG-PC) nodes were decomposed, merged and simplified based on the type of SR source node and decoding complexity, and Rate-C node was trimmed using fast simplified successive cancellation (Fast-SSC) decoding.Experimental results show that the decoding latency of the proposed algorithm can be reduced by up to 28% compared to the latest simplified sequence repetition (SRFSC) decoding algorithm when achieving similar decoding performance (approximately 0.1dB performance loss at frame error rate of 10-3).Moreover, compared to the Fast-SSC decoding algorithm, the decoding latency of proposed algorithm can be reduced by up to 49%.

Key words: polar code, Fast-SSC, simplified SR node, decoding latency

CLC Number: 

No Suggested Reading articles found!