求解卷积码子生成多项式算法的研究

Studies on Algorithms for Calculating Subgenerator Polynomials of Convolutional Codes

研究了辗转相减求最大公因式的原理,给出了求(n0,1,m)非系统卷积码子生成多项式的方法,讨论了求(n0,k0,m)系统卷积码子生成多项式的解线性方程组算法。

In this paper, the principle of calculating greatest common factors using mutual subtraction is studied , then the methods for calculating subgenerator polynomials of（n0,1 ,rn） nonsystematic convolutional codes are given, and finally, the algorithms for solving systems of linear equations for calculating subgenerator polynomials of（ n0,k0, m） systematic convutional codes are discussed.