Fast tree-trellis list Viterbi decoding

Röder, Martin; Hamzaoui, Raouf

Fast tree-trellis list Viterbi decoding

Dateien

Röder_222124.pdfGröße: 246.56 KBDownloads: 180

Datum

2006

Autor:innen

Röder, Martin

Hamzaoui, Raouf

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Erschienen in

IEEE Transactions on Communications. 2006, 54(3), pp. 453-461. ISSN 0090-6778. eISSN 1558-0857. Available under: doi: 10.1109/TCOMM.2006.869812

Zusammenfassung

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.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

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

BibTex

@article{Roder2006treet-22212,
  year={2006},
  doi={10.1109/TCOMM.2006.869812},
  title={Fast tree-trellis list Viterbi decoding},
  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: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/22212">
    <dcterms:title>Fast tree-trellis list Viterbi decoding</dcterms:title>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22212/2/R%c3%b6der_222124.pdf"/>
    <dc:creator>Hamzaoui, Raouf</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-04-02T08:50:41Z</dc:date>
    <dcterms:issued>2006</dcterms:issued>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/22212"/>
    <dc:contributor>Röder, Martin</dc:contributor>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:language>eng</dc:language>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:bibliographicCitation>IEEE Transactions on Communications ; 54 (2006), 3. - S. 453-461</dcterms:bibliographicCitation>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-04-02T08:50:41Z</dcterms:available>
    <dc:creator>Röder, Martin</dc:creator>
    <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>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22212/2/R%c3%b6der_222124.pdf"/>
    <dc:contributor>Hamzaoui, Raouf</dc:contributor>
  </rdf:Description>
</rdf:RDF>

Kommentar zur Publikation

Das beigefügte pdf entspricht der eingereichten Version

Universitätsbibliographie

Ja