Performance Analysis of Bit-Interleaved Polar Coded Modulation
- 14 Downloads
Polar codes have been applied to the construction of bit-interleaved polar coded modulation schemes in recent years. Bit-interleaved polar coded modulation schemes consist of the concatenation of multi-order modulation and polar codes. The structure of polar codes has some similar features to bit-interleaved coded modulation schemes. This similar features motivate us to transform the concatenated transmission schemes into a universal equivalent channel model, which consists of independent parallel channels, through considering polar coding and modulation synthetically in practical applications. We also propose a general polar codes constructing algorithm to design the constituent polar codes for the equivalent channel model. Then we employ a bijective mapper to accomplish the modulation i.e., binary address mapping, from coded bits to signals in constellation with Gray labeling or set partition labeling rule in different order modulations. We analyze and compare the performance of the equivalent channel model with different order modulations under different decoding algorithms. Simulation results show that the performance of our proposed schemes outperforms that of low-density parity-check codes in WiMAX standard and Turbo codes.
KeywordsBit-interleaved coded modulation Polar codes Equivalent channel model Polar codes constructing algorithm
Manuscript submitted December 14, 2017. This work was supported by the National Natural Science Foundation of China under Grant 61671073.
- 2.Zehavi, E. (1989). 8-PSK trellis codes on Rayleigh channel. In Proceedings of IEEE military communications conference (pp. 536–540).Google Scholar
- 5.Tal, I., & Vardy, A. (2011). List decoding of polar codes. In Proceedings of IEEE international symposium on information theory (pp. 1–5).Google Scholar
- 7.Berrou, C., Glavieux, A., & Thitimajshima, P. (1993). Near Shannon limit error correcting coding and decoding: Turbo-codes. In Proceedings of IEEE international conference on communications (ICC), (Geneva, Switzerland) (Vol. 2, pp. 1064–1070).Google Scholar
- 8.Leroux, C, Tal, I., Vardy, A., & Gross, W. J. (2011). Hardware architectures for successive cancellation decoding of polar codes. In Proceedings of IEEE international conference on acoustics, speech and signal processing (ICASSP), (pp. 1665–1668).Google Scholar
- 10.Arikan, E. (2010). Polar codes: A pipelined implementation. In Proceedings of 4th international symposium broadcasting communications (ISBC), (pp. 11–14).Google Scholar
- 11.Afser, H., & Tirpan, N. (2014). Bit interleaved polar coded modulation. IEEE wireless communications and networking conference (WCNC), (pp. 480–484).Google Scholar
- 14.GPP. (2016). Study on new radio access technology physical layer aspects. TR 38.802.Google Scholar
- 15.Chandesris, L., Savin, V., Declercq, D. (2018). Lasting successive-cancellation based decoders for multilevel polar coded modulation. In IEEE conferences, 2018 25th international conference on telecommunications (ICT), (pp. 264–268).Google Scholar
- 17.Alvarado, A., Graell i Amat, A., Brannstrom, F., & Agrell, E. (2012). On the equivalence of TCM encoders. In Proceedings of IEEE international symposium on information theory (ISIT), (pp. 2401–2405).Google Scholar
- 20.Martinez, A., & Willems, F. (2006). A coding theorem for bit-interleaved coded modulation. In 27th symposium on information theory in the Benelux (WIC 2006), Noordwijk, the Netherlands.Google Scholar
- 22.Trifonov, P., Miloslavskaya, V., & Morozov, R. (2018). Fast sequential decoding of polar codes. Available: https://arxiv.org/abs/1703.06592v1.
- 25.Stierstorfer, C., & Fischer, R. F. H. (2007). (Gray) mappings for bit-interleaved coded modulation. In Proceedings of IEEE vehicle technology conference (pp. 1703–1707).Google Scholar