?
Уменьшение сложности декодера МПП кодов c параллельным расписанием построенных на базе Information Bottleneck
С. 1–8.
Publication based on the results of:
In book
Институт проблем передачи информации им. А.А. Харкевича РАН, 2022.
Morozov V., Башара В. О., Емельяненко М. В., В кн.: Параллельные вычислительные технологии – XIX всероссийская научная конференция с международным участием, ПаВТ’2025, г. Москва, 8–10 апреля 2025 г. Короткие статьи и описания плакатов.: Челябинск: Издательский центр ЮУрГУ, 2025. С. 193–210.
Error correction in the secret key is a mandatory step in quantum key distribution (QKD) protocols. Usually, modern error-correcting codes are used for its implementation. Imperfections of the hardware used in QKD systems lead to bit flipping errors in the channel. Moreover, such systems are characterized by an asymmetric distribution of such errors. Taking into ...
Added: June 3, 2025
Osipov D., / Series arXiv "math". 2022. No. 1.
This paper devotes to comparison of different cod- ing schemes (various constructions of Polar and LDPC codes, Product codes and BCH codes) for the case when information is transmitted over AWGN channel with quantization with lowest possible complexity and resolution: 1-bit. We examine performance (in terms of Frame-error-rate — FER) for schemes mentioned above and ...
Added: December 27, 2022
Угловский А., Алексеев И., Щукин В. et al., В кн.: ИТиС 2022: Сборник трудов 46-й междисциплинарной школы-конференции ИППИ РАН "Информационные технологии и системы 2022".: Институт проблем передачи информации им. А.А. Харкевича РАН, 2022. С. 1–11.
Одной из ключевых проблем МПП-кодов является оценка низкого уровня ошибок, возникающего при относительно высоком уровне отношения сигнал – шум (SNR). Данное явление обусловлено в основном замедленным декодированием таких особенных структур как Трэппинг Сет (Trapping Set, TS), которые даже при высоком SNR могут привести к ошибке декодера. Исследование и оценка сверхнизкого уровня ошибок являются важными и ...
Added: October 26, 2022
Воробьев Д. И., Гаев В., В кн.: ИТиС 2022: Сборник трудов 46-й междисциплинарной школы-конференции ИППИ РАН "Информационные технологии и системы 2022".: Институт проблем передачи информации им. А.А. Харкевича РАН, 2022. С. 1–6.
В данной работе представлено сравнение грубо квантованных LDPC декодеров с различной степенью квантования. Методом квантования (сжатия) пересылаемых в ходе декодирования сообщений является метод информационно-узкого места (англ.: Information bottleneck method --- IB). Пересылаемые между переменными (англ.: Variable Node, VN) и проверочными (англ.: Check Node, CN) узлами сообщения передаются и обрабатываются в сжатом виде, при чем степень ...
Added: October 26, 2022
Курилов О. Ю., Гаев В., В кн.: ИТиС 2022: Сборник трудов 46-й междисциплинарной школы-конференции ИППИ РАН "Информационные технологии и системы 2022".: Институт проблем передачи информации им. А.А. Харкевича РАН, 2022. С. 1–8.
Данная работа посвящена исследованию MinLUT декодера с различными видами квантования. В ходе исследования обнаружено, что с некоторого момента число итераций декодера играет незначительную роль в производительности декодера вне зависимости от вида квантования. Данная статья частично посвящена исследованию именно этого эффекта. ...
Added: October 26, 2022
Ivanov F., Rybin P., , in: Proceedings of 2017 VI-th International Conference on Engineering and Telecommunication (EnT) 29-30 Nov. 2017.: IEEE Computer Society, 2017. P. 67–71.
In this paper we present a new ensemble of Low- Density Parity-Check codes (LDPC Codes) based on modular Golomb rulers and permutation matrices. We suggest a designing rule for these codes that allows obtaining a nested family of LDPC codes with wide range of rates from one matrix of lowest rate code. Moreover, the regular ...
Added: October 4, 2018
Frolov A., Rybin P., Ivanov F., , in: Proceedings of the 2016 XV International Symposium «Problems of Redundancy in Information and Control Systems.: Institute of Electrical and Electronics Engineers ( IEEE ), 2016. P. 48–52.
Non-orthogonal multiple access schemes are of great interest for next generation wireless systems, as such schemes allow to reduce the total number of resources (frequencies or time slots) in comparison to orthogonal transmission (TDMA, FDMA, CDMA). In this paper we consider an iterative LDPC-based joint decoding scheme suggested in [1]. We investigate the most difficult ...
Added: October 4, 2018
Rybin P., Ivanov F., Информационные процессы 2017 Т. 17 № 4 С. 284–293
This paper deals with the error exponent of the regular graph-based binary low-density parity-check (LDPC) codes under the maximum likelihood (ML) decoding algorithm in the binary symmetric channel (BSC). Unlike other papers where error exponents are considered for the case when the length of LDPC codes tends to infinity (asymptotic analysis) we considered the finite ...
Added: October 4, 2018
Ivanov F., Zhilin I., Automation and Remote Control 2016 Vol. 77 No. 10 P. 1781–1791
A modification of the decoding q-ary Sum Product Algorithm (q-SPA) was proposed for the nonbinary codes with small check density based on the permutation matrices. The algorithm described has a vector realization and operates over the vectors defined on the field GF(q), rather than over individual symbols. Under certain code parameters, this approach enables significant speedup of modeling. ...
Added: October 3, 2018
Ivanov F., Проблемы передачи информации 2017 Т. 53 № 3 С. 30–43
We propose a new ensemble of binary low-density parity-check codes with paritycheck matrices based on repetition codes and permutation matrices. The proposed class of codes is a subensemble of quasi-cyclic codes. For the constructed ensemble, we obtain minimum distance estimates. We present simulation results for the proposed code constructions under the (Sum-Product) iterative decoding algorithm ...
Added: February 1, 2018
Ivanov F., Zyablov V., Потапов В. Г., Информационные процессы 2012 Т. 12 № 1 С. 68–83
Methods for constructing a mapping of the elements of a multiplicative group of a Galois field onto a symmetric group of permutation matrices are proposed. A technique minimizing the order of the symmetric group is suggested. The results are used for constructing an ensemble of low-density parity-check codes. The obtained code constructions are tested on ...
Added: December 11, 2017
Ivanov F., Zhilin I., Автоматика и телемеханика 2016 Т. 10 С. 109–122
A modification of the decoding q-ary Sum Product Algorithm (q-SPA) was proposed for the nonbinary codes with small check density based on the permutation matrices. The algorithm described has a vector realization and operates over the vectors defined on the field GF(q), rather than over individual symbols. Under certain code parameters, this approach enables significant ...
Added: December 11, 2017
Zyablov V., Rybin P., Problems of Information Transmission 2009 Vol. 45 No. 3 P. 204–220
We generalize the method for computing the number of errors correctable by a low-density parity-check (LDPC) code in a binary symmetric channel, which was proposed by V.V. Zyablov and M.S. Pinsker in 1975. This method is for the first time applied for computing the fraction of guaranteed correctable erasures for an LDPC code with a ...
Added: December 11, 2017
Zyablov V., Rybin P., Problems of Information Transmission 2012 Vol. 48 No. 4 P. 297–323
A new method for estimating the number of errors guaranteed to be corrected by a low-density parity-check code is proposed. The method is obtained by analyzing edges with special properties of an appropriate Tanner graph. In this paper we consider binary LDPC codes with constituent single-parity-check and Hamming codes and an iterative decoding algorithm. Numerical ...
Added: December 11, 2017
Ivanov F., Зяблов В. В., Проблемы передачи информации 2013 Т. 49 № 4 С. 41–56
An algorithm for generating parity-check matrices of regular low-density paritycheck codes based on permutation matrices and Steiner triple systems S(v, 3, 2), v = 2m − 1, is proposed. Estimations of the rate, minimum distance, and girth for obtained code constructions are presented. Results of simulation of the obtained code constructions for an iterative “belief propagation” (Sum-Product) decoding algorithm ...
Added: December 11, 2017
Rybin P., Zyablov V., Problems of Information Transmission 2015 Vol. 51 No. 3 P. 205–216
Two ensembles of low-density parity-check (LDPC) codes with low-complexity decoding algorithms are considered. The first ensemble consists of generalized LDPC codes, and the second consists of concatenated codes with an outer LDPC code. Error exponent lower bounds for these ensembles under the corresponding low-complexity decoding algorithms are compared. A modification of the decoding algorithm of ...
Added: December 11, 2017
Rybin P., Journal of Communications Technology and Electronics 2016 Vol. 61 No. 12 P. 1432–1439
This paper deals with the irregular binary low-density parity-check (LDPC) codes and two iterative low-complexity decoding algorithms. The first one is the majority error-correcting decoding algorithm, and the second one is iterative erasure-correcting decoding algorithm. The lower bounds on correcting capabilities (the guaranteed corrected error and erasure fraction respectively) of irregular LDPC code under decoding ...
Added: December 11, 2017