Determining the Complexity of FH/SS Sequences by Fuzzy Entropy

Author

Chen, Xiaojun ; Li, Zan ; Si, JiangBo ; Hao, Benjian ; Bai, Baoming

Author_Institution

State Key Lab. of Integrated Service Networks (ISN), Xidian Univ., Xi´´an, China

fYear

2011

fDate

5-9 June 2011

Firstpage

1

Lastpage

5

Abstract

High complexity of frequency-hopping (FH)/spread- spectrum(SS) sequence is of great importance to high-security multiple-access communication systems, for it makes FH/SS sequence difficult to be analyzed. In this paper, a new complexity metric to evaluate the unpredictability of FH/SS sequence based on the Fuzzy Entropy(FuzzyEn) is presented. Simulation and analytical results show that, the proposed FuzzyEn works can effectively discern the changing complexities of the FH/SS sequences, and are compared with complexity metric based on the Approximate Entropy(ApEn). The FuzzyEn scheme has obvious advantages in the robustness to resolution parameter, the dependence to observation length and the sensitivity to vector dimension.

Keywords

fuzzy set theory; multi-access systems; telecommunication security; FH-SS sequence; approximate entropy; complexity metric; frequency-hopping-spread-spectrum sequence; fuzzy entropy; high-security multiple-access communication systems; vector dimension; Chaotic communication; Complexity theory; Entropy; IEEE Communications Society; Robustness; Sensitivity;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications (ICC), 2011 IEEE International Conference on

Conference_Location

Kyoto

ISSN

1550-3607

Print_ISBN

978-1-61284-232-5

Electronic_ISBN

1550-3607

Type

conf

DOI

10.1109/icc.2011.5962500

Filename

5962500