Received 21.12.2012, Revised 28.02.2013, Accepted 10.04.2013

Comparative analysis of the complexity of implementing turbo code decoding methods

Anatoly Kulyk, Serhii Kryvogubchenko, Yurii Ivanov

Considered problems of turbo coding, promising for using in distributed computer systems of different functional purpose.            Analysed SOVA, MAP, log-MAP and max-log-MAP algorithms. Completed the estimation complexity turbo-code decoding. Simulating the use of methods decoding turbo-codes for building hardware and software decoding signals in communication systems using the processing power of technical means and with research of probabilistic-energy characteristics

protecting coding, turbo-code, a generalized structure for work with information, LLR, the Viterbi algorithm, SOVA, MAP, log-MAP, max-log-MAP, the complexity of decoding turbo-codes
26-31
Kulyk, A., Kryvogubchenko, S., & Ivanov, Yu. (2013). Comparative analysis of the complexity of implementing turbo code decoding methods. Information Technologies and Computer Engineering, 10(1), 26-31.

References

References in the process of publication