Convolutional code: Difference between revisions

Revision as of 13:44, 18 February 2005

Revision as of 10:12, 11 March 2005

Line 8:

Simple Viterbi-decoded convolutional codes are now giving way to [[turbo code]]s, a new class of iterated short convolutional codes that closely approach the theoretical limits imposed by [[Shannon's theorem]] with much less decoding complexity than the Viterbi algorithm on the long convolutional codes that would be required for the same performance.

Turbo codes have not yet been concatenated with solid (low complexity) [[Reed-Solomon error correction]] codes. However, in the intrest of planetary exploreation this may some day be done.

[[Category:Error detection and correction]]