CN102288975B - Capturing method based on DFT (Discrete Fourier Transformation) optimization - Google Patents
Capturing method based on DFT (Discrete Fourier Transformation) optimization Download PDFInfo
- Publication number
- CN102288975B CN102288975B CN2011101209097A CN201110120909A CN102288975B CN 102288975 B CN102288975 B CN 102288975B CN 2011101209097 A CN2011101209097 A CN 2011101209097A CN 201110120909 A CN201110120909 A CN 201110120909A CN 102288975 B CN102288975 B CN 102288975B
- Authority
- CN
- China
- Prior art keywords
- dft
- value
- frequency
- calculate
- signal
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Position Fixing By Use Of Radio Waves (AREA)
Abstract
The invention belongs to the fields of communication and navigation, and discloses a capturing method based on DFT (Discrete Fourier Transformation) optimization. Specific to the problems of low efficiency, small number of responses and high power consumption existing in the conventional satellite navigation capturing method, the coefficient of DFT is quantified, so that computation of the DFT is optimized; and meanwhile, the points of the DFT are optimized as required, so that a large calculated quantity and a large quantity of storage resources and other resources are saved. During navigation application, the coefficient of the DFT is quantified at a low bit, and the DFT points are cut according to a Doppler deviation search range simultaneously, so that the calculated quantity and calculating points of the DFT are reduced greatly, and storage resources, calculation resources, time, power consumption and the like are saved. The method can be effectively applied to satellite navigation.
Description
Technical field
The invention belongs to communication and navigation field, relate in particular to the catching method that is used for satellite navigation.
Background technology
GPS (GPS, Global Position System) is the accurate global position system of a new generation.The GPS receiver generally includes the catching of signal, signal carrier and sign indicating number locking, navigation message and the extraction of pseudorange and resolving of calculating and locator value to the processing of received signal.What gps system adopted is spread spectrum technic; Before the band spread receiver despread-and-demodulation, must make the spreading code and the carrier wave of receiver local recovery and receive signal Synchronization; Only at code phase and carrier frequency error within the specific limits the time, detuner could operate as normal.Owing to there is the influence of the factors such as time delay, Doppler shift, multipath effect of drift, the electric wave transmission of frequency source; Code phase and carrier wave can have certain uncertainty synchronously; Therefore receiver must at first be caught signal; Code phase and estimating carrier frequencies error be reduced in the certain limit just can offer track loop, carry out signal trace.Catching of navigation satellite signal is the first step and the key that the GPS receiver signal is handled.
In the receiver, in army's sign indicating number receiver and multimode rake receiver, resource, volume and power consumption are a great problems of constraint receiver development especially at present.To this problem, domestic and international many mechanisms and unit have carried out big quantity research.The great majority of catching of satellite-signal are based on the time domain with on the frequency domain and realize that traditional method is on time domain, to utilize the way of serial search that spreading code is caught.At first propose to use FFT to realize the quick capturing method of spreading code at document " Van Nee, Coenen, Davenport.New Fast GPS Code-Acquisition Technique Using FFT; Electronic Letters; 1991, vol.27, NO.2:158-160 "; The multiple sampling plan of FFT is compared and analyze at document " C.Yang.Fast code acquisition with FFT and its sampling schemes; Proc.Institute of Navigation ION-GPS 96; Kansas City; MO, September 1996,1729-173 "; Proposed XFAST at document " Extended Replica Folding for Direct Acquisition of GPS P-Code and Its Performance Analysis; Proceedings of ION GPS 2000.Salt Lake City; Ut:The Institute of Navigation; 2000.2070-2078 " and realized P (Y) yard quick Acquisition Scheme, proposed the sequence blocks searching algorithm at document " Sequential Block Search for Direct Acquisition of Long Codes under Large Uncertainty, Proceedings of the 2001 National Technical Meeting.Long Beach; CA:ION; Jan.2001.408-414 " again, and to utilizing FFT to realize the short period sign indicating number, the catching method of long period sign indicating number and no periodic sign indicating number is classified and concluded.The analysis of the domestic method that long code is directly caught is also a lot, and has much provided corresponding achievement in research in realization, the string of realizing like the large-scale parallel correlator and the sliding correlation detector method of combination, and overlapping averaging method is duplicated in expansion, and the method for PMF-FFT etc.
Because the relative motion that exists between satellite and the receiver will inevitably be introduced Doppler shift in the receiver use.And Doppler shift will cause spreading gain to be decayed, and work is caught in influence, therefore in acquisition procedure, must carry out corresponding compensation and handle, and remove the influence that Doppler shift produced.In order to realize the receiver of low-power consumption, low-resource and miniaturization, special many scholars have proposed numerous optimization methods in the multimode rake receiver in future, but the optimization problem of efficient, resource, power consumption etc. still is the research emphasis of catching.
Summary of the invention
The present invention is in order to solve the bigger problem of efficient, resource and power consumption in the existing satellite navigation catching method, to have proposed a kind of catching method of optimizing based on DFT.
Technical scheme of the present invention is: a kind of catching method of optimizing based on DFT comprises the steps:
S1 carries out related operation to the satellite-signal N point data that receives and the N point data of the pseudo-random code of this locality;
S2 makes N point DFT to the result of each related operation among the step S1,
Wherein x (n) is the result of related operation, and X (k) is the frequency-domain result behind the calculating DFT, and detailed process is following: be reduced into the M five equilibrium to N Along ent on the frequency domain complex plane, establish N=M*m, behind the branches such as M, the value on the M five equilibrium
Replace score values such as original N
Be score values such as N
In the interval
Or
On value all use the value on the M five equilibrium
Replace, calculate N point DFT according to the DFT computing method then, obtain the DFT frequency-domain result;
S3 compares DFT frequency-domain result and preset threshold value, if surpass threshold value; Obtain the Doppler shift value of signal, if do not surpass threshold value, then code phase moves data; Continue step S1; If still come to nothing after all phase searches finish, then change intermediate frequency or sign indicating number sequence, continue search.
Further, also comprise the steps: between said step S2 and the step S3
Calculate DFT and calculate the maximal value of counting
Wherein, f
sBe the sampling rate of the satellite-signal that receives, Δ f is how general row frequency shift (FS) maximal value, then according to the n that counts that calculates
MaxCalculate DFT, the interval of promptly calculating k is [N-n
Max/ 2N-1] and [0 n
Max/ 2-1] the value of X (k).
Beneficial effect of the present invention: the present invention is through providing a kind of a kind of efficient and low-resource optimized Algorithm that proposes based on the algorithm of DFT, and effectively is applied to satellite navigation.Coefficient through to DFT quantizes, and then the calculating of DFT is optimized, and as required DFT is counted simultaneously to be optimized, and has practiced thrift a large amount of storage resources and calculated amount.In navigation application; Except the DFT coefficient is hanged down bit quantization; Also DFT is counted simultaneously and carry out cutting, thereby make calculated amount and the calculating of the DFT minimizing in a large number of counting all, conserve memory resource, computational resource, time and power consumption etc. according to search Doppler shift scope.
Description of drawings
Fig. 1 is the catching method schematic flow sheet of optimizing based on DFT of the present invention.
Fig. 2 is the DFT coefficient synoptic diagram of the bit quantization of the embodiment of the invention.
Embodiment
Below in conjunction with accompanying drawing and concrete embodiment the present invention is done further elaboration.
The method of traditional calculating DFT is to calculate according to formula
, and promptly each frequency domain components all must calculate the product of N Along ent on N input signal and the frequency domain complex plane.Therefore in the receiver acquisition process,, can bring the bigger problem of efficient, resource and power consumption based on the catching method of traditional DFT.
The catching method of optimizing based on DFT of the present invention, idiographic flow is as shown in Figure 1, comprises the steps:
S1 carries out related operation to the satellite-signal N point data that receives and the N point data of the pseudo-random code of this locality;
S2 makes N point DFT to the result of each related operation among the step S1,
Wherein x (n) is the result of related operation, and X (k) is the frequency-domain result behind the calculating DFT, and detailed process is following: be reduced into the M five equilibrium to N Along ent on the frequency domain complex plane, establish N=M*m, behind the branches such as M, the value on the M five equilibrium
Replace score values such as original N
Be score values such as N
In the interval
Or
On value all use the value on the M five equilibrium
Replace, calculate N point DFT according to the DFT computing method then, obtain the DFT frequency-domain result; The m here can be integer, also can be decimal.
S3 compares DFT frequency-domain result and preset threshold value, if surpass threshold value; Obtain the Doppler shift value of signal, if do not surpass threshold value, then code phase moves data; Continue step S1; If still come to nothing after all phase searches finish, then change intermediate frequency or sign indicating number sequence, continue search.
In order further to reduce calculated amount, between step S2 and step S3, also comprise the steps: to calculate DFT and calculate the maximal value of counting
Wherein, f
sBe the sampling rate of the satellite-signal that receives, Δ f is how general row frequency shift (FS) maximal value, then according to the n that counts that calculates
MaxCalculate DFT, the interval of promptly calculating k is [N-n
Max/ 2 N-1] and [0 n
Max/ 2-1] the value of X (k).Here, DFT conversion frequency domain representation scope is 0 to f
s, search for how general row frequency swing and be-1* Δ f~Δ f.
If the result of related operation is x (n), according to the DFT conversion, then the DFT of sequence x (n) is:
Because e
J θSo=cos θ-jsin θ is the DFT coefficient
Be the data on the N Along ent on the unit circle.If circle be divided into M N, usually N is the integral multiple of M, the coefficient of DFT has only M so, but it is constant to import number of data points, through putting the data of circle N five equilibrium under near the data the M five equilibrium among the data of M five equilibrium.Select suitable M, can greatly practice thrift storage resources, calculated amount and the computational resource of DFT.
When getting 8, M waits timesharing, and can be to obtain a more excellent effect.Be that example describes below with M=8.
The present invention gets 8 timesharing such as grade by M and calculates, and can know that according to
of DFT quantizing all coefficients in back all is positioned on the unit circle of complex plane.As shown in Figure 2, be divided into 8 equal portions to a complex plane circumference, to the DFT coefficient carry out 2 bit quantizations can the point on the eight equal parts all expression finish, and coefficient is carried out the later quantization parameter of suitable amplification is [1.5; 1+i, 1.5i ,-1+i ,-1.5;-1-i ,-1.5i, 1-i].According to the quantization parameter of DFT, DFT computing multiplication resources can have been become direct-connected signal (coefficient is ± 1) or several registers and totalizer (coefficient is ± 1.5) by original multiplier, and this will reduce the operand of DFT greatly.Suppose to be now 256 DFT; Carrying out five equilibrium because M gets 8, is that (1.5,0) replace so 240~256 and 1~16 Along ent in original 256 five equilibriums uses the corresponding DFT coefficient of first Along ent in the M=8 Along ent; 17~48 Along ents become (1 with the DFT coefficient of second Along ent of eight equal parts point; I) replace, 49~80 Along ents become (15i) replacement with the 3rd Along ent DFT coefficient of eight equal parts point, and the DFT that remaining coefficient and other are counted by that analogy.
In order only Doppler's frequency band to be searched for, can adjust the DFT coefficient, concentrate on coefficient in the frequency band range that needs and carry out conversion, the parameter of other frequency band is not then calculated, can also save a large amount of calculated amount like this.If sampling rate is f
s, DFT conversion frequency domain representation scope is 0 to f so
sBe ± 10KHZ that computer capacity needs only so if search for how general row scope
Just can calculate maximum calculating counts and is n
Max, count according to this then and just can calculate the DFT of needs.Suppose to adopt the 4ms data to be 256 DFT; Therefore spectral resolution is that corresponding
is when DFT is dispersed in calculating; In order to search for ± the 10KHz signal, calculative counting to
therefore only needs 216 o'clock to 255 o'clock, 0 o'clock to 39 o'clock X (k) to get final product.Thereby need not calculate 256 whole DFT.If same only search ± 5KHz only needs calculating 236 to 255 points, 0 o'clock to 19 o'clock DFT to get final product, other frequency computation part principle is the same.Full frequency-domain search if desired, perhaps the hunting zone is very big, causes the calculation procedure number to surpass the mode of FFT, can be applied to FFT to this quantification manner and get on.
Can find out, of the present inventionly quantize, can simplify the calculating of DFT, quantize later as required counting of DFT being optimized simultaneously, can practice thrift a large amount of storage resources and calculated amount through coefficient to DFT.In navigation application; Except the DFT coefficient is quantized; Also DFT is counted simultaneously and carry out cutting according to search Doppler shift scope; Make the calculating of DFT count and calculated amount all reduces, conserve memory resource, computational resource, time and power consumption etc., this method can effectively be applied to satellite navigation.
Those of ordinary skill in the art will appreciate that embodiment described here is in order to help reader understanding's principle of the present invention, should to be understood that protection scope of the present invention is not limited to such special statement and embodiment.Those of ordinary skill in the art can make various other various concrete distortion and combinations that do not break away from essence of the present invention according to these teachings disclosed by the invention, and these distortion and combination are still in protection scope of the present invention.
Claims (4)
1. a catching method of optimizing based on DFT comprises the steps:
S1 carries out related operation to the N point data of the satellite-signal that receives and the N point data of the pseudo-random code of this locality;
S2 makes N point DFT to the result of each related operation among the step S1,
Wherein x (n) is the result of related operation, and X (k) is the frequency-domain result behind the calculating DFT, and detailed process is following: be reduced into the M five equilibrium to N Along ent on the frequency domain complex plane, establish N=M*m, behind the branches such as M, the value on the M five equilibrium
Replace score values such as original N
Score values such as N
In the interval
Or
On value all use the value on the M five equilibrium
Replace, calculate N point DFT according to the DFT computing method then, obtain the DFT frequency-domain result;
S3 compares DFT frequency-domain result and preset threshold value, if surpass threshold value; Obtain the Doppler shift value of signal, if do not surpass threshold value, then code phase moves data; Continue step S1; If still come to nothing after all phase searches finish, then change intermediate frequency or sign indicating number sequence, continue search.
2. the catching method of optimizing based on DFT according to claim 1 is characterized in that, also comprises the steps: between said step S2 and the step S3
Calculate DFT and calculate the maximal value of counting
Wherein, f
sBe the sampling rate of the satellite-signal that receives, Δ f is how general row frequency shift (FS) maximal value, then according to the n that counts that calculates
MaxCalculate DFT, the interval of promptly calculating k is [N-n
Max/ 2N-1] and [0 n
Max/ 2-1] the value of X (k).
3. the catching method of optimizing based on DFT according to claim 1 and 2 is characterized in that described N is the integral multiple of M.
4. the catching method of optimizing based on DFT according to claim 1 and 2 is characterized in that described M is 8.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2011101209097A CN102288975B (en) | 2011-05-11 | 2011-05-11 | Capturing method based on DFT (Discrete Fourier Transformation) optimization |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2011101209097A CN102288975B (en) | 2011-05-11 | 2011-05-11 | Capturing method based on DFT (Discrete Fourier Transformation) optimization |
Publications (2)
Publication Number | Publication Date |
---|---|
CN102288975A CN102288975A (en) | 2011-12-21 |
CN102288975B true CN102288975B (en) | 2012-11-07 |
Family
ID=45335538
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN2011101209097A Expired - Fee Related CN102288975B (en) | 2011-05-11 | 2011-05-11 | Capturing method based on DFT (Discrete Fourier Transformation) optimization |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN102288975B (en) |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106980125B (en) * | 2016-01-18 | 2022-02-01 | 北京信息科技大学 | Reduced calculation amount deblurring processing method for XFAST capture in satellite navigation |
CN107728104A (en) * | 2017-10-09 | 2018-02-23 | 中国电子科技集团公司第二十研究所 | A kind of improved satellite navigation interference direction-finding method |
CN108318900B (en) * | 2017-12-29 | 2021-04-23 | 中国科学院光电研究院 | High-precision frequency capturing method for periodic pulse enhanced navigation signal |
CN112214895A (en) * | 2020-10-14 | 2021-01-12 | 中国船舶重工集团公司第七二四研究所 | Fourier multi-beam forming method with transform point number optimization design |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6452961B1 (en) * | 2000-09-12 | 2002-09-17 | Interstate Electronics Corporation | Massively paralleled sequential test algorithm |
CN101132191A (en) * | 2007-10-15 | 2008-02-27 | 北京航空航天大学 | Baseband signal processing method for GNSS receiver |
CN101561484A (en) * | 2009-05-11 | 2009-10-21 | 北京航空航天大学 | Method for acquiring pseudo code of GNSS signal |
EP2223143A2 (en) * | 2007-05-10 | 2010-09-01 | Qualcomm Incorporated | Gnss signal processor |
-
2011
- 2011-05-11 CN CN2011101209097A patent/CN102288975B/en not_active Expired - Fee Related
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6452961B1 (en) * | 2000-09-12 | 2002-09-17 | Interstate Electronics Corporation | Massively paralleled sequential test algorithm |
EP2223143A2 (en) * | 2007-05-10 | 2010-09-01 | Qualcomm Incorporated | Gnss signal processor |
CN101132191A (en) * | 2007-10-15 | 2008-02-27 | 北京航空航天大学 | Baseband signal processing method for GNSS receiver |
CN101561484A (en) * | 2009-05-11 | 2009-10-21 | 北京航空航天大学 | Method for acquiring pseudo code of GNSS signal |
Non-Patent Citations (2)
Title |
---|
包亮等.基于DFT快速算法对扩频码捕获过程的优化.《航天控制》.2010,第28卷(第3期),全文. |
基于DFT快速算法对扩频码捕获过程的优化;包亮等;《航天控制》;20100630;第28卷(第3期);全文 * |
Also Published As
Publication number | Publication date |
---|---|
CN102288975A (en) | 2011-12-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN100554994C (en) | Obtain the device and method of spread-spectrum signal | |
CN100360953C (en) | Radio signal receiver with device for calibrating multi-way signal effect and method for starting receiver | |
CN102288975B (en) | Capturing method based on DFT (Discrete Fourier Transformation) optimization | |
Li et al. | GPS signal acquisition via compressive multichannel sampling | |
CN104898136A (en) | Capturing method of Beidou second-generation B1 signals and system thereof | |
CN105553506A (en) | Fast acquisition method and device of long code spread spectrum signal | |
Gao et al. | Fast GNSS signal acquisition with Doppler frequency estimation algorithm | |
Tabatabaei et al. | Performance analysis of GLONASS integration with GPS vectorised receiver in urban canyon positioning | |
Tamazin et al. | Robust fine acquisition algorithm for GPS receiver with limited resources | |
CN101320084A (en) | Real-time processing method of satellite positioning signal | |
CN103926604A (en) | Weak signal capturing method based on overlapping difference cycle coherent integration | |
Sagiraju et al. | Fast acquisition implementation for high sensitivity global positioning systems receivers based on joint and reduced space search | |
CN104035109A (en) | Weak signal capturing method based on 1/5 bit differential circulation coherent integration | |
Nichols et al. | Software-defined GNSS is ready for launch | |
CN103439718A (en) | Unambiguous tracking unit of high-order BOC modulation signals | |
CN104931980A (en) | Carrier phase measurement semi-cycle fuzzy relieving method | |
CN103837878A (en) | Method for acquiring GNSS satellite signal | |
RU2444027C2 (en) | Satellite navigation signal receiver with fast and high-sensitivity search unit | |
CN103454651A (en) | Fast GPS L2C CM code capturing method | |
CN110780320B (en) | Software and hardware integrated satellite navigation signal processing method | |
CN102353967B (en) | Apparatus, methods and computer program products for signal acquisition using common demodulation templates | |
Won et al. | Noniterative filter-based maximum likelihood estimators for GNSS signal tracking | |
CN103064096B (en) | Beidou navigation message extraction device and method based on blind signal processing | |
CN100438360C (en) | Method and equipment for realizing parallel correlator utilizing block integral in spread spectrum communication | |
Gunawardena | A universal GNSS software receiver MATLAB® toolbox for education and research |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20121107 Termination date: 20150511 |
|
EXPY | Termination of patent right or utility model |