In order to overcome the shortcomings of high computational complexity and low fault tolerance of the existing algorithms for recognition of convolutional codes

a fast convolutional code identification method based on iterative elimination is proposed.Firstly

the proposed algorithm analyzed the performance of the traditional Gauss elimination method

and the minimum number of iterations was given to ensure the presence of check vectors. Secondly

by traversing the possible minimum constraint length and convolutional code rate

the elimination matrix was constructed

and as a result

the suspected check vectors were obtained. Finally

we set the decision threshold based on the minimum error decision criterion

which realized fast identification of check polynomial matrix at high bit error rate. The simulation results show that the theoretical performance is consistent with the simulation results

and the proposed algorithm has strong fault-tolerant performance. Compared with the existing algorithms

the proposed algorithm has advantages in computational efficiency

and it has a good prospect in application of intelligent communication or communication reconnaissance.