In this paper, an improvement has been made on the algorithm of solving the kernels of new functions which are generated after a common divisor appearing in the original functions is replaced by a new intermediate var...In this paper, an improvement has been made on the algorithm of solving the kernels of new functions which are generated after a common divisor appearing in the original functions is replaced by a new intermediate variable. And an efficient method based on kernel heritage is presented. This method has been successfully used in synthesis of LCA (Logic Cell Array).展开更多
提出了一种RS码的快速盲识别方法。该方法基于RS码的等效二进制分组码的循环移位特性,通过欧几里德算法计算循环移位前后码字的最大公约式,根据最大公约式指数的相关性来估计码长,并快速剔除含错码字,进而利用伽罗华域的傅里叶变换(Galo...提出了一种RS码的快速盲识别方法。该方法基于RS码的等效二进制分组码的循环移位特性,通过欧几里德算法计算循环移位前后码字的最大公约式,根据最大公约式指数的相关性来估计码长,并快速剔除含错码字,进而利用伽罗华域的傅里叶变换(Galois Field Fourier Transform,GFFT)实现RS码的本原多项式和生成多项式的识别。仿真结果表明,该算法复杂度低,计算量小,在误码率为10-3的情况下,对RS码的识别概率高于90%。展开更多
文摘In this paper, an improvement has been made on the algorithm of solving the kernels of new functions which are generated after a common divisor appearing in the original functions is replaced by a new intermediate variable. And an efficient method based on kernel heritage is presented. This method has been successfully used in synthesis of LCA (Logic Cell Array).
文摘提出了一种RS码的快速盲识别方法。该方法基于RS码的等效二进制分组码的循环移位特性,通过欧几里德算法计算循环移位前后码字的最大公约式,根据最大公约式指数的相关性来估计码长,并快速剔除含错码字,进而利用伽罗华域的傅里叶变换(Galois Field Fourier Transform,GFFT)实现RS码的本原多项式和生成多项式的识别。仿真结果表明,该算法复杂度低,计算量小,在误码率为10-3的情况下,对RS码的识别概率高于90%。
