首页 | 本学科首页   官方微博 | 高级检索  
     

一类混沌跳频序列的性能分析
引用本文:米良. 一类混沌跳频序列的性能分析[J]. 电子与信息学报, 2005, 27(11): 1741-1744.
作者姓名:米良
作者单位:西南电子电信技术研究所,成都,610041
摘    要:对一类基于混沌映射,由混沌轨道多值量化和比特抽取相结合产生的跳频序列进行了性能分析。理论分析和统计性能实验表明,该方法构造的跳频序列是贝努利随机序列,其汉明相关函数服从泊松分布。在相同的条件下(频率数目和序列长度相同),其均匀分布性、汉明相关值和线性复杂度与其它方法产生的混沌跳频序列相当,然而其所需的迭代次数却大大减少,从而能够产生更多的跳频序列,非常适合在跳频多址通信中应用。

关 键 词:跳频序列  混沌映射  汉明相关函数  线性复杂度
收稿时间:2004-06-16
修稿时间:2004-11-02

The Performance Analysis of Chaotic Frequency-Hopping Sequences
Mi Liang. The Performance Analysis of Chaotic Frequency-Hopping Sequences[J]. Journal of Electronics & Information Technology, 2005, 27(11): 1741-1744.
Authors:Mi Liang
Affiliation:Southwest Electronic & Telecommunication Technology Institute, Chengdu 610041, China
Abstract:The performance analysis of chaotic Frequency-Hopping(FH)sequences,which are generated by quantization function and reshaping operation based on chaotic map,is presented in this paper.Theory analysis and performance experimental at results show that this sequence is Bernoulli sequence and its Hamming correlation is shown to be Poisson distributed.It is comparable to other FH sequences on the properties of uniform distribution,Hamming correlation and linear complexity when they have the same number of frequency slots and the same period,but much less requirements of iterative operation.It can be concluded that more FH sequences can be generated by this method and they are suitable for FH code-division multiple-access systems.
Keywords:Frequency-hopping sequences  Chaotic map  Hamming correlation function  Linear complexity
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号