CN107786296A - A kind of reconstructing method for GOLD sequences - Google Patents

A kind of reconstructing method for GOLD sequences Download PDF

Info

Publication number
CN107786296A
CN107786296A CN201711314674.9A CN201711314674A CN107786296A CN 107786296 A CN107786296 A CN 107786296A CN 201711314674 A CN201711314674 A CN 201711314674A CN 107786296 A CN107786296 A CN 107786296A
Authority
CN
China
Prior art keywords
mrow
msub
gold
msubsup
gold sequences
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.)
Pending
Application number
CN201711314674.9A
Other languages
Chinese (zh)
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.)
University of Electronic Science and Technology of China
Original Assignee
University of Electronic Science and Technology of China
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 University of Electronic Science and Technology of China filed Critical University of Electronic Science and Technology of China
Priority to CN201711314674.9A priority Critical patent/CN107786296A/en
Publication of CN107786296A publication Critical patent/CN107786296A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/0007Code type
    • H04J13/0022PN, e.g. Kronecker
    • H04J13/0029Gold

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

The invention belongs to blind estimate technical field, particularly relates to a kind of reconstructing method for GOLD sequences.The method of the present invention includes the DSSS signals received carrying out pre- blind despread, obtain the GOLD sequence spread spectrum codes in M cycle, M GOLD sequence is solved generator polynomial and counted respectively again and obtains final correct generator polynomial, check matrix and block code generator matrix are solved again, changed again by Walsh and solve initial state, so as to complete the reconstruct of GOLD sequences.The GOLD series finally obtained using reconstruct completes the blind despread of DSSS signals., can be consistent with despreading performance during cooperative communication so as to strengthen the performance of blind despread because reconstructing obtained GOLD sequences and the GOLD sequences that transmitting terminal is sent being completely the same.

Description

