Publikation: Rate-based versus distortion-based optimal error protection of embedded codes
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (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
We consider a joint source-channel coding system that protects an embedded bitstream using a finite family of channel codes with error detection and error correction capability. The performance of this system may be measured by the expected distortion or by the expected number of correctly decoded source bits. Whereas a rate-based optimal solution can be found in linear time, the computation of a distortion-based optimal solution is prohibitive. Under the assumption of the convexity of the operational distortion-rate function of the source coder, we give a lower bound on the expected distortion of a distortion-based optimal solution that depends only a rate-based optimal solution. Then, we conjecture that a distortion-based optimal solution uses the same number of fewer information bits than a rated-based optimal solution. Finally, we propose a local search algorithm that starts from a rate-based optimal solution and converges in linear time to a local minimum of the expected distortion. Experimental results for a binary symmetric channel show that our local search algorithm is near optimal, whereas its complexity is much lower than that of the previous best solution.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
HAMZAOUI, Raouf, Vladimir STANKOVIC, Zixiang XIONG, 2003. Rate-based versus distortion-based optimal error protection of embedded codesBibTex
@unpublished{Hamzaoui2003Rateb-6073, year={2003}, title={Rate-based versus distortion-based optimal error protection of embedded codes}, author={Hamzaoui, Raouf and Stankovic, Vladimir and Xiong, Zixiang} }
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/6073"> <dc:format>application/pdf</dc:format> <dc:rights>terms-of-use</dc:rights> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dcterms:issued>2003</dcterms:issued> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6073/1/preprint_194.pdf"/> <dc:creator>Xiong, Zixiang</dc:creator> <dc:contributor>Xiong, Zixiang</dc:contributor> <dc:contributor>Hamzaoui, Raouf</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:23Z</dc:date> <dc:language>eng</dc:language> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6073/1/preprint_194.pdf"/> <dc:creator>Hamzaoui, Raouf</dc:creator> <dc:contributor>Stankovic, Vladimir</dc:contributor> <dcterms:abstract xml:lang="eng">We consider a joint source-channel coding system that protects an embedded bitstream using a finite family of channel codes with error detection and error correction capability. The performance of this system may be measured by the expected distortion or by the expected number of correctly decoded source bits. Whereas a rate-based optimal solution can be found in linear time, the computation of a distortion-based optimal solution is prohibitive. Under the assumption of the convexity of the operational distortion-rate function of the source coder, we give a lower bound on the expected distortion of a distortion-based optimal solution that depends only a rate-based optimal solution. Then, we conjecture that a distortion-based optimal solution uses the same number of fewer information bits than a rated-based optimal solution. Finally, we propose a local search algorithm that starts from a rate-based optimal solution and converges in linear time to a local minimum of the expected distortion. Experimental results for a binary symmetric channel show that our local search algorithm is near optimal, whereas its complexity is much lower than that of the previous best solution.</dcterms:abstract> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:23Z</dcterms:available> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6073"/> <dc:creator>Stankovic, Vladimir</dc:creator> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dcterms:title>Rate-based versus distortion-based optimal error protection of embedded codes</dcterms:title> </rdf:Description> </rdf:RDF>