Publikation:

Rate-based versus distortion-based optimal joint source-channel coding

Lade...
Vorschaubild

Dateien

Hamzaoui_231342.pdf
Hamzaoui_231342.pdfGröße: 127.9 KBDownloads: 297

Datum

2002

Autor:innen

Stankovic, Vladimir
Xiong, Zixiang

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

Proceedings DCC 2002. Data Compression Conference. IEEE Comput. Soc, 2002, pp. 63-72. ISBN 0-7695-1477-4. Available under: doi: 10.1109/DCC.2002.999944

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 on a rate-based optimal solution. Then, we conjecture that a distortion-based optimal solution uses the same number or fewer information bits than a rate-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)
004 Informatik

Schlagwörter

Konferenz

DCC 2002. Data Compression Conference, Snowbird, UT, USA
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690HAMZAOUI, Raouf, Vladimir STANKOVIC, Zixiang XIONG, 2002. Rate-based versus distortion-based optimal joint source-channel coding. DCC 2002. Data Compression Conference. Snowbird, UT, USA. In: Proceedings DCC 2002. Data Compression Conference. IEEE Comput. Soc, 2002, pp. 63-72. ISBN 0-7695-1477-4. Available under: doi: 10.1109/DCC.2002.999944
BibTex
@inproceedings{Hamzaoui2002Rateb-23134,
  year={2002},
  doi={10.1109/DCC.2002.999944},
  title={Rate-based versus distortion-based optimal joint source-channel coding},
  isbn={0-7695-1477-4},
  publisher={IEEE Comput. Soc},
  booktitle={Proceedings DCC 2002. Data Compression Conference},
  pages={63--72},
  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/23134">
    <dcterms:title>Rate-based versus distortion-based optimal joint source-channel coding</dcterms:title>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Stankovic, Vladimir</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-06-27T09:50:22Z</dcterms:available>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-06-27T09:50:22Z</dc:date>
    <dc:contributor>Xiong, Zixiang</dc:contributor>
    <dc:creator>Hamzaoui, Raouf</dc:creator>
    <dc:creator>Xiong, Zixiang</dc:creator>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23134/1/Hamzaoui_231342.pdf"/>
    <dcterms:bibliographicCitation>Proceedings - DCC 2002, Data Compression Conference : April 2 - 4, 2002, Snowbird, Utah / ed. by James A. Storer ... - Los Alamitos, Calif. [u.a.] : IEEE Computer Society, 2002. - S. 63-72. - ISBN 0-7695-1477-4</dcterms:bibliographicCitation>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23134/1/Hamzaoui_231342.pdf"/>
    <dc:creator>Stankovic, Vladimir</dc:creator>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/23134"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:contributor>Hamzaoui, Raouf</dc:contributor>
    <dcterms:issued>2002</dcterms:issued>
    <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 on a rate-based optimal solution. Then, we conjecture that a distortion-based optimal solution uses the same number or fewer information bits than a rate-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>
    <dc:language>eng</dc:language>
    <dc:rights>terms-of-use</dc:rights>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen