Sequential decoding: Difference between revisions

Revision as of 08:53, 17 March 2018

Revision as of 16:55, 13 May 2019

Line 1:

{{Expert-subject|Mathematics|date=December 2009}}

'''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 code]]s. 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 the choice of metric and algorithm. Metrics include:

*Fano metric

*Zigangirov metric