给出有限域F上多项式环F[x,y]的齐次理想的Grbner基的快速算法.证明,只要计算经过严格排序的生成多项式组中相邻元素之间的S-多项式,就可以实现计算齐次理想的Grbner基,这样大幅度地减少了S-多项式的计算,从而也证明了新算法的计算复杂度是输入数据量的平方.新算法解决卷积码的盲识别问题. A fast algorithm for the homogeneous ideal Grbner basis of the polynomial ring F [x, y] over finite field F is given. Proving that as long as the S-polynomial between adjacent elements in a strictly ordered generator polynomial set is computed, Which can reduce the computational complexity of S-polynomials and prove the computational complexity of the new algorithm is the square of the input data. The new algorithm solves the blind identification of convolutional codes problem.