Disclosure of Invention
The invention aims to provide a method and a device for eliminating signal interference of a common-frequency cell based on serial interference cancellation, which can eliminate the influence of the signal of the common-frequency cell to a great extent and improve the receiving performance of the signal of the cell under the severe condition that the power of a common-frequency adjacent cell is higher than that of the cell with lower implementation complexity.
The invention provides a method for eliminating signal interference of a same-frequency cell based on Serial Interference Cancellation (SIC), which is characterized in that the cell and each same-frequency adjacent cell respectively and independently adopt a method for reconstructing signals of each cell based on demodulation symbols generated by a matched filter, and the method carries out interference cancellation in series and comprises the following steps:
step 1, for each cell, namely the current cell and M same-frequency adjacent cells, the cell received signal recovery unit orderly eliminates the reconstructed signal of the cell in the s-1 level interference elimination process
And residual signals after removing interference signals of all previous cells in the s-th-stage interference elimination process
Superposing and recovering the received signals of each cell
Wherein S is 1, 2, …, S, and S represents the number of successive interference cancellation stages set by the system; j ═ 1, 2, …, M + 1;
step 2, according to the sampling input of the current received data I/Q way
And the sum of the signals after the interference elimination of the s-1 level, a Channel Estimation and interference reconstruction Unit (CEIGU for short) reconstructs the signals of each cell by adopting a method based on a demodulation symbol generated by a Matched Filter (MF), and sequentially and serially completes the reconstruction of the interference signals of each cell to obtain a reconstructed signal of each cell of the s level:
<math><mrow>
<msubsup>
<mover>
<mi>x</mi>
<mo>^</mo>
</mover>
<mi>j</mi>
<mi>s</mi>
</msubsup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>,</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mi>s</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>,</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
<mi>s</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>,</mo>
<mi>Z</mi>
<mo>)</mo>
</mrow>
<mi>s</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
wherein S is 1, 2, …, S, j is 1, 2, …, M +1, Z is the length of the sampling sequence;
the step 2 specifically comprises the following steps:
step 2.1, separating effective paths;
step 2.2, generating channel impulse response;
step 2.3, generating a demodulation symbol based on the matched filter;
step 2.4, reconstructing cell signals;
step 3, for each cell, the cell reconstruction signal removing unit sequentially eliminates the reconstruction signal of the cell in the s-th level interference elimination process
From input signals
Medium removal to get the s-th order removal of the smallResidual signal after zone interference
Wherein S is 1, 2, …, S, j is 1, 2, …, M + 1;
and 4, repeatedly executing the steps 1-3 according to SIC series preset by the system until SIC operation of all stages is completed.
In step 1, when s is 1, that is, when the first-stage interference cancellation is performed, the reconstructed signal of the cell is set to 0.
In step 1, when j is 1, that is, when interference cancellation is performed in the first cell, the residual signal after removing the interference signals of all the previous cells in the interference cancellation process is 0.
The method for reconstructing a cell signal using a demodulation symbol generated based on a matched filter in step 2 specifically includes:
step 2.1, separating effective paths;
step 2.1.1, for each cell, the last 128 chips of the Midamble sequence (Midamble code) part of the input signal are data-mappedBy matched filteringA filter, which is respectively connected with the Basic Midamble sequence (Basic Midamble) BM ═ m of the cell1,m2,…,m128) Performing bit-by-bit cyclic exclusive-or operation, and calculating the power (Delay Profile, DP) of each bit-by-bit exclusive-or result on each path:
<math><mrow>
<msub>
<mi>DP</mi>
<mi>k</mi>
</msub>
<mo>=</mo>
<munderover>
<mi>Σ</mi>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mn>128</mn>
</munderover>
<mo>|</mo>
<mo>|</mo>
<msubsup>
<mi>r</mi>
<mi>n</mi>
<mi>BM</mi>
</msubsup>
<mo>*</mo>
<msub>
<mi>m</mi>
<mrow>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>-</mo>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mi>mod</mi>
<mn>128</mn>
</mrow>
</msub>
<mo>|</mo>
<mo>|</mo>
<mo>;</mo>
</mrow></math>
step 2.1.2, detecting the effective path through the effective path detector:
comparing the power DP on each Path (Path) with a certain threshold Th; selecting a path corresponding to the power DP greater than or equal to the threshold Th as an effective path, otherwise, selecting an invalid path; the L effective paths detected by the final effective path detector are: peff=(p1,p2,…,pL);
Step 2.2, generating Channel Impulse response (Channel Impulse):
step 2.2.1, calculating Channel Estimation (ChE) on each path through a matched filter and a Channel estimator:
the basic midamble sequence according to the current cell is BM ═ (m)
1,m
2,…,m
128) And the data of the last 128 chips of the midamble sequence portion in the received input signal is
The channel estimate ChE on each path is calculated as:
<math><mrow>
<msub>
<mi>ChE</mi>
<mi>k</mi>
</msub>
<mo>=</mo>
<munderover>
<mi>Σ</mi>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mn>128</mn>
</munderover>
<msubsup>
<mi>r</mi>
<mi>n</mi>
<mi>BM</mi>
</msubsup>
<mo>*</mo>
<msub>
<mi>m</mi>
<mrow>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>-</mo>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mi>mod</mi>
<mn>128</mn>
</mrow>
</msub>
<mo>;</mo>
</mrow></math>
step 2.2.2, generating channel impulse response H ═ H (H) by the channel impulse responder according to the effective path obtained in step 2.1.2 and the channel estimation obtained in step 2.2.11,h2,…,hT) The length T represents the maximum delay supported by the system, the value at the position of the effective path of the channel impulse response is the channel estimation value on the path, and the value at the position of the non-effective path is zero, that is:
<math><mrow>
<msub>
<mi>h</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<mfenced open='{' close=''>
<mtable>
<mtr>
<mtd>
<msub>
<mi>ChE</mi>
<mi>i</mi>
</msub>
</mtd>
<mtd>
<msub>
<mi>DP</mi>
<mi>i</mi>
</msub>
<mo>≥</mo>
<mi>Th</mi>
</mtd>
</mtr>
<mtr>
<mtd>
<mn>0</mn>
</mtd>
<mtd>
<msub>
<mi>DP</mi>
<mi>i</mi>
</msub>
<mo><</mo>
<mi>Th</mi>
</mtd>
</mtr>
</mtable>
</mfenced>
</mrow></math>
DPirepresents the power of the ith path;
step 2.3, generating demodulation symbols based on the matched filter:
step 2.3.1, descrambling and despreading the data part in the input signal by the matched filter:
according to the position P of the active path, the scrambling code ScC of the current cell and the activated spreading code ChC ═ C
1,C
2,…,C
N),
Where N denotes the number of active code channels and SF denotes the spreading factor, and a matched filter is used to match the data portion of the input signal
Descrambling and despreading operations are carried out, and symbols obtained after descrambling and despreading are as follows:
<math><mrow>
<mi>U</mi>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
</msup>
<mo>,</mo>
<msup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
</msup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mi>N</mi>
</msup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mi>L</mi>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msubsup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mi>l</mi>
<mi>n</mi>
</msubsup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>u</mi>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>,</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>u</mi>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>,</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>u</mi>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>,</mo>
<mi>K</mi>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msubsup>
<mi>u</mi>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>,</mo>
<mi>k</mi>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msubsup>
<mo>=</mo>
<munderover>
<mi>Σ</mi>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>SF</mi>
</munderover>
<msub>
<mi>r</mi>
<mrow>
<msub>
<mi>p</mi>
<mi>k</mi>
</msub>
<mo>+</mo>
<mrow>
<mo>(</mo>
<mi>k</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>·</mo>
<mi>SF</mi>
<mo>+</mo>
<mi>i</mi>
</mrow>
</msub>
<mo>×</mo>
<mi>conj</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>c</mi>
<mi>i</mi>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>×</mo>
<mi>conj</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>ScC</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
wherein,indicating the symbol corresponding to the nth active code channel,representing symbols on the l effective path of the nth active code channel, K representing the number of symbols, u(l,k) nSymbol representing the nth active code channel of the kth symbol of the ith active path, ScCiA scrambling code representing the ith chip;
step 2.3.2, maximum ratio merger carries out maximum ratio merger to the symbol obtained after descrambling and despreading to obtain a demodulated symbol:
according to the channel impulse response, namely the channel estimation on the effective path, the maximal ratio combiner carries out the maximal ratio combining operation on the descrambled and despread symbols on different paths to obtain the demodulated symbol on each active code channel:
<math><mrow>
<mi>Y</mi>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msup>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
</msup>
<mo>,</mo>
<msup>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
</msup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msup>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mi>N</mi>
</msup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msup>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>y</mi>
<mn>1</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>y</mi>
<mn>2</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>y</mi>
<mi>K</mi>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msubsup>
<mi>y</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo>=</mo>
<munderover>
<mi>Σ</mi>
<mrow>
<mi>l</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>L</mi>
</munderover>
<mi>conj</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>ChE</mi>
<mi>l</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>×</mo>
<msubsup>
<mi>u</mi>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>,</mo>
<mi>k</mi>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msubsup>
<mo>;</mo>
</mrow></math>
wherein,indicates the demodulation symbol, u, corresponding to the nth active code channel(l,k) nA symbol representing the nth active code channel of the kth symbol of the 1 st active path;
step 2.3.3, the symbol decision device makes symbol decision to the demodulation symbol generated by the joint detector, and the estimated value of the obtained sending symbol is:
<math><mrow>
<mi>D</mi>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msup>
<mover>
<mi>d</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
</msup>
<mo>,</mo>
<msup>
<mover>
<mi>d</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
</msup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msup>
<mover>
<mi>d</mi>
<mo>^</mo>
</mover>
<mi>N</mi>
</msup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msup>
<mover>
<mi>d</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>d</mi>
<mn>1</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>d</mi>
<mn>2</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>d</mi>
<mi>K</mi>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
whereinAnd the judgment result of the demodulation symbol corresponding to the nth active code channel is shown.
In step 2.3.3, the symbol decision includes hard decision and soft decision:
the hard decision is operated by a demodulation symbol hard decision device, and the result after the hard decision is obtained is as follows:
<math><mrow>
<msubsup>
<mi>d</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo>=</mo>
<mi>sign</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>y</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open='{' close=''>
<mtable>
<mtr>
<mtd>
<mn>1</mn>
</mtd>
<mtd>
<msubsup>
<mi>y</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo>≥</mo>
<mn>0</mn>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>-</mo>
<mn>1</mn>
</mtd>
<mtd>
<msubsup>
<mi>y</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo><</mo>
<mn>0</mn>
</mtd>
</mtr>
</mtable>
</mfenced>
</mrow></math>
yk na demodulated symbol representing a kth symbol of an nth active code channel;
the soft decision is operated by a demodulation symbol soft decision device, and the result after the soft decision is obtained is as follows:
<math><mrow>
<msubsup>
<mi>d</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo>=</mo>
<mi>tanh</mi>
<mrow>
<mo>(</mo>
<mfrac>
<mrow>
<mi>m</mi>
<mo>·</mo>
<msubsup>
<mi>y</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
</mrow>
<msup>
<mi>σ</mi>
<mn>2</mn>
</msup>
</mfrac>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
where m represents the mean value of the received signal amplitude, σ2Representing the noise variance of the received signal and tanh representing the hyperbolic tangent function.
Step 2.4, reconstructing cell signals:
step 2.4.1, the modulation spreader performs modulation spread spectrum operation on the result of the symbol decision to obtain a chip sequence on the active code channel:
according to the scrambling code ScC adopted by the current cell and the spreading code ChC ═ on the active code channel (C)1,C2,…,CN), Modulating and spreading the result of the symbol decision by a modulation spreader to obtain a chip-level transmission signal estimation value on each active code channel:
<math><mrow>
<mi>V</mi>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msup>
<mover>
<mi>v</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
</msup>
<mo>,</mo>
<msup>
<mover>
<mi>v</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
</msup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msup>
<mover>
<mi>v</mi>
<mo>^</mo>
</mover>
<mi>N</mi>
</msup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msup>
<mover>
<mi>v</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>v</mi>
<mn>1</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>v</mi>
<mn>2</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>v</mi>
<mrow>
<mi>K</mi>
<mo>×</mo>
<mi>SF</mi>
</mrow>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
whereinA transmitted signal estimate representing the chip level on the nth active code channel;
step 2.4.2, the convolution device correspondingly completes the reconstruction of the received signal on the activation code channel:
the convolver completes the convolution operation on the chip sequence on each active code channel obtained in step 2.4.1 and the channel impulse response obtained in step 2.2 to obtain a reconstructed signal on each active code channel:
<math><mrow>
<mi>W</mi>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msup>
<mover>
<mi>w</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
</msup>
<mo>,</mo>
<msup>
<mover>
<mi>w</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
</msup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msup>
<mover>
<mi>w</mi>
<mo>^</mo>
</mover>
<mi>N</mi>
</msup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msup>
<mover>
<mi>w</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>w</mi>
<mn>1</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>w</mi>
<mn>2</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>w</mi>
<mrow>
<mi>K</mi>
<mo>×</mo>
<mi>SF</mi>
</mrow>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msup>
<mover>
<mi>w</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mi>H</mi>
<mo>⊗</mo>
<msup>
<mover>
<mi>v</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>;</mo>
</mrow></math>
wherein,
representing the reconstructed signal on the nth code track,
a transmitted signal estimate representing the chip level on the nth active code channel;
step 2.4.3, the activation code channel signal superimposer superimposes the reconstruction signal on each activation code channel to complete the combination of the activation code channels, thereby completing the reconstruction of the cell signal and obtaining the reconstruction signal of the cell
<math><mrow>
<msup>
<mover>
<mi>x</mi>
<mo>^</mo>
</mover>
<mi>s</mi>
</msup>
<mo>=</mo>
<munderover>
<mi>Σ</mi>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</munderover>
<msup>
<mover>
<mi>w</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
</mrow></math>
;
Representing the reconstructed signal on the nth code channel
Step 2.4.4, reconstruction signal weighting: reconstructing the signal of the cell
Multiplication by a particular weighting factor p
sPerformance loss due to incorrect symbol decisions is reduced:
<math><mrow>
<msup>
<mover>
<mi>x</mi>
<mo>^</mo>
</mover>
<mi>s</mi>
</msup>
<mo>=</mo>
<msup>
<mover>
<mi>x</mi>
<mo>^</mo>
</mover>
<mi>s</mi>
</msup>
<mo>×</mo>
<msup>
<mi>ρ</mi>
<mi>s</mi>
</msup>
<mo>.</mo>
</mrow></math>
in the method, when each co-frequency adjacent cell is subjected to signal reconstruction, the required basic cell information of the current co-frequency adjacent cell, including a basic midamble sequence, a scrambling code, an activated spreading code and the like, is known by a system or is obtained by detection.
Corresponding to the method, the invention also provides a device for eliminating the signal interference of the same-frequency cell based on serial interference cancellation, which comprises a cell received signal recovery unit, a CEIGU based on MF and a cell reconstruction signal removing unit which are connected in sequence;
the cell received signal recovery unit is used for sequentially eliminating the reconstructed signal of the cell in the s-1 level interference elimination process for the current cell and M same-frequency adjacent cells
And residual signals after removing interference signals of all previous cells in the s-th-stage interference elimination process
Superposing and sequentially recovering the received signals of all cells
Wherein S is 1, 2, …, S, and S represents the number of successive interference cancellation stages set by the system; j is 1, 2, …, M + 1.
When s is 1, i.e. the power DP performs the first stage interference cancellation, the reconstructed signal of the cell is set to 0.
When j is 1, that is, the power DP performs interference cancellation in the first cell, then the residual signal after removing the interference signals of all the previous cells in the interference cancellation process is 0.
The MF-based CEIGU is used for inputting samples according to the I/Q paths of the current received data
Interference cancellation with the s-1 st stageAnd the sum of the signals is processed by adopting a processing method for reconstructing cell signals based on demodulation symbols generated by MF to sequentially and serially complete the reconstruction of the received signals of each cell to obtain the reconstructed signal of each cell at the s-th level:
<math><mrow>
<msubsup>
<mover>
<mi>x</mi>
<mo>^</mo>
</mover>
<mi>j</mi>
<mi>s</mi>
</msubsup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>,</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mi>s</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>,</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
<mi>s</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>,</mo>
<mi>Z</mi>
<mo>)</mo>
</mrow>
<mi>s</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
where S is 1, 2, …, S, j is 1, 2, …, M +1, and Z is the length of the sample sequence.
The CEIGU based on MF comprises an effective path separation device, a channel impulse response device, a demodulation symbol generation device based on a matched filter and a cell signal reconstruction device which are connected through circuits;
the cell reconstruction signal removing unit is used for sequentially removing the reconstruction signal of each cell in the s-th level interference elimination process
From input signals
The s-th residual signal after the interference of the cell is removed is obtained
Wherein S is 1, 2, …, S, j is 1, 2, …, M + 1.
The effective path separation device comprises a first matched filter and an effective path detector which are connected in sequence;
the input of the first matched filter receives the last 128 chip data BM ═ m (m) of the midamble sequence in the input signal1,m2,…,m128) Basic midamble sequence with current cellCarrying out bit-by-bit cyclic XOR operation, and calculating the power of each bit-by-bit XOR result:
<math><mrow>
<msub>
<mi>DP</mi>
<mi>k</mi>
</msub>
<mo>=</mo>
<munderover>
<mi>Σ</mi>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mn>128</mn>
</munderover>
<mo>|</mo>
<mo>|</mo>
<msubsup>
<mi>r</mi>
<mi>n</mi>
<mi>BM</mi>
</msubsup>
<mo>*</mo>
<msub>
<mi>m</mi>
<mrow>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>-</mo>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mi>mod</mi>
<mn>128</mn>
</mrow>
</msub>
<mo>|</mo>
<mo>|</mo>
<mo>;</mo>
</mrow></math>
the effective path detector compares the power DP value of each path output by the first matched filter with a specific threshold Th; selecting a path corresponding to the power DP greater than or equal to the threshold Th as an effective path, otherwise, selecting an invalid path; the L effective paths detected by the final effective path detector are: peff=(p1,p2,…,pL)。
The channel impulse response device comprises a second matched filter, a channel estimator and a channel impulse response device which are connected in sequence;
the input of the second matched filter receives the last 128 chip data BM ═ m (m) of the midamble sequence in the input signal
1,m
2,…,m
128) Combining the basic midamble sequence of the current cell
The channel estimation ChE on each path is calculated by the channel estimator as:
<math><mrow>
<msub>
<mi>ChE</mi>
<mi>k</mi>
</msub>
<mo>=</mo>
<munderover>
<mi>Σ</mi>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mn>128</mn>
</munderover>
<msubsup>
<mi>r</mi>
<mi>n</mi>
<mi>BM</mi>
</msubsup>
<mo>*</mo>
<msub>
<mi>m</mi>
<mrow>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>-</mo>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mi>mod</mi>
<mn>128</mn>
</mrow>
</msub>
<mo>;</mo>
</mrow></math>
the input end of the channel impulse responder is also connected with the output end of the effective path detector; the channel impulse response device generates the channel impulse response H ═ (H) according to the effective path and the channel estimation1,h2,…,hT):
<math><mrow>
<msub>
<mi>h</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<mfenced open='{' close=''>
<mtable>
<mtr>
<mtd>
<msub>
<mi>ChE</mi>
<mi>i</mi>
</msub>
</mtd>
<mtd>
<msub>
<mi>DP</mi>
<mi>i</mi>
</msub>
<mo>≥</mo>
<mi>Th</mi>
</mtd>
</mtr>
<mtr>
<mtd>
<mn>0</mn>
</mtd>
<mtd>
<msub>
<mi>DP</mi>
<mi>i</mi>
</msub>
<mo><</mo>
<mi>Th</mi>
</mtd>
</mtr>
</mtable>
</mfenced>
</mrow></math>
DPiIndicating the power of the ith path, ChEiA channel estimation value representing an ith path;
wherein, the length T of the channel impulse response represents the maximum time delay supported by the system.
The demodulation symbol generating device based on the matched filter comprises a third matched filter, a maximum ratio combiner and a symbol decision device which are connected in sequence;
the input of the third matched filter receives the data part of the input signal and is connected with the effective path detector, and the third matched filter is based on the position P of the effective path, the scrambling code ScC of the current cell and the activated spreading code ChC ═ C (C)
1,C
2,…,C
N),
Wherein N represents the number of active code channels and SF represents the spreading factor for the data portion of the input signal
Descrambling and despreading operations are carried out, and symbols obtained after descrambling and despreading are as follows:
<math><mrow>
<mi>U</mi>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
</msup>
<mo>,</mo>
<msup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
</msup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mi>N</mi>
</msup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mi>L</mi>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msubsup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mi>l</mi>
<mi>n</mi>
</msubsup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>u</mi>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>,</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>u</mi>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>,</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>u</mi>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>,</mo>
<mi>K</mi>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msubsup>
<mi>u</mi>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>,</mo>
<mi>k</mi>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msubsup>
<mo>=</mo>
<munderover>
<mi>Σ</mi>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>SF</mi>
</munderover>
<msub>
<mi>r</mi>
<mrow>
<msub>
<mi>p</mi>
<mi>k</mi>
</msub>
<mo>+</mo>
<mrow>
<mo>(</mo>
<mi>k</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>·</mo>
<mi>SF</mi>
<mo>+</mo>
<mi>i</mi>
</mrow>
</msub>
<mo>×</mo>
<mi>conj</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>c</mi>
<mi>i</mi>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>×</mo>
<mi>conj</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>ScC</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
wherein,
indicating the symbol corresponding to the nth active code channel,
representing symbols on the l effective path of the nth active code channel, K representing the number of symbols, u
(l,j) nSymbol representing the nth active code channel of the kth symbol of the ith active path, ScC
iA scrambling code representing the ith chip;
the input end of the maximal ratio combiner is also connected with a channel impulse responder, and the maximal ratio combiner carries out maximal ratio combining operation on the descrambled and despread symbols on different paths output by the third matched filter according to the channel impulse response H, namely the channel estimation on an effective path, so as to obtain the demodulated symbol on each active code channel:
<math><mrow>
<mi>Y</mi>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msup>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
</msup>
<mo>,</mo>
<msup>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
</msup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msup>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mi>N</mi>
</msup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msup>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>y</mi>
<mn>1</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>y</mi>
<mn>2</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>y</mi>
<mi>K</mi>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msubsup>
<mi>y</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo>=</mo>
<munderover>
<mi>Σ</mi>
<mrow>
<mi>l</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>L</mi>
</munderover>
<mi>conj</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>ChE</mi>
<mi>l</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>×</mo>
<msubsup>
<mi>u</mi>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>,</mo>
<mi>k</mi>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msubsup>
<mo>;</mo>
</mrow></math>
wherein,
indicates the demodulation symbol, u, corresponding to the nth active code channel
(l,k) nA symbol representing the nth active code channel of the kth symbol of the ith active path;
the symbol decision device carries out symbol decision on the demodulation symbol output by the maximal ratio combiner to obtain an estimation value of a sending symbol:
<math><mrow>
<mi>D</mi>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msup>
<mover>
<mi>d</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
</msup>
<mo>,</mo>
<msup>
<mover>
<mi>d</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
</msup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msup>
<mover>
<mi>d</mi>
<mo>^</mo>
</mover>
<mi>N</mi>
</msup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msup>
<mover>
<mi>d</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>d</mi>
<mn>1</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>d</mi>
<mn>2</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>d</mi>
<mi>K</mi>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
wherein
And the judgment result of the demodulation symbol corresponding to the nth active code channel is shown.
The symbol decision device is a demodulation symbol hard decision device, and the hard decision result obtained by adopting the demodulation symbol hard decision device is as follows:
<math><mrow>
<msubsup>
<mi>d</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo>=</mo>
<mi>sign</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>y</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open='{' close=''>
<mtable>
<mtr>
<mtd>
<mn>1</mn>
</mtd>
<mtd>
<msubsup>
<mi>y</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo>≥</mo>
<mn>0</mn>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>-</mo>
<mn>1</mn>
</mtd>
<mtd>
<msubsup>
<mi>y</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo><</mo>
<mn>0</mn>
</mtd>
</mtr>
</mtable>
</mfenced>
</mrow></math>
yk na demodulated symbol representing a kth symbol of an nth active code channel;
the symbol decision device is a demodulation symbol soft decision device, and the soft decision result obtained by adopting the demodulation symbol soft decision device is as follows:
<math><mrow>
<msubsup>
<mi>d</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo>=</mo>
<mi>tanh</mi>
<mrow>
<mo>(</mo>
<mfrac>
<mrow>
<mi>m</mi>
<mo>·</mo>
<msubsup>
<mi>y</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
</mrow>
<msup>
<mi>σ</mi>
<mn>2</mn>
</msup>
</mfrac>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
where m represents the mean value of the received signal amplitude, σ2Representing the noise variance of the received signal and tanh representing the hyperbolic tangent function.
The cell signal reconstruction device comprises a modulation frequency spreader, N convolvers and an active code channel signal superimposer which are connected in sequence;
the modulation frequency spreader is based on the scrambling code ScC adopted by the current cell and the spreading code ChC ═ C (C) on the active code channel
1,C
2,…,C
N),
The device outputs the judgment result of the symbol judger according to SIC series S preset by the system and the residual signal of each cell after interference elimination calculated by the last SIC series
And for each SIC stage, repeatedly executing the operation of eliminating the signal interference of the cells with the same frequency until the SIC operation of all stages is completed.
FIG. 2 is a schematic structural diagram of eliminating co-channel interference by a serial interference cancellation method according to the present invention;
<math><mrow>
<msup>
<mover>
<mi>w</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>w</mi>
<mn>1</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>w</mi>
<mn>2</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>w</mi>
<mrow>
<mi>K</mi>
<mo>×</mo>
<mi>SF</mi>
</mrow>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msup>
<mover>
<mi>w</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mi>H</mi>
<mo>⊗</mo>
<msup>
<mover>
<mi>v</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>;</mo>
</mrow></math> the method and the device for eliminating the signal interference of the common-frequency cell based on the serial interference cancellation can eliminate the influence of the signal of the common-frequency cell to a great extent with lower implementation complexity, particularly under the severe condition that the power of the common-frequency adjacent cell is higher than that of the cell, and improve the receiving performance of the signal of the cell.
Wherein,
representing the reconstructed signal on the nth code channel;
the activation code channel signal superimposer superimposes the reconstruction signal on each activation code channel to complete the combination of the activation code channels, thereby completing the reconstruction of the cell signal and obtaining the reconstruction of the cellForm signal
<math><mrow>
<msup>
<mover>
<mi>x</mi>
<mo>^</mo>
</mover>
<mi>s</mi>
</msup>
<mo>=</mo>
<munderover>
<mi>Σ</mi>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</munderover>
<msup>
<mover>
<mi>w</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
</mrow></math>
Representing the reconstructed signal on the nth code channel.
Furthermore, the cell signal reconstruction device also comprises a weighting multiplier, the input end of the weighting multiplier is connected with the output end of the active code channel signal superimposer, and the weighting multiplier is used for reconstructing the cell reconstruction signal output by the active code channel signal superimposerMultiplication by a particular weighting factor psPerformance loss due to incorrect symbol decisions is reduced:
<math><mrow>
<msup>
<mover>
<mi>x</mi>
<mo>^</mo>
</mover>
<mi>s</mi>
</msup>
<mo>=</mo>
<msup>
<mover>
<mi>x</mi>
<mo>^</mo>
</mover>
<mi>s</mi>
</msup>
<mo>×</mo>
<msup>
<mi>ρ</mi>
<mi>s</mi>
</msup>
<mo>.</mo>
</mrow></math>
Detailed Description
The invention is described in detail below with reference to fig. 2 to 3 by way of preferred embodiments.
Taking serial interference cancellation of a time slot of TD-SCDMA as an example, assume that the received signal of the time slot is
Wherein r is
1~r
352A received signal, r, representing a DATA segment DATA1
113 BM,r
114 BM,…,r
128 BM,r
1 BM,…r
128 BMRepresenting the received midamble sequence signal, r
353~r
704Representing the received signal of the
DATA segment DATA 2.
Step 1.1, aiming at each cell, carrying out bit-by-bit cyclic exclusive or operation on the data of the last 128 chips of the Midamble code part in the input signal and the Basic Midamble code of the cell respectively through a matched filter 410_1, and calculating power DP;
as shown in fig. 3, a schematic structural diagram of a CEIGU based on demodulation results of a matched filter provided in the present invention is that chip-level data on each active code channel of a cell is obtained from demodulation results of the matched filter, and then reconstruction of received signals of each code channel is completed by convolution with a channel impulse response, where the specific operation steps are as follows:
step 1, effective path separation:
step 1.1, aiming at each cell, carrying out bit-by-bit cyclic exclusive or operation on the data of the last 128 chips of the Midamble code part in the input signal and the Basic Midamble code of the cell respectively through a matched filter 410_1, and calculating DP;
let BM ═ m be the basic midamble sequence of the current cell
1,m
2,…,m
128) The data of the last 128 chips of the midamble sequence portion in the received input signal is
The calculation formula of the power DP on each path is:
<math><mrow>
<msub>
<mi>DP</mi>
<mi>k</mi>
</msub>
<mo>=</mo>
<munderover>
<mi>Σ</mi>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mn>128</mn>
</munderover>
<mo>|</mo>
<mo>|</mo>
<msubsup>
<mi>r</mi>
<mi>n</mi>
<mi>BM</mi>
</msubsup>
<mo>*</mo>
<msub>
<mi>m</mi>
<mrow>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>-</mo>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mi>mod</mi>
<mn>128</mn>
</mrow>
</msub>
<mo>|</mo>
<mo>|</mo>
<mo>;</mo>
</mrow></math>
step 1.2, the active path is detected by the active path detector 490 connected to the matched filter 410_ 1:
the power DP on each path is compared with a specific threshold ThComparing; selecting a path corresponding to the power DP greater than or equal to the threshold Th as an effective path, otherwise, selecting an invalid path; the L effective paths detected by the final effective path detector are: peff=(p1,p2,…,pL);
Step 2, generating channel impulse response:
step 2.1, computing ChE on each path through the matched filter 410_2 and the channel estimator 480 which are connected in sequence:
let BM ═ m be the basic midamble sequence of the current cell
1,m
2,…,m
128) The data of the last 128 chips of the midamble sequence portion in the received input signal is
The channel estimate ChE on each path is then:
<math><mrow>
<msub>
<mi>ChE</mi>
<mi>k</mi>
</msub>
<mo>=</mo>
<munderover>
<mi>Σ</mi>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mn>128</mn>
</munderover>
<msubsup>
<mi>r</mi>
<mi>n</mi>
<mi>BM</mi>
</msubsup>
<mo>*</mo>
<msub>
<mi>m</mi>
<mrow>
<mrow>
<mo>(</mo>
<mi>n</mi>
<mo>-</mo>
<mi>k</mi>
<mo>+</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mi>mod</mi>
<mn>128</mn>
</mrow>
</msub>
<mo>;</mo>
</mrow></math>
step 2.2, the channel impulse response H ═ (H) is generated by the channel impulse response device 4701,h2,…,hT):
The channel impulse responder 470 is connected to the effective path detector 490 and the channel estimation, respectivelyThe output of the device 480 generates a channel impulse response H ═ (H) according to the effective path and the channel estimation respectively output1,h2,…,hT) The length T represents the maximum delay supported by the system, the value at the position of the effective path of the channel impulse response is the channel estimation value on the path, and the value at the position of the non-effective path is zero, that is:
<math><mrow>
<msub>
<mi>h</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<mfenced open='{' close=''>
<mtable>
<mtr>
<mtd>
<msub>
<mi>ChE</mi>
<mi>i</mi>
</msub>
</mtd>
<mtd>
<msub>
<mi>DP</mi>
<mi>i</mi>
</msub>
<mo>≥</mo>
<mi>Th</mi>
</mtd>
</mtr>
<mtr>
<mtd>
<mn>0</mn>
</mtd>
<mtd>
<msub>
<mi>DP</mi>
<mi>i</mi>
</msub>
<mo><</mo>
<mi>Th</mi>
</mtd>
</mtr>
</mtable>
</mfenced>
</mrow></math>
DPiindicating the power of the ith path, ChEiA channel estimation value representing an ith path;
step 3, generating a demodulation symbol based on the matched filter;
step 3.1, the matched filter 410_3 descrambles and despreads the data part in the input signal:
the input of the matched filter 410_3 is further connected to an effective path detector 490, which outputs the position P of the effective path, the scrambling code ScC of the current cell and the activated spreading code ChC ═ C (C)
1,C
2,…,C
N),
Where N represents the number of active code channels, SF represents the spreading factor, and matched filter 410_3 pairs the data portions of the input signal
Descrambling and despreading operations are carried out, and symbols obtained after descrambling and despreading are as follows:
<math><mrow>
<mi>U</mi>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
</msup>
<mo>,</mo>
<msup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
</msup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mi>N</mi>
</msup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mi>L</mi>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msubsup>
<mover>
<mi>u</mi>
<mo>^</mo>
</mover>
<mi>l</mi>
<mi>n</mi>
</msubsup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>u</mi>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>,</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>u</mi>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>,</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>u</mi>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>,</mo>
<mi>K</mi>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msubsup>
<mi>u</mi>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>,</mo>
<mi>k</mi>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msubsup>
<mo>=</mo>
<munderover>
<mi>Σ</mi>
<mrow>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>SF</mi>
</munderover>
<msub>
<mi>r</mi>
<mrow>
<msub>
<mi>p</mi>
<mi>k</mi>
</msub>
<mo>+</mo>
<mrow>
<mo>(</mo>
<mi>k</mi>
<mo>-</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mo>·</mo>
<mi>SF</mi>
<mo>+</mo>
<mi>i</mi>
</mrow>
</msub>
<mo>×</mo>
<mi>conj</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>c</mi>
<mi>i</mi>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>×</mo>
<mi>conj</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>ScC</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
wherein,indicating the symbol corresponding to the nth active code channel,representing symbols on the l effective path of the nth active code channel, K representing the number of symbols, u(l,k) nA symbol representing the nth active code channel of the kth symbol of the ith active path;
step 3.2, maximum ratio combiner 420 performs maximum ratio combining on the descrambled and despread symbols to obtain demodulated symbols:
the input end of the maximal ratio combiner 420 is connected to the matched filter 410_3 and the channel impulse responder 470, respectively, and according to the channel impulse response, i.e. the channel estimation on the effective path, the maximal ratio combiner 420 performs the maximal ratio combining operation on the descrambled and despread symbols on different paths to obtain the demodulated symbol on each active code channel:
<math><mrow>
<mi>Y</mi>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msup>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
</msup>
<mo>,</mo>
<msup>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
</msup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msup>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mi>N</mi>
</msup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msup>
<mover>
<mi>y</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>y</mi>
<mn>1</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>y</mi>
<mn>2</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>y</mi>
<mi>K</mi>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msubsup>
<mi>y</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo>=</mo>
<munderover>
<mi>Σ</mi>
<mrow>
<mi>l</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>L</mi>
</munderover>
<mi>conj</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>ChE</mi>
<mi>l</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>×</mo>
<msubsup>
<mi>u</mi>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>,</mo>
<mi>k</mi>
<mo>)</mo>
</mrow>
<mi>n</mi>
</msubsup>
<mo>;</mo>
</mrow></math>
wherein,indicating the demodulated symbol, ChE, corresponding to the nth active code channeliA channel estimation value representing an ith path;
step 3.3, the symbol decision device 430 connected to the output end of the maximal ratio combiner 420 performs symbol decision on the demodulated symbol to obtain an estimated value of the transmitted symbol:
<math><mrow>
<mi>D</mi>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msup>
<mover>
<mi>d</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
</msup>
<mo>,</mo>
<msup>
<mover>
<mi>d</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
</msup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msup>
<mover>
<mi>d</mi>
<mo>^</mo>
</mover>
<mi>N</mi>
</msup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msup>
<mover>
<mi>d</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>d</mi>
<mn>1</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>d</mi>
<mn>2</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>d</mi>
<mi>K</mi>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
whereinAnd the judgment result of the demodulation symbol corresponding to the nth active code channel is shown.
In step 3.3, the symbol decision includes a hard decision and a soft decision, and the symbol decision device 430 may be a demodulation symbol hard decision device or a demodulation symbol soft decision device;
the hard decision is operated by a demodulation symbol hard decision device, and the result after the hard decision is obtained is as follows:
<math><mrow>
<msubsup>
<mi>d</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo>=</mo>
<mi>sign</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>y</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open='{' close=''>
<mtable>
<mtr>
<mtd>
<mn>1</mn>
</mtd>
<mtd>
<msubsup>
<mi>y</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo>≥</mo>
<mn>0</mn>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>-</mo>
<mn>1</mn>
</mtd>
<mtd>
<msubsup>
<mi>y</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo><</mo>
<mn>0</mn>
</mtd>
</mtr>
</mtable>
</mfenced>
</mrow></math>
yk na demodulated symbol representing a kth symbol of an nth active code channel;
the soft decision is operated by a demodulation symbol soft decision device, and the result after the soft decision is obtained is as follows:
<math><mrow>
<msubsup>
<mi>d</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
<mo>=</mo>
<mi>tanh</mi>
<mrow>
<mo>(</mo>
<mfrac>
<mrow>
<mi>m</mi>
<mo>·</mo>
<msubsup>
<mi>y</mi>
<mi>k</mi>
<mi>n</mi>
</msubsup>
</mrow>
<msup>
<mi>σ</mi>
<mn>2</mn>
</msup>
</mfrac>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
where m represents the mean value of the received signal amplitude, σ2Representing the noise variance of the received signal and tanh representing the hyperbolic tangent function.
Step 4, reconstructing cell signals:
step 4.1, the modulation spreader 440 performs modulation spreading operation on the result of symbol decision to obtain the chip sequence on the active code channel:
the input end of the modulation spreader 440 is connected to a symbol decider 430, which is configured to determine (C) the spreading code ChC on the active code channel according to the scrambling code ScC adopted by the current cell1,C2,…,CN), The decision result output by the symbol decision device 430 is modulated and spread to obtain the chip-level transmit signal estimation value on each active code channel:
<math><mrow>
<mi>V</mi>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msup>
<mover>
<mi>v</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
</msup>
<mo>,</mo>
<msup>
<mover>
<mi>v</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
</msup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msup>
<mover>
<mi>v</mi>
<mo>^</mo>
</mover>
<mi>N</mi>
</msup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msup>
<mover>
<mi>v</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>v</mi>
<mn>1</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>v</mi>
<mn>2</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>v</mi>
<mrow>
<mi>K</mi>
<mo>×</mo>
<mi>SF</mi>
</mrow>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
whereinA transmitted signal estimate representing the chip level on the nth active code channel;
step 4.2, the N convolvers 460 correspondingly complete the reconstruction of the received signal on the active code channel:
the input end of the N convolvers 460 is connected to the modulation spreader 440 and the channel impulse responder 470, respectively, and performs convolution operation on the output chip sequence and the channel impulse response on each active code channel to obtain a reconstructed signal on each active code channel:
<math><mrow>
<mi>W</mi>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msup>
<mover>
<mi>w</mi>
<mo>^</mo>
</mover>
<mn>1</mn>
</msup>
<mo>,</mo>
<msup>
<mover>
<mi>w</mi>
<mo>^</mo>
</mover>
<mn>2</mn>
</msup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msup>
<mover>
<mi>w</mi>
<mo>^</mo>
</mover>
<mi>N</mi>
</msup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msup>
<mover>
<mi>w</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>w</mi>
<mn>1</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>w</mi>
<mn>2</mn>
<mi>n</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>w</mi>
<mrow>
<mi>K</mi>
<mo>×</mo>
<mi>SF</mi>
</mrow>
<mi>n</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
<math><mrow>
<msup>
<mover>
<mi>w</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>=</mo>
<mi>H</mi>
<mo>⊗</mo>
<msup>
<mover>
<mi>v</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
<mo>;</mo>
</mrow></math>
wherein,
representing the reconstructed signal on the nth code channel;
step 4.3, the activation code channel signal superimposer 450 connected with the N convolvers 460 superimposes the reconstruction signal on each activation code channel to complete the combination of the activation code channels, thereby completing the reconstruction of the cell signal and obtaining the reconstruction signal of the cell
<math><mrow>
<msup>
<mover>
<mi>x</mi>
<mo>^</mo>
</mover>
<mi>s</mi>
</msup>
<mo>=</mo>
<munderover>
<mi>Σ</mi>
<mrow>
<mi>n</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>N</mi>
</munderover>
<msup>
<mover>
<mi>w</mi>
<mo>^</mo>
</mover>
<mi>n</mi>
</msup>
</mrow></math>
Representing the reconstructed signal on the nth code channel;
step 4.4, reconstruction signal weighting: reconstructing the signal of the cell
Multiplication by a particular weighting factor p
sPerformance loss due to incorrect symbol decisions is reduced:
<math><mrow>
<msup>
<mover>
<mi>x</mi>
<mo>^</mo>
</mover>
<mi>s</mi>
</msup>
<mo>=</mo>
<msup>
<mover>
<mi>x</mi>
<mo>^</mo>
</mover>
<mi>s</mi>
</msup>
<mo>×</mo>
<msup>
<mi>ρ</mi>
<mi>s</mi>
</msup>
<mo>.</mo>
</mrow></math>
as shown in fig. 2, a schematic structural diagram of eliminating co-channel interference by using a serial interference cancellation method, the core idea of which is to serially reconstruct signals of each co-channel cell and complete interference signal elimination based on the serial reconstruction, the specific steps are as follows:
setting M same-frequency adjacent cells for the current cell; the current received data I/Q way sampling input isWherein, N is the length of the sampling sequence; the number of series interference cancellation stages set by the system is S;
step 1, for each cell, the cell received
signal recovery unit 320 eliminates the reconstructed signal of the cell in the s-1 th level interference elimination process
And residual signals after removing interference signals of all previous cells in the s-th-stage interference elimination process
Superposing and recovering the received signal of the cell
Wherein S is 1, 2, …, S, j is 1, 2, …, M + 1;
in step 1, each cell multiplexes the cell received signal recovery unit 320;
in step 1, if the first-stage interference cancellation is performed, that is, if s is 1, the reconstructed signal of the cell is set to 0; if the cell is the first cell to perform interference cancellation, that is, j is 1, then the residual signal after removing the interference signals of all the previous cells in the interference cancellation process is 0;
step 2, the MF-based CEIGU 400 receives the signals of the s-th-level cells obtained in step 1According to the processing method for reconstructing cell signals based on the demodulated symbols generated by the MF as shown in fig. 3, the reconstruction of the received signals of each cell is correspondingly and serially completed, and a reconstructed signal of each cell at the s-th level is obtained:
<math><mrow>
<msubsup>
<mover>
<mi>x</mi>
<mo>^</mo>
</mover>
<mi>j</mi>
<mi>s</mi>
</msubsup>
<mo>=</mo>
<mrow>
<mo>(</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>,</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
<mi>s</mi>
</msubsup>
<mo>,</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>,</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
<mi>s</mi>
</msubsup>
<mo>,</mo>
<mo>·</mo>
<mo>·</mo>
<mo>·</mo>
<mo>,</mo>
<msubsup>
<mi>x</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>,</mo>
<mi>N</mi>
<mo>)</mo>
</mrow>
<mi>s</mi>
</msubsup>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow></math>
wherein S is 1, 2, …, S, j is 1, 2, …, M + 1;
in the step 2, each cell reuses the CEIGU to complete interference signal reconstruction;
step 3, for each cell, the cell reconstruction
signal removing unit 330 removes the reconstruction signal of the cell from the input signal in the interference elimination process to obtain a residual signal after the interference of the cell is removed; namely, the cell reconstruction
signal removing unit 330 removes the reconstruction signal of the cell in the s-th interference elimination process
From input signals
The s-th residual signal after the interference of the cell is removed is obtained
Wherein S is 1, 2, …, S, j is 1, 2, …, M + 1;
in step 3, each cell multiplexes the cell reconstruction signal removing unit 330.
And 4, repeatedly executing the steps 1-3 according to the SIC series S preset by the system until SIC operation of all stages is completed.
In the method, when each co-frequency adjacent cell is subjected to signal reconstruction, the required basic cell information of the current co-frequency adjacent cell, including a basic midamble sequence, a scrambling code, an activated spreading code and the like, is known by a system or is obtained by detection.
It is obvious and understood by those skilled in the art that the preferred embodiments of the present invention are only for illustrating the present invention and not for limiting the present invention, and the technical features of the embodiments of the present invention can be arbitrarily combined without departing from the idea of the present invention. The method and the device for eliminating the signal interference of the co-channel cells based on the serial interference cancellation disclosed by the invention can be modified in many ways, and the invention can also have other embodiments besides the preferred modes specifically given above. Therefore, any method or improvement that can be made by the idea of the present invention is included in the scope of the claims of the present invention. The scope of the invention is defined by the appended claims.