摘要
提出了一种快速盲估计汉明码码长、码组同步时刻和校验矩阵的算法.该算法通过假设汉明码校验位长和码组同步时刻,首先利用截获的数据构造了一个截获矩阵,然后根据假设的本原多项式构造了一个校验矩阵.当校验矩阵行向量均为截获矩阵的对偶码字时,汉明码各参数能够被有效估计,进一步对所提算法进行了理论分析.仿真结果验证了该算法的良好性能.
An algorithm is proposed for fast blindly estimating the length,the starting point and the parity-check matrix of the hamming code.First,an intercepted matrix is built by the data received,and by exploiting an assumed number of parity-check digits and the assumed starting point of the hamming code.Then,a parity-check matrix is obtained by the assumed primitive polynomial,and when all its row-vectors are dual codes of the intercepted matrix,the hamming code parameters could be estimated.Moreover,a theoretical analysis of the proposed algorithm is made.Simulation results verify the good performance of the proposed method.
出处
《西安电子科技大学学报》
EI
CAS
CSCD
北大核心
2013年第5期60-65,共6页
Journal of Xidian University
基金
中央高校基本科研业务费专项资金基础研究资助项目(ZYGX2010J027)
国家自然科学基金资助项目(11176005)
关键词
非合作通信
汉明码
盲估计
对偶码字
本原多项式
non-cooperative communication
Hamming codes
blind estimation
dual codes
primitive polynomials