Affiliation:
1. School of Mathematics, Taiyuan University of Technology, Taiyuan 030024, China
Abstract
Over binary-input memoryless symmetric (BMS) channels, the performance of polar codes under successive cancellation list (SCL) decoding can approach maximum likelihood (ML) algorithm when the list size L is greater than or equal to 2MF, where MF, known as mixing factor of code, represents the number of information bits before the last frozen bit. Recently, Yao et al. showed the upper bound of the mixing factor of decreasing monomial codes with length n=2m and rate R≤12 when m is an odd number; moreover, this bound is reachable. Herein, we obtain an achievable upper bound in the case of an even number. Further, we propose a new decoding hard-decision rule beyond the last frozen bit of polar codes under BMS channels.
Subject
General Physics and Astronomy
Reference17 articles.
1. Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels;IEEE Trans. Inf. Theory,2009
2. List Decoding of Polar Codes;Tal;IEEE Trans. Inf. Theory,2015
3. Parity-Check-Concatenated Polar Codes;Wang;IEEE Commun. Lett.,2016
4. Arıkan, E. (2019). From Sequential Decoding to Channel Polarization and Back Again. arXiv.
5. Hashemi, S.A., Mondelli, M., Hassani, S.H., Urbanke, R., and Gross, W.J. (2017, January 4–8). Partitioned List Decoding of Polar Codes: Analysis and Improvement of Finite Length Performance. Proceedings of the GLOBECOM 2017—2017 IEEE Global Communications Conference, Singapore.