Skip to main content

Performance and Complexity Comparisons of Polar Codes and Turbo Codes

  • Conference paper
  • First Online:
Advanced Intelligent Systems for Sustainable Development (AI2SD’2018) (AI2SD 2018)

Abstract

Polar codes can be considered serious competitors to turbo codes in terms of performance and complexity. This paper provides a description of the Polar codes and the Turbo codes used by channel coding. Then, we undertake a comparison of Polar codes and Turbo codes based on several factors: BER performance, encoding complexity and decoding computational complexity. The performance of newly obtained codes is evaluated in term of bit error rate (BER) for a given value of Eb/No. It has been shown via computer simulations. They are employed as the error correction scheme over Additive White Gaussian Channels (AWGN) by employing Binary phase shift keying (BPSK) modulation scheme.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Arikan, E.: Channel polarization: A method for constructing capacity-achieving codes. IEEE Int. Symp. Inf. Theory, ISIT 2008, 1173–1177 (2008)

    Google Scholar 

  2. GUHA, S., Wilde, M.: Polar coding to achieve the Holevo capacity of a pure-loss optical channe. In: Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, pp. 546–550 (2012)

    Google Scholar 

  3. Wu, Z., Lankl, B.: Polar codes for low-complexity forward error correction in optical access networks. In: ITG Symposium; Proceedings of Photonic Networks, 15, pp. 1–8 (2014)

    Google Scholar 

  4. Sasoglu, E., Telatar, E., Yeh, E.: Polar codes for the two-user binary-input multiple-access channel. In: Information Theory Workshop (ITW), 2010 IEEE, pp 1–5 (2010)

    Google Scholar 

  5. Zhang, C., Yuan, B., Parhi, K.: Low-Latency SC Decoder Architectures for Polar Codes (2011). arXiv:1111.0705

  6. Lasco-Serrano, R., Thobaben, R., Andersson, M., Rathi, V., Skoglund, M.: Polar Codes for Cooperative Relaying. IEEE Trans. Commun., 60, pp 3263–3273 (2012)

    Google Scholar 

  7. HIRCHE, C.: Polar codes in quantum information theory (2015)

    Google Scholar 

  8. Andersson, M., Rathi, V., Thobaben, R., Kliewer, J, Skoglund, M.: Nested Polar Codes for Wiretap and Relay Channels,. Commun. Lett. IEEE, 14, pp. 752–754 (2010)

    Google Scholar 

  9. Berrou, C., Glavieux, A., Thitimajshima, P.: Near Shannon limit error-correcting coding and decoding: Turbo Codes. In: Proceedings IEEE International Conference Communications ICC’93, pp. 1064–1070, Geneva, Switzerland, May (1993)

    Google Scholar 

  10. Evolved Universal Terrestrial Radio Access (EUTRA) and Evolved Universal Terrestrial Radio Access Network (EUTRAN), 3GPP TS 36.300

    Google Scholar 

  11. General UMTS Architecture, 3GPP TS 23.101 version7.0.0, June (2007)

    Google Scholar 

  12. Parkvall, S., Dahlman, E., Furuskar, A., Jading, Y., Olsson, M., Wanstedt S., Zangi, K.: LTE-advanced evolving LTE towards IMT—advanced. In: IEEE Vehicular Technology Conference, pp 1–5, Sep (2008)

    Google Scholar 

  13. Berrou, C., Amat, A.G., Mouhamedou, Y.O.C., Douillard, C., Saouter, Y.: Adding a Rate-1 Third Dimension to Turbo Codes. In: Proceedings IEEE Information Theory Workshop ITW ’07, pp. 156–161, Sept 2–6 (2007)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  15. Mark Sum Chuen Ho, B.: Serial and Parallel Concatenated Turbo Codes. Doctoral Thesis. Unversity of South Australia, School of Electrical and information Engineering, Institute for Telecommunications Research (2002)

    Google Scholar 

  16. Berrou, C., Saouter, Y., Douillard, C., Kerouédan S., Jézéquel, M.: Designing good permutations for turbo codes: toward a single model. In: Proceedings IEEE International Conference Communications, pp. 341–345, Paris, France, Jun (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mensouri Mohammed .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mohammed, M., Abdessadek, A. (2019). Performance and Complexity Comparisons of Polar Codes and Turbo Codes. In: Ezziyyani, M. (eds) Advanced Intelligent Systems for Sustainable Development (AI2SD’2018). AI2SD 2018. Advances in Intelligent Systems and Computing, vol 915. Springer, Cham. https://doi.org/10.1007/978-3-030-11928-7_39

Download citation

Publish with us

Policies and ethics