帮我把下面的文字翻译成英文,谢绝机器翻译~!卷积码是一类很好的信道编码,是与分组码相对应的另一大类编码,卷积码与分组码的不同之处在于其编码器是有记忆的.卷积码的译码算法可以分

帮我把下面的文字翻译成英文,谢绝机器翻译~!
卷积码是一类很好的信道编码,是与分组码相对应的另一大类编码,卷积码与分组码的不同之处在于其编码器是有记忆的.
卷积码的译码算法可以分为代数译码和概率译码,代数译码基于代数结构,概率译码有序列译码与维特比译码.
在本论文中,根据编码器的关系实现卷积码的编码,用维特比译码算法实现卷积码的解码.维特比译码算法采用最大似然算法,能够达到最佳的误码率,运算量的大小也完全能够被接受.维特比译码算法通过比较规定时刻各个支路中的路径需求最短距离,得到幸存路径,然后在译码结束时选择最短的一条,反推这条幸存路径得到相应的译码输出.
本论文是用VC实现一个给定编码方案的卷积码编码及其维特比译码.并通过实例加入的随机噪声来验证维特比译码算法的纠错能力.

系统提示我的答案和别人重复了...
Convolution code is a kind of very good channel coding,and code is another categories corresponding coding,convolution code block codes and the difference in the encoder is a memory.
Convolution code of decoding algorithm can be divided into algebraic decode and decoding,based on the probability of algebraic structures,algebraic decode sequences decoding and decoding probability there than victor decode.
In this thesis,according to the order relation of the encoder,the coding convolution code with victor than decoding algorithm realization of convolution code.Victor than decoding algorithm using the maximum likelihood algorithm can achieve the best,the size of the computation of ber completely also can be accepted.Victor than decoding algorithm through comparing various branch of path stipulated time,get the demand and then decodes survived path in the end,choose one of the shortest path that survived the corresponding coding output.
This paper is a given using VC coding scheme of convolution code coding and decoding than victor.Examples of add random noise to verify the error decoding algorithm,victor than ability.

Convolution code is a kind of very good channel coding, and code is another categories corresponding coding, convolution code block codes and the difference in the encoder is a memory.
Convolution...

全部展开

Convolution code is a kind of very good channel coding, and code is another categories corresponding coding, convolution code block codes and the difference in the encoder is a memory.
Convolution code of decoding algorithm can be divided into algebraic decode and decoding, based on the probability of algebraic structures, algebraic decode sequences decoding and decoding probability there than victor decode.
In this thesis, according to the order relation of the encoder, the coding convolution code with victor than decoding algorithm realization of convolution code. Victor than decoding algorithm using the maximum likelihood algorithm can achieve the best, the size of the computation of ber completely also can be accepted. Victor than decoding algorithm through comparing various branch of path stipulated time, get the demand and then decodes survived path in the end, choose one of the shortest path that survived the corresponding coding output.
This paper is a given using VC coding scheme of convolution code coding and decoding than victor. Examples of add random noise to verify the error decoding algorithm, victor than ability.

收起

这个太难了，你给我100RMB 我帮你翻译

Convolutional code is a kind of very good channel coding, with block code corresponding to the other major categories of coding, convolutional codes and block codes of different code in its memory is ...

全部展开

Convolutional code is a kind of very good channel coding, with block code corresponding to the other major categories of coding, convolutional codes and block codes of different code in its memory is there.
Convolutional codes can be divided into the decoding algorithm and the probability of decoding algebraic decoding, algebraic decoding based on the algebraic structure, there is the probability of decoding sequence and Viterbi decoding.
In this paper, based on the relationship between the encoder to achieve coding convolutional codes with Viterbi algorithm decoding of convolutional codes. Viterbi algorithm using the maximum likelihood algorithm, to achieve the best bit error rate, the size of computation can be accepted fully. Viterbi decoding algorithm by comparing the provisions of the various slip moment demand in the shortest distance path, the surviving path, and then the end of the decoder to choose the shortest one, anti-surviving path onto the corresponding output of the decoder.
This paper is the realization of a given VC coding schemes of convolutional codes and Viterbi coding. And through examples of adding random noise to validate the Viterbi algorithm for error correction ability.

收起