1 / 54
文档名称:

和积译码算法.pptx

格式:pptx   大小:3,953KB   页数:54页
下载后只包含 1 个 PPTX 格式的文档,没有任何的图纸或源代码,查看文件列表

如果您已付费下载过本站文档,您可以点这里二次下载

分享

预览

和积译码算法.pptx

上传人:sxlw2014 2021/7/29 文件大小:3.86 MB

下载得到文件列表

和积译码算法.pptx

文档介绍

文档介绍:Choice of Encoder Class
The answer to the first question depends on the application. For example, many applications require that the encoder be systematic so that the data are readily observable in the code stream. As another example, parallel turbo codes (Chapter 7) require that the constituent convolutional codes be of the recursive type,and usually systematic. For many applications the encoder class matters very little,particularly applications in which the convolutional code is not a constituentcode of a turbo(-like) code. As seen in Example and as we shall see in the discussion below of the third question, the choice of encoder class can affect the encoder memory μ.
1
Catastrophic Encoders
2
Minimal Encoders
3
4
5
6
7
Design of Convolutional Codes
Regarding the fourth question listed in Section , for reasons affecting decoder complexity, typical values of n and k are very small: k =1, 2, 3 and n = 2, 3, 4. Typical code rates are 1/2, 1/3, 1/4, 2/3, and 3/4, with 1/2 by far the most common rate.
8
Alternative Convolutional Code Representations
Under this section, we consider alternative representations of convolutional codes that are useful for many other aspects of convolutional codes, such as
decoding, code design, and analysis.
Convolutional Codes as Semi-Infinite Linear Codes
9
10