Published December 31, 2020 | Version v1
Journal article Open

Performance analysis of the bioinspired method for optimizing irregular codes with a low density of parity checks

Creators

  • 1. Ukrainian State University of Railway Transport
  • 2. National University «Yuri Kondratyuk Poltava Polytechnic»

Description

This paper reports the principles of building irregular codes with a low density of parity checks. It has been determined that finding irregular finite-length codes with improved characteristics necessitates the optimization of the distributions of powers of the symbol and test vertices of the corresponding Tanner graph. The optimization problem has been stated and the application of a bioinspired approach to solving it has been substantiated. The paper considers the main stages of the bioinspired method to optimize the finite-length irregular codes with a low density of parity checks. It is shown that a given method is based on the combined application of the bioinspired procedure of bats, a special method for building Tanner graphs, and computer simulation.

The reported study aimed to evaluate the effectiveness of the proposed method for optimizing irregular codes when using the selected bioinspired procedure and the predefined model of a communication channel.

Based on the study results, it has been determined that the optimized relatively short irregular codes with a low density of parity checks possess better characteristics compared to existing codes. It is shown that the derived codes do not demonstrate the effect of an "error floor" and ensure an energy win via encoding of about 0.5 dB compared to regular codes depending on the length of the code. It has been determined that the optimization of irregular codes with a low value of the maximum power in the distribution of powers of the symbol vertices of the Tanner graph leads to a decrease in the order of an error coefficient in the region with a high signal/noise ratio.

The application of the optimized irregular codes with a low density of parity checks could improve the efficiency of next-generation wireless telecommunication systems

Files

Performance analysis of the bioinspired method for optimizing irregular codes with a low density of parity checks.pdf

Files (475.1 kB)

Additional details

References

  • Bae, J. H., Abotabl, A., Lin, H.-P., Song, K.-B., Lee, J. (2019). An overview of channel coding for 5G NR cellular communications. APSIPA Transactions on Signal and Information Processing, 8. doi: https://doi.org/10.1017/atsip.2019.10
  • Ryan, W., Lin, S. (2009). Channel codes: Classical and modern. Cambridge University Press, 692. doi: https://doi.org/10.1017/cbo9780511803253
  • Richardson, T., Urbanke, R. L. (2008). Modern Coding Theory. Cambridge University Press, 590. doi: https://doi.org/10.1017/cbo9780511791338
  • Ten Brink, S., Kramer, G., Ashikhmin, A. (2004). Design of Low-Density Parity-Check Codes for Modulation and Detection. IEEE Transactions on Communications, 52 (4), 670–678. doi: https://doi.org/10.1109/tcomm.2004.826370
  • Richardson, T. J., Shokrollahi, M. A., Urbanke, R. L. (2001). Design of capacity-approaching irregular low-density parity-check codes. IEEE Transactions on Information Theory, 47 (2), 619–637. doi: https://doi.org/10.1109/18.910578
  • Tavakoli, H., Ahmadian, M., Peyghami, M. R. (2012). Optimal rate irregular low-density parity-check codes in binary erasure channel. IET Communications, 6 (13), 2000–2006. doi: https://doi.org/10.1049/iet-com.2011.0915
  • Jayasooriya, S., Shirvanimoghaddam, M., Ong, L., Johnson, S. J. (2017). Joint optimisation technique for multi-edge type low-density parity-check codes. IET Communications, 11 (1), 61–68. doi: https://doi.org/10.1049/iet-com.2016.0287
  • Smith, B., Ardakani, M., Yu, W., Kschischang, F. (2010). Design of irregular LDPC codes with optimized performance-complexity tradeoff. IEEE Transactions on Communications, 58 (2), 489–499. doi: https://doi.org/10.1109/tcomm.2010.02.080193
  • Liu, S., Song, A. (2016). Optimization of LDPC Codes over the Underwater Acoustic Channel. International Journal of Distributed Sensor Networks, 12 (2), 8906985. doi: https://doi.org/10.1155/2016/8906985
  • Zhang, Y., Li, Q., Huang, L., Dai, K., Song, J. (2018). Optimal Design of Cascade LDPC-CPM System Based on Bionic Swarm Optimization Algorithm. IEEE Transactions on Broadcasting, 64 (3), 762–770. doi: https://doi.org/10.1109/tbc.2018.2835769
  • Zhao, S. (2020). Computing Algorithms for LDPC Coded Internet-of-Things. IEEE Access, 8, 88498–88505. doi: https://doi.org/10.1109/access.2020.2992933
  • Koganei, Y., Yofune, M., Li, C., Hoshida, T., Amezawa, Y. (2016). SC-LDPC Code With Nonuniform Degree Distribution Optimized by Using Genetic Algorithm. IEEE Communications Letters, 20 (5), 874–877. doi: https://doi.org/10.1109/lcomm.2016.2545652
  • Ao, J., Liang, J., Ma, C., Cao, G., Li, C., Shen, Y. (2017). Optimization of LDPC Codes for PIN-Based OOK FSO Communication Systems. IEEE Photonics Technology Letters, 29 (9), 727–730. doi: https://doi.org/10.1109/lpt.2017.2682269
  • Elkelesh, A., Ebada, M., Cammerer, S., Schmalen, L., ten Brink, S. (2019). Decoder-in-the-Loop: Genetic Optimization-Based LDPC Code Design. IEEE Access, 7, 141161–141170. doi: https://doi.org/10.1109/access.2019.2942999
  • Shtompel, M. (2016). Optimizatsiya neregulyarnyh kodov s maloy plotnost'yu proverok na chetnost' na osnove prirodnyh vychisleniy. Radiotehnika, 186, 207–210. Available at: http://nbuv.gov.ua/UJRN/rvmnts_2016_186_21
  • Hu, X. Y., Eleftheriou, E., Arnold, D. M. (2005). Regular and irregular progressive edge-growth Tanner graphs. IEEE transactions on information theory, 51 (1), 386–398. doi: https://doi.org/10.1109/tit.2004.839541
  • Yang, X.-S. (2010). Nature-inspired metaheuristic algorithms. Luniver Press, 160.