Low-complexity polar code construction for higher order modulation

This is a preview of subscription content, access via your institution.


  1. 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

    MathSciNet  Article  MATH  Google Scholar 

  2. 2

    Xu Q Y, Pan Z W, Liu N, et al. A complexity-reduced fast successive cancellation list decoder for polar codes. Sci China Inf Sci, 2018, 61: 022309

    MathSciNet  Article  Google Scholar 

  3. 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

    Article  Google Scholar 

  4. 4

    Mahdavifar H, El-Khamy M, Lee J, et al. Polar coding for bit-interleaved coded modulation. IEEE Trans Veh Technol, 2016, 65: 3115–3127

    Article  Google Scholar 

  5. 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. 6

    Chen K, Niu K, Lin J R. An efficient design of bitinterleaved polar coded modulation. In: Proceedings of IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications, London, 2013. 693–697

    Google Scholar 

Download references


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).

Author information



Corresponding author

Correspondence to Zhiwen Pan.

Electronic supplementary material

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Yu, Y., Pan, Z., Liu, N. et al. Low-complexity polar code construction for higher order modulation. Sci. China Inf. Sci. 62, 209301 (2019). https://doi.org/10.1007/s11432-018-9661-2

Download citation