论文部分内容阅读
为了获取数字通信中未知线路的纠错编码信息,提出了一种RS码快速盲识别方法。通过对RS码的二进制表示进行码根求解的方法来检测未知线路的RS码长、本原多项式阶数以及可能的本原多项式;进而遍历得到的本原多项式对RS序列进行伽罗华域的傅里叶变换(GFFT),通过连零位置和个数最终确定未知线路的真实本原多项式和生成多项式。实验验证和性能分析表明,该方法能实现绝大部分未知线路的RS码盲识别,并明显缩小以往算法中本原多项式的遍历范围。
In order to obtain the error correction coding information of unknown lines in digital communication, a fast blind identification method based on RS codes is proposed. The RS code length, the primitive polynomial order and the possible primitive polynomials of the unknown line are detected by the method of solving the binary representation of the RS code. Then the primitive polynomials traversed are used to carry out the RS sequence of Galois field The Fourier Transform (GFFT) finally determines the true primitive polynomials and generator polynomials of unknown lines by zero-sequence position and number. Experimental verification and performance analysis show that this method can blindly identify RS codes of most unknown lines and significantly reduce the traversal range of primitive polynomials in previous algorithms.