A comparative study of computer algorithms proposed encoding and decoding concatenated codes in the frequency domain, which showed that the transition in the frequency domain conversion usually leads to a substantial reduction of computational complexity. This reduction is comparable to the transition from a given code block length to the respective stages of the same length. Application code simultaneously cascade structures and computational procedures in the frequency domain allows the smallest computational complexity.
generalized concatenated code spectral properties codes multidimensional spectra, computational complexity, algorithms for encoding / decoding concatenated codes with changes in the frequency domain, Fourier transform
"Vыchyslytelnaia slozhnost alhorytmov kodyrovanyia/dekodyrovanyia kaskadnыmy kodamy v chastotnoi oblasty" ,
Information Processing Systems,