On the error-correcting capabilities of iterative error correction codes
Journal Title: Восточно-Европейский журнал передовых технологий - Year 2019, Vol 1, Issue 4
Abstract
<p>The influence of the theory of information on development of the error correcting coding theory has been studied. Main differences between the probabilistic approach and the deterministic approach in the analysis of error-correcting capabilities of different classes of linear codes have been demonstrated.</p><p>The automaton hierarchical models for analysis of permutation decoding of cyclic codes have been developed and a cyclic permutation generator based on two Moore automata has been proposed.<ins cite="mailto:1" datetime="2019-02-21T18:50"></ins></p><p>A study has been carried out into the regular and irregular states of linear finite-state machines (LFSM) based on the automaton representation of cyclic codes. A possibility of significant simplification of decoding of cyclic codes based on conversion of irregular LFSM syndromes into regular ones using permutations has been shown.</p><p>The formalized methods for determination of error-correcting capabilities of iteratively decoded cyclic codes (IDCC) have been devised. They imply the replacementof traditional complete checking of all possible options for comparison of code words to directional search for the solution of the assigned problem, which leads to a significant time saving for calculations. The algorithm for determination of error-correcting capabilities of IDCC with respect to double errors is given.</p><p>It has been shown that all iterative codes increase their error-correcting capabilities with an increase in the number of iterations and one can set it as a percentage for errors of various multiplicities. A distribution of error syndromes to separate iterations has been performed, which makes it possible to reduce the length of a check word in a code. As a result, this leads to an increase in a rate of iterative codes in comparison with the traditional correction codes.</p>A comparative analysis of IDCC and LDPC codes has been carried out to determine a scope of their optimal use
Authors and Affiliations
Vasyl Semerenko
Keywords
Related Articles
- EP ID EP666179
- DOI 10.15587/1729-4061.2019.157299
- Views 85
- Downloads 0
Formalization of the concept of adaptive tasks mapping in the reconfigurable computers on FPGA
<p>The effectiveness of data processing in the reconfigurable computer systems depends significantly on the unproductive time costs of the reconfiguration of the FPGA computational space. It is an important modern proble...
Experimental study into rotational-oscillatory vibrations of a vibration machine platform excited by the ball auto-balancer
<p>We have experimentally investigated the rotational-oscillatory vibrations of vibratory machine platform excited by the ball auto-balancer.</p><p>The law of change in the vibration accelerations at a platform was studi...
Development of the algorithm of video image adaptation to spectral power distribution of illuminants
Proposals for further progress of video technologies, issues that need to be resolved to implement this progress and possible ways to implement them in real devices of special and general application are made. It is prop...
Effect of the cryopowder "beet" on quality indicators of new curd desserts
<p>Natural plant bio-additives deserve special attention, because due to their natural properties they provide dairy products with functional properties. The use of such additives makes it possible to fill the shortage o...
Increasing the share of correct clustering of characteristic signal with random losses in self-organizing maps
<p class="Standard"><span lang="EN-US">Analysis of methods for optimizing algorithms of functioning of the Kohonen neural networks, self-organizing maps (SOM), in terms of training speed and percentage of correct cluster...