Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Вестник Воронежского государственного технического университета

Эффективное многопороговое декодирование недвоичных кодов с предварительной оценкой ошибочности проверок

А В Башкиров, Свиридова Ирина Владимировна, А. В. Муратов

Published Jan 1, 2015• 0 citations
OpenAlex

Abstract

This article presents a synthesis of the basic principles of multithreshold decoding (MTD) for non-binary codes. It is shown that the effectiveness of non-binary MTD is close to the results, provides an optimal exhaustive search methods, which for non-binary codes usually unrealizable. The problems of the complexity of proposed decoders

Related papers

Декодирование самоортогональных помехоустойчивых кодов с помощью многопорогового и min-sum алгоритмов

Natalya N. Grinchenko, В Т Као, Gennady V. Ovechkin

It’s discusses the self-orthogonal error-correcting codes (SOC) commonly decoded with multithreshold decoders (MTD). It is shown algorithms used for low-density parity-check codes (LDPC) decoding can be applied for SOC decoding. It is shown that the use of min-sum algorithm for decoding of SOC with code rate 1/2 in a channel with additive white Gaussian noise (AWGN) with binary phase-shift keying and soft demodulation would provide additional coding gain about 1..1,5 dB compared with MTD. Thus, the computational complexity of min-sum algorithm is 6...7 times more than the complexity of MTD. In this paper is proposed the composite decoder comprising elements of MTD and min-sum algorithms for decoding of SOC. Thus on the first few iterations of decoding it is used min-sum decoder and after MTD is used. The simulation results of the proposed decoding scheme show that its use can improve the coding gain compared with MTD approximately 1 dB for SOC with code rate 1/2 over AWGN channel with binary phase-shift keying at cost of doubling in computational complexity. At the same time coding gain depends on the SOC, the number of decoding iterations of min-sum and MTD algorithms.

Современные проблемы науки и образования•Jan 1, 2015•0 citations

Algorithm of multithreshold decoding for Gaussian channels

V. V. Zolotarev, Gennady V. Ovechkin

Major principles of the method of the linear codes multithreshhold decoding as search for the global functional extremum for a great number of variables are considered. It was demonstrated that the multithreshold decoding efficiency is close to the results ensured by the optimum exhaustive search methods. Decoding complexity under software and hardware realizations is evaluated.

Automation and Remote Control•Jun 1, 2008•9 citations

Improving performance of multithreshold decoder over binary erasure channel

Natalya N. Grinchenko, Artem Sergeyevich Gromov, Gennady V. Ovechkin

The article discusses self-orthogonal error-correcting codes (SOC) for the decoding of which multithreshold algorithms (MTD) are usually used. The work gives the results of the research of MTD efficiency in binary erasure channels. Also new, longer and more efficient convolutional SOCs are received, comparative analysis of MTD efficiency and the efficiency of best methods to recover erasures is made. It is offered new concatenated code consisting of SOC and parity-check code for binary erasure channel allowing to decrease bit unrecovered erasure probability in the area of MTD efficient operation to 2..3 decimal orders. Lower bounds on bit unrecovered erasure probabilities for a decoder of the concatenated code are given; the its simulation results are discussed.

Mediterranean Conference on Embedded Computing (MECO)•Jun 1, 2017•6 citations

Алгоритм построения самоортогональных кодов для многопороговых декодеров

Овечкин Геннадий Владимирович, P. V. Ovechkin, Гринченко Наталья Николаевна +1 more

An algorithm for self-orthogonal codes (SOC) construction is developed. These codes are applied with multithreshold decoders (MTD) and can provide good error correcting ability at high noise level. This algorithm constructs codes with lower error propagation due to optimizing weight of information and check branches. Such codes allow to perform near optimal decoding at lower signal to noise ratio than codes known earlier.

Известия Тульского государственного университета. Технические науки•Jan 1, 2013•0 citations

Improving performance of multithreshold decoder for self-orthogonal codes

Aleksey I. Baranchikov, Natalya N. Grinchenko, Gennady V. Ovechkin

The article discusses self-orthogonal error-correcting codes (SOC) for the decoding of which multithreshold algorithms (MTD) are usually used. To decode SOC the algorithms used for low-density parity-check (LDPC) codes can also be applied. The article shows that using a min-sum decoder for SOC over a channel with additive white Gaussian noise (AWGN) in case of binary phase shift keying allows to receive additional coding gain about 1..1,5 dB in comparison with MTD usage. At the same time computing complexity in a min-sum algorithm turns out to be 6...7 times higher than MTD. For SOC decoding the work offers a combined decoder including the elements of MTD and min-sum algorithms. The first several decoding iterations require the usage of min-sum decoder while later MTD is added. The results of offered decoder simulation show about 1 dB increase of coding gain in comparison with MTD for SOC over a channel with AWGN with binary phase shift keying in case of twofold increase of computing complexity. The gain received depends on the SOC used, the number of min-sum decoding iterations and MTD.

