tuzsutТруды учебных заведений связиProceedings of Telecommunication Universities1813-324X2712-8830СПбГУТ10.31854/1813-324X-2022-8-4-55-63tuzsut-416Research ArticleЭЛЕКТРОНИКА, ФОТОНИКА, ПРИБОРОСТРОЕНИЕ И СВЯЗЬELECTRONICS, PHOTONICS, INSTRUMENTATION AND COMMUNICATIONSОб использовании низкоплотностных кодов в канале ГилбертаUsage of LDPC Codes in a Gilbert Channelhttps://orcid.org/0000-0002-8523-9429ОвчинниковА. А.OvchinnikovA.

Овчинников Андрей Анатольевич, кандидат технических наук, доцент кафедры инфокоммуникационных технологий и систем связи

Санкт-Петербург, 190000

Andrey Ovchinnikov

Saint Petersburg, 190000

mldoc@guap.ruhttps://orcid.org/0000-0002-3792-9249ВересоваА. М.VeresovaA.

Вересова Алина Максимовна, аспирант кафедры инфокоммуникационных технологий и систем связи

Санкт-Петербург, 190000

Alina Veresova

Saint Petersburg, 190000

a.veresova@guap.ruhttps://orcid.org/0000-0002-1412-5766ФоминыхА. А.FominykhA.

Фоминых Анна Александровна, ассистент кафедры инфокоммуникационных технологий и систем связи

Санкт-Петербург, 190000

Anna Fominykh

Saint Petersburg, 190000

aawat@ya.ruСанкт-Петербургский государственный университет аэрокосмического приборостроенияРоссияSaint Petersburg State University of Aerospace InstrumentationRussian Federation202210012023845563Copyright © Овчинников А.А., Вересова А.М., Фоминых А.А., 20232023Овчинников А.А., Вересова А.М., Фоминых А.А.Ovchinnikov A., Veresova A., Fominykh A.This work is licensed under a Creative Commons Attribution 4.0 License.https://tuzs.sut.ru/jour/article/view/416

Коды с низкой плотностью проверок на четность для современных стандартов связи были тщательно изучены при использовании в каналах без памяти, но исправление пакетных ошибок с их помощью не было тщательно проанализировано. В статье исследуется декодирование различных типов кодов с низкой плотностью проверок на четность в каналах с памятью и приводятся оценки минимального расстояния и пакетной корректирующей способности для набора низкоплотностных кодов. Рассматриваются различные сценарии декодирования для канала Гилберта, включая обычный алгоритм распространения доверия, алгоритм распространения доверия с дополнительным этапом оценки состояния канала, введение буфера с перемежением внутри буфера. Передача по каналу Гилберта сравнивается с каналом без памяти. Полученные результаты показывают, что вероятность ошибки сильно зависит от характеристик, связанных с памятью канала.

Although low-density parity-check (LDPC) codes in modern communication standards have been extensively studied over a memoryless channel, their burst error correction capacity in channels with memory has yet to be thoroughly analyzed. The conventional approach to transmission in channels with memory uses interleaving within a buffer of several codewords. However, such an approach reduces the efficiency of the redundancy embedded by the error-correcting code. It is known from information theory that considering channel memory during decoding allows the transmission rate to be increased. An evaluation of the decoding error probability of different types of low-density parity-check codes in channels with memory is presented along with estimates of minimum distance and burst error correction capability for the considered codes. The decoding error probability is estimated for conventional decoding with deinterleaving and decoding taking channel memory into account. The decoding error probability is estimated for several parameters of a channel with memory and different buffer lengths. The obtained results reveal the absence of the unique decoding approach for all parameters of the channel with memory. The best decoding error probability is determined by the degree of channel memory correlation.

