Abstract
In this paper, a puncturing algorithm for mixing 2-kernel and 3-kernel polar codes is presented. The puncturing sequence is generated based on the capacity of channels and the upper bound of minimum block error probability for successive cancellation (SC) decoding. We use the capacity-zero puncturing model, the decoding algorithm of mother codes can still be adopted. An improved greedy algorithm of computing the maximization of the minimum distance is proposed to select the information set. The maximum number of punctured bits is limited to \([1,{{2}^{n-2}})\) when the length of subcodes \(M\in (2^{n-2}*3,2^n)\). Simulation results show that the block error rate based on the mixing kernels is better than that based on 2-kernel.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Arikan, E.: Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Press 55(7), 3051–3073 (2009)
Korada, S.-B., Sasoglu, E., Urbanke, R.: Polar codes: characterization of exponent, bounds, and constructions. IEEE Trans. Inf. Theory 56(12), 3253–6264 (2010)
Wang, X., Zhang, Z., Zhang, L.: On the SC decoder for any polar code of length \(N =l^n\). In: Wireless Communications and Networking Conference, pp. 485–489. IEEE, Istanbul (2014)
Gabry, F., Bioglio, V., Land, I., Belfiore, J.C.: Multi-kernel construction of polar codes. In: 2017 IEEE International Conference on Communications Workshops (ICC Workshops), pp. 761–765. IEEE, Paris (2017)
Eslami, A., Pishro-Nik, H.: A practical approach to polar codes. In: IEEE International Symposium on Information Theory Proceedings, pp. 16–20. IEEE, St. Petersburg (2011)
Zhang, L., Zhang, Z., Wang, X., Yu, Q.: On the puncturing patterns for punctured polar codes. In: IEEE International Symposium on Information Theory, pp. 121–125. IEEE, Honolulu (2014)
Niu, K., Chen, K., Lin, J.-R.: Beyond turbo codes: rate-compatible punctured polar codes. In: 2013 IEEE International Conference on Communications (ICC), pp. 3423–3427. IEEE, Budapest (2013)
Bioglio, V., Gabry, F., Land, I., Belfiore, J.-C.: Minimum-distance based construction of multi-kernel polar codes. In: 2017 IEEE Global Communications Conference, GLOBECOM 2017, pp. 1–6 (2016). IEEE Global Communications Conference 18(12), 2081–2084
Wang, R., Liu, R.: A novel puncturing scheme for polar codes. IEEE Commun. Lett. 18(12), 2081–2084 (2016)
Acknowledgment
This work was supported in part by the NSFC (61701284, 61472229, 61471224), Project funded by China Postdoctoral Science Foundation (2016M592216) and Qingdao postdoctoral research project (2016125), Sci. & Tech. Development Fund of Shandong Province of China (2016ZDJS02A11), and SDUST Research Fund (2015TDJH102). 2017 Humanities and Social Sciences Research Program of University in Shandong (J17ZZ27).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Zhang, X., Chen, C., Cui, J., Chen, G., Li, H. (2019). A Puncturing Algorithm for Mixing 2-Kernel and 3-Kernel Polar Codes. In: Jia, M., Guo, Q., Meng, W. (eds) Wireless and Satellite Systems. WiSATS 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 281. Springer, Cham. https://doi.org/10.1007/978-3-030-19156-6_30
Download citation
DOI: https://doi.org/10.1007/978-3-030-19156-6_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-19155-9
Online ISBN: 978-3-030-19156-6
eBook Packages: Computer ScienceComputer Science (R0)