High Performance Low Latency Parallel Successive Cancelation Decoder Structures for Polar Codes

Abstract

Polar codes are decoded using successive cancellation (SC) algorithm where likelihood ratios (LRs) for data bits are calculated in a sequential manner, and decisions are made using the calculated LRs. During the decoding of an information bit, the decision results for the predecessor bits are used, and a wrongly decided predecessor bit has negative effect on the accurate calculation of the LR for the information bit being decoded. In SC algorithm, when LR=1, the information bit is decoded as u ̂_i=0, however, such a decision has 50% of chance of being correct. In this paper, we propose improved polar decoders utilizing a number of SC decoders. We consider the case of LR=1, and propose polar decoder structures for the more accurate calculation of the LRs of the successor bits.

Keywords

• Multi-Parallel SCD
• Polar Coding
• BEC

References

1. [1] E. Arıkan, “Channel Polarization: A Method for Constructing Capacity Achieving Codes for Symmetric Binary-Input Memoryless Channels,” IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3051–3073, 2009.
2. [2] I. Tal and A. Vardy, “List Decoding of Polar Codes,” IEEE Transactions on Information Theory, vol. 61, no. 5, pp. 2213–2226, 2015.
3. [3] K. Niu and K. Chen, “CRC-aided decoding of polar codes,” IEEE Communications Letters, vol. 16, no. 10, pp. 1668-1671, 2012.
4. [4] P. Koopman and T. Chakravarty, “Cyclic redundancy code (CRC) polynomial selection for embedded networks,” in Proc. IEEE International.Conference Advanced Information Networking and Applications, pp.145-154, 2004.
5. [5] G. Sarkis, P. Giard, A. Vardy, C. Thibeault, and W. Gross, “Fast polar decoders: Algorithm and implementation,” IEEE Journal on Selected Areas in Communications, vol. 32, no. 5, pp. 946–957, 2014.
6. [6] G. Sarkis, P. Giard, A. Vardy, C. Thibeault, and W. J. Gross, “Fast list Decoders for polar codes,” IEEE Journal on Selected Areas in Communications, vol.34, no. 2, pp. 318–328, 2016.