UDC 621. 387.322
V. V. Zolotarev, Dr. Sc. (Tech.), full professor, Lead Researcher, SRI RAS, Moscow, Russia;
orcid.org/0000-0002-0277-6211, e-mail: This email address is being protected from spambots. You need JavaScript enabled to view it.
G. V. Ovechkin, Dr. Sc. (Tech.), full professor, Head of the Department, RSREU, Ryazan, Russia;
orcid.org/0000-0001-6887-2217, e-mail: This email address is being protected from spambots. You need JavaScript enabled to view it.
Ch. T. Zhung, postgraduate student, RSREU, Ryazan, Russia; e-mail: This email address is being protected from spambots. You need JavaScript enabled to view it.
Methods of simple implementation of concatenation in binary Gaussian channels based on multithreshold
decoders (MTD) for convolutional codes are considered. Cases of application in the second stage
of convolutional codes decoding for both binary and nonbinary classes, known in the Optimization Theory
(OT) as symbolic, are considered. A conclusion is made about a very simple implementation and about higher
efficiency characteristics of concatenated codes with MTD than those of the previous classical circuits
with Viterbi algorithm (VA) and Reed-Solomon (RS) (VA-RS) codes. It is noted that all schemes with MTD
have unlimited performance in hardware implementation. A very moderate increase in decoding delay is
indicated in comparison with non-concatenated versions of implementation, which is determined by the absence
of the need to use traditional two-dimensional concatenated structures.
Key words:
error-correction coding, Gaussian channel, multithreshold decoder, error propagation,
symbolic code, concatenated scheme, convolutional codes, block codes, decoder complexity, throughput,
Optimization Theory, self-orthogonal code, Reed-Solomon code.