Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern codes such as low-density parity-check (LDPC) codes. Of the many methods to improve the error-correction performance of polar codes, list decoding yields the bes...

This paper formulates the polar-code construction problem for successive-cancellation list (SCL) decoder as a maze-traversing game, which can be solved by reinforcement-learning techniques. The proposed method provides novel technique that no longer depends on sorting and selecting bit-channels reliability, in most current algorithms. Instead, this decides whether input bits should frozen purel...

Abstract In this research, we study soft-output decoding of polar codes. Two representative algorithms are belief propagation (BP) and soft cancellation (SCAN). The BP algorithm has low latency but suffers from high computational complexity. On the other hand, SCAN algorithm, which is proposed for reduced complexity decoding, achieves good performance long latency. These two suitable only extre...

—In this letter, we propose parallel SC (Successive Cancellation) decoder and parallel SC-List decoder for polar codes. The parallel decoder is composed of) 1 (2   m M m component decoders working in parallel and each component decoder decodes a Polar code of a block size of M / 1 of the original Polar code. Therefore the parallel decoder has M times faster decoding speed. Our simulation resu...