Metody dekódování konvolučních kódů
Loading...
Date
Authors
ORCID
Advisor
Referee
Mark
B
Journal Title
Journal ISSN
Volume Title
Publisher
Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií
Abstract
Konvolučné kódy patria medzi lineárne stromové kódy. Sú to kódy používané pre kanálové kódovanie. Pri vypracovaní projektu, teda porovnaní jednotlivých algoritmov boli brané do úvahy Viterbiho algoritmus, Stack algoritmus, Stack-bucket algoritmus, Fano algoritmus a Feedback dekódovania. Bol zostavený návrh konvolučného kodéra a dekodéra, ktorý pri svojej činnosti využíva Viterbiho algoritmus a Stack algoritmus, čo slúži pre porovnanie oboch metód. Ukázalo sa, že Viterbiho algoritmus je vhodný hlavne pre kódy s menšou nútenou dĺžkou, pretože má pevné množstvo počítaní. Pri Stack algoritme je množstvo počítaní závislé na dĺžke prijatej sekvencie, čo môže mať za následok oveža menší počet počítaní, avšak pri vežmi hlučnom kanáli sa môže stať, že počítaní bude omnoho viac ako u Viterbiho algoritmu. Ničmenej je Stack algoritmus alebo jeho variácia Stack-bucket algoritmus používaný hlavne na kódy s väčšou nútenou dĺžkou. Feedback dekódovanie je zase pre jednoduchú konštrukciu dekodéra vhodnou alternatívou k dekódovaniu s najväčšou pravdepodobnosťou a k sekvenčnému dekódovaniu.
Convolutional codes belongs to among linear tree codes. There are codes used for channel coding. At build - up project, then comparison separate algorithms were gateway into the account Viterbiho algorithm, Stack algorithm, Stack- bucket algorithm, Fano algorithm and Feedback decoding. Was built-up suggestion convolutional encoder and decoder, which at his activities make use of Viterbiho algorithm and Stack algorithm, what serves for contrast of both methods. It turned out, that the Viterbiho algorithm get past in the main for codes with smaller compulsory longitude, because has stand-by cost quantity calculated effect. At Stack algorithms is quantity calculated effect dependent on longitude received sequence, what may result in much smaller number calculated effect, however at very noisy channel is able to state, that the calculated effect will much more as with Viterbiho algorithm. Nothing less is Stack algorithm or his variation Stack- bucket algorithm used primarily on codes with bigger compulsory longitude. Feedback decoding is gainst for simple construction decoder acceptable alternative toward decoding most likely and to sequential decoding.
Convolutional codes belongs to among linear tree codes. There are codes used for channel coding. At build - up project, then comparison separate algorithms were gateway into the account Viterbiho algorithm, Stack algorithm, Stack- bucket algorithm, Fano algorithm and Feedback decoding. Was built-up suggestion convolutional encoder and decoder, which at his activities make use of Viterbiho algorithm and Stack algorithm, what serves for contrast of both methods. It turned out, that the Viterbiho algorithm get past in the main for codes with smaller compulsory longitude, because has stand-by cost quantity calculated effect. At Stack algorithms is quantity calculated effect dependent on longitude received sequence, what may result in much smaller number calculated effect, however at very noisy channel is able to state, that the calculated effect will much more as with Viterbiho algorithm. Nothing less is Stack algorithm or his variation Stack- bucket algorithm used primarily on codes with bigger compulsory longitude. Feedback decoding is gainst for simple construction decoder acceptable alternative toward decoding most likely and to sequential decoding.
Description
Citation
VLČEK, P. Metody dekódování konvolučních kódů [online]. Brno: Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií. 2008.
Document type
Document version
Date of access to the full text
Language of document
sk
Study field
Teleinformatika
Comittee
doc. Ing. Vladimír Kapoun, CSc. (předseda)
doc. Ing. Václav Zeman, Ph.D. (místopředseda)
Ing. Petr Daněček, Ph.D. (člen)
Ing. Filip Buršík (člen)
Ing. Vítězslav Křivánek, Ph.D. (člen)
Ing. Radek Zezula, Ph.D. (člen)
Ing. Ondřej Krajsa, Ph.D. (člen)
Date of acceptance
2008-06-17
Defence
Co znamená zkratka BMC, kterou jste uvedl ve své práci a neuvedl jste její význam?
Jak jste testoval použité algoritmy?
Result of defence
práce byla úspěšně obhájena
Document licence
Standardní licenční smlouva - přístup k plnému textu bez omezení