низкоплотностные кодыканалы с памятьюисправление пакетов ошибокперемежениеlow-density parity-check codeschannels with memoryburst error correctioninterleavingРабота выполнена при финансовой поддержке Министерства науки и высшего образования Российской Федерации, соглашение № FSRF-2020-0004, «Научные основы построения архитектур и систем связи бортовых информационно-вычислительных комплексов нового поколения для авиационных, космических систем и беспилотных транспортных средств».This research was supported by Ministry of Science and Higher Education of the Russian Federation, grant No. FSRF-2020-0004, “Scientific basis for architectures and communication systems development of the onboard information and computer systems new generation in aviation, space systems and unmanned vehicles”.ReferencesLin S., Li J. Fundamentals of Classical and Modern Error-Correcting Codes. Cambridge: Cambridge University Press, 2022. 840 p.Lin S., Li J. Fundamentals of Classical and Modern Error-Correcting Codes. Cambridge: Cambridge University Press; 2022, 840 p.Gallager R. Low-density parity-check codes // IRE Transactions on Information Theory. 1962. Vol. 8. Iss. 1. PP. 21–28. DOI:10.1109/TIT.1962.1057683Gallager R. Low-density parity-check codes. IRE Transactions on Information Theory. 1962;8(1):21–28. DOI:10.1109/TIT.1962.1057683ETSI TS 138 212 V15.3.0 (2018-10). 5G. NR. Multiplexing and channel coding (3GPP TS 38.212 version 15.3.0 Release 15). Technical Specification. 101 p.ETSI TS 138 212 V15.3.0 (2018-10). 5G. NR. Multiplexing and channel coding (3GPP TS 38.212 version 15.3.0 Release 15). Technical Specification. 101 p.Holton T. Digital Signal Processing: Principles and Applications. Cambridge: Cambridge University Press, 2021. 1058 p.Holton T. Digital Signal Processing: Principles and Applications. Cambridge: Cambridge University Press; 2021. 1058 p.Eckford A.W., Kschischang F.R., Pasupathy S. Analysis of low-density parity-check codes for the Gilbert-Elliott channel // IEEE Transactions on Information Theory. 2005. Vol. 51. Iss. 11. PP. 3872–3889. DOI:10.1109/TIT.2005.856934Eckford A.W., Kschischang F.R., Pasupathy S. Analysis of low-density parity-check codes for the Gilbert-Elliott channel. IEEE Transactions on Information Theory. 2005;51(11):3872–3889. DOI:10.1109/TIT.2005.856934Eckford A.W., Kschischang F.R., Pasupathy S. On designing good LDPC codes for Markov channels // IEEE Transactions on Information Theory. 2006. Vol. 53. Iss. 1. PP. 5–21. DOI:10.1109/TIT.2006.887467Eckford A.W., Kschischang F.R., Pasupathy S. On Designing Good LDPC Codes for Markov Channels. IEEE Transactions on Information Theory. 2006;53(1):5–21. DOI:10.1109/TIT.2006.887467Veresova A.M., Ovchinnikov A.A. Comparison of the Probability of Reed ‒ Solomon and LDPC Codes Decoding Error in the Gilbert-Elliott Channel // Proceedings of the Conference on Wave Electronics and its Application in Information and Telecommunication Systems (WECONF, St. Petersburg, Russia, 30 May‒03 June 2022). IEEE, 2022. DOI:10.1109/WECONF55058.2022.9803501Veresova A.M., Ovchinnikov A.A. Comparison of the Probability of Reed ‒ Solomon and LDPC Codes Decoding Error in the Gilbert-Elliott Channel. Proceedings of the Conference on Wave Electronics and its Application in Information and Telecommunication Systems, WECONF, 30 May‒03 June 2022, St. Petersburg, Russia. IEEE; 2022. DOI:10.1109/WECONF55058.2022.9803501Shannon C.E. A mathematical theory of communication // The Bell System Technical Journal. 1948. Vol. 27. Iss. 1. PP. 379–423. DOI:10.1002/j.1538-7305.1948.tb01338.xShannon C.E. A mathematical theory of communication. The Bell System Technical Journal. 1948;27(3):379–423. DOI:10.1002/j.1538-7305.1948.tb01338.xGilbert E.N. Capacity of a Burst-Noise Channel // Bell System Technical Journal. 1960. Vol. 39. Iss. 5. PP. 1253–1265. DOI:10.1002/j.1538-7305.1960.tb03959.xGilbert E.N. Capacity of a Burst-Noise Channel. Bell System Technical Journal. 1960;39(5):1253–1265. DOI:10.1002/j.1538-7305.1960.tb03959.xElliott E.O. Estimates of error rates for codes on burst-noise channels // The Bell System Technical Journal. 1963. Vol. 42. Iss. 5. PP. 1977–1997. DOI:10.1002/j.1538-7305.1963.tb00955.xElliott E.O. Estimates of error rates for codes on burst-noise channels. The Bell System Technical Journal. 1963;42(5): 1977–1997. DOI:10.1002/j.1538-7305.1963.tb00955.xRichardson T., Urbanke R. Modern Coding Theory. Cambridge: Cambridge University Press, 2008. 590 p.Richardson T., Urbanke R. Modern Coding Theory. Cambridge: Cambridge University Press; 2008. 590 p.Stern J. A method for finding codewords of small weigh // Proceedings of the 3rd International Colloquium on Coding Theory and Applications (Toulon, France, 2‒4 November 1988). Lecture Notes in Computer Science. Vol. 388. Berlin, Heidelberg: Springer, 1988. PP. 106–113. DOI:10.1007/BFb0019850Stern J. A method for finding codewords of small weigh. Proceedings of the 3rd International Colloquium on Coding Theory and Applications, 2‒4 November 1988, Toulon, France. Lecture Notes in Computer Science, vol.388. Berlin, Heidelberg: Springer; 1988. p.106–113. DOI:10.1007/BFb0019850Hu X.-Y., Fossorier M.P.C., Eleftheriou E. On the computation of the minimum distance of low-density parity-check codes // Proceedings of the International Conference on Communications (IEEE Cat. No.04CH37577, Paris, France, 20‒24 June 2004). IEEE, 2004. Vol. 2. PP. 767–771. DOI:10.1109/ICC.2004.1312605Hu X.-Y., Fossorier M.P.C., Eleftheriou E. On the computation of the minimum distance of low-density parity-check codes. Proceedings of the International Conference on Communications (IEEE Cat. No.04CH37577), 20‒24 June 2004, Paris, France, vol. 2. IEEE; 2004. p.767–771. DOI:10.1109/ICC.2004.1312605MacKay D.J.C. Good error-correcting codes based on very sparse matrices // IEEE Transactions on Information Theory. 1999. Vol. 45. Iss. 2. PP. 399–431. DOI:10.1109/18.748992MacKay D.J.C. Good error-correcting codes based on very sparse matrices. IEEE Transactions on Information Theory. 1999;45(2):399–431. DOI:10.1109/18.748992Krouk E., Ovchinnikov A. Exact Burst-Correction Capability of Gilbert Codes // Informatsionno-upravliaiushchie sistemy. 2016. Vol. 1. PP. 80–87. DOI:10.15217/issn1684-8853.2016.1.80Krouk E., Ovchinnikov A. Exact Burst-Correction Capability of Gilbert Codes. Informatsionno-upravliaiushchie sistemy. 2016;1:80–87. DOI:10.15217/issn1684-8853.2016.1.80Fossorier M.P.C. Quasi-cyclic low-density parity-check codes from circulant permutation matrices // IEEE Transactions on Information Theory. 2004. Vol. 50. Iss. 8. PP. 1788–1793. DOI:10.1109/TIT.2004.831841Fossorier M.P.C. Quasi-cyclic low-density parity-check codes from circulant permutation matrices. IEEE Transactions on Information Theory. 2004;50(8):1788–1793. DOI:10.1109/TIT.2004.831841Krouk E., Ovchinnikov A. 2-Stripes Block-Circulant LDPC Codes for Single Bursts Correction // Proceedings of the 9th International KES Conference on Intelligent Interactive Multimedia: Systems and Services (KES-IIMSS-16, Puerto de la Cruz, Tenerife, Spain, 15‒17 June 2016). Smart Innovation, Systems and Technologies. Vol. 55. Cham: Springer, 2016. PP. 11–23. DOI:10.1007/978-3-319-39345-2_2Krouk E., Ovchinnikov A. 2-Stripes Block-Circulant LDPC Codes for Single Bursts Correction. Proceedings of the 9th International KES Conference on Intelligent Interactive Multimedia: Systems and Services, KES-IIMSS-16, 15‒17 June 2016, Puerto de la Cruz, Tenerife, Spain. Smart Innovation, Systems and Technologies, vol.55. Cham: Springer; 2016. p.11–23. DOI:10.1007/978-3-319-39345-2_2Veresova A.M., Ovchinnikov A.A. About One Algorithm for Correcting Bursts Using Block-Permutation LDPC-Codes // Proceedings of the Conference on Wave Electronics and its Application in Information and Telecommunication Systems (WECONF, St. Petersburg, Russia, 03‒07 June 2019). IEEE, 2019. DOI:10.1109/WECONF.2019.8840580Veresova A.M., Ovchinnikov A.A. About One Algorithm for Correcting Bursts Using Block-Permutation LDPC-Codes. Proceedings of the Conference on Wave Electronics and its Application in Information and Telecommunication Systems, WECONF, 03‒07 June 2019, St. Petersburg, Russia. IEEE; 2019. DOI:10.1109/WECONF.2019.8840580

The authors declare that there are no conflicts of interest present.