Share Email Print
cover

Proceedings Paper

Implementation complexity analysis of the turbo decoding algorithms on digital signal processor
Author(s): Olexander N. Romanyuk; Yuriy Yu. Ivanov; Oleg V. Bisikalo; Oleg V. Stukach; Ruslana V. Ignatovska; Ryszard S. Romaniuk; Zhanar Azeshova
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this article, we work with turbo codes, which are widely used to reduce bit error rate in digital communication systems. we start with a brief discussion of the mathematical apparatus, which is connected with the turbo decoding algorithms. the key implementation issue for these algorithms is the overall high decoding complexity. therefore have been presented some estimations of the implementation complexity of the turbo decoding algorithms on digital signal processor.

Paper Details

Date Published: 1 October 2018
PDF: 8 pages
Proc. SPIE 10808, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2018, 1080820 (1 October 2018); doi: 10.1117/12.2501504
Show Author Affiliations
Olexander N. Romanyuk, Vinnytsia National Technical Univ. (Ukraine)
Yuriy Yu. Ivanov, Vinnytsia National Technical Univ. (Ukraine)
Oleg V. Bisikalo, Vinnytsia National Technical Univ. (Ukraine)
Oleg V. Stukach, National Research Tomsk Polytechnic Univ. (Russian Federation)
Ruslana V. Ignatovska, Odessa State Univ. of Internal Affairs (Ukraine)
Ryszard S. Romaniuk, Warsaw Univ. of Technology (Poland)
Zhanar Azeshova, Kazakh National Research Technical Univ. (Kazakhstan)


Published in SPIE Proceedings Vol. 10808:
Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2018
Ryszard S. Romaniuk; Maciej Linczuk, Editor(s)

© SPIE. Terms of Use
Back to Top