CN112910497B - Quick code capture method for short-spreading-ratio satellite communication system - Google Patents

Quick code capture method for short-spreading-ratio satellite communication system Download PDF

Info

Publication number
CN112910497B
CN112910497B CN202110062326.7A CN202110062326A CN112910497B CN 112910497 B CN112910497 B CN 112910497B CN 202110062326 A CN202110062326 A CN 202110062326A CN 112910497 B CN112910497 B CN 112910497B
Authority
CN
China
Prior art keywords
spreading
node
information
code
variable node
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.)
Active
Application number
CN202110062326.7A
Other languages
Chinese (zh)
Other versions
CN112910497A (en
Inventor
倪祖耀
林志远
匡麟玲
刘秉坤
贾浩歌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tsinghua University
Original Assignee
Tsinghua University
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 Tsinghua University filed Critical Tsinghua University
Priority to CN202110062326.7A priority Critical patent/CN112910497B/en
Publication of CN112910497A publication Critical patent/CN112910497A/en
Application granted granted Critical
Publication of CN112910497B publication Critical patent/CN112910497B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/707—Spread spectrum techniques using direct sequence modulation
    • H04B1/7073—Synchronisation aspects
    • H04B1/7075—Synchronisation aspects with code phase acquisition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/185—Space-based or airborne stations; Stations for satellite systems
    • H04B7/1851—Systems using a satellite or space-based relay
    • H04B7/18513—Transmission in a satellite or space-based system

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Astronomy & Astrophysics (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • General Physics & Mathematics (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a quick code capturing method for a short spreading ratio satellite communication system, belonging to the technical field of wireless communication. In a short spreading ratio satellite communication system, the detection performance of the traditional correlator-based code acquisition algorithm is reduced due to the frequent flipping of information bits. In order to overcome the influence of information bit inversion, the method obtains an initial state value of a spread spectrum code by carrying out joint estimation on the information bit and a spread spectrum chip, and loads the initial value to a local code generator, thereby completing quick code capture. Under the condition of extremely low spread spectrum ratio, the invention can effectively realize the correct estimation of the initial phase of the spread spectrum code and avoid the search process of the chip phase, thereby saving a large amount of capture time compared with the traditional serial search method and simultaneously being lower than the parallel capture in complexity.

Description

Quick code capture method for short-spreading-ratio satellite communication system
Technical Field
The invention relates to the technical field of wireless communication, in particular to a quick code acquisition method for a short-spreading-ratio satellite communication system.
Background
At present, the aperture of the satellite terminal antenna gradually develops towards miniaturization, so that the beam width of the terminal antenna gradually increases. The increase in beam width makes the interference of the terminal to the adjacent satellites non-negligible. In order to reduce the adjacent satellite interference, the ITU (international telecommunications union) imposes a corresponding limitation on the transmission power spectral density of small-aperture satellite terminals. In order to meet ITU regulations, the terminal may reduce the transmit power spectral density in a spread spectrum manner. The satellite spectrum resource is precious, and the short spreading ratio does not need to occupy too large bandwidth, so the method is applied to vehicle-mounted, airborne and satellite Internet of things terminals.
In spread spectrum communication, in order to realize information despreading, spread spectrum code acquisition is an important link. Conventional code acquisition methods include serial search and parallel search, which are based on correlators to determine the phase of the spreading code by finding the largest correlation peak. However, in the short spreading ratio system, the sign inversion phenomenon of the information bits is not negligible. The information bits are modulated onto the spreading chips such that the symbols of the spreading chips are flipped. The phenomenon of frequent flipping causes the performance of the traditional code acquisition algorithm based on correlation to be reduced, and the detection probability is seriously reduced.
Disclosure of Invention
The invention aims to provide a quick code acquisition method for a short spreading ratio satellite communication system, which is characterized by comprising the following steps:
step 1: carrying out frequency offset and initial phase compensation on a section of receiving signal with the length of N;
step 2: acquiring system parameters including a spread spectrum code generator polynomial, a spread spectrum ratio, signal energy and a noise variance; sending the system parameters and the signals subjected to initial phase compensation in the step 1 into a spread spectrum code and information bit joint estimation module to obtain an initial state estimation value of the spread spectrum code;
and step 3: sending the initial state estimation value obtained in the step 2 into a local code generator to generate a local spread spectrum code;
and 4, step 4: performing integral and non-correlation accumulation operation on the local spread spectrum code generated in the step 3 and the signal subjected to initial phase compensation in the step 1, and comparing an operation result with a threshold value; if the operation result is larger than the threshold value, the acquisition is successful, otherwise, the acquisition is failed, another signal with the length of N is received, and the steps 1 to 3 are repeated until the acquisition is successful.
The received signal in step 1 is a discrete time signal, and has completed down-conversion, matched filtering and sampling operations, and the sampling rate is a chip rate.
Step 2 comprises the following substeps:
step 21: generating a polynomial according to the spreading code to construct a factor graph;
step 22: initializing probability information:
Figure BDA0002902792020000021
wherein K represents a spreading ratio, and tau represents a delay variable node in a factor graph;
step 23: initializing log-likelihood ratio information:
Figure BDA0002902792020000022
Figure BDA0002902792020000023
wherein EcRepresenting the signal energy, N0Representing the variance of the noise, ykRepresents the signal after initial phase compensation in step 1, xkRepresenting the kth spreading chip variable node, g, in the factor graphiRepresenting the ith check function node, h, in the factor graphkRepresenting the kth state transfer function node in the factor graph, dkRepresents the kth information chip variable node in the factor graph;
step 24: starting iteration, setting the maximum iteration number as IterMax, if the iteration number reaches IterMax, quitting the iteration, entering the step 25, otherwise, continuing the iteration; the l iteration is as follows:
(1) updating check function node gjTo spreading chip variable node xkLog likelihood ratio information of (1):
Figure BDA0002902792020000024
wherein N (g)j) G in the representative factor graphjThe neighbor node of (2);
(2) updating spread-spectrum chip variable node xkTo channel transfer function node fkLog likelihood ratio information of (1):
Figure BDA0002902792020000025
(3) updating channel transfer function node fkTo information chip variable node dkLog likelihood ratio information of (1):
Figure BDA0002902792020000026
(4) update information chip variable node dkNode h of the state transfer functionkAnd hk-1Log likelihood ratio information of (1):
Figure BDA0002902792020000027
(5) updating state transfer function node hkProbability information to delay variable node τ:
Figure BDA0002902792020000031
wherein I (-) represents an exemplary function,
Figure BDA0002902792020000032
Figure BDA0002902792020000033
(6) confidence of update delay variable node τ:
Figure BDA0002902792020000034
(7) updating a delay variable node τ to a state transfer function nodehkProbability information of (2):
Figure BDA0002902792020000035
(8) updating state transfer function node hkTo information chip variable node dkAnd dk+1Log likelihood ratio information of (1):
Figure BDA0002902792020000036
Figure BDA0002902792020000037
(9) update information chip variable node dkTo channel transfer function node fkLog likelihood ratio information of (1):
Figure BDA0002902792020000038
(10) updating channel transfer function node fkTo spreading chip variable node xkLog likelihood ratio information of (1):
Figure BDA0002902792020000039
(11) updating spread-spectrum chip variable node xkTo check function node giLog likelihood ratio information of (1):
Figure BDA00029027920200000310
step 25: obtaining soft information of the spreading chips:
Figure BDA00029027920200000311
step 26: to pairAnd (3) carrying out hard decision on the spread spectrum chips:
Figure BDA00029027920200000312
step 27: obtaining an initial state estimation value of a spreading code:
Figure BDA00029027920200000313
where u represents the estimated initial state value of the spreading code and r represents the highest degree of the generator polynomial.
The spreading code in step 2 comprises an m sequence and a Gold sequence, and the spreading ratio is a positive integer greater than 2.
The local code generator in step 3 is composed of a linear feedback shift register, the number of stages of the shift register is equal to the highest degree of the generator polynomial in step 2, and the tap coefficient of the shift register is determined by the coefficient of the generator polynomial.
The integration in the step 4 is to perform multiplication and addition operation on the local code and the received signal, and the integration length is m; the non-correlation accumulation refers to square summation of the integration results of each segment, and the summation length is n; the operation result refers to the result of the uncorrelated accumulation.
The invention has the beneficial effects that:
the invention obtains the initial state value of the spread spectrum code by carrying out joint estimation on the information bit and the spread spectrum chip, and loads the initial value to the local code generator, thereby completing the rapid code capture. Under the condition of extremely low spreading ratio, the correct estimation of the initial phase of the spreading code can be effectively realized, and the one-by-one searching process of the chip phase is avoided. Compared with the traditional serial search method, the method provided by the invention saves a large amount of capture time, and is lower than parallel capture in complexity.
Drawings
FIG. 1 is a system diagram of a fast code acquisition method for a short spreading ratio satellite communication system;
FIG. 2 is a flow chart of a method for fast code acquisition for a short spreading ratio satellite communication system;
FIG. 3 is a factor graph diagram of example 1;
FIG. 4 is a factor graph showing the results of example 2.
Detailed Description
The present invention provides a fast code acquisition method for a short spreading ratio satellite communication system, which is further described with reference to the accompanying drawings and specific embodiments.
FIG. 1 is a system diagram of a fast code acquisition method for a short spreading ratio satellite communication system; fig. 2 is a flow chart of a fast code acquisition method for a short spreading ratio satellite communication system.
Example 1
Assume that the spreading code generator polynomial g (D) 1+ D15Spreading ratio K4, received signal length N1024, and signal energy E c1, noise variance is N0Setting the maximum iteration number Itermax to be 32, and setting the threshold value to be Th. Fast code acquisition can be achieved by:
1) carrying out frequency offset and initial phase compensation on a received signal with the length of 1024;
2) according to the generating polynomial g (D) ═ 1+ D15Constructing a factor graph, as shown in FIG. 3;
3) initializing probability information:
Figure BDA0002902792020000051
where τ represents the delay variable node in fig. 3;
4) initializing log-likelihood ratio information:
Figure BDA0002902792020000052
Figure BDA0002902792020000053
wherein y iskRepresents the compensated received signal, x, of 1)kRepresents the kth spreading chip variable node, g, in fig. 3iRepresents the ith check function node, d, in FIG. 3kRepresents the kth information chip variable node, h, in FIG. 3kRepresents the kth state transfer function node in fig. 3;
5) starting iteration, if the number of iterations reaches 32, exiting the iteration, and entering the step 6), otherwise, continuing the iteration. The l iteration is as follows:
a) updating check function node gjTo spreading chip variable node xkLog likelihood ratio information of (1):
Figure BDA0002902792020000054
wherein N (g)j) Is represented as g in FIG. 3jThe neighbor node of (2);
b) updating spread-spectrum chip variable node xkTo channel transfer function node fkLog likelihood ratio information of (1):
Figure BDA0002902792020000055
c) updating channel transfer function node fkTo information chip variable node dkLog likelihood ratio information of (1):
Figure BDA0002902792020000056
d) update information chip variable node dkNode h of the state transfer functionkAnd hk-1Log likelihood ratio information of (1):
Figure BDA0002902792020000057
e) updating state transfer function node hkProbability information to delay variable node τ:
Figure BDA0002902792020000058
wherein I (-) represents an exemplary function,
Figure BDA0002902792020000059
Figure BDA00029027920200000510
f) confidence of update delay variable node τ:
Figure BDA00029027920200000511
g) updating delay variable node tau to state transfer function node hkProbability information of (2):
Figure BDA0002902792020000061
h) updating state transfer function node hkTo information chip variable node dkAnd dk+1Log likelihood ratio information of (1):
Figure BDA0002902792020000062
Figure BDA0002902792020000063
i) update information chip variable node dkTo channel transfer function node fkLog likelihood ratio information of (1):
Figure BDA0002902792020000064
j) updating channel transfer function node fkTo spreading chip variable node xkLog likelihood ratio information of (1):
Figure BDA0002902792020000065
k) updating spread-spectrum chip variable node xkTo check function node giLog likelihood ratio information of (1):
Figure BDA0002902792020000066
6) obtaining soft information of the spreading chips:
Figure BDA0002902792020000067
7) and hard decision is carried out on the spreading chips:
Figure BDA0002902792020000068
8) obtaining an initial state estimation value of a spreading code:
Figure BDA0002902792020000069
9) sending the initial state estimated value to a local code generator to generate a local spread spectrum code;
performing correlation operation on the local spread spectrum code and the compensated signal in the step 1), wherein the correlation operation comprises a correlation integral and a non-correlation accumulation, the correlation integral refers to performing multiplication and addition operation on the local code and a received signal, and the integral length is 8; non-correlated accumulation refers to the square summation of the results of each segment of correlated integration, with a summation length of 256. If the correlation result is greater than the threshold value ThIndicating successful acquisition, otherwise failing to acquire, and receiving another signal, and repeating the steps 1) to 10) until successful acquisition is achieved.
Example 2
Assume that the spreading code generator polynomial g (D) 1+ D3+D7Spreading ratio K is 8, received signal length N is 512, and signal energy E c1, noise variance is N0Setting the maximum iteration number Itermax to be 32 and setting the threshold value to be Th. Fast code acquisition can be achieved by:
1) carrying out frequency offset and initial phase compensation on a received signal with the length of 512;
2) according to the generating polynomial g (D) ═ 1+ D3+D7Constructing a factor graph, as shown in FIG. 4;
3) initializing probability information:
Figure BDA0002902792020000071
where τ represents the delay variable node in fig. 3;
4) initializing log-likelihood ratio information:
Figure BDA0002902792020000072
Figure BDA0002902792020000073
wherein y iskRepresents the compensated received signal, x, of 1)kRepresents the kth spreading chip variable node, g, in fig. 4iRepresents the ith check function node, d, in FIG. 4kRepresents the kth information chip variable node, h, in FIG. 4kRepresents the kth state transfer function node in fig. 4;
5) starting iteration, if the number of iterations reaches 32, exiting the iteration, and entering the step 6), otherwise, continuing the iteration. The l iteration is as follows:
a) updating check function node gjTo spreading chip variable node xkLog likelihood ratio information of (1):
Figure BDA0002902792020000074
wherein N (g)j) Is represented as g in FIG. 4jThe neighbor node of (2);
b) updating spread-spectrum chip variable node xkTo channel transfer function node fkLog likelihood ratio information of (1):
Figure BDA0002902792020000075
c) updating channel transfer function node fkTo information chip variable node dkLog likelihood ratio information of (1):
Figure BDA0002902792020000076
d) updating informationChip variable node dkNode h of the state transfer functionkAnd hk-1Log likelihood ratio information of (1):
Figure BDA0002902792020000077
e) updating state transfer function node hkProbability information to delay variable node τ:
Figure BDA0002902792020000078
wherein I (-) represents an exemplary function,
Figure BDA0002902792020000081
Figure BDA0002902792020000082
f) confidence of update delay variable node τ:
Figure BDA0002902792020000083
g) updating delay variable node tau to state transfer function node hkProbability information of (2):
Figure BDA0002902792020000084
h) updating state transfer function node hkTo information chip variable node dkAnd dk+1Log likelihood ratio information of (1):
Figure BDA0002902792020000085
Figure BDA0002902792020000086
i) update information chip variable node dkTo channel transfer function node fkLog likelihood ratio information of (1):
Figure BDA0002902792020000087
j) updating channel transfer function node fkTo spreading chip variable node xkLog likelihood ratio information of (1):
Figure BDA0002902792020000088
k) updating spread-spectrum chip variable node xkTo check function node giLog likelihood ratio information of (1):
Figure BDA0002902792020000089
6) obtaining soft information of the spreading chips:
Figure BDA00029027920200000810
7) and hard decision is carried out on the spreading chips:
Figure BDA00029027920200000811
8) obtaining an initial state estimation value of a spreading code:
Figure BDA00029027920200000812
9) sending the initial state estimated value to a local code generator to generate a local spread spectrum code;
performing correlation operation on the local spread spectrum code and the compensated signal in the step 1), wherein the correlation operation comprises correlation integration and non-correlation accumulation, the correlation integration refers to performing multiplication and addition operation on the local code and a received signal, and the integration length is 16; non-correlated accumulation refers to the square summation of the results of each segment of correlated integration, with a summation length of 64. If the correlation result is greater than the threshold value ThIndicating successful acquisition, otherwise failing to acquire, and receiving another signal, and repeating the steps 1) to 10) until successful acquisition is achieved.
Table 1 shows the data of the serial capture method and the present method over algorithm complexity and average capture time.
TABLE 1 data statistics table for serial capture and method
Figure BDA0002902792020000091
The meaning of the parameters in the table is as follows:
r: the stage number of the shift register is 15;
n: receiving signal length, where N is 1024 in the table;
k: spreading multiple, in this table K is 4;
IterMax, which is the number of iterations of the method, wherein IterMax in the table is 32;
tc: a chip rate;
under the specific parameters, the average capture time of the method is faster than that of serial capture by 2 orders of magnitude, and the complexity is lower by about 1 order of magnitude.
The present invention is not limited to the above embodiments, and any changes or substitutions that can be easily made by those skilled in the art within the technical scope of the present invention are also within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (5)

