Skip to main content
Log in

Hardware Implementation of Successive-Cancellation Decoders for Polar Codes

  • Published:
Journal of Signal Processing Systems Aims and scope Submit manuscript

Abstract

The recently-discovered polar codes are seen as a major breakthrough in coding theory; they provably achieve the theoretical capacity of discrete memoryless channels using the low-complexity successive cancellation decoding algorithm. Motivated by recent developments in polar coding theory, we propose a family of efficient hardware implementations for successive cancellation (SC) polar decoders. We show that such decoders can be implemented with O(N) processing elements and O(N) memory elements. Furthermore, we show that SC decoding can be implemented in the logarithmic domain, thereby eliminating costly multiplication and division operations, and reducing the complexity of each processing element greatly. We also present a detailed architecture for an SC decoder and provide logic synthesis results confirming the linear complexity growth of the decoder as the code length increases.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Notes

  1. Binary-coded integers are assumed to be stored in little-endian format.

  2. Nominal supply voltage and temperature are V dd  = 0.9 V and T = 125°C, respectively.

References

  1. Arikan, E. (2009). Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Transactions on Information Theory, 55(7), 3051–3073. doi:10.1109/TIT.2009.2021379.

    Article  MathSciNet  Google Scholar 

  2. Fossorier, M., Mihaljevic, M., & Imai, H. (1999). Reduced complexity iterative decoding of low-density parity check codes based on belief propagation. IEEE Transactions on Communications, 47(5), 673–680. doi:10.1109/26.768759.

    Article  Google Scholar 

  3. Gallager, R. (1968). Information theory and reliable communications. New York: Wiley.

    Google Scholar 

  4. Hussami, N., Urbanke, R., & Korada, S. (2009). Performance of polar codes for channel and source coding. In IEEE ISIT 2009 (pp. 1488–1492). doi:10.1109/ISIT.2009.5205860.

  5. Leroux, C., Tal, I., Vardy, A., & Gross, W. J. (2011). Hardware architectures for successive cancellation decoding of polar codes. In Proc. IEEE int acoustics, speech and signal processing (ICASSP) conf (pp. 1665–1668). doi:10.1109/ICASSP.2011.5946819.

  6. Mahdavifar, H., & Vardy, A. (2010). Achieving the secrecy capacity of wiretap channels using polar codes. In IEEE ISIT 2010 (pp. 913–917). doi:10.1109/ISIT.2010.5513514.

  7. Sasoglu, E., Telatar, E., & Arikan, E. (2009). Polarization for arbitrary discrete memoryless channels. In Proc. IEEE information theory workshop ITW 2009 (pp. 144–148). doi:10.1109/ITW.2009.5351487.

  8. Tal, I., & Vardy, A. (2011). How to construct polar codes. Submitted to IEEE Transactions on Information Theory, available online as arXiv:1105.6164v2.

  9. Tal, I., & Vardy, A. (2011). List decoding of polar codes. In IEEE ISIT 2011 (pp. 1–5). doi:10.1109/ISIT.2011.6033904, extended version available online as arXiv:1206.0050.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Warren J. Gross.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Leroux, C., Raymond, A.J., Sarkis, G. et al. Hardware Implementation of Successive-Cancellation Decoders for Polar Codes. J Sign Process Syst 69, 305–315 (2012). https://doi.org/10.1007/s11265-012-0685-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-012-0685-3

Keywords

Navigation