Performance Analysis of CRC-Polar Concatenated Codes
Main Article Content
Abstract
Polar code has been proven to obtain Shannon capacity for Binary Input Discrete Memoryless Channel (BIDMC) and its use has been proposed as the channel coding in 5G technology. However, its performance is limited in finite block length, compared to Turbo or LDPC codes. This research proposes the use of various CRC codes to complement Polar codes with finite block length and analyses the performance based on Block Error Rate (BLER) to Es/N0 (dB). The CRC codes used are of degrees 11 and 24, with 3 different polynomial generators for each degree. The number of bits in the information sequence is 32. The list sizes used are 1, 2, 4, and 8. Simulation results show that the concatenation of CRC and Polar codes will yield good BLER vs Es/N0 performance for short blocks of codeword, with rates 32/864 and 54/864. Concatenating CRC codes with Polar codes will yield a BLER performance of 10-2 with Es/N0 values of -9.1 to -7.5 dB when CRC codes of degree 11 is used, depending on the SC list used. The use of CRC codes of degree 24 enables a BLER performance of 10-2 with Es/N0 values of -7 to -6 dB when the SC list used is 1 or 2. The use of CRC codes of degree 24 combined with SC list with sizes 4 or 8 will improve the BLER performance to 10-2 with Es/N0 values of -8 to -7.5 dB
Downloads
Article Details
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
References
[2] J. H. Bae, A. Abotabl, H. P. Lin, K. B. Song, and J. Lee, “An overview of channel coding for 5G NR cellular communications,” APSIPA Trans. Signal Inf. Process., vol. 8, 2019.
[3] E. Arikan, “Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels,” IEEE Trans, vol. 55, no. 7, pp. 3051–3073, 2009.
[4] P. Akuon and H. Xu, “Polar coded spatial modulation,” IET Commun., 2014.
[5] O. O. Koyluoglu and H. El Gamal, “Key agreement,” IEEE Trans. Inf. Forensics Secur., vol. 7, no. 5, pp. 1472–1483, 2012.
[6] H. Vangala, E. Viterbo, and Y. Hong, “A Comparative Study of Polar Code Constructions for the AWGN Channel,” arXiv:1501.02473, 2015. [Online]. Available: http://arxiv.org/abs/1501.02473.
[7] I. Tal and A. Vardy, “List Decoding of Polar Codes,” IEEE Trans. Inf. Theory, vol. 61, no. 5, pp. 2213–2226, 2015.
[8] C. Zhang and K. K. Parhi, “Low-Latency Sequential and Over- lapped Architectures for Successive,” IEEE Trans. Signal Process., vol. 61, no. 10, pp. 2429–2441, 2013.
[9] B. Yuan, S. Member, and K. K. Parhi, “Low-Latency Successive-Cancellation Polar Decoder Architectures Using 2-Bit Decoding,” IEEE Trans. Circuits Syst., vol. 61, no. 4, pp. 1241–1254, 2014.
[10] A. V. and W. J. G. C. Leroux, A. J. Raymond, G. Sarkis, I. Tal, “Hardware implementation of successive cancellation decoders for polar codes,” J. Signal Process. Syst., vol. 69, no. 3, pp. 305–315, 2012.
[11] S. Sets and E. Floor, “On Finite-Length Performance of Polar Codes : Concatenated Design,” IEEE Trans. Commun., vol. 61, no. 3, pp. 919–929, 2013.
[12] T. Wang, D. Qu, and T. Jiang, “Parity-check-concatenated polar codes,” IEEE Commun. Lett., vol. 20, no. 12, pp. 2342–2345, 2016.
[13] J. H. Kim, S. H. Kim, J. W. Jang, and Y. S. Kim, “Low complexity list decoding for polar codes with multiple CRC Codes,” Entropy, vol. 19, no. 4, pp. 1–13, 2017.
[14] T. Baicheva and P. Kazakov, “CRC selection for decoding of CRC-polar concatenated codes,” in Proceedings of 2019 Balkan Conference in Informatics, 2019, no. 26-28 September, pp. 1–5.
[15] H. Vangala, Y. Hong, and E. Viterbo, “Efficient algorithms for systematic polar encoding,” IEEE Commun. Lett., vol. 20, no. 1, pp. 17–20, 2016.
[16] H. Vangala, E. Viterbo, and Y. Hong, “A new multiple folded successive cancellation decoder for polar codes,” 2014 IEEE Inf. Theory Work. ITW 2014, pp. 381–385, 2014.
[17] X. Wang, J. He, J. Li, Z. Wu, L. Shan, and B. Hong, “Improved Adaptive Successive Cancellation List Decoding of Polar Codes,” Entropy, vol. 21, no. 9, p. 899, 2019.
[18] Y. S. K. J.H. Kim, S.H. Kim, J.W. Jang, “Low complexity list decoding for polar codes with multiple CRC codes,” Entropy, vol. 19, no. 4, 2017.
[19] T. Specification, “TS 138 212 - V15.2.0 - 5G; NR; Multiplexing and channel coding (3GPP TS 38.212 version 15.2.0 Release 15),” vol. 0, p. 100, 2018.