A Method for Blind Recognition of Convolution Code Based on Euclidean Algorithm

摘要：

The key equation (KE) plays an important role in cryptography and communication. In this paper, a new generalization of KE is introduced. By the problem of convolution code blind recognition, a multi-order key equation (MKE) is introduced. It is proved that the MKE can be used for blind recognition of convolution code with any code rate. A fast algorithm based on Euclidean algorithm is achieved which can solve 2-order KE. A new method for blind recognition of convolution code with 1/2 code rate is given, and an example is given in detail, then the computation load is analyzed. The computation load of our algorithm not more than 2 L N × , where L is the length of the shortest linear feedback shift register to generate it , N is code length.

关键词： key equation (KE) multi-order key equation (MKE) blind recognition of convolution code

作者: Fenghua Wang Zhitao Huang Yiyu Zhou

作者单位: School of Electronic Science and Engineering, National University of Defense Technology Changsha, 410073, P. R. China

会议类型: 国际会议

会议名称: 第三届IEEE无线通讯、网络技术暨移动计算国际会议

会议地点: 上海

会议语种:英文

在线出版日期: 2007-09-21（万方平台首次上网日期，不代表论文的发表时间）