Advertisement

An Adaptive Code Rate Control of Polar Codes in Time-Varying Gaussian Channel

  • Hongxu JinEmail author
  • Bofeng Jiang
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 262)

Abstract

Under a benchmark of bit error rate (BER) in data transmission, a just perfect trade-off between maximizing code rate (CR) and reliable communication presents a significant coordinated challenge in the time-varying additive white Gaussian noise (T-AWGN) channel. In this paper, based on the guidance of a tight bound as coding parameters of polar code rate \( R \), block length \( N \) with the capacity \( I(W) \) in channel \( W \) of \( N \ge \beta /(I(W) - R)^{\mu } \), a criteria of effectively adjusting the size of the parameter \( \mu \) will achieve a better trade-off between the CR and the reliability, where \( \beta \) depends only on block error probability. In the circumstance of a round-clock traffic light (RTL) simulation, numerical results show that this scheme has a good preference for the guaranteed reliability for the wireless communication.

Keywords

Polar codes Code rate Traffic light (RTL) of wireless communication Time-varying additive white Gaussian noise 

References

  1. 1.
    Arikan, E.: Channel polarization: a method for constructing capacity achieving codes for symmetric binary-input memoryless channels. IEEE Trans. Inf. Theory 55(7), 3051–3073 (2009)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Korada, S.B., Montanari, A., Telatar, E., Urbanke, R.: An empirical scaling law for polar codes. In: IEEE International Symposium on Information Theory Proceedings (ISIT), Austin, U.S.A. June 2010Google Scholar
  3. 3.
    Goli, A., Hassani, S.H., Urbanke, R.: Universal bounds on the scaling behavior of polar codes. In: IEEE International Symposium on Information Theory Proceedings (ISIT), Austin, U.S.A. July 2012Google Scholar
  4. 4.
    Hassani, S.H., Alishahi, K., Urbanke, R.: Finite-length scaling for polar codes. IEEE Trans. Inf. Theory 60(10), 8575–5898 (2014)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Goldin, D., Burshtein, D.: Improved bounds on the finite length scaling of polar codes. IEEE Trans. Inf. Theory 60(11), 6966–6978 (2014)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Polyanskiy, Y., Vincent Poor, H., Verdú, S.: Channel coding rate in the finite blocklength regime. IEEE Trans. Inf. Theory 56(6), 2307–2359 (2010)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Hashemi, S.A., Balatsoukas-Stimming, A., Giard, P., Thibeault, C., Gross, W.J.: Partitioned successive-cancellation list decoding of polar codes. In: IEEE International Conference on Acoustics, Speech, and Signal Process (ICASSP) (2016)Google Scholar
  8. 8.
    Zhang, C., Wang, Z., You, X., Yuan, B.: Efficient adaptive list successive cancellation decoder for polar codes. In: IEEE International Asilomar Conference on Signals, Systems, Pacific Grove, CA (2014)Google Scholar
  9. 9.
    Crowther, J., Herzig, C., Feller, G.: The time is right for connected public lighting within smart cities. In: IBSG Cisco System, San Jose, CA, U.S.A. (2012)Google Scholar
  10. 10.
    Hu, B., Wang, Y., Liu, G.: Measurements and estimations of photosystem vertically active radiation in Beijing. Elsevier Atmos. Res. 85(3–4), 361–371 (2007)Google Scholar
  11. 11.
    Rajagopal, S., Roberts, R., Lim, S.: IEEE 802.15.7 visible light communication: modulation schemes and dimming support. IEEE Commun. Mag. 50(3), 71–82 (2012)CrossRefGoogle Scholar

Copyright information

© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2019

Authors and Affiliations

  1. 1.School of Electronic and Information EngineeringBeihang UniversityBeijingChina

Personalised recommendations