DocumentCode :
3492157
Title :
A Method for Blind Recognition of Convolution Code Based on Euclidean Algorithm
Author :
Wang, Fenghua ; Huang, Zhitoo ; Zhou, Yiyu
Author_Institution :
Sch. of Electron. Sci. & Eng., Nat. Univ. of Defense Technol., Changsha
fYear :
2007
fDate :
21-25 Sept. 2007
Firstpage :
1414
Lastpage :
1417
Abstract :
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.
Keywords :
convolutional codes; cryptography; Euclidean algorithm; blind recognition; convolution code; cryptography; linear feedback shift register; multiorder key equation; Algorithm design and analysis; Convolution; Cryptography; Decoding; Equations; Information theory; Iterative algorithms; Linear feedback shift registers; Modulation coding; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-1311-9
Type :
conf
DOI :
10.1109/WICOM.2007.358
Filename :
4340133
Link To Document :
بازگشت