Mediterranean Conference on Embedded Computing (MECO)•Jun 1, 2016•1 citation

Algorithm of multithreshold decoding for non-binary self-orthogonal concatenated codes

V. V. Zolotarev, Yerzhan N. Seitkulov, Gennady V. Ovechkin +3 more

Non-binary multithreshold decoding (qMTD) for q-ary self-orthogonal codes (qSOC) is considered. The SER performance of qMTD is shown to be close to the results provided by optimum total search methods, which are not realizable for non-binary codes in general. qMTD decoders are compared with different decoders for Reed-Solomon codes. The performance provided with qMTD in some cases is unattainable with classical decoders for arbitrary long Reed-Solomon codes. The result of concatenation of qSOC with simple to decode outer codes is described. Method of improving of qMTD decoder's performance for qSOC is offered. Some simulated results obtained by using these two decoding techniques (the base and modified ways) are presented as well. Comparison of the results showed that the change in the threshold element's algorithm can significantly improve speed of qMTD work. It's shown that for a larger gain this modification qMTD should be used after conventional decoding iterations.

IEEE International Conference on Application of Information and Communication Technologies (AICT)•Oct 1, 2014•1 citation
It’s discusses the self-orthogonal error-correcting codes (SOC) commonly decoded with multithreshold decoders (MTD). It is shown algorithms used for low-density parity-check codes (LDPC) decoding can be applied for SOC decoding. It is shown that the use of min-sum algorithm for decoding of SOC with code rate 1/2 in a channel with additive white Gaussian noise (AWGN) with binary phase-shift keying and soft demodulation would provide additional coding gain about 1..1,5 dB compared with MTD. Thus, the computational complexity of min-sum algorithm is 6...7 times more than the complexity of MTD. In this paper is proposed the composite decoder comprising elements of MTD and min-sum algorithms for decoding of SOC. Thus on the first few iterations of decoding it is used min-sum decoder and after MTD is used. The simulation results of the proposed decoding scheme show that its use can improve the coding gain compared with MTD approximately 1 dB for SOC with code rate 1/2 over AWGN channel with binary phase-shift keying at cost of doubling in computational complexity. At the same time coding gain depends on the SOC, the number of decoding iterations of min-sum and MTD algorithms.
The article discusses self-orthogonal error-correcting codes (SOC) for the decoding of which multithreshold algorithms (MTD) are usually used. The work gives the results of the research of MTD efficiency in binary erasure channels. Also new, longer and more efficient convolutional SOCs are received, comparative analysis of MTD efficiency and the efficiency of best methods to recover erasures is made. It is offered new concatenated code consisting of SOC and parity-check code for binary erasure channel allowing to decrease bit unrecovered erasure probability in the area of MTD efficient operation to 2..3 decimal orders. Lower bounds on bit unrecovered erasure probabilities for a decoder of the concatenated code are given; the its simulation results are discussed.
The article discusses self-orthogonal error-correcting codes (SOC) for the decoding of which multithreshold algorithms (MTD) are usually used. To decode SOC the algorithms used for low-density parity-check (LDPC) codes can also be applied. The article shows that using a min-sum decoder for SOC over a channel with additive white Gaussian noise (AWGN) in case of binary phase shift keying allows to receive additional coding gain about 1..1,5 dB in comparison with MTD usage. At the same time computing complexity in a min-sum algorithm turns out to be 6...7 times higher than MTD. For SOC decoding the work offers a combined decoder including the elements of MTD and min-sum algorithms. The first several decoding iterations require the usage of min-sum decoder while later MTD is added. The results of offered decoder simulation show about 1 dB increase of coding gain in comparison with MTD for SOC over a channel with AWGN with binary phase shift keying in case of twofold increase of computing complexity. The gain received depends on the SOC used, the number of min-sum decoding iterations and MTD.
Non-binary multithreshold decoding (qMTD) for q-ary self-orthogonal codes (qSOC) is considered. The SER performance of qMTD is shown to be close to the results provided by optimum total search methods, which are not realizable for non-binary codes in general. qMTD decoders are compared with different decoders for Reed-Solomon codes. The performance provided with qMTD in some cases is unattainable with classical decoders for arbitrary long Reed-Solomon codes. The result of concatenation of qSOC with simple to decode outer codes is described. Method of improving of qMTD decoder's performance for qSOC is offered. Some simulated results obtained by using these two decoding techniques (the base and modified ways) are presented as well. Comparison of the results showed that the change in the threshold element's algorithm can significantly improve speed of qMTD work. It's shown that for a larger gain this modification qMTD should be used after conventional decoding iterations.