Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können derzeit keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted currently.)
Type of Publication: | Preprint |
URI (citable link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-22200 |
Author: | Hamzaoui, Raouf; Stankovic, Vladimir; Xiong, Zixiang |
Year of publication: | 2003 |
Series: | Konstanzer Schriften in Mathematik und Informatik ; 194 |
Summary: |
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.
|
Subject (DDC): | 004 Computer Science |
Link to License: | In Copyright |
HAMZAOUI, Raouf, Vladimir STANKOVIC, Zixiang XIONG, 2003. Rate-based versus distortion-based optimal error protection of embedded codes
@unpublished{Hamzaoui2003Rateb-6073, title={Rate-based versus distortion-based optimal error protection of embedded codes}, year={2003}, author={Hamzaoui, Raouf and Stankovic, Vladimir and Xiong, Zixiang} }
<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/rdf/resource/123456789/6073"> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6073"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:contributor>Stankovic, Vladimir</dc:contributor> <dc:creator>Xiong, Zixiang</dc:creator> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6073/1/preprint_194.pdf"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <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> <dc:contributor>Xiong, Zixiang</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> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6073/1/preprint_194.pdf"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:issued>2003</dcterms:issued> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:title>Rate-based versus distortion-based optimal error protection of embedded codes</dcterms:title> <dc:creator>Stankovic, Vladimir</dc:creator> <dc:rights>terms-of-use</dc:rights> <dc:creator>Hamzaoui, Raouf</dc:creator> <dc:format>application/pdf</dc:format> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:09:23Z</dcterms:available> </rdf:Description> </rdf:RDF>
preprint_194.pdf | 106 |