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

• Original Articles • Previous Articles     Next Articles

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 E-mail:xuerui@hrbeu.edu.cn

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

CLC Number: 

  • TN967.1