Skip to main content
SpringerLink
Log in

A complexity-reduced fast successive cancellation list decoder for polar codes

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

A multi-bit decision for polar codes based on a simplified successive cancellation (SSC) decoding algorithm can improve the throughput of polar decoding. A list algorithm is used to improve the error-correcting performance. However, list decoders are highly complex compared with decoders without a list algorithm. In this paper, a low-complexity list decoder is proposed, where path-splitting operations for a multi-bit decision can be avoided, if the decoding reliability exceeds a threshold. The threshold is determined based on the reliability of subchannels and positions of decoding nodes. Path splitting rules are designed for multi-bit decision processes, and a complexity-reduced list decoder is proposed based on this. Results show that the number of survival paths can be greatly reduced at the cost of negligible deterioration in block error performance. Thus, the computational complexity can be significantly reduced, especially for a high signal-to-noise ratio (SNR) region.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Arikan E. Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Trans Inf Theory, 2009, 55: 3051–3073

    Article  MathSciNet  MATH  Google Scholar 

  2. Arikan E, Costello D J, Kliewer J, et al. Guest editorial recent advances in capacity approaching codes. IEEE J Sel Areas Commun, 2016, 34: 205–208

    Article  Google Scholar 

  3. Alamdar-Yazdi A, Kschischang F R. A simplified successive-cancellation decoder for polar codes. IEEE Commun Lett, 2011, 15: 1378–1380

    Article  Google Scholar 

  4. Sarkis G, Giard P, Vardy A, et al. Fast polar decoders: algorithm and implementation. IEEE J Sel Areas Commun, 2014, 32: 946–957

    Article  Google Scholar 

  5. Tal I, Vardy A. List decoding of polar codes. IEEE Trans Inf Theory, 2015, 61: 2213–2226

    Article  MathSciNet  MATH  Google Scholar 

  6. Niu K, Chen K. CRC-aided decoding of polar codes. IEEE Commun Lett, 2012, 16: 1668–1671

    Article  Google Scholar 

  7. Trifonov P, Miloslavskaya V. Polar codes with dynamic frozen symbols and their decoding by directed search. In: Proceedings of IEEE Information Theory Work, Sevilla, 2013. 1–5

    Google Scholar 

  8. Sarkis G, Giard P, Vardy A, et al. Increasing the speed of polar list decoders. In: Proceedings of IEEE Work Signal Process Syst, Belfast, 2014. 1–6

    Google Scholar 

  9. Sarkis G, Giard P, Vardy A, et al. Fast list decoders for polar codes. IEEE J Sel Areas Commun, 2016, 34: 318–328

    Article  Google Scholar 

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

  11. Chen K, Li B, Shen H, et al. Reduce the complexity of list decoding of polar codes by tree-pruning. IEEE Commun Lett, 2016, 20: 204–207

    Article  Google Scholar 

  12. Zhang Z, Zhang L, Wang X, et al. A split-reduced successive cancellation list decoder for polar codes. IEEE J Sel Areas Commun, 2016, 34: 292–302

    Article  Google Scholar 

  13. Yuan B, Parhi K K. LLR-based successive-cancellation list decoder for polar codes with multi-bit decision. IEEE Trans Circuits Syst II Express Briefs, 2016, 64: 21–25

    Article  Google Scholar 

  14. Tal I, Vardy A. How to construct polar codes. IEEE Trans Inf Theory, 2013, 59: 6562–6582

    Article  MathSciNet  MATH  Google Scholar 

  15. Wu D, Li Y, Sun Y. Construction and block error rate analysis of polar codes over AWGN channel based on Gaussian ap-proximation. IEEE Commun Lett, 2014, 18: 1099–1102

    Article  Google Scholar 

Download references

Acknowledgements

This work was partially supported by National Major Project (Grant No. 2016ZX030010-11005), National Natural Science Foundation Project (Grant No. 61521061), and Intel Corporation.

Author information

Authors and Affiliations

  1. National Mobile Communications Research Laboratory, Southeast University, Nanjing, 210096, China

    Qingyun Xu, Zhiwen Pan, Nan Liu & Xiaohu You

Authors
  1. Qingyun Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhiwen Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nan Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiaohu You
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhiwen Pan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xu, Q., Pan, Z., Liu, N. et al. A complexity-reduced fast successive cancellation list decoder for polar codes. Sci. China Inf. Sci. 61, 022309 (2018). https://doi.org/10.1007/s11432-017-9128-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-017-9128-x

Keywords

Search

Navigation