Beidou satellite navigation receiver, and method and device for improving tracking sensitivity of same
A navigation receiver and Beidou satellite technology, applied in the field of navigation, can solve the problems of short length and low tracking sensitivity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0026] see figure 1 The method for improving the tracking sensitivity of the Beidou satellite navigation receiver provided by Embodiment 1 of the present invention comprises the following steps:
[0027] S101, after the bit synchronization is successful, after the first millisecond of the bit period is determined, the I branch value and the Q branch value in each bit in the continuous n bits are respectively accumulated to obtain n groups of bit accumulation values, and n is greater than Or an integer equal to 2.
[0028] Assume that the numbers of the I branch value and the Q branch value of the NGEO satellite are I1, Q1, I2, Q2, ..., I20, Q20, I21, Q21, I22, Q22, ..., I40, Q40, ..., I20xn, Q20xn, Wherein, I20xn and Q20xn represent the 20th I branch value and Q branch value corresponding to the nth bit respectively, and I1 and Q1 represent the value of the first millisecond corresponding to the first bit.
[0029] Assume that the numbers of the I branch value and the Q bran...
Embodiment 2
[0042] see figure 2 The device for improving the tracking sensitivity of the Beidou satellite navigation receiver provided by Embodiment 2 of the present invention includes:
[0043] The accumulating module 11 is used to accumulate the I branch value and the Q branch value in each bit of the continuous n bits after the bit synchronization is successful and determine the first millisecond of the bit period to obtain n groups of bit accumulation values , n is an integer greater than or equal to 2;
[0044] Compensation module 12, for multiplying the I branch value and the Q branch value in n groups of bit accumulation values by 2 respectively n or 2 n-1 Bit compensation value, get 2 n or 2 n-1 The bit accumulation value after group compensation, each bit compensation value includes n bit compensation values corresponding to n groups of bit accumulation values, and each bit compensation value is 1 or -1;
[0045] FFT operation module 13, for respectively pairing 2 n or...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com