Determining the complexity of FH/SS sequence by approximate entropy
Determining the complexity of FH/SS sequence by approximate entropy
复制标题
通过近似熵确定FH/SS序列的复杂度
DOI:
10.1109/tcomm.2009.03.060721
复制
发表时间:
2009-03
影响因子:
8.3
通讯作者:
Li, Zan
中科院分区:
文献类型:
--
作者:
Cai, Jueping;Chang, Yilin;Li, Zan
High complexity of frequency-hopping (FH)/spreadspectrum (SS) sequence is of great importance to high-security multiple-access communication systems, for it makes FH/SS sequence difficult to be analyzed. With the growing development in the design of FH/SS sequence in much wider fields, the wellknown complexity measuresiquestthe linear complexity (LC), the linear complexity profile (LCP) and the k-error linear complexity (k-error LC)iquestare widely used but not sufficient to evaluate the complexities of the sequences available, such as the cryptographical sequence and the chaotic sequence families. In this paper, a new complexity metric to evaluate the unpredictability of FH/SS sequence based on the approximate entropy (ApEn) is proposed in the view of the maximal randomness of the sequences with arbitrary length. And the theoretical bounds of the ApEn are derived from a probabilistic point of view. Simulations and analysis results show that, the proposed ApEn works effectively to discern the changing complexities of the FH/SS sequences with small number of samples, which provide superior performance over its candidates.
登录
查看更多内容
DOI:
10.1017/9781108571401.019
发表时间:
2020-07
期刊:
Bandit Algorithms
影响因子:
--
作者:
Tor Lattimore;Csaba Szepesvari
通讯作者:
Tor Lattimore;Csaba Szepesvari
影响因子:
4.3
作者:
Li, Z;Chang, YL;Jin, LJ
通讯作者:
Jin, LJ
DOI:
--
发表时间:
1994-02
期刊:
--
影响因子:
--
作者:
G. Heidari-Bateni;C. McGillem
通讯作者:
G. Heidari-Bateni;C. McGillem
影响因子:
44.1
作者:
ECKMANN, JP;RUELLE, D
通讯作者:
RUELLE, D
DOI:
10.1109/lcomm.2004.832742
发表时间:
2004-07
期刊:
IEEE Communications Letters
影响因子:
--
作者:
Zan Li;Yilin Chang;Lijun Jin;Jueping Cai
通讯作者:
Zan Li;Yilin Chang;Lijun Jin;Jueping Cai