On the Scheduling of Belief Propagation Decoding for Polar Codes

• Main Authors: Liu, Chen-Feng, 劉振灃
• Other Authors: Lu, Hsiao-Feng
• Format: Others
• Language: en_US
• Published: 2011
• Online Access: http://ndltd.ncl.edu.tw/handle/93232557119438583379

碩士 === 國立交通大學 === 電信工程研究所 === 99 === Channel coding is a scheme that adds redundancy to messages for reliable transmission. Many works have been devoting to constructing a coding scheme that can transmit messages reliably at rates set below the channel capacity. Polar code is one such scheme that can achieves channel capacity theoretically under successive cancellation (SC) decoding. Besides SC decoding, there are other decoding algorithms such that as code length increases, error rates of polar codes decrease more rapidly. For instance, belief propagation (BP) decoding has been used to decode polar codes with error rates better than the SC decoding. BP decoder uses the information ignored by SC decoder, and its superiority over SC decoder has been established in [1]. In this thesis, we propose a scheduling for the BP decoding of polar codes that resembles the SC decoding. By simulation over binary-input AWGN channel, we see that in some cases, error performance in this schedule is better than that of BP decoding alone.