DocumentCode :
693060
Title :
A novel complexity metric for FH sequence based on chaotic features
Author :
Li Siqi ; Quan Houde
Author_Institution :
Dept. of Inf. Eng., Ordnance Eng. Coll., Shijiazhuang, China
fYear :
2013
fDate :
20-22 Dec. 2013
Firstpage :
3338
Lastpage :
3342
Abstract :
Berlekamp-Massey algorithm is a conventional complexity metric for frequency-hopping (FH) sequence based on linear model, but as a result of new FH sequences unfolding (such as the block cipher and chaotic FH sequence), the existing complexity metric becomes more and more difficult to discern the complexities of these new sequences. Aiming at this problem, the complexity metric of FH sequence based on chaotic features is proposed. By this approach, the complexity of FH sequences that satisfy the chaotic features can be analyzed. First, the calculation process of complexity metric is carried out, and then the FH sequences based on L-G discontinuous tap model and Logistic-Kent cascade mapping are constructed. Finally, the complexities of these two FH sequences are calculated, and the comparison result is also given.
Keywords :
computational complexity; frequency hop communication; Berlekamp-Massey algorithm; FH sequence; L-G discontinuous tap model; block cipher; chaotic features; complexity metric; frequency-hopping sequence; linear model; logistic-kent cascade mapping; Analytical models; Chaotic communication; Measurement; Wireless communication; FH sequence; chaotic features; complexity metric;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Mechatronic Sciences, Electric Engineering and Computer (MEC), Proceedings 2013 International Conference on
Conference_Location :
Shengyang
Print_ISBN :
978-1-4799-2564-3
Type :
conf
DOI :
10.1109/MEC.2013.6885594
Filename :
6885594
Link To Document :
بازگشت