Fast List Viterbi Decoding and Application for Source-Channel Coding of Images. 2. rev. ed.

Röder, Martin; Hamzaoui, Raouf

Fast List Viterbi Decoding and Application for Source-Channel Coding of Images. 2. rev. ed.

Files

preprint_182.pdf(211.79 KB)

Date

2005

Authors

Röder, Martin

Hamzaoui, Raouf

Series

Konstanzer Schriften in Mathematik und Informatik; 182

Publication type

Preprint

Abstract

A list Viterbi algorithm (LVA) finds n most likely paths in a trellis diagram of a convolutional code. One of the most efficient LVAs is the tree-trellis algorithm of Soong and Huang. We propose a new implementation of this algorithm. Instead of storing the candidate paths in a single list sorted according to the metrics of the paths, we show that it is computationally more efficient to use several unsorted lists, where all paths of the same list have the same metric. For an arbitrary integer bit metric, both the time and space complexity of our implementation are linear in n. Experimental results for a binary symmetric channel and an additive white Gaussian noise channel show that our implementation is much faster than all previous LVAs. This allows us to consider a large number of paths in acceptable time. As an application, we show that by increasing the number of candidate paths, one can significantly improve the performance of a popular progressive source-channel coding system that protects an embedded image code with a concatenation of an outer error detecting code and an inner error correcting convolutional code.

Subject (DDC)

004 Computer Science

Cite This

ISO 690

RÖDER, Martin, Raouf HAMZAOUI, 2005. Fast List Viterbi Decoding and Application for Source-Channel Coding of Images. 2. rev. ed.

BibTex

@unpublished{Roder2005Viter-6307,
  year={2005},
  title={Fast List Viterbi Decoding and Application for Source-Channel Coding of Images. 2. rev. ed.},
  author={Röder, Martin and Hamzaoui, Raouf}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/6307">
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6307/1/preprint_182.pdf"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Hamzaoui, Raouf</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:11:20Z</dc:date>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6307"/>
    <dc:language>eng</dc:language>
    <dc:contributor>Hamzaoui, Raouf</dc:contributor>
    <dc:format>application/pdf</dc:format>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6307/1/preprint_182.pdf"/>
    <dcterms:title>Fast List Viterbi Decoding and Application for Source-Channel Coding of Images. 2. rev. ed.</dcterms:title>
    <dcterms:issued>2005</dcterms:issued>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Röder, Martin</dc:creator>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:abstract xml:lang="eng">A list Viterbi algorithm (LVA) finds n most likely paths in a trellis diagram of a convolutional code. One of the most efficient LVAs is the tree-trellis algorithm of Soong and Huang. We propose a new implementation of this algorithm. Instead of storing the candidate paths in a single list sorted according to the metrics of the paths, we show that it is computationally more efficient to use several unsorted lists, where all paths of the same list have the same metric. For an arbitrary integer bit metric, both the time and space complexity of our implementation are linear in n. Experimental results for a binary symmetric channel and an additive white Gaussian noise channel show that our implementation is much faster than all previous LVAs. This allows us to consider a large number of paths in acceptable time. As an application, we show that by increasing the number of candidate paths, one can significantly improve the performance of a popular progressive source-channel coding system that protects an embedded image code with a concatenation of an outer error detecting code and an inner error correcting convolutional code.</dcterms:abstract>
    <dc:contributor>Röder, Martin</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:11:20Z</dcterms:available>
  </rdf:Description>
</rdf:RDF>

Bibliography of Konstanz

Yes