Publikation: Fast list Viterbi decoding and application for source-channel coding of images
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
A list Viterbi algorithm (LVA) finds the n best paths in a trellis. We propose a new implementation of the tree-trellis LVA. Instead of storing all paths in a single sorted list, we show that it is more efficient to use several lists, where all paths of the same list have the same metric. For an integer metric, both the time and space complexity of our implementation are linear in n. Experimental results show that our implementation is much faster than all previous LVAs. This allows us to consider a large number of paths in acceptable time, which significantly improves the performance of a popular progressive source-channel coding system that protects embedded data with a concatenation of an outer error detecting code and an inner error correcting convolutional code.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
RÖDER, Martin, Raouf HAMZAOUI, 2002. Fast list Viterbi decoding and application for source-channel coding of images. IEEE International Conference on Multimedia and Expo (ICME). Lausanne, Switzerland. In: Proceedings. IEEE International Conference on Multimedia and Expo. IEEE, 2002, pp. 801-804. ISBN 0-7803-7304-9. Available under: doi: 10.1109/ICME.2002.1035903BibTex
@inproceedings{Roder2002Viter-23129, year={2002}, doi={10.1109/ICME.2002.1035903}, title={Fast list Viterbi decoding and application for source-channel coding of images}, isbn={0-7803-7304-9}, publisher={IEEE}, booktitle={Proceedings. IEEE International Conference on Multimedia and Expo}, pages={801--804}, 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/23129"> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-26T09:52:14Z</dcterms:available> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dcterms:bibliographicCitation>Proceedings, 2002 IEEE International Conference on Multimedia and Expo : August 26 - 29, 2002, Swiss Federal Institute of Technology, Lausanne, Switzerland; vol. 1. - Piscataway, NJ : IEEE Operations Center, 2002. - S. 801-804. - ISBN 0-7803-7304-9</dcterms:bibliographicCitation> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/23129"/> <dc:contributor>Röder, Martin</dc:contributor> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23129/1/Roeder_231293.pdf"/> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23129/1/Roeder_231293.pdf"/> <dcterms:title>Fast list Viterbi decoding and application for source-channel coding of images</dcterms:title> <dcterms:abstract xml:lang="eng">A list Viterbi algorithm (LVA) finds the n best paths in a trellis. We propose a new implementation of the tree-trellis LVA. Instead of storing all paths in a single sorted list, we show that it is more efficient to use several lists, where all paths of the same list have the same metric. For an integer metric, both the time and space complexity of our implementation are linear in n. Experimental results show that our implementation is much faster than all previous LVAs. This allows us to consider a large number of paths in acceptable time, which significantly improves the performance of a popular progressive source-channel coding system that protects embedded data with a concatenation of an outer error detecting code and an inner error correcting convolutional code.</dcterms:abstract> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-26T09:52:14Z</dc:date> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Hamzaoui, Raouf</dc:contributor> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:language>eng</dc:language> <dc:creator>Hamzaoui, Raouf</dc:creator> <dcterms:issued>2002</dcterms:issued> <dc:creator>Röder, Martin</dc:creator> <dc:rights>terms-of-use</dc:rights> </rdf:Description> </rdf:RDF>