基于秩函数和Euclide算法的循环码盲识别

A blind method of cyclic codes based on rank function and Euclide arithmetic

信道编码码序列的信息侦获是当前研究的热点、难点领域。针对信道编码中循环码的参数识别问题,本文利用秩函数确定了循环码的码长,并通过Euclide算法确定了码字起始位置和生成多项式,解决了循环码的识别问题。仿真结果表明,该方法能够对循环码进行有效的盲识别,且具有较好的容错性能。

The information recd of channel coding codes sequence is a hot and difficult field in current research, in order to solve Cyclic codes＇ blind recognition problem, the rank fuction is provided for codes length recognition, and Euclide arithmetic is used to recognize the codes first bit and creating polynomial, the recognition problem of cyclic codes is solved. Simulation experiments show that the method could recognize cyclic codes, and it had well error-abiden capability.