Sequential decoding: Difference between revisions

Revision as of 17:05, 13 May 2019

Revision as of 17:06, 13 May 2019

Line 1:

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

Recognised by [[John Wozencraft]], '''Sequential decoding''' is a limited memory technique for decoding [[tree codes]]. Sequential decoding is mainly used 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. It was used to decode a convolutional code in 1968 [[Pioneer 9 mission]] 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.