In this semi-tutorial paper convolutional codes and their various encoders are presented. The terminology rudified convolutional encoders is introduced for convolutional encoders that are both systematic and polynomial. It is argued that these rudified convolutional encoders—contrary to common belief—are sometimes the best choice.
KeywordsGenerator Matrix Convolutional Code Viterbi Algorithm List Size Correct Path
Unable to display preview. Download preview PDF.
- J. A. Heller, “Sequential decoding: Short constraint length convolutional codes”, Jet Propulsion Lab., California Inst. Technol., Pasadena, Space Program Summary 37–54, vol. 3, Dec. 1968, 171–174.Google Scholar
- S. W. Golomb, Shift Register Sequences, Holden-Day, San Fransisco, 1967. Revised ed., Aegean Park Press, Laguna Hills, Cal., 1982.Google Scholar
- G. D. Forney, Jr., (1967), Review of random tree codes (NASA Ames. Res. Cen., Contract NAS2–3637, NASA CR, 73176, Final Rep.;Appx A). See also Forney, G. D., Jr. (1974), Convolutional codes II: Maximum-likelihood decoding and convolutional codes III: Sequential decoding. Inform Contr., 25: 222–297.Google Scholar