Iterative hard­-decision decoding of combined cyclic codes

Abstract

<p>We propose error correction iteratively decodable cyclic codes (IDCC) that consist of two cyclic Hamming codes with different generator polynomials. As a mathematical apparatus, we apply the theory of linear finite-state machines (LFSM) in binary Galois fields. A generalized decoding algorithm was constructed based on power permutation of bits in the code word and the new technique for combining the codes.</p><p>By using hard decisions only, it is possible to achieve high speed and simple hardware-software implementation of encoder and decoder on linear feedback shift registers. The IDCC (n, k)-code makes it possible to correct the errors of multiplicity to (n−k). A code word may have arbitrary length: both small and large. Code rate (k/n) is close to one.</p><p>It was established in the course of research that approaching the theoretical limit (border) by Shannon maximally close significantly increases length of codes, complicates encoders and decoders, increases a delay in decoding, and other problems appear. That is why the main criterion for the optimality of error correction coding is proposed to be those code characteristics that are important for practical application (time and hardware costs, focus on contemporary circuitry and parallel processing). From this point of view, the developed IDCC codes can be considered as an alternative to well-known iterative codes (LDPC codes and turbo codes) whose main advantage is the maximum proximity to the Shannon limit.</p><p class="IwimSection">This is important because at the present stage of development of science and technology one of the relevant scientific and technological problems is the task on ensuring high reliability of data transmission in different systems of digital communication. The proposed codes make it possible to solve the specified task at minimal resource costs and high efficiency.</p>

Authors and Affiliations

Vasyl Semerenko

Keywords

Related Articles

Theoretical study into efficiency of the improved longitudinal profile of frogs at railroad switches

<p>We have developed a comprehensive method to prolong the time of operation of frogs at railroad switches, based on the consideration of a longitudinal profile of the frog, the magnitude of dynamic forces and normal str...

Analog of the classical borel theorem for entire harmonic functions in ℝn and generalized orders

<p>The article describes research on the growth of functions that are harmonic in the whole space ℝ<sup>n</sup>, n≥3, and thus they are called entire harmonic.</p><p>A relation has been established between the maximum te...

Examining the effect of production conditions at territorial logistic systems of milk harvesting on the parameters of a fleet of specialized road tanks

<p class="a"><span lang="EN-US">We have studied the influence of changing production conditions and components of transportation processes on the need in specialized vehicles in the milk harvesting systems. Based on the...

Study of the mathematical models of optimal partitioning for particular cases

<p>The basic problem of optimal sets partitioning (OSP) for the case, where a segment of a plane curve is a set, was stated. The problem is stated as follows: let us assume there is a segment of a plane curve, it is requ...

Selection of new working fluids for a heat-using compression refrigerating machine with the block «turbine- compressor»

<p>The compression heat-using refrigerating machines operating in the Chistiakov-Plotnikov cycle use recycled waste heat of power machines as primary energy for producing cold of various temperature potentials thus savin...

Download PDF file
  • EP ID EP527802
  • DOI 10.15587/1729-4061.2018.123207
  • Views 95
  • Downloads 0

How To Cite

Vasyl Semerenko (2018). Iterative hard­-decision decoding of combined cyclic codes. Восточно-Европейский журнал передовых технологий, 1(9), 61-72. https://europub.co.uk/articles/-A-527802