1. A method for fast code acquisition for a short spreading ratio satellite communication system, comprising the steps of:
step 1: carrying out frequency offset and initial phase compensation on a section of receiving signal with the length of N; wherein the value of N is 512 or 1024;
step 2: acquiring system parameters including a spread spectrum code generator polynomial, a spread spectrum ratio, signal energy and a noise variance; sending the system parameters and the signals subjected to initial phase compensation in the step 1 into a spread spectrum code and information bit joint estimation module to obtain an initial state estimation value of the spread spectrum code;
the step 2 comprises the following substeps:
step 21: generating a polynomial according to the spreading code to construct a factor graph;
step 22: initializing probability information:
Figure FDA0003356110360000011
wherein K represents a spreading ratio, and tau represents a delay variable node in a factor graph;
step 23: initializing log-likelihood ratio information:
Figure FDA0003356110360000012
Figure FDA0003356110360000013
wherein EcRepresenting the signal energy, N0Representing the variance of the noise, ykRepresents the signal after initial phase compensation in step 1, xkRepresenting the kth spreading chip variable node, g, in the factor graphiRepresenting the ith check function node, h, in the factor graphkRepresenting the kth state transfer function node in the factor graph, dkRepresents the kth information chip variable node in the factor graph;
step 24: starting iteration, setting the maximum iteration number as IterMax, if the iteration number reaches IterMax, quitting the iteration, entering the step 25, otherwise, continuing the iteration; the l iteration is as follows:
(1) updating check function node gjTo spreading chip variable node xkLog likelihood ratio information of (1):
Figure FDA0003356110360000014
wherein N (g)j) G in the representative factor graphjIs adjacent toAn intermediate node;
(2) updating spread-spectrum chip variable node xkTo channel transfer function node fkLog likelihood ratio information of (1):
Figure FDA0003356110360000015
(3) updating channel transfer function node fkTo information chip variable node dkLog likelihood ratio information of (1):
Figure FDA0003356110360000016
(4) update information chip variable node dkNode h of the state transfer functionkAnd hk-1Log likelihood ratio information of (1):
Figure FDA0003356110360000021
(5) updating state transfer function node hkProbability information to delay variable node τ:
Figure FDA0003356110360000022
wherein I (-) represents an exemplary function,
Figure FDA0003356110360000023
Figure FDA0003356110360000024
(6) confidence of update delay variable node τ:
Figure FDA0003356110360000025
(7) updating delay variable node tau to state transfer function node hkProbability information of (2):
Figure FDA0003356110360000026
(8) updating state transfer function node hkTo information chip variable node dkAnd dk+1Log likelihood ratio information of (1):
Figure FDA0003356110360000027
Figure FDA0003356110360000028
(9) update information chip variable node dkTo channel transfer function node fkLog likelihood ratio information of (1):
Figure FDA0003356110360000029
(10) updating channel transfer function node fkTo spreading chip variable node xkLog likelihood ratio information of (1):
Figure FDA00033561103600000210
(11) updating spread-spectrum chip variable node xkTo check function node giLog likelihood ratio information of (1):
Figure FDA00033561103600000211
step 25: obtaining soft information of the spreading chips:
Figure FDA0003356110360000031
step 26: and hard decision is carried out on the spreading chips:
Figure FDA0003356110360000032
step 27: obtaining an initial state estimation value of a spreading code:
Figure FDA0003356110360000033
wherein u represents the estimated initial state value of the spreading code and r represents the highest degree of the generator polynomial;
and step 3: sending the initial state estimation value obtained in the step 2 into a local code generator to generate a local spread spectrum code;
and 4, step 4: performing integral and non-correlation accumulation operation on the local spread spectrum code generated in the step 3 and the signal subjected to initial phase compensation in the step 1, and comparing an operation result with a threshold value; if the operation result is larger than the threshold value, the acquisition is successful, otherwise, the acquisition is failed, another signal with the length of N is received, and the steps 1 to 3 are repeated until the acquisition is successful.
2. The method of claim 1, wherein the received signal in step 1 is a discrete time signal, and the down-conversion, matched filtering and sampling operations are completed, and the sampling rate is a chip rate.
3. The method of claim 1, wherein the spreading codes in step 2 comprise m-sequences and Gold sequences, and the spreading ratio is a positive integer greater than 2.
4. The method of claim 1, wherein the local code generator in step 3 is comprised of a linear feedback shift register, the number of stages of the shift register is equal to the highest degree of the generator polynomial in step 2, and tap coefficients of the shift register are determined by coefficients of the generator polynomial.
5. The method as claimed in claim 1, wherein the integration in step 4 is performed by performing a multiply-add operation on the local code and the received signal, and the integration length is m; the non-correlation accumulation refers to square summation of the integration results of each segment, and the summation length is n; wherein m is 8, n is 256, m is 16, n is 64; the operation result refers to the result of the uncorrelated accumulation.
CN202110062326.7A 2021-01-18 2021-01-18 Quick code capture method for short-spreading-ratio satellite communication system Active CN112910497B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110062326.7A CN112910497B (en) 2021-01-18 2021-01-18 Quick code capture method for short-spreading-ratio satellite communication system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110062326.7A CN112910497B (en) 2021-01-18 2021-01-18 Quick code capture method for short-spreading-ratio satellite communication system

