KR101767571B1 - Acquisition method for precision code at receiver - Google Patents

Acquisition method for precision code at receiver Download PDF

Info

Publication number
KR101767571B1
KR101767571B1 KR1020160000433A KR20160000433A KR101767571B1 KR 101767571 B1 KR101767571 B1 KR 101767571B1 KR 1020160000433 A KR1020160000433 A KR 1020160000433A KR 20160000433 A KR20160000433 A KR 20160000433A KR 101767571 B1 KR101767571 B1 KR 101767571B1
Authority
KR
South Korea
Prior art keywords
code
receiver
local
acquisition point
observation window
Prior art date
Application number
KR1020160000433A
Other languages
Korean (ko)
Other versions
KR20170081421A (en
Inventor
윤석호
채근홍
Original Assignee
성균관대학교산학협력단
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 성균관대학교산학협력단 filed Critical 성균관대학교산학협력단
Priority to KR1020160000433A priority Critical patent/KR101767571B1/en
Publication of KR20170081421A publication Critical patent/KR20170081421A/en
Application granted granted Critical
Publication of KR101767571B1 publication Critical patent/KR101767571B1/en

Links

Images

Classifications

    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
    • G01S19/00—Satellite radio beacon positioning systems; Determining position, velocity or attitude using signals transmitted by such systems
    • G01S19/01—Satellite radio beacon positioning systems transmitting time-stamped messages, e.g. GPS [Global Positioning System], GLONASS [Global Orbiting Navigation Satellite System] or GALILEO
    • G01S19/13—Receivers
    • G01S19/24—Acquisition or tracking or demodulation of signals transmitted by the system
    • G01S19/30—Acquisition or tracking or demodulation of signals transmitted by the system code related
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
    • G01S19/00—Satellite radio beacon positioning systems; Determining position, velocity or attitude using signals transmitted by such systems
    • G01S19/01—Satellite radio beacon positioning systems transmitting time-stamped messages, e.g. GPS [Global Positioning System], GLONASS [Global Orbiting Navigation Satellite System] or GALILEO
    • G01S19/13—Receivers
    • G01S19/20—Integrity monitoring, fault detection or fault isolation of space segment
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
    • G01S19/00—Satellite radio beacon positioning systems; Determining position, velocity or attitude using signals transmitted by such systems
    • G01S19/01—Satellite radio beacon positioning systems transmitting time-stamped messages, e.g. GPS [Global Positioning System], GLONASS [Global Orbiting Navigation Satellite System] or GALILEO
    • G01S19/13—Receivers
    • G01S19/31—Acquisition or tracking of other signals for positioning

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • Position Fixing By Use Of Radio Waves (AREA)

Abstract

A method of acquiring a P-code at a receiver includes the steps of: determining a first code acquisition point using a first local code folded with an input signal by a receiver; And determining a second code acquisition point using a second local code folding code located within the first code acquisition point.

Figure R1020160000433

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention [0001] The present invention relates to a method for acquiring a P-

The technique described below relates to a technique for obtaining a P code among pseudo noise codes.

Global navigation satellite systems (GNSSs) are systems that provide information on the location of objects on the ground using space satellites. The global positioning system (GPS) is the most popular GNSS system developed and operated by the US Department of Defense in the early 1970s for military purposes. Although GPS was originally developed for military purposes, some signals are currently being used by the private sector, and are being used for various purposes in agriculture and surveying as well as for location guidance and emergency rescue.

The GPS signal is multiplied by a pseudo random noise code (PRN code), and the PRN code of the GPS signal can be divided into two types. The coarse acquisition (C / A) code provides a standard positioning service, with a chip rate of 1.023 MHz and a period of 1 ms. The P (precision) code provides precise location services, a chip rate of 10.23 MHz, and a cycle of 7 days. Since the P code has a higher chip rate and a longer cycle time than the C / A code, the signal using the P code provides higher positioning accuracy, and is characterized in that it is robust to jamming and spoofing.

P code has a very long cycle, so it takes a long time to acquire the code. There is a method of acquiring the code of the C / A code to obtain the P code more quickly, and finally obtaining the P code through the handover. Also, a direct acquisition (DA) technique has been proposed in which code acquisition is performed using only P code without using code acquisition of C / A code.

C. Yang, J. Chaffee, J. Abel, and M. J. Vasquez, "Fast direct P (Y) -code acquisition using XFAST," in Proc. ION GPS 2000, pp. 19-22, Salt Lake City, UT, Sep, 2000. H. Li, X. Cui, M. Lu, and Z. Feng, "Dual-folding based rapid search method for long PN-code acquisition," IEEE Trans. Wireless Commun. vol. 7, no. 12, pp. 5286-5295, Dec. 2008. H. Li, M. Lu, and Z. Feng, "Generalized zero-padding scheme for direct GPS P-code acquisition," IEEE Trans. Wireless Commun. vol. 8, no. 6, pp. 2866-2871, June 2009. J. Ping, X. Wu, J. Yan, and W. Zhu, "Modified Zero-Padding Method for Fast Long PN-Code Acquisition," IEEE Vehicular Technology Conference Fall 2014 (VTC Fall 2014), pp. 1-5, Vancouver, Canada, 2014.

The technique described below is intended to provide a technique for P code acquisition at a receiver.

A method of acquiring a P-code at a receiver includes the steps of: determining a first code acquisition point using a first local code folded with an input signal by a receiver; And determining a second code acquisition point using a second local code folding code located within the first code acquisition point.

The technique described below determines the approximate code acquisition point and determines the correct code acquisition point based on the approximate code acquisition point to acquire the P code quickly and accurately.

1 is an example of a block diagram illustrating the structure of a receiver for P code acquisition.
2 is an example showing a process of generating an observation window by a receiver.
3 shows an example of a received code and a folded local code.
4 shows an example of a received code in which 0 is inserted.
Figure 5 shows an example of folding local code.

The following description is intended to illustrate and describe specific embodiments in the drawings, since various changes may be made and the embodiments may have various embodiments. However, it should be understood that the following description does not limit the specific embodiments, but includes all changes, equivalents, and alternatives falling within the spirit and scope of the following description.

The terms first, second, A, B, etc., may be used to describe various components, but the components are not limited by the terms, but may be used to distinguish one component from another . For example, without departing from the scope of the following description, the first component may be referred to as a second component, and similarly, the second component may also be referred to as a first component. And / or < / RTI > includes any combination of a plurality of related listed items or any of a plurality of related listed items.

As used herein, the singular " include "should be understood to include a plurality of representations unless the context clearly dictates otherwise, and the terms" comprises & , Parts or combinations thereof, and does not preclude the presence or addition of one or more other features, integers, steps, components, components, or combinations thereof.

Before describing the drawings in detail, it is to be clarified that the division of constituent parts in this specification is merely a division by main functions of each constituent part. That is, two or more constituent parts to be described below may be combined into one constituent part, or one constituent part may be divided into two or more functions according to functions that are more subdivided. In addition, each of the constituent units described below may additionally perform some or all of the functions of other constituent units in addition to the main functions of the constituent units themselves, and that some of the main functions, And may be carried out in a dedicated manner.

Also, in performing a method or an operation method, each of the processes constituting the above method may occur in a different order than that described in the context without explicitly specifying a specific order in the context. That is, each process may occur in the same order as described, may be performed substantially concurrently, or may be performed in the opposite order.

The DSSS system uses a spread spectrum modulation scheme that multiplies (XORs) a digital signal (spreading code) having a high frequency with a signal to be transmitted and spreads the spread signal. The DSSS technique is used in Code Division Multiple Access (CDMA), IEEE 802.11b (Wi-Fi), GPS and the like. The DSSS technique modulates data using PN (Pseudo Noise) codes, which are bit streams. The PN code is also called a PRN (Pseudorandom Noise) code. In the GPS or the like, the PN code can use the C / A code and the P code as described above.

Since the P code has a higher chip rate and a longer cycle time than the C / A code, the signal using the P code provides higher positioning accuracy, and is characterized in that it is robust to jamming and spoofing.

The first method proposed in the DA technique is a linear correlation (SS) method in which a long period of P code is deferred one after another and the long period of the P code is not considered. . Although parallel retrieval reduces the code acquisition time by using linear correlations using a number of parallel correlators, the hardware complexity increases, which makes it difficult to actually implement. In order to overcome this disadvantage, a fast code - acquisition scheme has been developed using fast fourier transform (FFT) correlation instead of linear correlation.

There are two ways of using FFT correlation: folding and zero padding (ZP). The extended replica folding acquisition search technique (XFAST) is a method of folding many local codes of the same length as the received code and performing code acquisition through FFT correlation with the received code. However, there is a problem that the XFAST technique searches only a part of the correlation candidates obtained through the rough code acquisition, rather than the entire correlation candidates, in the accurate code acquisition process performed after the rough code acquisition process. In the dual folding developed in the future, folding is performed on the received signal to overcome the disadvantage of degradation of the correlation property caused by the folding method employed in the XFAST technique, and the correlation obtained through the rough code acquisition Although the XFAST technique is improved by searching the entire candidate values, there is a disadvantage in that the mean acquisition time (MAT) can not be effectively reduced due to the folding of the received signal and the increase in the number of correlations during correct code acquisition.

On the other hand, a code acquisition method using a ZP technique that performs an FFT operation by replacing part of a received code with 0 without using folding has been proposed. However, the ZP method has a disadvantage in that it does not reduce the MAT effectively because the minimum number of correlations required is larger than that of the XFAST or the dual folding method.

The technique described below relates to a technique for P code acquisition. The technique described below corresponds to the DA technique. The P code acquisition described below is performed at the receiver.

Under the AWGN (Additive White Gaussian Noise) environment, a baseband received signal considering a broadband jamming environment

Figure 112016000339624-pat00001
I < th >

Figure 112016000339624-pat00002

I is the size of the signal, d [i] ∈ {-1,1} is the ith navigation data, C [i] ∈ {-1,1} is the i-th P code chip, n [i] A white additive Gaussian noise (AWGN) with mean 0 and variance σ 2 n , w [i] represents a broadband jamming component with mean 0 and variance σ 2 w . Hereinafter, it is assumed that d [i] = 1 based on the pilot channel.

The receiver performs correlation for the synchronization candidate point search. The receiver uses a fast Fourier transform (FFT) -based correlator for fast correlation. For example, if the receiver uses a code vector

Figure 112016000339624-pat00003
The FFT-based autocorrelation is expressed by Equation (2) below.

Figure 112016000339624-pat00004

In Equation 2,

Figure 112016000339624-pat00005
Is an inner product operator, and (x) * denotes a conjugate operator for the variable x.

We propose a code acquisition method with two steps for fast code acquisition of P code in broadband jamming environment. First, in a first step, the receiver performs an FFT correlation between a folded code and a received code by folding a plurality of local codes equal in length to the received code to obtain a rough code acquisition interval. The first step is to find the approximate code acquisition interval. In the second step, the receiver performs FFT correlation between the code in which the local code is folded once by 1/2 and the code in which 0 is inserted in a part of the received code in order to obtain an accurate code within the approximate code acquisition period.

1 is an example of a block diagram illustrating the structure of a receiver 100 for P code acquisition. The receiver 100 includes a local P code generator 110, a first sample extractor 120, a second sample extractor 130, a third sample extractor 160, a zero padding 130, a first folding unit 150 A second folding unit 170, a correlator 180, and a code determiner 190. [

The first sample extractor 120 extracts a predetermined sample signal from the signal (input signal) received by the receiver. The signal extracted by the first sample extractor 120 is called a reception code. It is assumed that the first sample extractor 120 extracts N received codes of length (size).

The local P-code generator 110 generates a constant P-code in the receiver 100. The signal generated by the local P code generator 110 is called a local code. The second sample extractor 140 and the third sample extractor 160 extract a predetermined sample signal from the local code, respectively.

The second sample extractor 140 extracts N × M (as much as the observation window) code from the local code. Where M is any natural number and N is the length of the received code. The observation window is an area of code that can be searched once for FFT correlation.

FIG. 2 is an example showing a process of generating an observation window by the receiver 100. FIG. Figure 2 shows an observation window for finding a rough code acquisition point. If the receiver does not find the approximate code acquisition point in the jth observation window, it looks for the approximate code acquisition point in the j + 1th observation window. The current observation window (e.g., the jth observation window) and the next observation window (e.g., the (j + 1) th observation window) have a partially overlapped form. 2 shows an example of generating an observation window of LAMBDA in the local P code. The second sample extractor 140 extracts a code corresponding to the observation window size from the code generated by the local P code generator 110. Thereafter, the receiver 100 finds an approximate code acquisition point on an observation window basis. Hereinafter, a process of finding an approximate code acquisition point within the observation window will be described.

The receiver searches for a synchronization point based on the local code extracted by the second sample extractor 140 (i.e., within one observation window). The method of finding the synchronization point in the observation window is as follows.

The first folding unit 150 folds the local code transmitted by the second sample extractor 140 uniformly. In the MN size observation window, M codes (segments) of N sizes are listed. The first folding unit 150 arranges and folds N size segments in a predetermined order. The first folding unit 150 folds N size segments to generate a code of length N. [ At this time,

Figure 112016000339624-pat00006
I < th > sample in the j < th &
Figure 112016000339624-pat00007
Is expressed as follows.

Figure 112016000339624-pat00008

In Equation 3, C [jW + i] means the i-th sample in the j-th observation window in the local code.

Figure 112016000339624-pat00009
Has a value between -M and M.

3 shows an example of a received code and a folded local code. FIG. 3 is an example of a process performed in one observation window j. 3, the length of the received code x is N. In Fig. The local code has an overall length NM. The receiver (the second sample extractor) divides the local code into M segments having N segments, and folds M local codes. Folding means that M segments are summed in a state where M segments are arranged at the same position as shown in FIG. The folding result is N segments of length having values of f j (0) to f j (N-1).

The receiver determines that there is a synchronization point in the window if there is a value exceeding a threshold value among the correlation result values through FFT correlation between the reception code and the folded code. This synchronization point is called the approximate code acquisition point. The correlator 180 constantly correlates the received code with the folded code to determine whether or not there is a synchronization point in the code. The FFT correlation in the first stage (approximate code acquisition point detection) system can be expressed as Equation (4) below.

Figure 112016000339624-pat00010

The first FFT operator 181 performs an FFT operation on the reception code extracted by the first sample extractor 120. The second FFT operator 182 performs FFT operation on the code generated by folding the first folding unit 150. The conjugate operator 180 performs a conjugate operation on the output value of the second FFT operator 182. The inner product calculator 184 multiplies the output value of the first FFT calculator 181

Figure 112016000339624-pat00011
And the output value of the sum calculator 180
Figure 112016000339624-pat00012
Internal Operations on (
Figure 112016000339624-pat00013
). The IFFT operator 185 performs an inverse Fourier operation on the output signal of the internal /

The code determiner 190 determines that there is a synchronization point in the window if the output signal (correlation result value) of the IFFT operator 185 has a value exceeding the threshold value.

If the receiver 100 acquires a rough code acquisition point, it acquires an accurate code acquisition point based on it. On the other hand, if there is no value exceeding the threshold among the correlation result values, the receiver determines that there is no synchronization point in the window. Then, the receiver 100 repeats the process of finding the approximate code acquisition point by setting the length NM starting from the point spaced by (M-1) N + 1 as the observation window. 1, if the code determiner 190 determines that there is no synchronization point in the window, it transmits a certain signal to the second sampler 140, and the second sampler 140 transmits a signal corresponding to the next sample window Extract the signal. Then repeat the process to find the approximate code acquisition point in the next observation window.

If the receiver 100 finds a rough code acquisition point, it then proceeds to obtain the correct code acquisition point from the approximate code acquisition point.

The zero padding unit 130 inserts zero in the received code. Here zero insertion is the process of replacing the last N / 2 codes of the received code with zero. 4 shows an example of a received code in which 0 is inserted. Equation (5) below shows a reception code in which a padding unit inserts 0 into a reception code

Figure 112016000339624-pat00014
. That is, the output signal of the zero padding unit 130 is
Figure 112016000339624-pat00015
.

Figure 112016000339624-pat00016

Receiver 100 now folds the local code using a 3N / 2 size observation window. The third sample extractor 160 extracts a sample code based on the approximate code acquisition point determined in the first step. Therefore, the third sample extractor 160 receives the local code within the observation window (approximate code acquisition point) of the MN size extracted by the second sample extractor 140.

The third sample extractor 160 extracts the sample code using a 3N / 2 observation window in the local code of the MN size. The second folding unit 170 folds the local code of 3N / 2 size extracted by the third sample extractor 160. Figure 5 shows an example of folding local code. 5 shows an example of folding a local code using a 3N / 2 size window.

The second folding unit 170 generates a new signal by folding the local code based on the 3N / 2 size window. There are N local codes and N / 2 local codes in the 3N / 2 size window.

As shown in FIG. 5, the second folding unit 170 folds N-sized local codes and N / 2-sized local codes to generate N-sized new codes. (6) is a local code generated by folding N-sized local codes ([0] to [N-1]) and N /

Figure 112016000339624-pat00017
.

Figure 112016000339624-pat00018

The receiver 100 now receives the zero received code

Figure 112016000339624-pat00019
And the newly created local code
Figure 112016000339624-pat00020
To find the correct code acquisition point. Equation (7) below represents the reception code
Figure 112016000339624-pat00021
And the newly created local code
Figure 112016000339624-pat00022
Lt; / RTI >

Figure 112016000339624-pat00023

When the zero padding unit 130 receives zero (0)

Figure 112016000339624-pat00024
To the first FFT operator (181) of the correlator (180). The second folding unit 170 may include a local code
Figure 112016000339624-pat00025
To the second FFT operator (182) of the correlator (180). In FIG. 1, the correlator 180 performs a correlation operation in both a process of finding a rough code acquisition point and a process of finding an accurate code acquisition point. In some cases, the correlator for finding the approximate code acquisition point and the correlator for finding the correct code acquisition point may be different.

The calculation process inside the correlator 180 is the same as the case of finding the approximate code acquisition point. The code determiner 190 then compares the output signal (correlation value) of the correlator 180 with a threshold to determine the correct code acquisition point.

The code determiner 190 finds the maximum value among the N correlation values obtained from Equation (7). The code determiner 190 compares the maximum value with a threshold value, and if the j-th correlation value is greater than the threshold value,

Figure 112016000339624-pat00026
As an accurate code acquisition point. For reference, the threshold used to determine the correct code acquisition point and the threshold used to determine the approximate code acquisition point may be different. If the maximum value of the N correlation values does not exceed the threshold value, the receiver 100 sets an observation window having a length of 3N / 2 starting from a point spaced by N, to find an accurate code acquisition point . Although not shown in FIG. 1, the code determiner 190 may send a signal to the third sample extractor 160 or the like to repeat the process for finding an accurate code acquisition point. The third sample extractor 160 extracts the local signal present in the next observation window. Thereafter, a process for finding an accurate code acquisition is repeated. Since the length of the code acquired through the rough code acquisition process is the MN, the receiver 100 performs code searching of up to M times in the accurate code acquisition process.

The receiver 100 then uses the correct code acquisition point to track subsequent signals.

It should be noted that the present embodiment and the drawings attached hereto are only a part of the technical idea included in the above-described technology, and those skilled in the art will readily understand the technical ideas included in the above- It is to be understood that both variations and specific embodiments which can be deduced are included in the scope of the above-mentioned technical scope.

100: receiver
110: Local P code generator
120: First sample extractor
130: zero padding machine
140: second sample extractor
150: first folding machine
160: Third sample extractor
170: second folding machine
180: Correlator
181: first FFT operator
182: second FFT operator
183:
184: inner product operator
185: IFFT operator
190: Code determiner

Claims (5)

Determining a first code acquisition point using a first local code folded with an input signal by a receiver; And
Determining a second code acquisition point using a second local code in which the receiver folds the code located within the first code acquisition point with a signal padded with zero (0) to the input signal; , ≪ / RTI &
Wherein determining the second code acquisition point comprises:
Extracting an N number of received codes from the input signal;
Dividing the received code in half by the receiver and padding a back portion of the received code with zero to generate a padded receive code;
Extracting a sample code using an N × M size code, which is the first code acquisition point, using the 3N / 2 observation window;
The receiver folding a first segment of N size and a second segment of N / 2 size located within the viewing window to generate a local code; And
Determining a sample code included in the observation window as a second code acquisition point if a correlation value between the padded reception code and the local code and a value exceeding a threshold value exist among the correlation values calculated by the correlation; And wherein M is an arbitrary natural number. The method according to claim 1,
Further comprising the step of the receiver tracking the signal with reference to a second code acquisition point. The method according to claim 1,
The step of determining the first code acquisition point
Extracting an N number of received codes from the input signal;
The receiver generating a local P code;
The receiver extracting a sample code using an observation window having an N x M size in the local P code;
The receiver separating the sample codes into N samples and folding the segments into N samples to generate local codes; And
Determining a sample code included in the observation window as a first code acquisition point if a correlation value between the reception code and the local code and a value exceeding a threshold value exist among the correlation values calculated by the correlation, , And M is a random natural number. The method of claim 3,
If the correlation value is less than or equal to a threshold value, the receiver extracts a new sample code using the next observation window of the observation window in the local P code, divides the new sample code into N segments, Folding to generate a new local code; And
Determining a new sample code included in the next observation window as a first code acquisition point if the receiver correlates the received code with the new local code and there is a correlation value exceeding a threshold among the correlated values; ≪ / RTI > further comprising receiving the P code from the receiver. delete
KR1020160000433A 2016-01-04 2016-01-04 Acquisition method for precision code at receiver KR101767571B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020160000433A KR101767571B1 (en) 2016-01-04 2016-01-04 Acquisition method for precision code at receiver

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020160000433A KR101767571B1 (en) 2016-01-04 2016-01-04 Acquisition method for precision code at receiver

Publications (2)

Publication Number Publication Date
KR20170081421A KR20170081421A (en) 2017-07-12
KR101767571B1 true KR101767571B1 (en) 2017-08-11

Family

ID=59353045

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020160000433A KR101767571B1 (en) 2016-01-04 2016-01-04 Acquisition method for precision code at receiver

Country Status (1)

Country Link
KR (1) KR101767571B1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102155658B1 (en) * 2018-02-02 2020-09-15 성균관대학교산학협력단 Method for acquiring binary offset cattier modulated code and apparatus therefor

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
Hong Li 외 3명. Dual-Folding Based Rapid Search Method for Long PN-Code Acquisition. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS. DECEMBER 2008. VOL.7, NO.12, pp.5286-5296.
Na Wang 외 2명. Direct and rapid p code acquisition technique. Communications and Information Technologies. 2007. ISCIT '07. International Symposium on, 2007.10. pp.1122-1124.
전현옥 외 4명. 해양 통신 환경에서의 P 코드 신호 획득을 위한 Dual-Folding 기법의 성능 분석. 한국통신학회 학술대회논문집. 2014.11월. pp.99-101.

Also Published As

Publication number Publication date
KR20170081421A (en) 2017-07-12

Similar Documents

Publication Publication Date Title
KR101564828B1 (en) Signal processing method for ultra-fast acquisition and tracking of severely attenuated spread spectrum signals with doppler frequency and apparatus thereof
JP5642669B2 (en) Multiple correlation processing in code space search
KR101818162B1 (en) Acquisition method for precision code based on parallel folding and receiver for acquiring precision code based on parallel folding
Kong et al. Two-dimensional compressed correlator for fast PN code acquisition
Kim et al. Design of FFT-based TDCC for GNSS acquisition
Tamazin et al. Robust fine acquisition algorithm for GPS receiver with limited resources
US20110050496A1 (en) Energy Domain Based Peak Reconstruction Methods And Apparatuses
KR101767571B1 (en) Acquisition method for precision code at receiver
KR101356239B1 (en) Compressed sensing based fast gnss and spread spectrum signal acquisition method and apparatus thereof
CN102841361B (en) Fast capturing method for ordinary ranging codes of signals of global navigation satellite system
CN104765053B (en) The catching method and device of pseudo-code in a kind of GNSS receiver
KR101812325B1 (en) Acquisition method for precision code based on memory array and receiver for acquiring precision code based on memory array
KR100778096B1 (en) Method and Apparatus for Acquiring Signals in CDMA Receivers
Mao et al. Unambiguous BPSK-like CSC method for Galileo acquisition
CN104993844B (en) A kind of frequency domain search method and device
KR102155658B1 (en) Method for acquiring binary offset cattier modulated code and apparatus therefor
US20040141574A1 (en) Determination of the code phase between a code modulated signal and a replica code sequence
Kim et al. Two dimensional compressed correlator for fast acquisition in GNSS
KR101956339B1 (en) Method and receiver for direct acquisition of precision code based on multiple folding
CN115267860B (en) High-precision guiding method for multi-correlator set of high-dynamic short burst signals
US20080068264A1 (en) Reconfigurable search engine
Beldjilali et al. A new proposed GPS satellite signals acquisition algorithm based on the fast Fourier transform
Kim et al. FFT based two dimensional compressed correlator for fast acquisition in GNSS
KR101440692B1 (en) 2-dimensional compressed correlator for fast gnss and spread spectrum signal acquisition and robust tracking and apparatus thereof
Chae et al. An improved direct acquisition scheme for rapid P code acquisition

Legal Events

Date Code Title Description
A201 Request for examination
E902 Notification of reason for refusal
E701 Decision to grant or registration of patent right
GRNT Written decision to grant