Content deleted Content added
adding links to references using Google Scholar |
|||
Line 131:
An especially popular Viterbi-decoded convolutional code, used at least since the [[Voyager program]] has a constraint length ''k'' of 7 and a rate ''r'' of 1/2.<ref> Butman, S. A., L. J. Deutsch, and R. L. Miller. [https://ipnpr.jpl.nasa.gov/progress_report/42-63/63H.PDF "Performance of concatenated codes for deep space missions." ] The Telecommunications and Data Acquisition Progress Report 42-63, March–April 1981 (1981): 33-39.</ref>
* Longer constraint lengths produce more powerful codes, but the [[complexity]] of the Viterbi algorithm [[exponential growth|increases exponentially]] with constraint lengths, limiting these more powerful codes to deep space missions where the extra performance is easily worth the increased decoder complexity.
| |||