Threshold decoding of hospitals self-original conventional codes

Abstract

The efficiency of threshold decoding of non-binary self-orthogonal convolutional codes in the communication channel with additive white Gaussian noise with the correction of t (t ≥ 1) symbolic errors is considered. The characters or elements of the code sequence (CS) used by the self-triggered convolutional code with the code transmission rate equaled R = k0/n0 = 1/2 are the elements of the final field GF(ai), i ≥ 2. The number of erroneous code symbols and their positions in the received CS on the length of the code constraint equaled na = (m + 1)∙n0 binary symbols is determined by the decoder based on the structure of the generated syndrome sequence (SS) S(x) = {S0, S1, …, SN}, depending on the structure of errors in the communication channel and the structure of the generating polynomials: m is maximum degree of the generating polynomials. It has been established that while preserving the merits of the threshold decoding algorithm, an increase in i (i ≥ 2) times the multiplicity of corrected errors is ensured by binary self-orthogonal codes with an equal transfer rate of codes.

Keywords

• self-orthogonal convolutional code
• code sequences
• code speed
• threshold decoding
• generator polynomial