Advertisement

Problems of Information Transmission

, Volume 54, Issue 4, pp 301–328 | Cite as

Polar Codes with Higher-Order Memory

  • H. AfşerEmail author
  • H. Deliç
Coding Theory
  • 17 Downloads

Abstract

We introduce a construction of a set of code sequences {Cn(m) : n ≥ 1, m ≥ 1} with memory order m and code length N(n). {Cn(m)} is a generalization of polar codes presented by Arıkan in [1], where the encoder mapping with length N(n) is obtained recursively from the encoder mappings with lengths N(n − 1) and N(nm), and {Cn(m)} coincides with the original polar codes when m = 1. We show that {Cn(m)} achieves the symmetric capacity I(W) of an arbitrary binary-input, discrete-output memoryless channel W for any fixed m. We also obtain an upper bound on the probability of block-decoding error Pe of {Cn(m)} and show that \({P_e} = O({2^{ - {N^\beta }}})\) is achievable for β < 1/[1+m(ϕ − 1)], where ϕ ∈ (1, 2] is the largest real root of the polynomial F(m, ρ) = ρmρm − 1 − 1. The encoding and decoding complexities of {Cn(m)} decrease with increasing m, which proves the existence of new polar coding schemes that have lower complexity than Arıkan’s construction.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arıkan, E., Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels, IEEE Trans. Inform. Theory, 2009, vol. 55, no. 7, pp. 3051–3073.MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Arıkan, E., Channel Combining and Splitting for Cutoff Rate Improvement, IEEE Trans. Inform. Theory, 2006, vol. 52, no. 2, pp. 628–639.MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Arıkan, E. and Telatar, I.E., On the Rate of Channel Polarization, in Proc. 2009 IEEE Int. Sympos. on Information Theory (ISIT’2009), Seoul, Korea, June 28–July 3, 2009, pp. 1493–1495.Google Scholar
  4. 4.
    Korada, S.B., Şaşoğlu, E., and Urbanke, R., Polar Codes: Characterization of Exponent, Bounds, and Constructions, IEEE Trans. Inform. Theory, 2010, vol. 56, no. 12, pp. 6253–6264.MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Tal, I. and Vardy, A., How to Construct Polar Codes, IEEE Trans. Inform. Theory, 2013, vol. 59, no. 10, pp. 6562–6582.MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Bartle, R.G., The Elements of Real Analysis, New York: Wiley, 1995, 2nd ed.zbMATHGoogle Scholar
  7. 7.
    Billingsley, P., Probability and Measure, New York: Wiley, 1995, 3rd ed.zbMATHGoogle Scholar
  8. 8.
    Cover, T.M. and Thomas, J.A., Elements of Information Theory, Hoboken, NJ: Wiley, 2006, 2nd ed.zbMATHGoogle Scholar
  9. 9.
    Afşer, H. and Deliç, H., On the Channel-Specific Construction of Polar Codes, IEEE Commun. Lett., 2015, vol. 19, no. 9, pp. 1480–1483.CrossRefGoogle Scholar
  10. 10.
    Hassani, S.H. and Urbanke, R., On the Scaling of Polar Codes: I. The Behavior of Polarized Channels, in Proc. 2010 IEEE Int. Sympos. on Information Theory (ISIT’2010), Austin, TX, USA, June 13–18, 2010, pp. 874–878.Google Scholar

Copyright information

© Pleiades Publishing, Inc. 2018

Authors and Affiliations

  1. 1.Wireless Communications Laboratory, Department of Electrical and Electronics EngineeringBoğaziçi UniversityIstanbulTurkey
  2. 2.Department of Electrical and Electronics EngineeringAdana Science and Technology UniversityAdanaTurkey

Personalised recommendations