J4 ›› 2013, Vol. 40 ›› Issue (5): 60-65.doi: 10.3969/j.issn.1001-2400.2013.05.010

• 研究论文 • 上一篇    下一篇

汉明码参数的快速盲估计算法

杨晓炜1,2;甘露1   

  1. (1. 电子科技大学 电子工程学院,四川 成都  611731;
    2. 中国电子科技集团36所 通信系统信息控制技术国家级重点实验室,浙江 嘉兴  314033)
  • 收稿日期:2012-07-17 出版日期:2013-10-20 发布日期:2013-11-27
  • 通讯作者: 杨晓炜
  • 作者简介:杨晓炜(1988-), 男, 电子科技大学硕士研究生, E-mail: yangxwh@126.com.
  • 基金资助:

    中央高校基本科研业务费专项资金基础研究资助项目(ZYGX2010J027); 国家自然科学基金资助项目(11176005)

Fast blind estimation algorithm for Hamming codes parameters

YANG Xiaowei1,2;GAN Lu1   

  1. (1. School of Electronic Engineering, University of Electronic Science and Technology of China, Chengdu  611731, China;
    2. National Laboratory of Information Control Technology for Communication System, No.36 Research Institute of CETC, Jiaxing  314033, China)
  • Received:2012-07-17 Online:2013-10-20 Published:2013-11-27
  • Contact: YANG Xiaowei

摘要:

提出了一种快速盲估计汉明码码长、码组同步时刻和校验矩阵的算法.该算法通过假设汉明码校验位长和码组同步时刻,首先利用截获的数据构造了一个截获矩阵,然后根据假设的本原多项式构造了一个校验矩阵.当校验矩阵行向量均为截获矩阵的对偶码字时,汉明码各参数能够被有效估计,进一步对所提算法进行了理论分析.仿真结果验证了该算法的良好性能.

关键词: 非合作通信, 汉明码, 盲估计, 对偶码字, 本原多项式

Abstract:

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.

Key words: non-cooperative communication, Hamming codes, blind estimation, dual codes, primitive polynomials

中图分类号: 

  • TN971.1