Simulation of turbo convolutional codes
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F12%3APU99907" target="_blank" >RIV/00216305:26220/12:PU99907 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Simulation of turbo convolutional codes
Original language description
Turbo codes show a large code gain at high data rates and even with a relatively simple implementation. Properties of these codes provide a low error rate at low values of signal-noise ratio that is close to the Shannon limit. The article is focused on the issue of turbo convolutional code encoder design and coding of these codes. Furthermore, it presents the principle of iterative decoding of these codes using the Viterbi algorithm with soft input and soft output. The performance of turbo convolutionalcode is demonstrated in simulations. These simulations are performed based on the code optional parameters that affect the bit error rate, code gain and computational complexity.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JA - Electronics and optoelectronics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Research in Telecommunication Technologies 2012
ISBN
978-80-554-0570-4
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
235-240
Publisher name
Neuveden
Place of publication
Žilina, Slovenská republika
Event location
Vrátna, SK
Event date
Sep 1, 2012
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—