Fast algorithm for rate-based optimal error protection of embedded codes

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:f34f3f4752dbd739ad61147bb2644e25

STANKOVIC, Vladimir, Raouf HAMZAOUI, Dietmar SAUPE, 2003. Fast algorithm for rate-based optimal error protection of embedded codes. In: IEEE Transactions on Communications. 51(11), pp. 1788-1795. ISSN 0090-6778. eISSN 1558-0857. Available under: doi: 10.1109/TCOMM.2003.819235

@article{Stankovic2003algor-22302, title={Fast algorithm for rate-based optimal error protection of embedded codes}, year={2003}, doi={10.1109/TCOMM.2003.819235}, number={11}, volume={51}, issn={0090-6778}, journal={IEEE Transactions on Communications}, pages={1788--1795}, author={Stankovic, Vladimir and Hamzaoui, Raouf and Saupe, Dietmar} }

<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/22302"> <dc:contributor>Hamzaoui, Raouf</dc:contributor> <dc:rights>deposit-license</dc:rights> <dcterms:issued>2003</dcterms:issued> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Stankovic, Vladimir</dc:contributor> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22302/2/Stankovic_223024.pdf"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/22302"/> <dc:creator>Stankovic, Vladimir</dc:creator> <dcterms:title>Fast algorithm for rate-based optimal error protection of embedded codes</dcterms:title> <dc:contributor>Saupe, Dietmar</dc:contributor> <dc:creator>Saupe, Dietmar</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:bibliographicCitation>IEEE Transactions on Communications ; 51 (2003), 11. - S. 1788-1795</dcterms:bibliographicCitation> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:language>eng</dc:language> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Hamzaoui, Raouf</dc:creator> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-05-16T08:41:55Z</dc:date> <dcterms:abstract xml:lang="eng">Embedded image codes are very sensitive to channel noise because a single bit error can lead to an irreversible loss of synchronization between the encoder and the decoder. Sherwood and Zeger introduced a powerful system that protects an embedded wavelet image code with a concatenation of a cyclic redundancy check coder for error detection and a rate-compatible punctured convolutional coder for error correction. For such systems, Chande and Farvardin proposed an unequal error protection strategy that maximizes the expected number of correctly received source bits subject to a target transmission rate. Noting that an optimal strategy protects successive source blocks with the same channel code, we give an algorithm that accelerates the computation of the optimal strategy of Chande and Farvardin by finding an explicit formula for the number of occurences of a same channel code. Experimental results with two competitive channel coders and a binary symmetric channel showed that the speed-up factor over the approach of Chande and Farvardin ranged from 2.82 to 44.76 for transmission rates between 0.25 and 2 bits per pixel.</dcterms:abstract> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-05-16T08:41:55Z</dcterms:available> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22302/2/Stankovic_223024.pdf"/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Stankovic_223024.pdf 94

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto