Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7452500> ?p ?o }
Showing triples 1 to 17 of
17
with 100 triples per page.
- Q7452500 subject Q6542000.
- Q7452500 abstract "Sequential decoding is a limited memory technique for decoding tree codes. Sequential decoding is mainly used is 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.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 choice of metric and algorithm. Metrics include:Fano metricZigangirov metricGallager metricAlgorithms include:Stack algorithmFano algorithmCreeper algorithm".
- Q7452500 wikiPageExternalLink CorrectionTrees.
- Q7452500 wikiPageWikiLink Q1395022.
- Q7452500 wikiPageWikiLink Q182505.
- Q7452500 wikiPageWikiLink Q272172.
- Q7452500 wikiPageWikiLink Q278090.
- Q7452500 wikiPageWikiLink Q45284.
- Q7452500 wikiPageWikiLink Q6264925.
- Q7452500 wikiPageWikiLink Q6542000.
- Q7452500 wikiPageWikiLink Q834373.
- Q7452500 wikiPageWikiLink Q83886.
- Q7452500 wikiPageWikiLink Q863510.
- Q7452500 wikiPageWikiLink Q93052.
- Q7452500 wikiPageWikiLink Q9492.
- Q7452500 comment "Sequential decoding is a limited memory technique for decoding tree codes. Sequential decoding is mainly used is as an approximate decoding algorithm for long constraint-length convolutional codes.".
- Q7452500 label "Sequential decoding".