A Novel Ranging Code based on improved Logistic Map Chaotic Sequences

Abstract

Spread-spectrum technology is widely used in communication system particularly in Global Navigation Satellite System (GNSS) to achieve a better ranging accuracy. This makes spreading code (also known as ranging code) so important that any change of it would directly influence positioning accuracy, compatibility, anti-interference, security, and receiver performance. Therefore, research on ranging code could provide theoretical support for the improvement of the performance of ranging codes and extension of their design methods to future satellite navigation signal structures. Chaotic sequence is not predictable and non-periodic so that has great auto-correlation and cross-correlation characteristic. However, the code balance of chaotic sequence is barely satisfactory, in this paper, a novel ranging code is proposed and we will give the details of the ranging code design process based on improved Logistic-map chaotic sequences and m code. Then the code select criteria based on even/odd correlation functions and welch bound have been set up to compare different code sets which include the proposed code, common GPS code, common Beidou code, and Random code. Theoretical analysis and simulation results show that the proposed ranging code cannot only maintain excellent performance in the acquisition, tracking, and anti-interference performance as the GPS L5I code but also significantly improve balance performance to strong balance constraints and improve code length flexibility.