Scholarlink

The second chapter on Convolutional Codes defines Maximum-Likelihood and Maximum A Posteriori probability decoding for the binary symmetric channel and AWGN. The Viterbi, Soft-Output-Viterbi, and the BCJR algorithms are described, the latter also with blocking options of convolutional codes. The BCJR treatment also includes the Log-MAP and Max-Log-MAP variants. Puncturing and Pruning provide means of adjusting the code rate and performance starting from a common mother code, offering unequal error correction capabilities. The chapter also contains the actual Union-Bound Error Probability approximation based on the Transfer Function introduced in the previous chapter.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Convolutional Codes II—Viterbi and BCJR Decoders, Error Probabilities, Special Constructions

  • 章节

  • 发表日期：

    2026年

查看全文
  • Werner Henkel

摘要

The second chapter on Convolutional Codes defines Maximum-Likelihood and Maximum A Posteriori probability decoding for the binary symmetric channel and AWGN. The Viterbi, Soft-Output-Viterbi, and the BCJR algorithms are described, the latter also with blocking options of convolutional codes. The BCJR treatment also includes the Log-MAP and Max-Log-MAP variants. Puncturing and Pruning provide means of adjusting the code rate and performance starting from a common mother code, offering unequal error correction capabilities. The chapter also contains the actual Union-Bound Error Probability approximation based on the Transfer Function introduced in the previous chapter.