Publications (2)

Publication Number Publication Date
CN112910497A CN112910497A (en) 2021-06-04
CN112910497B true CN112910497B (en) 2022-01-25

Family

ID=76114864

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110062326.7A Active CN112910497B (en) 2021-01-18 2021-01-18 Quick code capture method for short-spreading-ratio satellite communication system

Country Status (1)

Country Link
CN (1) CN112910497B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113885057A (en) * 2021-09-26 2022-01-04 深圳市微联星智科技有限公司 Satellite internet of things signal processing method based on coherent-incoherent spread spectrum modulation

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH09223989A (en) * 1996-02-19 1997-08-26 Fujitsu Ltd Initial acquisition method for spreading code, initial acquisition circuit for spreading code and receiver for spread spectrum communication
US6345073B1 (en) * 1998-10-08 2002-02-05 The Aerospace Corporation Convolutional despreading method for rapid code phase determination of chipping codes of spread spectrum systems
CN104833988A (en) * 2015-04-30 2015-08-12 西安空间无线电技术研究所 Acquisition system and method for high data rate direct sequence spread spectrum signals under large Doppler dynamic condition
CN109088838A (en) * 2018-09-08 2018-12-25 南京理工大学 Pseudo-code-Doppler's quick capturing method of direct expansion dpsk signal under a kind of high dynamic
CN109474307A (en) * 2018-11-28 2019-03-15 西南电子技术研究所（中国电子科技集团公司第十研究所） Non-coherent spread-spectrum signal quick capturing method
CN112217538A (en) * 2020-10-12 2021-01-12 清华大学 Method and device for rapidly capturing spread spectrum signal of large dynamic satellite communication system

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE69632566T2 (en) * 1995-06-13 2004-11-11 Ntt Docomo, Inc. METHOD AND DEVICE FOR SYNCHRONIZING A SPREAD CODE
US5577025A (en) * 1995-06-30 1996-11-19 Qualcomm Incorporated Signal acquisition in a multi-user communication system using multiple walsh channels
JP2914312B2 (en) * 1996-08-22 1999-06-28 松下電器産業株式会社 Synchronous acquisition circuit
WO2007123766A2 (en) * 2006-03-31 2007-11-01 The Regents Of The University Of California Spread-spectrum receiver and reception method
CA2704353A1 (en) * 2009-05-13 2010-11-13 Ron Kerr Spreading code acquisition for direct sequence spread spectrum signals
US9231648B2 (en) * 2014-05-21 2016-01-05 Texas Instruments Incorporated Methods and apparatus for frequency offset estimation and correction prior to preamble detection of direct sequence spread spectrum (DSSS) signals
CN108011652B (en) * 2016-10-28 2020-05-12 上海复控华龙微系统技术有限公司 Method and device for capturing spread spectrum signal

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH09223989A (en) * 1996-02-19 1997-08-26 Fujitsu Ltd Initial acquisition method for spreading code, initial acquisition circuit for spreading code and receiver for spread spectrum communication
US6345073B1 (en) * 1998-10-08 2002-02-05 The Aerospace Corporation Convolutional despreading method for rapid code phase determination of chipping codes of spread spectrum systems
CN104833988A (en) * 2015-04-30 2015-08-12 西安空间无线电技术研究所 Acquisition system and method for high data rate direct sequence spread spectrum signals under large Doppler dynamic condition
CN109088838A (en) * 2018-09-08 2018-12-25 南京理工大学 Pseudo-code-Doppler's quick capturing method of direct expansion dpsk signal under a kind of high dynamic
CN109474307A (en) * 2018-11-28 2019-03-15 西南电子技术研究所（中国电子科技集团公司第十研究所） Non-coherent spread-spectrum signal quick capturing method
CN112217538A (en) * 2020-10-12 2021-01-12 清华大学 Method and device for rapidly capturing spread spectrum signal of large dynamic satellite communication system

