1. Science
  2. Publications
  3. Scientific Works of Kharkiv National Air Force University
  4. 1(27)'2011
  5. The computational complexity of coding and decoding of algebraic concatenated convolutional codes in the time and frequency domain

The computational complexity of coding and decoding of algebraic concatenated convolutional codes in the time and frequency domain

S.I. Prihodko, A.S. Volkov
Annotations languages:

The proposed complexity of methods for encoding and decoding of algebraic concatenated convolutional codes in the time and frequency domain. It is shown that the methods of encoding and decoding of algebraic concatenated convolutional codes in the frequency domain based on FFT-algorithms the Cooley-Tukey and Good-Thomas can reduce the computational complexity.
Keywords: error correcting coding, convolutional codes, concatenated codes, FFT-algorithm, Fourier transform, computational complexity
Reference:
Prykhodko, S.Y. and Volkov, A.S. (2011), "Vыchyslytelnaia slozhnost metodov kodyrovanyia y dekodyrovanyia alhebraycheskykh kaskadnыkh svertochnыkh kodov vo vremennoi y chastotnoi oblasty" , Scientific Works of Kharkiv National Air Force University, Vol. 1(27), pp. 154-158.