- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 3 of 3 (0.06 seconds)Spelling suggestions: "subject:"faltungscodes"" "subject:"faltungscode""
| 1 |
Effiziente Viterbi Decodierung und Anwendung auf die Bildübertragung in gestörten KanälenRöder, Martin 26 October 2017 (has links)
Faltungscodes ist der Viterbi Algorithmus, der aus einem empfangenen, codierten Datenblock die Daten ermittelt, die der Sender mit höchster Wahrscheinlichkeit gesendet hat. Auf dem Viterbi Algorithmus basieren die List Viterbi Algorithmen, die nicht nur die wahrscheinlichste Lösung, sondern eine Liste der n wahrscheinlichsten Lösungen (Pfade) finden. Im ersten Teil der Arbeit werden die aus der Literatur bekannten List Viterbi Algorithmen beschrieben, analysiert und hinsichtlich ihrer Komplexität verglichen. Es wird außerdem eine spezielle Implementation des Tree Trellis Algorithmusvorgeschlagen, durch die eine Komplexitätsreduzierung von quadratischer auf lineare Zeitkomplexität möglich ist. Der zweite Teil der Arbeit betrachtet die Anwendung von Faltungscodes auf die Bildübertragung. Es wird gezeigt, daß die durch die Reduzierung der Zeitkomplexität mögliche Erhöhung der Anzahl der bei der Decodierung betrachteten Pfade die Ergebnisse eines bestehenden Verfahrens zur Bildübertragung signifikant verbessert.
|
| 2 |
Comparison of LDPC Block and LDPC Convolutional Codes based on their Decoding LatencyHassan, Najeeb ul, Lentmaier, Michael, Fettweis, Gerhard P. 11 February 2013 (has links) (PDF)
We compare LDPC block and LDPC convolutional codes with respect to their decoding performance under low decoding latencies. Protograph based regular LDPC codes are considered with rather small lifting factors. LDPC block and convolutional codes are decoded using belief propagation. For LDPC convolutional codes, a sliding window decoder with different window sizes is applied to continuously decode the input symbols. We show the required Eb/N0 to achieve a bit error rate of 10 -5 for the LDPC block and LDPC convolutional codes for the decoding latency of up to approximately 550 information bits. It has been observed that LDPC convolutional codes perform better than the block codes from which they are derived even at low latency. We demonstrate the trade off between complexity and performance in terms of lifting factor and window size for a fixed value of latency. Furthermore, the two codes are also compared in terms of their complexity as a function of Eb/N0. Convolutional codes with Viterbi decoding are also compared with the two above mentioned codes.
|
| 3 |
Comparison of LDPC Block and LDPC Convolutional Codes based on their Decoding LatencyHassan, Najeeb ul, Lentmaier, Michael, Fettweis, Gerhard P. January 2012 (has links)
We compare LDPC block and LDPC convolutional codes with respect to their decoding performance under low decoding latencies. Protograph based regular LDPC codes are considered with rather small lifting factors. LDPC block and convolutional codes are decoded using belief propagation. For LDPC convolutional codes, a sliding window decoder with different window sizes is applied to continuously decode the input symbols. We show the required Eb/N0 to achieve a bit error rate of 10 -5 for the LDPC block and LDPC convolutional codes for the decoding latency of up to approximately 550 information bits. It has been observed that LDPC convolutional codes perform better than the block codes from which they are derived even at low latency. We demonstrate the trade off between complexity and performance in terms of lifting factor and window size for a fixed value of latency. Furthermore, the two codes are also compared in terms of their complexity as a function of Eb/N0. Convolutional codes with Viterbi decoding are also compared with the two above mentioned codes.
|
Page generated in 0.0658 seconds