Comparative analysis of the complexity of decoding methods for turbo codes
Keywords:
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-codesAbstract
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.Downloads
-
PDF (Українська)
Downloads: 260
Abstract views: 267
How to Cite
[1]
A. Y. Kulyk, S. H. Kryvohubenko, and Y. Y. Ivanov, “Comparative analysis of the complexity of decoding methods for turbo codes”, ІТКІ, vol. 26, no. 1, Nov. 2013.
Issue
Section
Information technology and coding theory