| 引用本文: |
|
| Citation: |
|
计量
- 文章访问数: 3696
- PDF下载量: 5361
- 被引次数: 0
物理学报. 2003, 52(8): 1871-1876.
doi: 10.7498/aps.52.1871.
一种混沌伪随机序列复杂度分析法
- 收稿日期: 2002-09-30
- 修回日期: 2002-12-13
- 刊出日期: 2003-04-05
English Abstract
Analysis on the chaotic pseudo-random sequence complexity
- Received Date:
30 September 2002
- Accepted Date:
13 December 2002
- Published Online:
05 April 2003
Abstract: In this paper, the conventional pseudo-random sequence linear complexity is disc ussed, and a new criterion is proposed, based on the approximate entropy. It is proved that the criterion is able to distinguish different complex chaos and cha otic pseudo-random sequences with short observed sequence. Simulations indicate that the method is effective, and the corresponding theories are proved right.
-
Keywords:
- chaos /
- pseudo-random sequence /
- entropy
下载:
