About: Sequential decoding

An Entity of Type: topical concept, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Recognised by John Wozencraft, sequential decoding is a limited memory technique for decoding . Sequential decoding is mainly used as an approximate decoding algorithm for long constraint-length convolutional codes. This approach may not be as accurate as the Viterbi algorithm but can save a substantial amount of computer memory. It was used to decode a convolutional code in 1968 Pioneer 9 mission. Sequential decoding explores the tree code in such a way to try to minimise the computational cost and memory requirements to store the tree. * Fano metric * Zigangirov metric * Gallager metric

Property Value
dbo:abstract
  • Recognised by John Wozencraft, sequential decoding is a limited memory technique for decoding . Sequential decoding is mainly used as an approximate decoding algorithm for long constraint-length convolutional codes. This approach may not be as accurate as the Viterbi algorithm but can save a substantial amount of computer memory. It was used to decode a convolutional code in 1968 Pioneer 9 mission. Sequential decoding explores the tree code in such a way to try to minimise the computational cost and memory requirements to store the tree. There is a range of sequential decoding approaches based on the choice of metric and algorithm. Metrics include: * Fano metric * Zigangirov metric * Gallager metric Algorithms include: * Stack algorithm * Fano algorithm * Creeper algorithm (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 25258521 (xsd:integer)
dbo:wikiPageLength
  • 6763 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1066542638 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • Recognised by John Wozencraft, sequential decoding is a limited memory technique for decoding . Sequential decoding is mainly used as an approximate decoding algorithm for long constraint-length convolutional codes. This approach may not be as accurate as the Viterbi algorithm but can save a substantial amount of computer memory. It was used to decode a convolutional code in 1968 Pioneer 9 mission. Sequential decoding explores the tree code in such a way to try to minimise the computational cost and memory requirements to store the tree. * Fano metric * Zigangirov metric * Gallager metric (en)
rdfs:label
  • Sequential decoding (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:knownFor of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is dbp:knownFor of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License