SCIENCE CHINA Information Sciences, Volume 62 , Issue 10 : 209301(2019) https://doi.org/10.1007/s11432-018-9661-2

Low-complexity polar code construction for higher order modulation

More info
  • ReceivedJul 19, 2018
  • AcceptedNov 7, 2018
  • PublishedApr 4, 2019


There is no abstract available for this article.


This work was partially supported by National Major Project (Grant No. 2017ZX03001002-004), National Natural Science Foundation of China (Grant No. 61521061), and 333 Program of Jiangsu (Grant No. BRA2017366).


Appendixes A–D.


[1] Arikan E. Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels. IEEE Trans Inform Theor, 2009, 55: 3051-3073 CrossRef Google Scholar

[2] Xu Q Y, Pan Z W, Liu N. A complexity-reduced fast successive cancellation list decoder for polar codes. Sci China Inf Sci, 2018, 61: 022309 CrossRef Google Scholar

[3] Li B, Shen H, Tse D. An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy Check. IEEE Commun Lett, 2012, 16: 2044-2047 CrossRef Google Scholar

[4] Mahdavifar H, El-Khamy M, Lee J. Polar Coding for Bit-Interleaved Coded Modulation. IEEE Trans Veh Technol, 2016, 65: 3115-3127 CrossRef Google Scholar

[5] Chen P, Xu M, Bai B, et al. Design of polar coded 64-qam. In: Proceedings of International Symposium on Turbo Codes and Iterative Information Processing, Brest, 2016. 251--255. Google Scholar

[6] Chen K, Niu K, Lin J R. An efficient design of bit-interleaved polar coded modulation. In: Proceedings of IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications, London, 2013. 693--697. Google Scholar


Contact and support