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

• Original Articles • Previous Articles     Next Articles

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 E-mail:yangxwh@126.com

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

CLC Number: 

  • TN971.1