Non-Patent Citations (8)

* Cited by examiner, † Cited by third party
Title
A 2-step GPS carrier tracking loop for urban vehicle applications;Hongyang Zhang;《IEEE》;20171228;全文 *
基于信号估计的扩频测控信号快捕方法;刘燕都;《万方数据库》;20160930;全文 *
基于信号估计的扩频测控信号快捕方法;刘燕都等;《电讯技术》;20160928(第09期);全文 *
基于最大似然估计的扩频捕获方法;肖振宇;《万方数据库》;20100623;全文 *
基于迭代信息传递技术的直扩信号捕获;徐定杰等;《计算机仿真》;20080315(第03期);全文 *
基于迭代信息传递的PN码快速捕获方法研究;王伟等;《宇航学报》;20080730(第04期);全文 *
大Doppler频移条件下基于导频信号的扩频码捕获;吴团锋等;《电子与信息学报》;20050620(第06期);全文 *
扩频信号捕获过程中信息比特跳变对载波频率估计的影响;商向永等;《宇航计测技术》;20121215(第06期);全文 *

Also Published As

Publication number Publication date
CN112910497A (en) 2021-06-04

Similar Documents

Publication Publication Date Title
US6345073B1 (en) Convolutional despreading method for rapid code phase determination of chipping codes of spread spectrum systems
US7061970B2 (en) Self-synchronizing adaptive multistage receiver for wireless communication systems
US6650653B1 (en) Software-based digital receiver adaptable to multiple multiplexing schemes
US20030091100A1 (en) Method and device for radio signal reception
US7885326B2 (en) Method for determining a pulse position in a signal
CN1771671B (en) Joint detection method and system in CDMA communications system
US7609785B2 (en) Mitigation of interference in cell search by wireless transmit and receive units
US7095811B1 (en) Apparatus and method for secondary synchronization channel detection in a 3GPP WCDMA receiver
CN111917460A (en) Low-earth-orbit satellite high-speed signal capturing method based on FPGA
CN112910497B (en) Quick code capture method for short-spreading-ratio satellite communication system
US7450518B2 (en) Sparse channel dual-error tracking adaptive filter/equalizer
EP1037423A1 (en) Digital communication system, its transmitter and receiver, and frame synchronization detector
KR20010102190A (en) Multibit spread spectrum signalling
US7130342B2 (en) Wireless receiver and method employing forward/backward recursive covariance based filter coefficient generation
EP0988706B1 (en) Reception method and receiver
CN1148922A (en) Receiving method and receiver
CN111490807B (en) Direct spread spectrum signal spread spectrum code estimation method based on MLDC and bit-by-bit decision
CN109218241B (en) System and method for processing analog signals
Hakizimana et al. A new M-ary wideband communication system with application to multipath channels-part i: system performance
EP1873924A1 (en) Method for determining a pulse position in a signal
FR2825856A1 (en) METHOD AND DEVICE FOR SIGNAL PROCESSING IN A SPECTRUMALLY SPREADED RADIO COMMUNICATION RECEIVER
CN101390318A (en) A symbol-level adaptation method, memory, equalizer and receiver for implementing this method
CN113904905A (en) Capturing device and method for dynamic direct sequence spread spectrum keying (GMSK) signal
US7042931B2 (en) Path detection method and receiver
EP1625717A1 (en) Iterative channel estimation using pilot signals

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant