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...

Full description

Saved in:
Bibliographic Details
Published in2007 International Conference on Wireless Communications, Networking and Mobile Computing pp. 1414 - 1417
Main Authors Fenghua Wang, Zhitao Huang, Yiyu Zhou
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2007
Subjects
Algorithm design and analysis
Convolution
Cryptography
Decoding
Equations
Information theory
Iterative algorithms
Linear feedback shift registers
Modulation coding
Vectors
Online AccessGet full text

Cover

More Information
Summary: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 L times N/2, where L is the length of the shortest linear feedback shift register to generate it, N is code length.
ISBN:1424413117
9781424413119
ISSN:2161-9646
DOI:10.1109/WICOM.2007.358