A kind of reconstructing method for GOLD sequences
Technical field
The invention belongs to the blind estimate of DSSS (Direct-Sequence Spread Spectrum, DSSS) Technical field, particularly relate to a kind of reconstructing method for GOLD sequences.
Background technology
DSSS (DSSS) technology is one of communication technology the most frequently used in Modern Communication System.The spy of the technology Point is:Information code sequence is multiplied with frequency expansion sequence in the transmitting terminal of signal, because the bit rate of the spreading code is high so that letter Number spread spectrum, can reduce the power spectral density of transmission signal, have low probability of intercept characteristic.
DSSS communication system cooperation recipients, reception signal cooperation is de-spread using known frequency expansion sequence, can be suppressed dry Disturb and recover transmission information.But then need to handle the signal of reception for non-cooperation recipient, therefrom extract letter Number spreading code, the spreading code then obtained with estimation de-spread to obtain transmission information code sequence.
Code sequence for spread-spectrum is pseudo noise code, generally use M sequence and GOLD sequences.And they have it is fixed Create-rule.For GOLD sequences, it is the GOLD sequences needed using two Calais of M sequence mould two that it, which is produced,. In the blind despread of spread spectrum communication, often first estimation obtains spreading code to non-cooperation recipient from reception signal.Due to noise or letter The influence of road condition, the spreading code for estimating to obtain often contain vicious symbol.Therefore obtained in blind despread using estimation The create-rule of spreading code and spreading code can reconstruct with transmitting terminal identical pseudo-random sequence, so as to so that blind despread The bit error rate for the information code sequence for estimating to obtain further reduces, it might even be possible to its performance is matched in excellence or beauty with cooperative communication.Therefore it is right It is more meaningful in the reconstruct research of DSSS signal spread-spectrum codes.
The content of the invention
The purpose of the present invention, exactly in order to overcome above-mentioned deficiency, there is provided a kind of method for fast reconstruction containing wrong GOLD sequences.
The technical scheme is that a kind of reconstructing method for GOLD sequences, this method is GOLD for spreading code The Direct Sequence Spread Spectrum Communication of sequence, it is characterised in that comprise the following steps:
A, it is known or be estimated to obtain that length and the exponent number of GOLD sequences are set, and is estimated roughly by blind despread The GOLD sequences in M cycle are counted out, then generator polynomial are solved to the GOLD sequences in M cycle using BM algorithms, i.e., according to BM Algorithm is to every section of GOLD sequenceSolve generator polynomial f(m)(x):It can be written asAnd press exponent number N SummarizeWherein n=0,1,2 ..., N-1;Specific method is:
A1, init state, order:
A2, hypothesisIt has been tried to achieve that, and l0≤l1 ≤…≤ln, wherein:Calculate the n-th step difference dn
Wherein mod (A, 2) is represented to the remainder except 2;
A3, according to the n-th step difference dnValue, have following two situations:
(1) d is worked asn=0, then:
(2) d such asn=1, then:
1. when:l0=l1=...=lnWhen=0, take:
2. when there is k (0≤k<N), make:lk<lk+1=lk+2=...=ln, then:
A4, finally obtainExactly produce GOLD sequencesLine of shortest length shift register,ForGenerator polynomial;
B, after the generator polynomial for obtaining M GOLD code, by the life for counting correctly GOLD sequences c to be reconstructed Into multinomial;
C, the check matrix H of GOLD sequences is estimated with code length N and exponent number r using obtained GOLD sequences;
D, using check matrix H and code length N and exponent number r, block code generator matrix G is estimated;
E, the GOLD sequences that known block code generator matrix G, exponent number r and estimation obtainIn the case of, become using Walsh Change solution initial state;
F, the spread spectrum use of transmitting terminal is reconstructed using the initial state and generator polynomial and known code length that solve GOLD sequences.
Finally, the DSSS signals received with the GOLD sequence dockings reconstructed are de-spread, and obtain the information code of transmitting terminal Sequence, so as to complete blind despread.
The invention has the advantages that the because GOLD sequences complete one that the GOLD sequences that reconstruct obtains are sent with transmitting terminal Cause, can be consistent with despreading performance during cooperative communication so as to strengthen the performance of blind despread.
Brief description of the drawings
Fig. 1 is a kind of embodiment flow chart of GOLD sequence methods in quick reconfiguration DSSS communications of the present invention;
Fig. 2 is the performance map of restructing algorithm in present invention specific implementation.
Embodiment
The present invention will be described with reference to the accompanying drawings and examples.
Embodiment
In this example, signal to noise ratio is from -12dB to -8dB, and the exponent number for producing the shift register of two m-sequences is 5, its tap Coefficient is respectively:[0 010 1], [1 110 1], information code number are 100, and Monte-Carlo Simulation number is 10.Using Method as shown in Figure 1 carries out GOLD sequence reconstruct, and the GOLD sequences that caused GOLD sequences and estimation reconstruct obtain are done into ratio Compared with finding out their different he numbers.Curve map caused by final is as shown in Figure 2.It can be obtained according to Fig. 2, structure of the present invention obtains GOLD sequences and GOLD sequences that transmitting terminal is sent it is completely the same.

Claims (1)

1. a kind of reconstructing method for GOLD sequences, this method is used for spreading code and led to for the DSSS of GOLD sequences Letter, it is characterised in that comprise the following steps:
A, it is known or be estimated to obtain that length and the exponent number of GOLD sequences are set, and is roughly estimated by blind despread The GOLD sequences in M cycle, then generator polynomial is solved to the GOLD sequences in M cycle using BM algorithms, i.e., according to BM algorithms To every section of GOLD sequenceSolve generator polynomial f(m)(x):It can be written asAnd concluded by exponent number N Go outWherein n=0,1,2 ..., N-1;Specific method is:
A1, init state, order:
A2, hypothesis0≤n<N, try to achieve, and l0≤l1≤…≤ ln, wherein:Calculate the n-th step difference dn
<mrow> <msub> <mi>d</mi> <mi>n</mi> </msub> <mo>=</mo> <mi>mod</mi> <mrow> <mo>(</mo> <msubsup> <mi>a</mi> <mn>0</mn> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </msubsup> <msub> <mover> <mi>c</mi> <mo>~</mo> </mover> <mi>n</mi> </msub> <mo>+</mo> <msubsup> <mi>a</mi> <mn>1</mn> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </msubsup> <msub> <mover> <mi>c</mi> <mo>~</mo> </mover> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mo>+</mo> <mn>...</mn> <mo>+</mo> <msubsup> <mi>a</mi> <msub> <mi>l</mi> <mi>n</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </msubsup> <msub> <mover> <mi>c</mi> <mo>~</mo> </mover> <mrow> <mi>n</mi> <mo>-</mo> <msub> <mi>l</mi> <mi>n</mi> </msub> </mrow> </msub> <mo>,</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow>
Wherein mod (A, 2) is represented to the remainder except 2;
A3, according to the n-th step difference dnValue, have following two situations:
(1) d is worked asn=0, then:
<mrow> <msubsup> <mi>f</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>=</mo> <msubsup> <mi>f</mi> <mi>n</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>l</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>=</mo> <msub> <mi>l</mi> <mi>n</mi> </msub> </mrow>
(2) d such asn=1, then:
1. when:l0=l1=...=lnWhen=0, take:
<mrow> <msubsup> <mi>f</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>=</mo> <mn>1</mn> <mo>+</mo> <msup> <mi>x</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mo>,</mo> <msub> <mi>l</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>=</mo> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow>
2. when there is k (0≤k<N), make:lk<lk+1=lk+2=...=ln, then:
ln+1=max { ln,n+1-ln}
A4, finally obtainExactly produce GOLD sequencesLine of shortest length shift register,For Generator polynomial;
B, it is more by the generation for counting correctly GOLD sequences c to be reconstructed after the generator polynomial for obtaining M GOLD code Item formula;
C, the check matrix H of GOLD sequences is estimated with code length N and exponent number r using obtained GOLD sequences;
D, using check matrix H and code length N and exponent number r, block code generator matrix G is estimated;
E, the GOLD sequences that known block code generator matrix G, exponent number r and estimation obtainIn the case of, asked using Walsh conversion Solve initial state;
F, the GOLD of the spread spectrum use of transmitting terminal is reconstructed using the initial state and generator polynomial and known code length that solve Sequence.
CN201711314674.9A 2017-12-12 2017-12-12 A kind of reconstructing method for GOLD sequences Pending CN107786296A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711314674.9A CN107786296A (en) 2017-12-12 2017-12-12 A kind of reconstructing method for GOLD sequences

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711314674.9A CN107786296A (en) 2017-12-12 2017-12-12 A kind of reconstructing method for GOLD sequences

Publications (1)

Publication Number Publication Date
CN107786296A true CN107786296A (en) 2018-03-09

Family

ID=61430458

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711314674.9A Pending CN107786296A (en) 2017-12-12 2017-12-12 A kind of reconstructing method for GOLD sequences

Country Status (1)

Country Link
CN (1) CN107786296A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110048976A (en) * 2019-03-06 2019-07-23 中国人民解放军战略支援部队信息工程大学 Short code direct sequence signal array blind despread method and device towards intermediate frequency
CN112799721A (en) * 2021-02-05 2021-05-14 北京科电航宇空间技术有限公司 Efficient reconstruction method, electronic equipment and system of error code-containing m sequence and Gold sequence
CN113366890A (en) * 2019-03-29 2021-09-07 华为技术有限公司 Wake-up signal sending method and device

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104168233A (en) * 2014-08-12 2014-11-26 重庆邮电大学 DSSS/UQPSK signal pseudo code sequence estimation method based on characteristic decomposition and Messay algorithm
CN104539310A (en) * 2014-12-31 2015-04-22 电子科技大学 Direct sequence spread spectrum signal hiding method
WO2016206721A1 (en) * 2015-06-23 2016-12-29 Huawei Technologies Co., Ltd. Controller, access node and aggregation node in a radio communication network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104168233A (en) * 2014-08-12 2014-11-26 重庆邮电大学 DSSS/UQPSK signal pseudo code sequence estimation method based on characteristic decomposition and Messay algorithm
CN104539310A (en) * 2014-12-31 2015-04-22 电子科技大学 Direct sequence spread spectrum signal hiding method
WO2016206721A1 (en) * 2015-06-23 2016-12-29 Huawei Technologies Co., Ltd. Controller, access node and aggregation node in a radio communication network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
熊伟杰: "直扩信号盲估计技术研究", 《电子科技大学硕士学位论文》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110048976A (en) * 2019-03-06 2019-07-23 中国人民解放军战略支援部队信息工程大学 Short code direct sequence signal array blind despread method and device towards intermediate frequency
CN110048976B (en) * 2019-03-06 2021-07-02 中国人民解放军战略支援部队信息工程大学 Intermediate frequency-oriented blind despreading method and device for short code direct spread spectrum signal array
CN113366890A (en) * 2019-03-29 2021-09-07 华为技术有限公司 Wake-up signal sending method and device
CN113366890B (en) * 2019-03-29 2022-09-23 华为技术有限公司 Wake-up signal sending method and device
CN112799721A (en) * 2021-02-05 2021-05-14 北京科电航宇空间技术有限公司 Efficient reconstruction method, electronic equipment and system of error code-containing m sequence and Gold sequence

Similar Documents

Publication Publication Date Title
CN100425016C (en) Code division multiple access system
CN1097358C (en) Coherent demodulation with decision-directed channel estimation for digital communication
JP3993093B2 (en) Apparatus and method for encoding and decoding transmission rate information in a mobile communication system
CN105791184B (en) Aperiodic long code direct sequence signal frequency expansion sequence blind estimating method based on similarity
CN104753561B (en) Direct sequence spread spectrum modulation method for suppressing multipath interference in underwater acoustic communication
EP2381584A2 (en) Apparatus and method for generating scrambling codes in a radio communication system
EP3076624B1 (en) Method and device for transmitting preamble sequence
CN101645743B (en) Chaotic sequence-based packet M element spread spectrum communication method and device
CN107786296A (en) A kind of reconstructing method for GOLD sequences
RU2009133780A (en) USING CODE WORDS IN A WIRELESS COMMUNICATION SYSTEM
CN102025669B (en) Short-wave data transmission method based on dual multisystem quasi-orthogonal spread-spectrum composite phase modulation
KR100393616B1 (en) Encoding apparatus and method in cdma communication system
CN103490860A (en) Iterative demodulating and decoding method for high-performance shortwave orthogonal spectrum spreading
CN104158557A (en) Parameter estimation method of Gold sequence
CN108886380A (en) Safe lane measurement
CN103414670A (en) Long code DSSS signal blind dispreading method based on semi-definite programming
CN103152074B (en) A kind of direct sequence spread spectrum communication system launching and receiving method
CN102035770A (en) Method for estimating channel by means of correlation
CN103957026B (en) A kind of frame hopping spread spectrum communication system based on chaos sequence
CN116545471B (en) Demodulation method of UWB communication system
CN103152070A (en) Variable beacon sequence-based spread spectrum communication method
CN104994042A (en) Blind recognition method of self-synchronizing scrambling generator polynomial based on autocorrelation function
CN100490363C (en) Gridding coding modulation method for multiuser receiving device in WCDMA system
CN101355373B (en) Method for generating signal of non-interference quasi-synchronous CDMA communication system
CN112087244A (en) Composite chaotic sequence forming method and unmanned aerial vehicle measurement and control link anti-interference method

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
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20180309

WD01 Invention patent application deemed withdrawn after publication