J4 ›› 2015, Vol. 42 ›› Issue (3): 103-108.doi: 10.3969/j.issn.1001-2400.2015.03.018

• 研究论文 • 上一篇    下一篇

混沌序列测距码性能研究

薛睿;魏强;徐锡超   

  1. (哈尔滨工程大学 信息与通信工程学院,黑龙江 哈尔滨  150001)
  • 收稿日期:2014-01-27 出版日期:2015-06-20 发布日期:2015-07-27
  • 通讯作者: 薛睿
  • 作者简介:薛睿(1980-),男,讲师,博士,E-mail:xuerui@hrbeu.edu.cn.
  • 基金资助:

    国家自然科学基金资助项目(61403093);黑龙江省留学归国科学基金资助项目(.LC2013C22);黑龙江省博士后科研启动金资助项目(LBH-Q14048)

Performance research on ranging codes based on  the chaotic sequence

XUE Rui;WEI Qiang;XU Xichao   

  1. (College of Information and Communication Engineering, Harbin Engineering Univ., Harbin  150001, China)
  • Received:2014-01-27 Online:2015-06-20 Published:2015-07-27
  • Contact: XUE Rui

摘要:

针对混沌序列数目众多、相关性能良好、安全性强、保密性高以及逼近高斯白噪声的统计特性,提出一种基于加权算法的改进型Logistic混沌序列测距码.该码是通过对两个初值不同的改进型Logistic混沌序列进行加权处理、求和、量化得到的.采用基于相关峰旁瓣和Welch界两种测距码性能分析方法评估所提测距码在内的各种经典混沌序列测距码的性能.理论分析和仿真结果表明,基于加权优化混沌序列的测距码不仅平衡性大大提高,而且测距码性能良好,同时增强了测距码的安全性与保密性.

关键词: 测距码, 混沌序列, 自相关, 互相关, Welch界

Abstract:

Since the chaotic sequence has a lot of numbers, good relative performance, strong security, high security and approaching statistical properties of Gaussian white noise, a ranging code based on the weighted optimizing chaotic sequence is proposed. This code is obtained by two different initial improved Logistic chaotic sequences through weighting and summation and quantification. This paper analyses various classic chaotic sequences including the weighted optimizing chaotic sequence as the performance of the ranging code based on the peaks of autocorrelation and crosscorrelation, and the Welch bound. Theoretical analysis and simulation results show that the ranging code based on the improved Logistic chaotic sequence greatly improves the balance and that the ranging code performance is good and at the same time enhances the security and privacy of the ranging code.

Key words: ranging codes, chaotic sequence, autocorrelation, crosscorrelation, Welch bound

中图分类号: 

  • TN967.1