Convolutional code: Difference between revisions

Revision as of 14:37, 7 July 2006

Revision as of 18:27, 20 July 2006

Line 116:

===Design Issues===

Longer constraint length codes are more practically decoded with any of several '''sequential''' decoding algorithms, of which the [[Shannon-Fano_codingFano coding|Fano]] algorithm is the best known. Unlike Viterbi decoding, sequential decoding is not maximum likelihood but its complexity increases only slightly with constraint length, allowing the use of strong, long-constraint-length codes. Such codes were used in the [[Pioneer program]] of the early 1970s to Jupiter and Saturn, but gave way to shorter, Viterbi-decoded codes, usually concatenated with large [[Reed-Solomon error correction]] codes that steepen the overall bit-error-rate curve and produce extremely low residual undetected error rates.

===Turbo Codes: replacing Convolutional Codes===

Line 122:

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

==External Linkslinks==

*[http://complextoreal.com/chapters/convo.pdf Tutorial on Convolutional Coding and Decoding]