Fast tree-trellis list Viterbi decoding

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:d096a136b3afa9430767b6e8ba38ab67

RÖDER, Martin, Raouf HAMZAOUI, 2006. Fast tree-trellis list Viterbi decoding. In: IEEE Transactions on Communications. 54(3), pp. 453-461. ISSN 0090-6778. eISSN 1558-0857. Available under: doi: 10.1109/TCOMM.2006.869812

@article{Roder2006treet-22212, title={Fast tree-trellis list Viterbi decoding}, year={2006}, doi={10.1109/TCOMM.2006.869812}, number={3}, volume={54}, issn={0090-6778}, journal={IEEE Transactions on Communications}, pages={453--461}, author={Röder, Martin and Hamzaoui, Raouf}, note={Das beigefügte pdf entspricht der eingereichten Version} }

<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/22212"> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22212/2/R%c3%b6der_222124.pdf"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22212/2/R%c3%b6der_222124.pdf"/> <dcterms:title>Fast tree-trellis list Viterbi decoding</dcterms:title> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:language>eng</dc:language> <dcterms:abstract xml:lang="eng">A list Viterbi algorithm (LVA) finds n most likely paths in a trellis diagram of a convolutional code. One of the most efficient LVAs is the tree-trellis algorithm of Soong and Huang. We propose a new implementation of this algorithm. Instead of storing the candidate paths in a single list sorted according to the metrics of the paths, we show that it is computationally more efficient to use several unsorted lists, where all paths of the same list have the same metric. For an arbitrary integer bit metric, both the time and space complexity of our implementation are linear in n. Experimental results for a binary symmetric channel and an additive white Gaussian noise channel show that our implementation is much faster than all previous LVAs.</dcterms:abstract> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-04-02T08:50:41Z</dcterms:available> <dcterms:bibliographicCitation>IEEE Transactions on Communications ; 54 (2006), 3. - S. 453-461</dcterms:bibliographicCitation> <dc:creator>Hamzaoui, Raouf</dc:creator> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-04-02T08:50:41Z</dc:date> <dc:rights>deposit-license</dc:rights> <dc:creator>Röder, Martin</dc:creator> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> <dcterms:issued>2006</dcterms:issued> <dc:contributor>Hamzaoui, Raouf</dc:contributor> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Röder, Martin</dc:contributor> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/22212"/> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Röder_222124.pdf 89

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto