CN107547106A - The long short code method of estimation of the long short code direct sequency-code division multiple access signal of multi tate - Google Patents
The long short code method of estimation of the long short code direct sequency-code division multiple access signal of multi tate Download PDFInfo
- Publication number
- CN107547106A CN107547106A CN201710960141.1A CN201710960141A CN107547106A CN 107547106 A CN107547106 A CN 107547106A CN 201710960141 A CN201710960141 A CN 201710960141A CN 107547106 A CN107547106 A CN 107547106A
- Authority
- CN
- China
- Prior art keywords
- mrow
- sequence
- msub
- msubsup
- code
- 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.)
- Granted
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
- Synchronisation In Digital Transmission Systems (AREA)
Abstract
The invention discloses a kind of long short code method of estimation of multi tate short code spread spectrum long code scrambling direct sequency-code division multiple access signal.Scrambler cycle and minimum spreading code cycle are most greatly enhanced according to it first, carrying out double fragmentation to reception signal obtains signal matrix, utilizes the compound chip segment of the isolated each user of Fast ICA algorithms.Then successively decreased with information rate and estimate the long short code sequence of user successively, splicing forms fuzzy sequence by the isolated compound chip segment of Fast ICA algorithms, order is eliminated using secondary delay multiplication method to obscure and spreading code interference, with reference to cyclotomic cosets and third-order correlation characteristic, the long scrambler that all users are corresponded to using the same speed of characteristic information matching method completion is estimated, short spreading code is estimated by related operation simultaneously, all compound chip segments for having estimated user are removed by similarity factor matrix again, until completing the long short code estimation of all users.
Description
Technical field
It is more particularly to a kind of to be added using short code spread spectrum long code the invention belongs to the parameter Estimation field of direct sequence signal in communicating
The long short code method of estimation for the long short code direct sequency-code division multiple access signal of multi tate disturbed.
Background technology
DSSS (direct sequence spread spectrum, DSSS) has strong antijamming capability, hidden
Covering property is good, is easy to the advantages that CDMA, is widely applied in military and civilian field.
With the continuous development of spread spectrum communication, traditional DSSS technologies limit because the contradiction of processing gain and data transfer rate be present
Its application in terms of high speed data transfer.To provide preferably service and application, multi tate is introduced in spread spectrum communication
Direct sequence spread spectrum skill.Direct sequency-code division multiple access system is realized based on DSSS technologies and CDMA technology, in non-cooperation
In communication, to direct sequency-code division multiple access (the long and short codes direct of multi tate short code spread spectrum long code scrambling
Sequence code division multiple access, LSC-DS-CDMA) signal carry out pseudo-code blind estimate have it is important
Meaning.
Typical direct sequence signal spread spectrum code sequence method of estimation includes feature decomposition method, blind source separating method, based on subspace
Method and the expectation maximization estimation technique etc..These methods have certain effect for simple direct sequence signal, but not
Multi tate LSC-DS-CDMA signals can be directly used in.
The content of the invention
The present invention is directed to the limitation of existing spread code estimation method, proposes a kind of multi tate length based on Fast-ICA
The long short code method of estimation of code direct sequency-code division multiple access signal.
Technical scheme comprises the following steps used by this hair solves its technical problem：
Step 1, by the long short code direct sequency-code division multiple access signal of multi tate with spreading code chip polydispersity index be converted into base band letter
Number, instantaneous linear mixed signal model in blind separation is built into, passes through the compound key of the isolated each user of Fast-ICA algorithms
Fragment；
Step 2, estimation minimum-rate correspond to the long short code sequence of user, and the compound chip segment that splicing blind separation obtains obtains
Completely fuzzy sequence, the fuzzy influence with spreading code of order is eliminated using delay multiplication method twice；
Step 3, the third-order correlation peak point characteristic information matrix with reference to cyclotomic cosets the Theory Construction m-sequence, computing relay
Signal peak point at triple correlation function average value, the method matched by characteristic information completes long scrambler sequence and estimates
Meter；
Step 4, the long scrambler sequence obtained according to compound key sequence and estimation, complete short spreading code using related operation and estimate
Meter；
Step 5, all fragments for having estimated user are removed according to the similarity factor matrix of sequence fragment, complete compound chip
The cleaning of section；
Step 6, the fuzzy sequence of reconstruct, circulation step 2- steps 5, the long short code until completing all users in reception signal
Sequence estimation.
The present invention makes full use of the design feature of multi tate LSC-DS-CDMA signals, according to most greatly enhancing scrambler cycle and most
The small spreading code cycle carries out double fragmentation to reception signal, is converted into instantaneous linear mixed signal model, is calculated using Fast-ICA
Method carries out blind separation and obtains the compound chip segment of length, completes user's separation.
The present invention estimates the long short code of each user according to the order of speed from small to large successively.Minimum-rate pair is estimated first
The long short code of the whole users answered, it is recycled to time big speed and is estimated that this method reduces algorithm complex and reduced
Amount of calculation.
The theoretical third-order correlation characteristic with m-sequence of cyclotomic cosets is combined in the present invention, utilizes characteristic information matching method to complete
The long scrambler estimation of user, then short spreading code is completed by related operation and estimated, method is simple and effective.
Similarity factor definition is provided in the present invention, the compound chip segment for having estimated user is removed by similarity factor matrix,
Greatly reduce algorithm complex and amount of calculation.
The beneficial effects of the invention are as follows：
1st, it is blind source signal separation problem by multi tate LSC-DS-CDMA signal modelings, by baroque signal model
Simplify.
2nd, the influence that order obscures and spreading code is estimated long scrambler is eliminated by delay multiplication method twice, improves estimation
Performance.
3rd, characteristic information matrix is constructed using the third-order correlation characteristic of m-sequence, the method matched using characteristic information is estimated
Long scrambler sequence is counted, improves estimation performance.
4th, the fragment for having estimated user is removed according to similarity factor matrix, amount of calculation is reduced and reduces the complexity of algorithm
Degree.
Embodiment
Illustrate the implementation steps of the present invention in detail further below.
The long short code method of estimation of the long short code direct sequency-code division multiple access signal of multi tate, specifically comprises the following steps：
Step 1, by the long short code direct sequency-code division multiple access signal of multi tate with spreading code chip polydispersity index be converted into base band letter
Number, instantaneous linear mixed signal model in blind separation is built into, passes through the compound key of the isolated each user of Fast-ICA methods
Fragment, it is specific as follows：
The carrier frequency for the multi tate LSC-DS-CDMA signals that total number of users known to 1-1. hypothesis is U, the base that will be received
Band signal is expressed as with frequency expansion sequence chip polydispersity index, then reception signal：
Wherein, n is sampling instant, and 1≤n≤N, N are reception signal length；V is the different information of all users in signal
Speed species number, its information rate are respectively R1,R2,…RV, the corresponding spreading code cycle is respectively Lb1,Lb2,…LbV(Lbi=
1/Ri), and meet LbV=2LbV-1=... ,=2V-1Lb1；UiIt is that information rate is RiUser's number, U1+U2+…+UV=U；
Ai.jFor signal amplitude, di,j(n)、bi,jAnd c (n)i,j(n) be respectively user information code, short spreading code and long scrambler sequence,
si.j(n) it is the compound key sequence of long short code.Because the pseudo-code sequence recovered from the signal of different initial times is original
The cyclic shift of beginning sequence, τ might as well be seti,j=0；W (n) is additive zero white Gaussian noise, variance σ2.I-th kind of speed pair
The user answered, short spreading code are Lb from the cycleiOrthogonal Variable Spreading Factor OVSF (orthogonal variable
Spreading factor, OVSF) code, long scrambler selects m-sequence, is the effective of ensuring method because the m-sequence cycle is odd number
Property, first chip of m-sequence is added to its end, it is Lc to remember the new cyclei.The short spreading code of each user and long scrambler
Differ, but the long short code cycle phase of information rate identical user is same, and have LcV=2LcV-1... ,=2V-1Lc1。
1-2. is according to most greatly enhancing scrambler period L cVTo signal subsection, the array being made up of Z signal segment is translated into
Signal, formula (1) can be expressed as the form of matrix：
R (n)=A (n) S (n)+W (n) (2)
Wherein, 1≤n≤LcV, r (n)=[r1(n)r2(n)…rZ(n)]T, rz(n)=r ((z-1) LcV+ n),W (n)=[w1(n)w2(n)…wZ(n)]T, wz(n)
=w ((z-1) LcV+n).Hybrid matrix A (n) is time-varying, is expressed as：
WhereinSymbolExpression takes upwards.
1-3. is by minimum spreading code period L b1Each array element signals are divided into K sequence fragment, then the reception of k-th of fragment
Signal is represented by
rk(n)=Ak(n)Sk(n)+Wk(n) (4)
1≤n≤Lb in formula1, 1≤k≤K, Within the time corresponding to sequence fragment,
Hybrid matrix Ak(n) can be expressed as：
WhereinAk(n) approximately constant.Formula (4) is instantaneous line in typical blind separation
Property mixed signal model.Each user's compound key sequence estimation is completed with Fast-ICA algorithms.
Step 2, first estimation minimum-rate correspond to the long short code sequence of user, the compound chip segment that splicing blind separation obtains
Obtain completely obscuring sequence, the fuzzy influence with spreading code of order is eliminated using delay multiplication method twice, it is specific as follows：
2-1. cycle estimators are Lc1M-sequence, choose K in order1=Lc1/Lb1Individual fragment is spliced, and is obtainedIt is individual
Length is Lc1Fuzzy sequence, be designated as αh.These αhSequence can be represented by the following formula：
Wherein Individual αhIn, have and only U1It is individual
It is that real speed is R1And user's compound key sequence of complete cycle, it is labeled as
2-2. eliminates the fuzzy influence with spreading code of order by delay multiplication method, even
TCF be estimated as
Step 3, the third-order correlation peak point characteristic information matrix with reference to cyclotomic cosets the Theory Construction m-sequence, computing relay
Signal peak point at triple correlation function average value, the method matched by characteristic information completes long scrambler sequence and estimates
Meter, it is specific as follows：
3-1. assumes J finite aggregate be present in the cyclotomic cosets in scrambler cycle, and the coset head of this J finite aggregate is charged into collection
Close { ηj| 1≤j≤J }, it is { η to calculate all primitive polynomials of the exponent number (common F) corresponding m-sequence abscissa in main value domainj|1
≤ j≤J } when TCF values, find TCF peak point, thus form the peak point translation specifications information matrix Φ of m-sequence.
3-2. utilizes formula (8) computing relay sequence γh(n) TCF at F sequence peaks point, and calculate it with following formula
Average value：
Wherein f represents the sequence number of m-sequence, meets 1≤f≤F, qf,jRepresent that f-th of primitive polynomial corresponds to m-sequence in horizontal stroke
Coordinate is ηjWhen ordinate corresponding to peak point.
3-3. finds maximumAnd corresponding sequence number f is charged into set ξ.ByIndividual sequence is obtained in set ξ
How much individual element, whole elements in statistics set ξ, sort by occurrence number, preceding U1Number is U1The correct m-sequence of individual user
Sequence number in characteristic information matrix, it is R that the method matched by peak coordinate characteristic information, which is finally completed speed,1U1Individual use
The long scrambler sequence estimation at family.
Step 4, the long scrambler sequence obtained according to compound key sequence and estimation, complete short spreading code using related operation and estimate
Meter, it is specific as follows：
According to compound key sequenceAnd the long scrambler sequence c that estimation obtainsh′(n), short expansion is estimated using related operation
Frequency code：
Wherein, 1≤n≤Lb1, 1≤h '≤U1.The sequence b now obtainedh′(n) it is the in the same direction or backward sequence of short spreading code
Row, are judged according to the property of ovsf code, determine short spreading code sequence.
Step 5, all fragments for having estimated user are removed according to the similarity factor matrix of sequence fragment, complete compound chip
The cleaning of section, it is specific as follows：
5-1. is in all compound key sequence fragments that blind separation obtains, according to the similarity factor matrix of sequence fragment come clear
Except U1All fragments of individual user.Similarity factor is defined as the ratio that same symbol is shared in sequence length in two sequence fragments
Example, as shown in formula (11)：
Wherein,Represent i-th kind of speed control that blind separation obtains
N-th of sequential value in k-th of compound chip segment of j user, 1≤j '≤U1,RepresentMedium-rate is R1's
N-th of sequential value in jth ' compound chip segment of k-th of individual user.
Thus 5-2. obtains similarity factor matrix corresponding to k-th of fragment：
WhenWhen represent that two sequence fragments are identical, due to the particularity of m-sequence,Minimum value it is near
Approximately equal to 0.5.Matrix delta in theorykOne and only one value of middle each row and column is 1, and its residual value is approximately equal to 0.5.Determine jth '
It is maximum in rowCorresponding λ, removeIn λ rows (wherein 1≤j '≤U1), finally give one it is newThis
Complete R1U corresponding to speed1The compound chip segment cleaning of individual user.
Step 6, the fuzzy sequence of reconstruct, circulation step 2- steps 5, the long short code until completing all users in reception signal
Sequence estimation, it is specific as follows：
ReconstructIt is individualRepeat to walk
Rapid 2 to step 5, by U1Replace with Ui, completion speed is RiUiThe long short code sequence estimation of individual user, is finally progressively estimated
The long short code sequence of all users.
Claims (7)
1. the long short code method of estimation of the long short code direct sequency-code division multiple access signal of multi tate, it is characterised in that this method includes following step
Suddenly：
Step 1, the long short code direct sequency-code division multiple access signal of multi tate is converted into baseband signal, structure with spreading code chip polydispersity index
Instantaneous linear mixed signal model in blind separation is built up, passes through the compound chip segment of the isolated each user of Fast-ICA methods；
Step 2, first estimation minimum-rate correspond to the long short code sequence of user, and the compound chip segment that splicing blind separation obtains obtains
Completely fuzzy sequence, the fuzzy influence with spreading code of order is eliminated using delay multiplication method twice；
Step 3, the third-order correlation peak point characteristic information matrix with reference to cyclotomic cosets the Theory Construction m-sequence, computing relay signal
Peak point at triple correlation function average value, pass through the estimation that the method that characteristic information matches completes long scrambler sequence；
Step 4, the long scrambler sequence obtained according to compound key sequence and estimation, short spreading code estimation is completed using related operation；
Step 5, all fragments for having estimated user are removed according to the similarity factor matrix of sequence fragment, complete compound chip segment
Cleaning；
Step 6, the fuzzy sequence of reconstruct, circulation step 2- steps 5, the long short code sequence until completing all users in reception signal
Estimation.
2. the long short code method of estimation of the long short code direct sequency-code division multiple access signal of multi tate according to claim 1, its feature
It is that step 1 is specific as follows：
The carrier frequency for the multi tate LSC-DS-CDMA signals that total number of users known to 1-1. hypothesis is U, the base band received is believed
Number with frequency expansion sequence chip polydispersity index, then reception signal is expressed as：
<mrow>
<mtable>
<mtr>
<mtd>
<mrow>
<mi>r</mi>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>V</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
</munderover>
<msub>
<mi>A</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
</mrow>
</msub>
<msub>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>)</mo>
</mrow>
<msub>
<mi>s</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>)</mo>
</mrow>
<mo>+</mo>
<mi>w</mi>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>V</mi>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<msub>
<mi>U</mi>
<mi>i</mi>
</msub>
</munderover>
<msub>
<mi>A</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
</mrow>
</msub>
<msub>
<mi>d</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>)</mo>
</mrow>
<msub>
<mi>b</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>-</mo>
<msub>
<mi>&tau;</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<msub>
<mi>c</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>-</mo>
<msub>
<mi>&tau;</mi>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
<mo>+</mo>
<mi>w</mi>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
</mtable>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein, n is sampling instant, and 1≤n≤N, N are reception signal length；V is the different information rates of all users in signal
Species number, its information rate are respectively R1,R2,…RV, the corresponding spreading code cycle is respectively Lb1,Lb2,…LbV(Lbi=1/
Ri), and meet LbV=2LbV-1=... ,=2V-1Lb1；UiIt is that information rate is RiUser's number, U1+U2+…+UV=U；Ai.j
For signal amplitude, di,j(n)、bi,jAnd c (n)i,j(n) be respectively user information code, short spreading code and long scrambler sequence, si.j
(n) it is the compound key sequence of long short code；Because the pseudo-code sequence recovered from the signal of different initial times is original
The cyclic shift of sequence, τ might as well be seti,j=0；W (n) is additive zero white Gaussian noise, variance σ2；I-th kind of speed is corresponding
User, short spreading code is Lb from the cycleiOrthogonal variable frequency extension factor code, long scrambler selects m-sequence, due to m-sequence week
Phase is odd number, first chip of m-sequence is added into its end, it is Lc to remember the new cyclei；The short spreading code of each user and
Long scrambler differs, but the long short code cycle phase of information rate identical user is same, and has LcV=2LcV-1... ,=2V-1Lc1；
1-2. is according to most greatly enhancing scrambler period L cVTo signal subsection, the array signal being made up of Z signal segment is translated into,
Formula (1) can be expressed as the form of matrix：
R (n)=A (n) S (n)+W (n) (2)
Wherein, 1≤n≤LcV, r (n)=[r1(n)r2(n)…rZ(n)]T, rz(n)=r ((z-1) LcV+ n),1≤i≤V, 1≤j≤Ui, W (n)=[w1(n)w2(n)…wZ(n)]T, wz(n)=
w((z-1)·LcV+n)；Hybrid matrix A (n) is time-varying, is expressed as：
WhereinSymbolExpression takes upwards；
1-3. is by minimum spreading code period L b1Each array element signals are divided into K sequence fragment, then the reception signal of k-th of fragment can
It is expressed as
rk(n)=Ak(n)Sk(n)+Wk(n) (4)
1≤n≤Lb in formula1, 1≤k≤K, Within the time corresponding to sequence fragment,
Hybrid matrix Ak(n) can be expressed as：
WhereinAk(n) approximately constant；Formula (4) is that instantaneous linear mixes in typical blind separation
Signal model；Each user's compound key sequence estimation is completed with Fast-ICA algorithms.
3. the long short code method of estimation of the long short code direct sequency-code division multiple access signal of multi tate according to claim 1, its feature
It is that step 2 is specific as follows：
2-1. cycle estimators are Lc1M-sequence, choose K in order1=Lc1/Lb1Individual fragment is spliced, and is obtainedIndividual length
For Lc1Fuzzy sequence, be designated as αh；These αhSequence can be represented by the following formula：
<mrow>
<msub>
<mi>&alpha;</mi>
<mi>h</mi>
</msub>
<mo>=</mo>
<mfenced open = "[" close = "]">
<mtable>
<mtr>
<mtd>
<msubsup>
<mover>
<mi>s</mi>
<mo>^</mo>
</mover>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
</mrow>
<mn>1</mn>
</msubsup>
</mtd>
<mtd>
<msubsup>
<mover>
<mi>s</mi>
<mo>^</mo>
</mover>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
</mrow>
<mn>2</mn>
</msubsup>
</mtd>
<mtd>
<mn>...</mn>
</mtd>
<mtd>
<msubsup>
<mover>
<mi>s</mi>
<mo>^</mo>
</mover>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
</mrow>
<mi>k</mi>
</msubsup>
</mtd>
<mtd>
<mn>...</mn>
</mtd>
<mtd>
<msubsup>
<mover>
<mi>s</mi>
<mo>^</mo>
</mover>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
</mrow>
<msub>
<mi>K</mi>
<mn>1</mn>
</msub>
</msubsup>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>6</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein1≤i≤V, 1≤j≤Ui, 1≤k≤K1；Individual αhIn, have and only U1Individual is real speed
Rate is R1And user's compound key sequence of complete cycle, it is labeled as
2-2. eliminates the fuzzy influence with spreading code of order by delay multiplication method, even
<mrow>
<mtable>
<mtr>
<mtd>
<mrow>
<msubsup>
<mi>&beta;</mi>
<msup>
<mi>h</mi>
<mo>&prime;</mo>
</msup>
<mo>*</mo>
</msubsup>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msubsup>
<mi>&alpha;</mi>
<msup>
<mi>h</mi>
<mo>&prime;</mo>
</msup>
<mo>*</mo>
</msubsup>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>)</mo>
</mrow>
<mo>&CenterDot;</mo>
<msubsup>
<mi>&alpha;</mi>
<msup>
<mi>h</mi>
<mo>&prime;</mo>
</msup>
<mo>*</mo>
</msubsup>
<mrow>
<mo>(</mo>
<mo>(</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
<mo>)</mo>
<mi>mod</mi>
<mi> </mi>
<msub>
<mi>Lc</mi>
<mn>1</mn>
</msub>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msubsup>
<mi>&gamma;</mi>
<msup>
<mi>h</mi>
<mo>&prime;</mo>
</msup>
<mo>*</mo>
</msubsup>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msubsup>
<mi>&beta;</mi>
<msup>
<mi>h</mi>
<mo>&prime;</mo>
</msup>
<mo>*</mo>
</msubsup>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>)</mo>
</mrow>
<mo>&CenterDot;</mo>
<msubsup>
<mi>&beta;</mi>
<msup>
<mi>h</mi>
<mo>&prime;</mo>
</msup>
<mo>*</mo>
</msubsup>
<mrow>
<mo>(</mo>
<mo>(</mo>
<mrow>
<mi>n</mi>
<mo>+</mo>
<msub>
<mi>Lb</mi>
<mn>1</mn>
</msub>
</mrow>
<mo>)</mo>
<mi>mod</mi>
<mi> </mi>
<msub>
<mi>Lc</mi>
<mn>1</mn>
</msub>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
</mtable>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>7</mn>
<mo>)</mo>
</mrow>
</mrow>
TCF be estimated as
<mrow>
<msub>
<mi>C</mi>
<mi>h</mi>
</msub>
<mrow>
<mo>(</mo>
<mi>p</mi>
<mo>,</mo>
<mi>q</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<mn>1</mn>
<mrow>
<msub>
<mi>Lc</mi>
<mn>1</mn>
</msub>
</mrow>
</mfrac>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mrow>
<msub>
<mi>Lc</mi>
<mn>1</mn>
</msub>
</mrow>
</munderover>
<msubsup>
<mi>&gamma;</mi>
<msup>
<mi>n</mi>
<mo>&prime;</mo>
</msup>
<mo>*</mo>
</msubsup>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>)</mo>
</mrow>
<msubsup>
<mi>&gamma;</mi>
<msup>
<mi>h</mi>
<mo>&prime;</mo>
</msup>
<mo>*</mo>
</msubsup>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>+</mo>
<mi>p</mi>
<mo>)</mo>
</mrow>
<msubsup>
<mi>&gamma;</mi>
<msup>
<mi>h</mi>
<mo>&prime;</mo>
</msup>
<mo>*</mo>
</msubsup>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>+</mo>
<mi>q</mi>
<mo>)</mo>
</mrow>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>8</mn>
<mo>)</mo>
</mrow>
<mo>.</mo>
</mrow>
4. the long short code method of estimation of the long short code direct sequency-code division multiple access signal of multi tate according to claim 3, its feature
It is that step 3 is specific as follows：
3-1. assumes J finite aggregate be present in the cyclotomic cosets in scrambler cycle, and the coset head of this J finite aggregate is charged into set { ηj
| 1≤j≤J }, it is { η to calculate all primitive polynomials of the exponent number and correspond to m-sequence abscissa in main value domainj| 1≤j≤J } when
TCF values, TCF peak point is found, thus form the peak point translation specifications information matrix Φ of m-sequence；
3-2. utilizes formula (8) computing relay sequence γh(n) TCF at F sequence peaks point, and calculate it with following formula and be averaged
Value：
<mrow>
<msub>
<mover>
<mi>C</mi>
<mo>&OverBar;</mo>
</mover>
<mi>f</mi>
</msub>
<mo>=</mo>
<mfrac>
<mrow>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>J</mi>
</munderover>
<msub>
<mi>C</mi>
<mi>h</mi>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>&eta;</mi>
<mi>j</mi>
</msub>
<mo>,</mo>
<msub>
<mi>q</mi>
<mrow>
<mi>f</mi>
<mo>,</mo>
<mi>j</mi>
</mrow>
</msub>
<mo>)</mo>
</mrow>
</mrow>
<mi>J</mi>
</mfrac>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>9</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein f represents the sequence number of m-sequence, meets 1≤f≤F, qf,jRepresent that f-th of primitive polynomial corresponds to m-sequence in abscissa
For ηjWhen ordinate corresponding to peak point；
3-3. finds maximumAnd corresponding sequence number f is charged into set ξ；ByIndividual sequence is obtained in set ξIndividual member
How much element, whole elements in statistics set ξ, sort by occurrence number, preceding U1Number is U1The correct m-sequence of individual user is in spy
The sequence number in information matrix is levied, it is R that the method matched by peak coordinate characteristic information, which is finally completed speed,1U1Individual user's
Long scrambler sequence estimation.
5. the long short code method of estimation of the long short code direct sequency-code division multiple access signal of multi tate according to claim 4, its feature
It is that step 4 is specific as follows：
According to compound key sequenceAnd the long scrambler sequence c that estimation obtainsh′(n), short spread spectrum is estimated using related operation
Code：
<mrow>
<msub>
<mi>b</mi>
<msup>
<mi>h</mi>
<mo>&prime;</mo>
</msup>
</msub>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msubsup>
<mi>&alpha;</mi>
<msup>
<mi>h</mi>
<mo>&prime;</mo>
</msup>
<mo>*</mo>
</msubsup>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>)</mo>
</mrow>
<mo>&CenterDot;</mo>
<msub>
<mi>c</mi>
<msup>
<mi>h</mi>
<mo>&prime;</mo>
</msup>
</msub>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>)</mo>
</mrow>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>10</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein, 1≤n≤Lb1, 1≤h '≤U1；The sequence b now obtainedh′(n) it is the in the same direction or reverse sequence of short spreading code, root
Judged according to the property of ovsf code, determine short spreading code sequence.
6. the long short code method of estimation of the long short code direct sequency-code division multiple access signal of multi tate according to claim 5, its feature
It is that step 5 is specific as follows：
5-1. removes U in all compound key sequence fragments that blind separation obtains according to the similarity factor matrix of sequence fragment1
All fragments of individual user；Similarity factor is defined as the ratio that same symbol is shared in sequence length in two sequence fragments,
As shown in formula (11)：
<mrow>
<msubsup>
<mi>&delta;</mi>
<mrow>
<mi>&lambda;</mi>
<mo>,</mo>
<msup>
<mi>j</mi>
<mo>&prime;</mo>
</msup>
</mrow>
<mi>k</mi>
</msubsup>
<mo>=</mo>
<mfrac>
<mrow>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mrow>
<msub>
<mi>Lb</mi>
<mn>1</mn>
</msub>
</mrow>
</munderover>
<mo>|</mo>
<msubsup>
<mover>
<mi>s</mi>
<mo>^</mo>
</mover>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
</mrow>
<mi>k</mi>
</msubsup>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>)</mo>
</mrow>
<mo>+</mo>
<msubsup>
<msup>
<mover>
<mi>s</mi>
<mo>^</mo>
</mover>
<mo>&prime;</mo>
</msup>
<mrow>
<mn>1</mn>
<mo>,</mo>
<msup>
<mi>j</mi>
<mo>&prime;</mo>
</msup>
</mrow>
<mi>k</mi>
</msubsup>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>)</mo>
</mrow>
<mo>|</mo>
</mrow>
<mrow>
<mn>2</mn>
<mo>&CenterDot;</mo>
<msub>
<mi>Lb</mi>
<mn>1</mn>
</msub>
</mrow>
</mfrac>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>11</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein,1≤i≤V, 1≤j≤Ui,Represent i-th kind of speed, j-th of user that blind separation obtains
K-th of compound chip segment in n-th of sequential value, 1≤j '≤U1,RepresentMedium-rate is R1Jth ' individual
N-th of sequential value in k-th of compound chip segment of user；
Thus 5-2. obtains similarity factor matrix corresponding to k-th of fragment：
WhenWhen represent that two sequence fragments are identical, due to the particularity of m-sequence,Minimum value approximation etc.
In 0.5；Matrix delta in theorykOne and only one value of middle each row and column is 1, and its residual value is approximately equal to 0.5；Determine in jth ' row
It is maximumCorresponding λ, removeIn λ rows (wherein 1≤j '≤U1), finally give one it is newThisComplete
R1U corresponding to speed1The compound chip segment cleaning of individual user.
7. the long short code method of estimation of the long short code direct sequency-code division multiple access signal of multi tate according to claim 6, its feature
It is that step 6 is specific as follows：
ReconstructIt is individualRepeat step 2 to
Step 5, by U1Replace with Ui, completion speed is RiUiThe long short code sequence estimation of individual user, it is useful finally progressively to estimate institute
The long short code sequence at family.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710960141.1A CN107547106B (en) | 2017-10-16 | 2017-10-16 | The long short code estimation method of the long short code direct sequency-code division multiple access signal of multi tate |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710960141.1A CN107547106B (en) | 2017-10-16 | 2017-10-16 | The long short code estimation method of the long short code direct sequency-code division multiple access signal of multi tate |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107547106A true CN107547106A (en) | 2018-01-05 |
| CN107547106B CN107547106B (en) | 2019-08-13 |
Family
ID=60967112
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710960141.1A Active CN107547106B (en) | 2017-10-16 | 2017-10-16 | The long short code estimation method of the long short code direct sequency-code division multiple access signal of multi tate |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107547106B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109150776A (en) * | 2018-08-15 | 2019-01-04 | 桂林电子科技大学 | A kind of short code direct sequence signal pseudo-code sequence blind estimating method |
| CN114301496A (en) * | 2021-11-30 | 2022-04-08 | 中国电子科技集团公司第五十四研究所 | Long-period spread spectrum sequence generation method based on m-sequence preferred pairs |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050047490A1 (en) * | 2003-08-28 | 2005-03-03 | Haitao Zhang | Method and apparatus for removing code aliases when using short synchronization codes |
| CN1677909A (en) * | 2004-03-31 | 2005-10-05 | 清华大学 | Frame synchronizing method for time-domain synchronous orthogonal frequency-division duplex receiver and system |
| CN101079653A (en) * | 2007-06-27 | 2007-11-28 | 哈尔滨工程大学 | PN SN blind estimation method and device |
| CN105429925A (en) * | 2015-11-18 | 2016-03-23 | 杭州电子科技大学 | Multi-antenna OFDMA signal decoding method based on rapid and independent component analysis |
| CN106817326A (en) * | 2016-12-23 | 2017-06-09 | 杭州电子科技大学 | The pseudo-code blind estimating method of multi-user's cycle short code direct sequence signal long |
-
2017
- 2017-10-16 CN CN201710960141.1A patent/CN107547106B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050047490A1 (en) * | 2003-08-28 | 2005-03-03 | Haitao Zhang | Method and apparatus for removing code aliases when using short synchronization codes |
| CN1677909A (en) * | 2004-03-31 | 2005-10-05 | 清华大学 | Frame synchronizing method for time-domain synchronous orthogonal frequency-division duplex receiver and system |
| CN101079653A (en) * | 2007-06-27 | 2007-11-28 | 哈尔滨工程大学 | PN SN blind estimation method and device |
| CN105429925A (en) * | 2015-11-18 | 2016-03-23 | 杭州电子科技大学 | Multi-antenna OFDMA signal decoding method based on rapid and independent component analysis |
| CN106817326A (en) * | 2016-12-23 | 2017-06-09 | 杭州电子科技大学 | The pseudo-code blind estimating method of multi-user's cycle short code direct sequence signal long |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109150776A (en) * | 2018-08-15 | 2019-01-04 | 桂林电子科技大学 | A kind of short code direct sequence signal pseudo-code sequence blind estimating method |
| CN109150776B (en) * | 2018-08-15 | 2021-06-08 | 桂林电子科技大学 | Blind estimation method for pseudo code sequence of short code direct sequence spread spectrum signal |
| CN114301496A (en) * | 2021-11-30 | 2022-04-08 | 中国电子科技集团公司第五十四研究所 | Long-period spread spectrum sequence generation method based on m-sequence preferred pairs |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107547106B (en) | 2019-08-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Rovatti et al. | Chaotic complex spreading sequences for asynchronous DS-CDMA. Part II. Some theoretical performance bounds | |
| CN106817326B (en) | Pseudo code blind estimation method of multi-user long-period short code direct sequence spread spectrum signal | |
| CN106789789A (en) | WCDMA signal scrambling codes are estimated and information source information blind decoding method | |
| CN102710282B (en) | Self-synchronizing scrambling blind identification method based on code weight distribution | |
| CN105680903B (en) | The period more pseudo-code methods of estimation of long short code direct sequency-code division multiple access signal | |
| CN107547106B (en) | The long short code estimation method of the long short code direct sequency-code division multiple access signal of multi tate | |
| CN104038249B (en) | Cycle long code direct sequence signal pseudo-random code estimation method | |
| CN105045561A (en) | Pseudo-random number generating method | |
| CN108886380A (en) | Safe lane measurement | |
| CN1706110B (en) | Reduced complexity MMSE multiuser detection for a multirate CDMA link | |
| CN101414890B (en) | Method for composing multidimensional quadrature pseudo-random matrix | |
| CN102905137A (en) | Quick difference value vector quantitative compression coding method of ultra-spectrum signal | |
| CN111953380A (en) | Non-periodic long code direct sequence spread spectrum signal time delay estimation method and system based on norm fitting | |
| CN111490847A (en) | Multi-address communication method and device for selecting pseudo-random code sequence to carry out spread spectrum | |
| CN104994042A (en) | Blind recognition method of self-synchronizing scrambling generator polynomial based on autocorrelation function | |
| CN109951406B (en) | Blind estimation method for number of users and scrambling codes of real-time acquisition signals of Unicom asynchronous WCDMA (wideband code division multiple Access) | |
| US6529546B2 (en) | Acquisition of a spread-spectrum signal using counters | |
| CN104301100B (en) | A kind of radio channel characteristic integrated information fusion method | |
| CN102201912A (en) | Blind recognition method for self-synchronization scrambling code generation polynomial | |
| CN101662304B (en) | Method for designing zero correlation zone sequence on quadrature amplitude modulation constellation | |
| CN101626249B (en) | Soft-input soft-output coding system and soft-input soft-output coding method | |
| Zhao et al. | Blind Estimation of PN Codes in Multi-user LSC-DSSS Signals. | |
| CN108983191B (en) | Low-speed signal processing method of OFDM radar communication integrated system | |
| CN101753248B (en) | Construction device of multi-dimensional similar-orthogonal pseudo-random extended matrix | |
| CN100459487C (en) | Chaotic cipher production method under limited precision |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201225 Address after: Room 3003-1, building 1, Gaode land center, Jianggan District, Hangzhou City, Zhejiang Province Patentee after: Zhejiang Zhiduo Network Technology Co.,Ltd. Address before: 310018 No. 2 street, Xiasha Higher Education Zone, Hangzhou, Zhejiang Patentee before: HANGZHOU DIANZI University Effective date of registration: 20201225 Address after: 314500 Tongxiang City, Jiaxing, Zhejiang, Tung Tung Road, Wu Tung Street (East) 55, Tongxiang chamber of Commerce Building 1 unit 1702, 1703 room -A-220 Patentee after: Jiaxing Beixi Electromechanical Equipment Co.,Ltd. Address before: Room 3003-1, building 1, Gaode land center, Jianggan District, Hangzhou City, Zhejiang Province Patentee before: Zhejiang Zhiduo Network Technology Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20221214 Address after: Room 407-10, floor 4, building 2, Haichuang science and technology center, Cangqian street, Yuhang District, Hangzhou City, Zhejiang Province, 311100 Patentee after: Zhejiang Zhiduo Network Technology Co.,Ltd. Address before: 314500 Tongxiang City, Jiaxing, Zhejiang, Tung Tung Road, Wu Tung Street (East) 55, Tongxiang chamber of Commerce Building 1 unit 1702, 1703 room -A-220 Patentee before: Jiaxing Beixi Electromechanical Equipment Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230208 Address after: 200120 500 Chuanqiao Road, Pudong New Area (Shanghai) Pilot Free Trade Zone, Shanghai Patentee after: Infinite Shanghai Communication Terminals Ltd. Address before: Room 407-10, floor 4, building 2, Haichuang science and technology center, Cangqian street, Yuhang District, Hangzhou City, Zhejiang Province, 311100 Patentee before: Zhejiang Zhiduo Network Technology Co.,Ltd. |
|
| TR01 | Transfer of patent right |