CN1949684B - Method and apparatus for eliminating common-frequency cell signal interference based on parallel interference cancellation - Google Patents

Method and apparatus for eliminating common-frequency cell signal interference based on parallel interference cancellation Download PDF

Info

Publication number
CN1949684B
CN1949684B CN2006101179156A CN200610117915A CN1949684B CN 1949684 B CN1949684 B CN 1949684B CN 2006101179156 A CN2006101179156 A CN 2006101179156A CN 200610117915 A CN200610117915 A CN 200610117915A CN 1949684 B CN1949684 B CN 1949684B
Authority
CN
China
Prior art keywords
signal
cell
channel
interference
symbol
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN2006101179156A
Other languages
Chinese (zh)
Other versions
CN1949684A (en
Inventor
单鸣
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
SHANGHAI XUANPU INDUSTRIAL Co Ltd
Original Assignee
SHANGHAI XUANPU INDUSTRIAL Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by SHANGHAI XUANPU INDUSTRIAL Co Ltd filed Critical SHANGHAI XUANPU INDUSTRIAL Co Ltd
Priority to CN2006101179156A priority Critical patent/CN1949684B/en
Publication of CN1949684A publication Critical patent/CN1949684A/en
Application granted granted Critical
Publication of CN1949684B publication Critical patent/CN1949684B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Noise Elimination (AREA)

Abstract

The invention provides provides a parallel interference offset-based same-frequency cell signal interference suppressing method and device, for each cell, reconstructing cell interfering signal by the demodulation symbole generated, based on combined detection; superposing the reconstructed signals of the other interference cells; then removing the superposed value from the received signal and suppressing the effect of the adjacent cell interfercne signals on the received signal of the cell; and according to the parallel progression, repeating the above steps. And the invention can suppress the effect of same-frequncy cell signals and improve the signal receving performance of the cell on the mal-condition that the powers of the adjacent same-frequency cells are higher than that of the cell.

Description

Method and device for eliminating signal interference of co-frequency cell based on parallel interference cancellation
Technical Field
The invention relates to a method and a device for eliminating co-channel interference in parallel for a Time Division synchronous code Division Multiple Access (TD-SCDMA) mobile communication system, in particular to a method and a device for eliminating the influence of co-channel interference signals on useful signals to the maximum extent in parallel and improving the receiving performance of a receiver.
Background
In a direct spread spectrum code division multiple access (DS-CDMA) system, because of the code division multiple access technology, there is a possibility that different cells use the same-frequency networking objectively, which means that a certain base station (NodeB) may be interfered by signals of mobile stations (UE) in neighboring cells of the same frequency, or a certain mobile station may be interfered by signals of base stations of multiple same-frequency cells. Due to the different propagation delays of different signals and the existence of scrambling codes, the spreading code sets adopted by the respective signals are not completely orthogonal, and this Interference caused by non-zero cross-correlation coefficient is often called Multiple Access Interference (MAI). In CDMA systems, Matched filters (MF for short) or Multi-user detectors (MUD for short) are usually used to recover data before spreading and scrambling. The traditional Rake receiver can not effectively restrain multiple access interference, and multi-user detection can better eliminate the influence caused by MAI.
The multi-user detection method mainly comprises two methods: linear multi-user detection and non-linear multi-user detection. Since linear multi-user detection (joint detection receiver) needs to complete the operation of system matrix inversion, when the Spreading Factor (SF) adopted by the CDMA system is large, the scrambling code length is long, or the number of interfering users is too large, the dimension of the system matrix will increase, and the operation amount of matrix inversion will become unacceptable. In this case, the nonlinear multi-user detection method (interference cancellation) can achieve better reception performance with lower implementation complexity. The non-linear multi-user detection method is mainly divided into two types: parallel Interference Cancellation (PIC) and Successive Interference Cancellation (SIC). In contrast, the PIC has the advantages of short processing delay, no need of power sequencing of each cell, and the like; and SIC consumes less resources, and has better stability and performance when the signal power difference of each cell is larger.
Fig. 1 is a schematic diagram of a frame structure of a TD-SCDMA system. The structure is given in accordance with the low chip rate time division duplex (LCR-TDD) mode (1.28Mcps) in the 3G partnership project (3GPP) specification TS 25.221(Release 4), or the chinese wireless communication standard (CWTS) specification TSM05.02(Release 3). The chip rate of TD-SCDMA system is 1.28Mcps, and each Radio Frame (Radio Frame)100、101Is 5ms, i.e., 6400 chips (for a 3GPP LCR-TDD system, each radio frame is 10ms in length and can be divided into two subframes (subframes) of 5ms in length, where each Subframe contains 6400 chips). Wherein, each radio frame 10 in TD-SCDMA system (or sub-frame in LCR system)0、101Can be divided into 7 time slots (TS 0-TS 6)110-116And two pilot slots: a downlink pilot time slot (DwPTS)12 and an uplink pilot time slot (UpPTS)14, and a Guard interval (Guard) 13. Further, TS0 time slot 110Is used to carry the system broadcast channel and possibly other downlink traffic channels; and TS 1-TS 6 time slot 111-116It is used to carry the uplink and downlink traffic channels. An uplink pilot time slot (UpPTS)14 and a downlink pilot time slot (DwPTS)12 are used to establish initial uplink and downlink synchronization, respectively. TS 0-TS 6 time slot 110-116Each of 0.675ms or 864 chips in length, which includes two DATA segments DATA1(17) and DATA2(19) of 352 chips in length, and a middle training sequence of 144 chips in length, i.e., Midamble (Midamble) sequence 18. The Midamble sequence has significance in TD-SCDMA, and modules including cell identification, channel estimation and synchronization (including frequency synchronization) and the like are all used. DwPTS timeSlot 12 contains a 32-chip guard interval 20 and a 64-chip length downlink synchronization code (SYNC-DL) codeword 15, which is used for cell identification and initial synchronization establishment; the UpPTS timeslot, in turn, contains an uplink synchronization code (SYNC-UL) codeword 16 of length 128 chips, which is used by the ue to perform the relevant uplink access procedure.
DATA carried by two parts of DATA segments DATA1(17) and DATA2(19) of a TD-SCDMA downlink time slot are spread and wound by using spreading codes and scrambling codes. Under the condition of co-channel interference, because the lengths of Spreading codes (Spreading codes) and scrambling codes (scrambling codes) adopted by the TD-SCDMA system are both relatively short (both are only 16 chips), the cross-correlation characteristics between the Spreading codes and the scrambling codes of different cells are not ideal, and the influence of interference signals of adjacent cells cannot be effectively inhibited by a traditional Rake receiver or a single-cell joint detection device (JD for short), which causes the degradation of the receiving performance of the TD-SCDMA system. In order to obtain higher system capacity for the TD-SCDMA system, it is necessary to improve its receiving performance under co-channel interference. The invention introduces a method of parallel interference cancellation, and effectively improves the receiving performance of the TD-SCDMA system under the same frequency interference condition.
Disclosure of Invention
The invention aims to provide a method and a device for eliminating signal interference of a common-frequency cell based on parallel 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 common-frequency cell based on Parallel Interference Cancellation (PIC), which is characterized in that the cell and each common-frequency adjacent cell respectively and independently adopt a method for reconstructing signals of each cell based on demodulation symbols generated by joint detection, and then carry out interference cancellation in parallel, and the method comprises the following steps:
step 1, for the current bookM +1 Channel Estimation and interference reconstruction units (CEIGU) based on Joint Detection (JD) and M co-frequency neighboring cells, according to sampling input of current received data I/Q path <math><mrow> <mover> <mi>r</mi> <mo>^</mo> </mover> <mi></mi> <mo>=</mo> <mrow> <mo>(</mo> <msub> <mi>r</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>r</mi> <mn>2</mn> </msub> <mo>,</mo> <mi>&Lambda;</mi> <mo>,</mo> <msub> <mi>r</mi> <mi>Z</mi> </msub> <mo>)</mo> </mrow> </mrow></math> Or reconstructing interference signals of M same-frequency adjacent cells and the cell by adopting a processing method for reconstructing cell signals by demodulation symbols generated based on JD (joint detection) to obtain an s-level reconstruction signal of each cell:
<math><mrow> <msubsup> <mover> <mi>x</mi> <mo>^</mo> </mover> <mi>j</mi> <mi>s</mi> </msubsup> <mi></mi> <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> <mi>&Lambda;</mi> <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, and S represents the number of parallel interference cancellation stages set by the system; j ═ 1, 2, Λ, M + 1; z is the length of the sampling sequence;
the step 1 specifically comprises:
step 1.1, separating effective paths;
step 1.2, generating channel impulse response;
step 1.3, generating a demodulation symbol based on joint detection;
and step 1.4, reconstructing a cell signal.
Step 2, for each cell, the cell reconstruction signal superimposer respectively uses the s-th level reconstruction signals of other cells calculated in the step 1And superposing to obtain an interference signal of the s-th level corresponding to each cell:
<math><mrow> <msubsup> <mover> <mi>I</mi> <mo>^</mo> </mover> <mi>j</mi> <mi>s</mi> </msubsup> <mo>=</mo> <mrow> <mo>(</mo> <msubsup> <mi>I</mi> <mrow> <mo>(</mo> <mi>j</mi> <mo>,</mo> <mn>1</mn> <mo>)</mo> </mrow> <mi>s</mi> </msubsup> <mo>,</mo> <msubsup> <mi>I</mi> <mrow> <mo>(</mo> <mi>j</mi> <mo>,</mo> <mn>2</mn> <mo>)</mo> </mrow> <mi>s</mi> </msubsup> <mo>,</mo> <mi>&Lambda;</mi> <mo>,</mo> <msubsup> <mi>I</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 ═ 1, 2, Λ, S, j ═ 1, 2, Λ, M + 1;
3, for each cell, the cell interference signal eliminator removes the signal superposition value generated by the reconstruction of other interference cells in the step 2 from the received signal, namely, the s-th level interference eliminated received signal is calculated
Figure DEST_PATH_GSB00000088219800011
Thereby eliminating the influence of the interference signal of the adjacent cell on the signal received by the cell;
r ^ j s = ( r ( j , 1 ) s , r ( j , 2 ) s , . . . , r ( j , Z ) s ) ;
r ^ ( j , k ) s = r ^ k - I ^ ( j , k ) s ;
wherein S is 1, 2, …, S, j is 1, 2, …, M +1, 1 ≦ k ≦ Z;
and 4, repeatedly executing the steps 1 to 3 according to the PIC level preset by the system and the received signals obtained by calculating the previous PIC level and after the interference of each cell is eliminated until the PIC operation of all levels is completed.
In step 1, if s is 1, namely cell signal reconstruction is performed at the first stage, the M +1 JD-based ceiigus directly adopt sampling inputs of I/Q paths of received dataAnd completing signal reconstruction of each cell.
In step 1, if S is 2, 3, …, S, the M +1 JD-based ceiigus use the S-1 th interference-cancelled signal to complete signal reconstruction of each cell.
The method for reconstructing signals of each cell by using demodulation symbols generated based on joint detection in step 1 specifically includes:
step 1.1, effective path separation:
step 1.1.1, aiming at each cell, respectively carrying out bit-by-bit cyclic exclusive OR operation on the data of the last 128 chips of the midamble sequence part in the input signal and the basic midamble sequence of the cell through a matched filter, and calculating to obtain the power DP of each bit-by-bit exclusive OR result;
let BM ═ m be the basic midamble sequence of the current cell1,m2,…,m128) The data of the last 128 chips of the midamble sequence portion in the received input signal is
Figure DEST_PATH_GSB00000088219800015
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>&Sigma;</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.1.2, detecting an effective path through an effective path detector:
comparing the power DP on each 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 1.2, generating channel impulse response:
step 1.2.1, calculating channel estimation ChE on each path through a matched filter and a channel estimator:
let BM ═ m be the basic midamble sequence of the current cell1,m2,…,m128) The data of the last 128 chips of the midamble sequence portion in the received input signal is
Figure DEST_PATH_GSB00000088219800021
The channel estimate ChE on each path is then:
<math><mrow> <msub> <mi>ChE</mi> <mi>k</mi> </msub> <mo>=</mo> <munderover> <mi>&Sigma;</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 1.2.2, generating a channel impulse response H ═ H (H) by the channel impulse responder according to the effective path obtained in step 1.1.2 and the channel estimation obtained in step 1.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>&GreaterEqual;</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>
ChEiindicating the channel estimate, DP, of the ith pathiRepresents the power of the ith path;
step 1.3, generating demodulation symbols based on joint detection:
step 1.3.1, descrambling and despreading the data part in the input signal by a 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 ═ C1,C2,…,CN),
Figure DEST_PATH_GSB00000088219800024
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
Figure DEST_PATH_GSB00000088219800025
Descrambling and despreading operations are carried out, and symbols obtained after descrambling and despreading are as follows:
U = ( u ^ 1 , u ^ 2 , . . . , u ^ N ) ;
u ^ n = ( u ^ 1 n , u ^ 2 n , . . . , u ^ L n ) ;
u ^ l n = ( u ( l , 1 ) n , u ( l , 2 ) n , . . . , u ( l , K ) n ) ;
<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>&Sigma;</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>&CenterDot;</mo> <mi>SF</mi> <mo>+</mo> <mi>i</mi> </mrow> </msub> <mo>&times;</mo> <mi>conj</mi> <mrow> <mo>(</mo> <msubsup> <mi>c</mi> <mi>i</mi> <mi>n</mi> </msubsup> <mo>)</mo> </mrow> <mo>&times;</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,
Figure DEST_PATH_GSB000000882198000211
indicates the nth activationSymbols on the ith effective path of the 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 1.3.2, maximum ratio merger carries out maximum ratio merger on the symbols obtained after descrambling and despreading to obtain demodulated symbols:
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:
Y = ( y ^ 1 , y ^ 2 , . . . , y ^ N ) ;
y ^ n = ( y 1 n , y 2 n , . . . , y K n ) ;
<math><mrow> <msubsup> <mi>y</mi> <mi>k</mi> <mi>n</mi> </msubsup> <mo>=</mo> <munderover> <mi>&Sigma;</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>&times;</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) nSymbol representing the nth active code channel of the kth symbol of the ith active path, ChEiA channel estimation value representing an ith path;
step 1.3.3, joint detection:
step 1.3.3.1, the System matrix generator convolves the point product result of the scrambling code and the activated spreading code adopted by the current cell with the channel impulse response to generate a System matrix (System ResponseMatrix):
the active spreading code ChC ═ C (C) according to the scrambling code ScC of the current cell generated by the scrambling code generator and the spreading code generator1,C2,…,CN), Where N denotes the number of active code channels and SF denotes the spreading factorAnd calculating a system matrix A by a system matrix generator according to the channel impulse response H obtained in the step 1.1.2:
<math><mrow> <msup> <mi>b</mi> <mi>n</mi> </msup> <mo>=</mo> <mi>H</mi> <mo>&CircleTimes;</mo> <mrow> <mo>(</mo> <mi>ScC</mi> <mo>.</mo> <mo>*</mo> <msub> <mi>C</mi> <mi>n</mi> </msub> <mo>)</mo> </mrow> <mo>;</mo> </mrow></math>
B=[b1,b2,…,bN]T
wherein, the [ alpha ], [ beta ]]TRepresenting matrix transposition, wherein the number of B matrixes in the A matrix is equal to the number of symbols needing joint detection;
step 1.3.3.2, the joint detector performs joint detection operation by adopting Zero-Forcing Block Linear Equalizer algorithm (ZF-BLE for short) or Minimum Mean Square Error Block Linear Equalizer algorithm (MMSE-BLE for short), so as to obtain a demodulation symbol;
by adopting the zero forcing linear block equalizer algorithm, the obtained demodulation symbols are as follows:
<math><mrow> <mover> <mi>d</mi> <mo>^</mo> </mover> <mo>=</mo> <msup> <mrow> <mo>(</mo> <msup> <mi>A</mi> <mi>H</mi> </msup> <mo>&CenterDot;</mo> <mi>A</mi> <mo>)</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>&times;</mo> <msup> <mi>A</mi> <mi>H</mi> </msup> <mo>&CenterDot;</mo> <mover> <mi>r</mi> <mo>^</mo> </mover> <mo>;</mo> </mrow></math>
wherein, A represents a system matrix,represents the input I/Q path signal,indicating the demodulated symbols resulting from the joint detection.
The minimum mean square error linear block equalizer algorithm is adopted, and the obtained demodulation symbols are as follows:
<math><mrow> <mover> <mi>d</mi> <mo>^</mo> </mover> <mo>=</mo> <msup> <mrow> <mo>(</mo> <msup> <mi>A</mi> <mi>H</mi> </msup> <mo>&CenterDot;</mo> <mi>A</mi> <mo>+</mo> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mo>&CenterDot;</mo> <mi>I</mi> <mo>)</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>&times;</mo> <msup> <mi>A</mi> <mi>H</mi> </msup> <mo>&CenterDot;</mo> <mover> <mi>r</mi> <mo>^</mo> </mover> <mo>;</mo> </mrow></math>
wherein, A represents a system matrix,
Figure DEST_PATH_GSB00000088219800045
representing the input I/Q-path signal, σ2Which represents the variance of the noise, is,
Figure DEST_PATH_GSB00000088219800046
indicating the demodulated symbols resulting from the joint detection.
Step 1.3.4, 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:
D = ( d ^ 1 , d ^ 2 , . . . , d ^ N ) ;
d ^ n = ( d 1 n , d 2 n , . . . , d K n ) ;
wherein
Figure DEST_PATH_GSB00000088219800049
Indicates the nth activationAnd judging the demodulation symbol corresponding to the code channel.
In step 1.3.4, 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>&GreaterEqual;</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 the kth symbol of the 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>&CenterDot;</mo> <msubsup> <mi>y</mi> <mi>k</mi> <mi>n</mi> </msubsup> </mrow> <msup> <mi>&sigma;</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, tanh representing the hyperbolic tangent function, yk nA demodulated symbol representing the kth symbol of the nth active code channel.
Step 1.4, reconstructing cell signals:
step 1.4.1, the modulation spreader performs modulation spread spectrum operation on the result of symbol decision to obtain a chip sequence on an 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:
V = ( v ^ 1 , v ^ 2 , . . . , v ^ N ) ;
<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>&times;</mo> <mi>SF</mi> </mrow> <mi>n</mi> </msubsup> <mo>)</mo> </mrow> <mo>;</mo> </mrow></math>
wherein
Figure DEST_PATH_GSB00000088219800052
A transmitted signal estimate representing the chip level on the nth active code channel;
step 1.4.2, correspondingly completing the reconstruction of the received signals on a plurality of active code channels by a plurality of convolvers:
the convolver completes the convolution operation on the chip sequence on each active code channel obtained in step 1.4.1 and the channel impulse response obtained in step 1.2 to obtain a reconstructed signal on each active code channel:
W = ( w ^ 1 , w ^ 2 , . . . , w ^ N ) ;
<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>&times;</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>&CircleTimes;</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 1.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>&Sigma;</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>
Figure DEST_PATH_GSB00000088219800059
Representing the reconstructed signal on the nth code channel;
step 1.4.4, reconstruction signal weighting: reconstructing the signal of the cell
Figure DEST_PATH_GSB000000882198000510
Multiplication 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>&times;</mo> <msup> <mi>&rho;</mi> <mi>s</mi> </msup> <mo>.</mo> </mrow></math>
in step 2, the s-th level interference signal corresponding to each cell includes:
interference signal of the cell:
<math><mrow> <msubsup> <mover> <mi>I</mi> <mo>^</mo> </mover> <mn>1</mn> <mi>s</mi> </msubsup> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>2</mn> </mrow> <mrow> <mi>M</mi> <mo>+</mo> <mn>1</mn> </mrow> </munderover> <msubsup> <mover> <mi>x</mi> <mo>^</mo> </mover> <mi>i</mi> <mi>s</mi> </msubsup> <mo>;</mo> </mrow></math>
and interference signals of M co-frequency adjacent cells;
<math><mrow> <msubsup> <mover> <mi>I</mi> <mo>^</mo> </mover> <mi>j</mi> <mi>s</mi> </msubsup> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <munder> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mrow> <mi>i</mi> <mo>&NotEqual;</mo> <mi>j</mi> <mo>,</mo> <mi>i</mi> <mo>&Element;</mo> <mi>U</mi> </mrow> </munder> <mrow> <mi>M</mi> <mo>+</mo> <mn>1</mn> </mrow> </munderover> <msubsup> <mover> <mi>x</mi> <mo>^</mo> </mover> <mi>i</mi> <mi>s</mi> </msubsup> <mo>;</mo> </mrow></math>
where, S ═ 1, 2, …, S, j denotes the jth co-frequency neighbor cell.
In step 2, when stacking the reconstructed signals of different cells, the delays of the respective cells must be considered at the same time, i.e. the delays of the different cells must be aligned before stacking.
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 cells based on parallel interference cancellation, which comprises M +1 JD-based CEIGUs, an M +1 cell reconstruction signal superimposer and an M +1 cell interference signal eliminator which are connected in sequence;
the M +1 JD-based CEIGUs input the sampling of the current received data I/Q pathOr the signal after the s-1 level interference elimination adopts a processing method for reconstructing the cell signal by using the demodulation symbol generated based on JD to complete the reconstruction of the interference signals of each cell in parallel, wherein the reconstruction comprises M same-frequency adjacent cells and the interference signal of the cell, and the s level reconstruction signal of each cell is obtained:
x ^ j s = ( x ( j , 1 ) s , x ( j , 2 ) s , . . . , x ( j , Z ) s ) ;
wherein S is 1, 2, …, S, and S represents the number of parallel interference cancellation stages set by the system;
j=1,2,…,M,M+1;
z is the length of the sample sequence.
If s is equal to 1, namely, cell signal reconstruction is carried out at the first stage, the M +1 JD-based CEIGUs directly adopt sampling input of an I/Q path of received data
Figure DEST_PATH_GSB00000088219800063
Completing signal reconstruction of each cell;
and if S is 2, 3, …, S, the M +1 JD-based ceiigus use the S-1 th level interference-cancelled signal to complete signal reconstruction of each cell.
The M +1 cell reconstruction signal superimposer respectively and correspondingly superimposes the s-th level reconstruction signals of other cells for each cell
Figure DEST_PATH_GSB00000088219800064
And superposing to obtain an interference signal of the s-th level corresponding to each cell:
I ^ j s = ( I ( j , 1 ) s , I ( j , 2 ) s , . . . , I ( j , Z ) s ) ;
wherein S is 1, 2, …, S, j is 1, 2, …, M + 1.
And the M +1 cell reconstruction signal superimposer aligns the delay of each cell when the superimposer superimposes the reconstruction signals of other cells.
The M +1 cell interference signal eliminator removes the reconstructed signal superposition value of other interference cells from the received signal aiming at each cell, namely the cell and M same-frequency adjacent cells, eliminates the influence of the interference signal of the adjacent cell on the received signal of the cell, and obtains the s-level interference eliminated received signalAnd adopt
Figure DEST_PATH_GSB00000088219800067
And (3) carrying out interference elimination of the next stage, namely the (s + 1) th stage:
r ^ j s = ( r ( j , 1 ) s , r ( j , 2 ) s , . . . , r ( j , Z ) s ) ;
r ^ ( j , k ) s = r ^ k - I ^ ( j , k ) s ;
wherein S is 1, 2, …, S, j is 1, 2, …, M +1, 1 ≦ k ≦ Z.
The JD-based CEIGU comprises an effective path separation device, a channel impulse response device, a demodulation symbol generation device based on joint detection and a cell signal reconstruction device which are connected through circuits;
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 receiving the midamble sequence in the input signalThe last 128 chip data BM ═ (m)1,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>&Sigma;</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 L effective paths detected by the final effective path detector as invalid paths: 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 signal1,m2,…,m128) In conjunction with the current cellBasic midamble sequence of (2)
Figure DEST_PATH_GSB00000088219800075
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>&Sigma;</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>&GreaterEqual;</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 joint detection comprises a third matched filter, a maximum ratio combiner, a joint detection device 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,C2,…,CN), Wherein N represents the number of active code channels and SF represents the spreading factor for the data portion of the input signalDescrambling and despreading operations are carried out, and symbols obtained after descrambling and despreading are as follows:
U = ( u ^ 1 , u ^ 2 , . . . , u ^ N ) ;
u ^ n = ( u ^ 1 n , u ^ 2 n , . . . , u ^ L n ) ;
u ^ l n = ( u ( l , 1 ) n , u ( l , 2 ) n , . . . , u ( l , K ) n ) ;
<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>&Sigma;</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>&CenterDot;</mo> <mi>SF</mi> <mo>+</mo> <mi>i</mi> </mrow> </msub> <mo>&times;</mo> <mi>conj</mi> <mrow> <mo>(</mo> <msubsup> <mi>c</mi> <mi>i</mi> <mi>n</mi> </msubsup> <mo>)</mo> </mrow> <mo>&times;</mo> <mi>conj</mi> <mrow> <mo>(</mo> <msub> <mi>ScC</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo>;</mo> </mrow></math>
wherein,
Figure DEST_PATH_GSB00000088219800087
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;
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, namely the channel estimation on an effective path, so as to obtain the demodulated symbol on each active code channel:
Y = ( y ^ 1 , y ^ 2 , . . . , y ^ N ) ;
y ^ n = ( y 1 n , y 2 n , . . . , y K n ) ;
<math><mrow> <msubsup> <mi>y</mi> <mi>k</mi> <mi>n</mi> </msubsup> <mo>=</mo> <munderover> <mi>&Sigma;</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>&times;</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 channeliIndicating the channel estimate, u, of the ith path(l,k) nA symbol representing the nth active code channel of the kth symbol of the ith active path;
the joint detection device comprises a scrambling code generator, a spread spectrum code generator, a system matrix generator and a joint detector which are connected in sequence;
the scrambling code ScC of the current cell generated by the scrambling code generator and the spreading code generator, and the activated spreading code ChC ═ C1,C2,…,CN), Wherein N represents the number of active code channels and SF represents the spreading factor;
the input end of the system matrix generator is further connected with the output end of the channel impulse responder, and the system matrix A is obtained by calculation according to the scrambling code ScC of the current cell, the activated spreading code ChC and the channel impulse response H generated by the channel impulse responder, wherein the scrambling code ScC and the activated spreading code ChC are generated by the scrambling code generator and the spreading code generator:
<math><mrow> <msup> <mi>b</mi> <mi>n</mi> </msup> <mo>=</mo> <mi>H</mi> <mo>&CircleTimes;</mo> <mrow> <mo>(</mo> <mi>ScC</mi> <mo>.</mo> <mo>*</mo> <msub> <mi>C</mi> <mi>n</mi> </msub> <mo>)</mo> </mrow> <mo>;</mo> </mrow></math>
B=[b1,b2,…,bN]T
Figure DEST_PATH_GSB00000088219800092
wherein, the [ alpha ], [ beta ]]TRepresenting matrix transposition, wherein the number of B matrixes in the A matrix is equal to the number of symbols needing joint detection;
the input end of the joint detector is respectively connected with the system matrix generator and the maximum ratio combiner; adopting zero forcing linear block equalizer algorithm or minimum mean square error linear block equalizer algorithm to carry out joint detection operation to obtain demodulation symbol
The joint detector adopts a zero forcing linear block equalizer algorithm, and the detected demodulated symbols are as follows:
<math><mrow> <mover> <mi>d</mi> <mo>^</mo> </mover> <mo>=</mo> <msup> <mrow> <mo>(</mo> <msup> <mi>A</mi> <mi>H</mi> </msup> <mo>&CenterDot;</mo> <mi>A</mi> <mo>)</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>&times;</mo> <msup> <mi>A</mi> <mi>H</mi> </msup> <mo>&CenterDot;</mo> <mover> <mi>r</mi> <mo>^</mo> </mover> <mo>;</mo> </mrow></math>
wherein, A represents a system matrix,
Figure DEST_PATH_GSB00000088219800095
represents the input I/Q path signal,indicating the demodulated symbols resulting from the joint detection.
The joint detector adopts a minimum mean square error linear block equalizer algorithm, and the detected demodulation symbols are as follows:
<math><mrow> <mover> <mi>d</mi> <mo>^</mo> </mover> <mo>=</mo> <msup> <mrow> <mo>(</mo> <msup> <mi>A</mi> <mi>H</mi> </msup> <mo>&CenterDot;</mo> <mi>A</mi> <mo>+</mo> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mo>&CenterDot;</mo> <mi>I</mi> <mo>)</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>&times;</mo> <msup> <mi>A</mi> <mi>H</mi> </msup> <mo>&CenterDot;</mo> <mover> <mi>r</mi> <mo>^</mo> </mover> <mo>;</mo> </mrow></math>
wherein, A represents a system matrix,
Figure DEST_PATH_GSB00000088219800098
representing the input I/Q-path signal, σ2Which represents the variance of the noise, is,indicating the demodulated symbols resulting from the joint detection.
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:
D = ( d ^ 1 , d ^ 2 , . . . , d ^ N ) ;
d ^ n = ( d 1 n , d 2 n , . . . , d K n ) ;
wherein
Figure DEST_PATH_GSB000000882198000912
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>&GreaterEqual;</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 the kth symbol of the 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>&CenterDot;</mo> <msubsup> <mi>y</mi> <mi>k</mi> <mi>n</mi> </msubsup> </mrow> <msup> <mi>&sigma;</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, tanh representing the hyperbolic tangent function, yk nA demodulated symbol representing the kth symbol of the nth active code channel.
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 channel1,C2,…,CN),
Figure DEST_PATH_GSB00000088219800103
Modulating and spreading the decision result output by the symbol decision device to obtain a chip-level transmission signal estimation value on each active code channel:
V = ( v ^ 1 , v ^ 2 , . . . , v ^ N ) ;
<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>&times;</mo> <mi>SF</mi> </mrow> <mi>n</mi> </msubsup> <mo>)</mo> </mrow> <mo>;</mo> </mrow></math>
wherein
Figure DEST_PATH_GSB00000088219800106
A transmitted signal estimate representing the chip level on the nth active code channel;
the input ends of the N convolvers are also connected with a channel impulse responder, and the convolving operation is completed on the chip sequence on each active code channel output by the modulation frequency spreader and the channel impulse response generated by the channel impulse responder to obtain a reconstructed signal on each active code channel:
W = ( w ^ 1 , w ^ 2 , . . . , w ^ N ) ;
<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>&times;</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>&CircleTimes;</mo> <msup> <mover> <mi>v</mi> <mo>^</mo> </mover> <mi>n</mi> </msup> <mo>;</mo> </mrow></math>
wherein,
Figure DEST_PATH_GSB000000882198001010
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 signal of the cell
Figure DEST_PATH_GSB000000882198001011
<math><mrow> <msup> <mover> <mi>x</mi> <mo>^</mo> </mover> <mi>s</mi> </msup> <mo>=</mo> <munderover> <mi>&Sigma;</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>
Figure DEST_PATH_GSB00000088219800111
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>&times;</mo> <msup> <mi>&rho;</mi> <mi>s</mi> </msup> <mo>.</mo> </mrow></math>
the device calculates the received signal after interference elimination according to the PIC level S preset by the system and the previous PIC level
Figure DEST_PATH_GSB00000088219800114
For each PIC stage, the operation of eliminating the signal interference of the same-frequency cells is repeatedly executed until all stages are finishedThe PIC operates.
The method and the device for eliminating the signal interference of the common-frequency cell based on the parallel 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.
Drawings
FIG. 1 is a frame structure diagram of TD-SCDMA system according to the 3GPP specification in the background art;
FIG. 2 is a schematic structural diagram of the present invention for eliminating co-channel interference by using a parallel interference cancellation method;
fig. 3 is a schematic structural diagram of a CEIGU based on joint detection demodulation results provided in the present invention.
Detailed Description
The invention is described in detail below with reference to fig. 2 to 3 by way of preferred embodiments.
Taking parallel interference cancellation of a time slot of TD-SCDMA as an example, assume that the received signal of the time slot is
Figure DEST_PATH_GSB00000088219800115
Wherein r is1~r352A received signal, r, representing a DATA segment DATA1113 BM,r114 BM,…,r128 BM,r1 BM,…r128 BMRepresenting the received midamble sequence signal, r353~r704Representing the received signal of the DATA segment DATA 2.
As shown in fig. 3, a schematic structural diagram of a CEIGU based on joint detection demodulation results provided by the present invention includes the following specific operation steps:
step 1, effective path separation:
step 1.1, aiming at each cell, respectively carrying out bit-by-bit cyclic exclusive OR operation on the data of the last 128 chips of the midamble sequence part in the input signal and the basic midamble sequence of the cell through a matched filter 410_1, and calculating power DP;
the basic midamble sequence of the current cell is BM ═ (m)1,m2,…,m128) The data of the last 128 chips of the midamble sequence portion in the received input signal isThe calculation formula of the power DP on each path is:
<math><mrow> <msub> <mi>DP</mi> <mi>k</mi> </msub> <mo>=</mo> <munderover> <mi>&Sigma;</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_ 2:
comparing the power DP on each path with a certain threshold Th; selecting a power D equal to or greater than a threshold ThThe path corresponding to the P is an effective path, otherwise, the path is 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 cell1,m2,…,m128) The data of the last 128 chips of the midamble sequence portion in the received input signal is
Figure DEST_PATH_GSB00000088219800123
The channel estimate ChE on each path is then:
<math><mrow> <msub> <mi>ChE</mi> <mi>k</mi> </msub> <mo>=</mo> <munderover> <mi>&Sigma;</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, generating channel impulse response by the channel impulse responder 470:
the channel impulse responder 470 is connected to the outputs of the effective path detector 490 and the channel estimator 480, respectively, and generates a channel impulse response H ═ (H ═ H) according to the effective path and the channel estimation output, respectively1,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>&GreaterEqual;</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,C2,…,CN),
Figure DEST_PATH_GSB00000088219800131
Where N denotes the number of active code channels and SF denotes spreadingFactoring, matched filter 410_3 pairs data portions of an input signalDescrambling and despreading operations are carried out, and symbols obtained after descrambling and despreading are as follows:
U = ( u ^ 1 , u ^ 2 , . . . , u ^ N ) ;
u ^ n = ( u ^ 1 n , u ^ 2 n , . . . , u ^ L n ) ;
u ^ l n = ( u ( l , 1 ) n , u ( l , 2 ) n , . . . , u ( l , K ) n ) ;
<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>&Sigma;</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>&CenterDot;</mo> <mi>SF</mi> <mo>+</mo> <mi>i</mi> </mrow> </msub> <mo>&times;</mo> <mi>conj</mi> <mrow> <mo>(</mo> <msubsup> <mi>c</mi> <mi>i</mi> <mi>n</mi> </msubsup> <mo>)</mo> </mrow> <mo>&times;</mo> <mi>conj</mi> <mrow> <mo>(</mo> <msub> <mi>ScC</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo>;</mo> </mrow></math>
wherein,
Figure DEST_PATH_GSB00000088219800137
indicating the symbol corresponding to the nth active code channel,
Figure DEST_PATH_GSB00000088219800138
the symbol on the l effective path of the nth active code channel is shown, K represents the number of the symbols,a 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:
Y = ( y ^ 1 , y ^ 2 , . . . , y ^ N ) ;
y ^ n = ( y 1 n , y 2 n , . . . , y K n ) ;
<math><mrow> <msubsup> <mi>y</mi> <mi>k</mi> <mi>n</mi> </msubsup> <mo>=</mo> <munderover> <mi>&Sigma;</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>&times;</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) nSymbol representing the nth active code channel of the kth symbol of the ith active pathCode, ChEiA channel estimation value representing an ith path;
step 3.3, joint detection:
step 3.3.1, the system matrix generator 590 performs convolution with the channel impulse response according to the dot product result of the scrambling code generator and the activated spreading code adopted by the current cell, and generates a system matrix:
the input end of the system matrix generator 590 is connected to the scrambling code generator and spreading code generator 580 and the channel impulse responder 470, respectively, and the activated spreading code ChC ═ C (C) is determined according to the scrambling code ScC of the current cell generated by the scrambling code generator and spreading code generator 5801,C2,…,CN), Wherein N represents the number of active code channels, SF represents the spreading factor, and the channel impulse response H generated by the channel impulse response generator 470, and the system matrix a is calculated as:
<math><mrow> <msup> <mi>b</mi> <mi>n</mi> </msup> <mo>=</mo> <mi>H</mi> <mo>&CircleTimes;</mo> <mrow> <mo>(</mo> <mi>ScC</mi> <mo>.</mo> <mo>*</mo> <msub> <mi>C</mi> <mi>n</mi> </msub> <mo>)</mo> </mrow> <mo>;</mo> </mrow></math>
B=[b1,b2,…,bN]T
Figure DEST_PATH_GSB00000088219800143
wherein, the [ alpha ], [ beta ]]TRepresenting matrix transposition, wherein the number of B matrixes in the A matrix is equal to the number of symbols needing joint detection;
step 3.3.2, the joint detector 530 adopts a zero-forcing linear block equalizer algorithm or a minimum mean square error linear block equalizer algorithm to carry out joint detection operation to obtain a demodulation symbol;
the input terminals of the joint detector 530 are respectively connected to the system matrix generator 590 and the maximal ratio combiner 420;
the joint detector 530 uses the zero-chase linear block equalizer algorithm to obtain the demodulated symbols as follows:
<math><mrow> <mover> <mi>d</mi> <mo>^</mo> </mover> <mo>=</mo> <msup> <mrow> <mo>(</mo> <msup> <mi>A</mi> <mi>H</mi> </msup> <mo>&CenterDot;</mo> <mi>A</mi> <mo>)</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>&times;</mo> <msup> <mi>A</mi> <mi>H</mi> </msup> <mo>&CenterDot;</mo> <mover> <mi>r</mi> <mo>^</mo> </mover> <mo>;</mo> </mrow></math>
wherein, A represents a system matrix,represents the input I/Q path signal,indicating the demodulated symbols resulting from the joint detection.
The joint detector 530 uses the minimum mean square error linear block equalizer algorithm to obtain the demodulated symbols as follows:
<math><mrow> <mover> <mi>d</mi> <mo>^</mo> </mover> <mo>=</mo> <msup> <mrow> <mo>(</mo> <msup> <mi>A</mi> <mi>H</mi> </msup> <mo>&CenterDot;</mo> <mi>A</mi> <mo>+</mo> <msup> <mi>&sigma;</mi> <mn>2</mn> </msup> <mo>&CenterDot;</mo> <mi>I</mi> <mo>)</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>&times;</mo> <msup> <mi>A</mi> <mi>H</mi> </msup> <mo>&CenterDot;</mo> <mover> <mi>r</mi> <mo>^</mo> </mover> <mo>;</mo> </mrow></math>
wherein, A represents a system matrix,
Figure DEST_PATH_GSB00000088219800148
representing the input I/Q-path signal, σ2Which represents the variance of the noise, is,
Figure DEST_PATH_GSB00000088219800149
indicating the demodulated symbols resulting from the joint detection.
Step 3.4, symbol decision device 430 performs symbol decision on the demodulated symbol generated by joint detector 530, and obtains the estimated value of the transmitted symbol as:
D = ( d ^ 1 , d ^ 2 , . . . , d ^ N ) ;
d ^ n = ( d 1 n , d 2 n , . . . , d K n ) ;
whereinAnd the judgment result of the demodulation symbol corresponding to the nth active code channel is shown.
In step 3.4, 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>&GreaterEqual;</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 the kth symbol of the 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>&CenterDot;</mo> <msubsup> <mi>y</mi> <mi>k</mi> <mi>n</mi> </msubsup> </mrow> <msup> <mi>&sigma;</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 of the modulation spreader 440 is connected to a symbol decider 430, which is based on the current cell acquisitionScrambling code ScC used, spreading code ChC ═ on active code channel (C)1,C2,…,CN),
Figure DEST_PATH_GSB00000088219800154
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:
V = ( v ^ 1 , v ^ 2 , . . . , v ^ N ) ;
<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>&times;</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 signals on the plurality of active code channels:
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:
W = ( w ^ 1 , w ^ 2 , . . . , w ^ N ) ;
<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>&times;</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>&CircleTimes;</mo> <msup> <mover> <mi>v</mi> <mo>^</mo> </mover> <mi>n</mi> </msup> <mo>;</mo> </mrow></math>
wherein,
Figure DEST_PATH_GSB00000088219800161
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>&Sigma;</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>
Figure DEST_PATH_GSB00000088219800164
Denotes the n-thA reconstructed signal on a code channel;
step 4.4, the weighting multiplier connected with the output end of the activated code channel signal adder 450 weights the cell reconstruction signal: reconstructing the signal of the cell
Figure DEST_PATH_GSB00000088219800165
Multiplication 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>&times;</mo> <msup> <mi>&rho;</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 parallel interference cancellation method, the core idea is to reconstruct signals of each co-channel cell simultaneously and complete interference signal elimination on the basis,
the method comprises the following specific steps:
setting M same-frequency adjacent cells for the current cell; the current received data I/Q way sampling input isWherein Z is the length of the sampling sequence; the number of parallel interference cancellation stages set by the system is S;
step 1, M +1 JD-based ceiigus perform reconstruction of interference signals of M co-frequency neighbor cells and the cell in parallel according to s-1 level interference-eliminated signals and the JD-based demodulation symbol reconstruction cell signal processing method as shown in fig. 3, so as to obtain s-level reconstruction signals of each cell:
x ^ j s = ( x ( j , 1 ) s , x ( j , 2 ) s , . . . , x ( j , Z ) s ) ;
wherein S is 1, 2, …, S, j is 1, 2, …, M + 1.
In the above step 1, if s is 1, that is, if the cell signal is reconstructed in the first stage, the sampling input of the I/Q channel of the received data is directly used
Figure DEST_PATH_GSB00000088219800169
Step 2, for each cell, namely the cell and M same-frequency adjacent cells, the corresponding M +1 cell reconstruction signal superimposer superimposes the s-th level reconstruction signals of other cells calculated in the step 1
Figure DEST_PATH_GSB000000882198001610
And superposing to obtain an interference signal of the s-th level corresponding to each cell:
I ^ j s = ( I ( j , 1 ) s , I ( j , 2 ) s , . . . , I ( j , Z ) s ) .
wherein S is 1, 2, …, S, j is 1, 2, …, M + 1.
In step 2, the s-th level interference signal corresponding to each cell includes:
interference signal of the cell:
<math><mrow> <msubsup> <mover> <mi>I</mi> <mo>^</mo> </mover> <mn>1</mn> <mi>s</mi> </msubsup> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>2</mn> </mrow> <mrow> <mi>M</mi> <mo>+</mo> <mn>1</mn> </mrow> </munderover> <msubsup> <mover> <mi>x</mi> <mo>^</mo> </mover> <mi>i</mi> <mi>s</mi> </msubsup> <mo>;</mo> </mrow></math>
and interference signals of M co-frequency adjacent cells;
<math><mrow> <msubsup> <mover> <mi>I</mi> <mo>^</mo> </mover> <mi>j</mi> <mi>s</mi> </msubsup> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <munder> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mrow> <mi>i</mi> <mo>&NotEqual;</mo> <mi>j</mi> <mo>,</mo> <mi>i</mi> <mo>&Element;</mo> <mi>U</mi> </mrow> </munder> <mrow> <mi>M</mi> <mo>+</mo> <mn>1</mn> </mrow> </munderover> <msubsup> <mover> <mi>x</mi> <mo>^</mo> </mover> <mi>i</mi> <mi>s</mi> </msubsup> <mo>;</mo> </mrow></math>
where, S ═ 1, 2, …, S, j denotes the jth co-frequency neighbor cell.
In step 2, when stacking the reconstructed signals of different cells, the delays of the respective cells must be considered at the same time, i.e. the delays of the different cells must be aligned before stacking.
Step 3, for each cell, namely the cell and M same-frequency adjacent cells, the corresponding M +1 cell interference signal eliminator removes the signal superposition value generated by the reconstruction of other interference cells generated in the step 2 from the received signal, thereby eliminating the influence of the adjacent cell interference signal on the received signal of the cell; namely, the cell interference signal eliminator calculates the receiving signals after the interference elimination of the s-th level respectivelyAnd adoptAnd (3) carrying out interference elimination of the next stage, namely the (s + 1) th stage:
r ^ j s = ( r ( j , 1 ) s , r ( j , 2 ) s , . . . , r ( j , Z ) s ) ;
r ^ ( j , k ) s = r ^ k - I ^ ( j , k ) s ;
wherein S is 1, 2, …, S, j is 1, 2, …, M +1, 1 ≦ k ≦ Z.
And 4, repeatedly executing the steps 1-3 according to the PIC level S preset by the system and the received signal obtained by calculation of the previous PIC level after interference elimination until the PIC operation of all levels 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 parallel 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.

Claims (28)

1. A method for cancelling and eliminating signal interference of a common-frequency cell based on parallel interference is characterized in that a method for reconstructing signals of each cell by a demodulation symbol generated based on joint detection is independently adopted by a cell and each common-frequency adjacent cell respectively, and then interference elimination is carried out in parallel, and comprises the following steps:
step 1, according to the sampling input of the current received data I/Q wayOr after s-1 th order interference cancellationThe signal, M +1 channel estimation and interference reconstruction units (500) based on joint detection adopt the processing method based on demodulation symbol reconstruction cell signals generated by a joint detection device to complete the reconstruction of the interference signals of M same-frequency adjacent cells and the cell in parallel, and obtain the s-level reconstruction signal of each cell:
wherein S is 1, 2, …, S, and S represents the number of parallel interference cancellation stages set by the system; j ═ 1, 2, …, M + 1; z is the length of the sampling sequence;
the step 1 specifically comprises:
step 1.1, separating effective paths;
step 1.1 comprises the following substeps:
step 1.1.1, for each cell, the last 128 chips of the midamble sequence part in the input signal are counted
Figure FSB00000088219700013
The basic midamble sequences BM of the cells are matched to (m) by a matched filter (410_1)1,m2,…,m128) Performing bit-by-bit cyclic exclusive-or operation, and calculating to obtain the power DP of each bit-by-bit exclusive-or result on each path:
Figure FSB00000088219700014
step 1.1.2, detecting the effective path by an effective path detector (490):
comparing the power DP on each 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 the path as an ineffective path; the L valid paths detected by the final valid path detector (490) are: peff=(p1,p2,…,pL);
Step 1.2, generating channel impulse response;
the step 1.2 comprises the following substeps:
step 1.2.1, calculating the channel estimate ChE on each path through a matched filter (410_2) and a channel estimator (480):
the basic midamble sequence according to the current cell is BM ═ (m)1,m2,…,m128) And the data of the last 128 chips of the midamble sequence portion in the received input signal is
Figure FSB00000088219700021
The channel estimate ChE on each path is calculated as:
step 1.2.2, generating a channel impulse response H ═ (H) by the channel impulse responder (470) according to the effective path obtained in step 1.1.2 and the channel estimation obtained in step 1.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:
Figure FSB00000088219700023
DPiindicating the power of the ith path, ChEiA channel estimation value representing an ith path;
step 1.3, generating a demodulation symbol based on joint detection;
the step 1.3 specifically comprises the following steps:
step 1.3.1, descrambling and despreading the data part in the input signal by a matched filter (410_ 3):
according to the position P of the active path, the scrambling code ScC of the current cell and the activated spreading code ChC ═ C1,C2,…,CN),
Figure FSB00000088219700024
Where N represents the number of active code channels and SF represents the spreading factor, a matched filter (410_3) is used to match the data portion of the input signalDescrambling and despreading operations are carried out, and symbols obtained after descrambling and despreading are as follows:
Figure FSB00000088219700027
Figure FSB00000088219700029
wherein,
Figure FSB000000882197000210
indicating the symbol corresponding to the nth active code channel,
Figure FSB000000882197000211
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 1.3.2, maximum ratio combining is carried out on the symbols obtained after descrambling and despreading by a maximum ratio combiner (420) to obtain demodulated symbols:
according to the channel impulse response, namely the channel estimation on the effective path, the maximal ratio combiner (420) carries out the maximal ratio combining operation on the descrambled and despread symbols on different paths to obtain the demodulation symbols on each active code channel:
Figure FSB00000088219700031
Figure FSB00000088219700032
Figure FSB00000088219700033
wherein,
Figure FSB00000088219700034
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;
step 1.3.3, joint detection:
step 1.3.4, the symbol decision device (420) makes symbol decision on the demodulated symbol generated by the joint detector, and the estimated value of the transmitted symbol is obtained as follows:
Figure FSB00000088219700035
Figure FSB00000088219700036
wherein,
Figure FSB00000088219700037
the decision result of the demodulation symbol corresponding to the nth active code channel is shown;
step 1.4, reconstructing a cell signal;
step 1.4 comprises the following substeps:
step 1.4.1, the modulation spreader (440) performs modulation spread spectrum operation on the result of 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), The result of the symbol decision is modulated and spread by a modulation spreader (440) to obtain a chip-level transmit signal estimate on each active code channel:
Figure FSB00000088219700039
whereinA transmitted signal estimate representing the chip level on the nth active code channel;
step 1.4.2, a plurality of convolvers (460) correspondingly complete the reconstruction of the received signals on a plurality of active code channels:
and (3) performing convolution operation on the chip sequence on each active code channel obtained in the step 1.1.4.1 and the channel impulse response obtained in the step 1.2 by using a convolver (460), so as to obtain a reconstructed signal on each active code channel:
Figure FSB00000088219700041
Figure FSB00000088219700043
wherein,
Figure FSB00000088219700044
representing the reconstructed signal on the nth code channel;
step 1.4.3, the activation code channel signal superimposer (450) 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
Figure FSB00000088219700046
Figure FSB00000088219700047
Representing the reconstructed signal on the nth code channel;
step 2, for the local cell and M same-frequency adjacent cells, the reconstructed signal superimposer (230) of the cell respectively uses the reconstructed signals of the s-th level of other cells calculated in the step 1And superposing to obtain an interference signal of the s-th level corresponding to each cell:
Figure FSB00000088219700049
wherein S is 1, 2, …, S, j is 1, 2, …, M + 1;
the interference signal to the s-th level of the cell is:
wherein S is 1, 2, …, S;
the interference signals of the s-th level for the M co-frequency neighbor cells are as follows:
wherein, S is 1, 2, …, S, j represents the jth co-frequency neighbor cell;
in step 2, when the reconstruction signals of different cells are superposed, the time delay of each different cell must be aligned first;
and 3, for the local cell and the M same-frequency adjacent cells, removing the signal superposition values generated in the step 2 after reconstruction of other interference cells from the received signals by the cell interference signal eliminator (240), namely respectively calculating the received signals after interference elimination of the s-th levelThereby eliminating the influence of the interference signal of the adjacent cell on the signal received by the cell;
wherein S is 1, 2, …, S, j is 1, 2, …, M +1, 1 ≦ k ≦ Z;
and 4, repeatedly executing the steps 1 to 3 according to the parallel interference cancellation stage number set by the system and the received signals after the interference of each cell is eliminated and obtained by the calculation of the previous parallel interference cancellation stage until the parallel interference cancellation operation of all stages is completed.
2. The method according to claim 1, wherein in step 1, when s is 1, i.e. cell signal reconstruction is performed at the first stage, and the M +1 channel estimation and interference reconstruction units (500) based on joint detection directly use the sampling input of the I/Q channel of the received data
Figure FSB00000088219700053
And completing signal reconstruction of each cell.
3. The method for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 1, wherein in step 1, when S is 2, 3, …, S, the M +1 channel estimation and interference reconstruction units (500) based on joint detection use the S-1 th level interference cancelled signal to complete signal reconstruction of each cell.
4. The method for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 1, wherein the step 1.3.3 specifically includes:
step 1.3.3.1, the system matrix generator (590) convolves the dot product result of the scrambling code and the activated spreading code adopted by the current cell with the channel impulse response to generate the system matrix:
the active spreading code ChC ═ C according to the scrambling code ScC of the current cell generated by the scrambling code generator and spreading code generator (580)1,C2,…,CN), Wherein N represents the number of active code channels, SF represents the spreading factor, anFrom the channel impulse response H obtained in step 1.1.2, a system matrix a is calculated by a system matrix generator (590):
Figure FSB00000088219700055
B=[b1,b2,…,bN]T
wherein, the [ alpha ], [ beta ]]TRepresenting matrix transposition, wherein the number of B matrixes in the A matrix is equal to the number of symbols needing joint detection;
step 1.3.3.2, the joint detector (530) performs joint detection operation using zero-forcing linear block equalizer algorithm or minimum mean square error linear block equalizer algorithm to obtain demodulated symbols
5. The method of claim 4, wherein in step 1.3.3.2, the demodulation symbols obtained by the zero forcing linear block equalizer algorithm are used
Figure FSB00000088219700062
Comprises the following steps:
wherein, A represents a system matrix,
Figure FSB00000088219700064
represents the input I/Q path signal,
Figure FSB00000088219700065
indicating the demodulated symbols resulting from the joint detection.
6. The method of claim 4, wherein in step 1.3.3.2, the demodulation symbol obtained by the MMSE linear block equalizer algorithm is usedComprises the following steps:
Figure FSB00000088219700067
wherein, A represents a system matrix,
Figure FSB00000088219700068
representing the input I/Q-path signal, σ2Which represents the variance of the noise, is,
Figure FSB00000088219700069
indicating the demodulated symbols resulting from the joint detection.
7. The method for canceling and eliminating co-channel cell signal interference based on parallel interference according to claim 1, wherein in step 1.3.4, the symbol decision is a hard decision, a demodulation symbol hard decision device performs symbol decision on a demodulation symbol, and the obtained hard decision result is:
yk na demodulated symbol representing the kth symbol of the nth active code channel.
8. The method for canceling and eliminating co-channel cell signal interference based on parallel interference according to claim 1, wherein in step 1.3.4, the symbol decision is a soft decision, a demodulation symbol soft decision device performs symbol decision on a demodulation symbol, and the obtained soft decision result is:
Figure FSB000000882197000611
where m represents the mean value of the received signal amplitude, σ2Representing the noise variance of the received signal, tanh representing the hyperbolic tangent function, yk nA demodulated symbol representing the kth symbol of the nth active code channel.
9. The method for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 1, wherein said step 1.4 further comprises a step 1.4.4 of reconstructing a signal for a cell
Figure FSB00000088219700071
Multiplication by a particular weighting factor psAnd performing weighting operation:
Figure FSB00000088219700072
10. a device for cancelling signal interference of a common-frequency cell based on parallel interference cancellation is characterized in that for a local cell and M common-frequency adjacent cells, the device comprises M +1 channel estimation and interference reconstruction units (500) based on joint detection, an M +1 cell reconstruction signal superimposer (230) and an M +1 cell interference signal canceller (240) which are sequentially connected;
the M +1 channel estimation and interference reconstruction units (500) based on joint detection input the sampling of the current received data I/Q path
Figure FSB00000088219700073
Or the signal after s-1 level interference elimination adopts a method for reconstructing cell signals based on demodulation symbols generated by joint detection to complete the reconstruction of interference signals of each cell in parallel, and the s level reconstruction signal of each cell is obtained:
Figure FSB00000088219700074
wherein S is 1, 2, …, S, and S represents the number of parallel interference cancellation stages set by the system; j ═ 1, 2, …, M + 1; z is the length of the sampling sequence;
the channel estimation and interference reconstruction unit (500) based on joint detection comprises an effective path separation device, a channel impulse response device, a demodulation symbol generation device based on joint detection and a cell signal reconstruction device which are connected through circuits;
the effective path separation device comprises a first matched filter (410_1) and an effective path detector (490) which are connected in sequence;
the input of the first matched filter (410_1) receives the last 128 chips of the midamble sequence in the input signal (m ═ m)1m2,…,m128) Basic midamble sequence with current cell
Figure FSB00000088219700075
Carrying out bit-by-bit cyclic XOR operation, and calculating the power DP of each bit-by-bit XOR result:
Figure FSB00000088219700076
the active path detector (490) compares the power DP value on each path output by the first matched filter (410_1) 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 the path as an ineffective path; final effective path detectionThe L valid paths detected by the detector (490) are: peff=(p1,p2,…,pL);
The channel impulse response device comprises a second matched filter (410_2), a channel estimator (480) and a channel impulse response device (470) which are connected in sequence;
the second matched filter (410_2) has an input receiving the last 128 chip data BM ═ m of the midamble sequence in the input signal1,m2,…,m128) Combining the basic midamble sequence of the current cell
Figure DEST_PATH_FSB00000571853300011
The channel estimator (480) calculates the channel estimation ChE on each path as:
the input end of the channel impulse responder (470) is also connected with the output end of the effective path detector (490); the channel impulse responder (470) generates a channel impulse response H ═ H (H) according to the effective path and the channel estimation1,h2,…,hT):
DPiIndicating the power of the ith path, ChEiA channel estimation value representing an ith path;
the length T of the channel impulse response represents the maximum time delay supported by the system;
the demodulation symbol generating device based on joint detection comprises a third matched filter (410_3), a maximum ratio combiner (420), a joint detection device and a symbol decision device (430) which are connected in sequence;
the cell signal reconstruction device comprises a modulation spreader (440), a plurality of convolvers (460) and an active code channel signal superimposer (450) which are connected in sequence;
the M +1 cell reconstruction signal superimposer (230) respectively and correspondingly superimposes the s-th level reconstruction signals of other cells for the cell and M same-frequency adjacent cells
Figure DEST_PATH_FSB00000571853300014
And superposing to obtain an interference signal of the s-th level corresponding to each cell:
Figure DEST_PATH_FSB00000571853300015
wherein S is 1, 2, …, S, j is 1, 2, …, M + 1;
the M +1 cell interference signal eliminator (240) removes the reconstructed signal superposition value of other interference cells from the received signal for the local cell and M same-frequency adjacent cells, eliminates the influence of the adjacent cell interference signal on the local cell received signal, and obtains the s-th level interference eliminated received signalAnd adopt
Figure FSB00000088219700092
And (3) carrying out interference elimination of the next stage, namely the (s + 1) th stage:
Figure FSB00000088219700093
Figure FSB00000088219700094
wherein S is 1, 2, …, S, j is 1, 2, …, M +1, 1 ≦ k ≦ Z;
the interference signal to the s-th level of the cell is:
wherein S is 1, 2, …, S;
the interference signals of the s-th level for the M co-frequency neighbor cells are as follows:
Figure FSB00000088219700096
wherein, S is 1, 2, …, S, j represents the jth co-frequency neighbor cell;
and the M +1 cell reconstruction signal superimposer aligns the delay of each cell when the superimposer superimposes the reconstruction signals of other cells.
11. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 10, wherein when s is 1, i.e. cell signal reconstruction is performed at the first stage, the M +1 channel estimation and interference reconstruction units (500) based on joint detection directly use the sampling input of I/Q channel of received data
Figure FSB00000088219700097
And completing signal reconstruction of each cell.
12. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 10, wherein when S is 2, 3, …, S, the M +1 channel estimation and interference reconstruction units (500) based on joint detection use the S-1 th-level interference-canceled signal to complete signal reconstruction of each cell.
13. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 10, wherein the input terminal of said third matched filter (410_3) receives the data portion of the input signal and is connected to the effective path detector (490);
the third matched filter (410_3) is based on the position P of the active path, the scrambling code ScC of the current cell and the activated spreading code ChC ═ C1,C2,…,CN), Wherein N represents the number of active code channels and SF represents the spreading factor for the data portion of the input signal
Figure FSB00000088219700101
Descrambling and despreading operations are carried out, and symbols obtained after descrambling and despreading are as follows:
Figure FSB00000088219700102
wherein,
Figure FSB00000088219700106
indicating the symbol corresponding to the nth active code channel,
Figure FSB00000088219700107
representing symbols on the l effective path of the nth active code channel, K representing the number of symbols, u(l,k) nIs shown asSymbol of the n-th active code channel of the k-th symbol of the l active paths, ScCiIndicating the scrambling code of the ith chip.
14. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 10, wherein the input end of the maximal ratio combiner (420) is further connected to a channel impulse responder (470), which performs maximal ratio combining operation on the descrambled and despread symbols on different paths output by the third matched filter (410_3) according to a channel impulse response, i.e. channel estimation on an effective path, to obtain the demodulated symbol on each active code channel:
Figure FSB00000088219700108
Figure FSB00000088219700109
wherein,
Figure FSB000000882197001011
indicates the demodulation symbol, u, corresponding to the nth active code channel(l,k) nSymbol representing the nth active code channel of the kth symbol of the ith active path, ChEiIndicating the channel estimate for the ith path.
15. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 10, wherein the joint detection apparatus comprises a scrambling code generator and a spreading code generator (580), a system matrix generator (590) and a joint detector (530) connected in sequence.
16. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 15, wherein the scrambling code generator and the spreading code generator (580) generate the scrambling code ScC of the current cell and the activated spreading code ChC ═ (C)1,C2,…,CN),
Figure FSB000000882197001012
Where N denotes the number of active code channels and SF denotes the spreading factor.
17. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 15, wherein the input terminal of the system matrix generator (590) is further connected to the output terminal of the channel impulse responder (470), and the system matrix a is calculated according to the scrambling code ScC of the current cell generated by the scrambling code generator and the spreading code generator (580), the activated spreading code ChC, and the channel impulse response H generated by the channel impulse responder (470):
Figure FSB00000088219700111
B=[b1,b2,…,bN]T
Figure FSB00000088219700112
wherein, the [ alpha ], [ beta ]]TAnd (3) representing matrix transposition, wherein the number of B matrixes in the A matrix is equal to the number of symbols needing joint detection.
18. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 15, wherein the inputs of the joint detector (530) are respectively connected to the system matrix generator (590) and the maximum frequency detectorA large ratio combiner (420); performing joint detection operation by adopting zero-chasing linear block equalizer algorithm or minimum mean square error linear block equalizer algorithm to obtain demodulated symbol
Figure FSB00000088219700113
19. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 18, wherein the joint detector (530) employs a zero-forcing linear block equalizer algorithm, and detects the demodulated symbols as:
wherein, A represents a system matrix,represents the input I/Q path signal,indicating the demodulated symbols resulting from the joint detection.
20. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 18, wherein the joint detector (530) employs a minimum mean square error linear block equalizer algorithm, and the detected demodulated symbols are:
Figure FSB00000088219700121
wherein, A represents a system matrix,
Figure FSB00000088219700122
representing the input I/Q-path signal, σ2Representing the variance of the noise,
Figure FSB00000088219700123
Indicating the demodulated symbols resulting from the joint detection.
21. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 10, wherein the symbol decision unit (430) performs symbol decision on the demodulated symbol outputted from the maximal ratio combiner (420) to obtain the estimated value of the transmitted symbol:
Figure FSB00000088219700124
Figure FSB00000088219700125
wherein
Figure FSB00000088219700126
And the judgment result of the demodulation symbol corresponding to the nth active code channel is shown.
22. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 21, wherein said symbol decider (430) is a demodulation symbol hard decider, and the hard decision result obtained by using the demodulation symbol hard decider is:
yk na demodulated symbol representing the kth symbol of the nth active code channel.
23. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 21, wherein said symbol decision device (430) is a demodulation symbol soft decision device, and the soft decision result obtained by using the demodulation symbol soft decision device is:
Figure FSB00000088219700128
where m represents the mean value of the received signal amplitude, σ2Representing the noise variance of the received signal, tanh representing the hyperbolic tangent function, yk nA demodulated symbol representing the kth symbol of the nth active code channel.
24. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 10, wherein the modulation spreader (440) activates the spreading code ChC ═ C (C) on the code channel according to the scrambling code ScC adopted by the current cell1,C2,…,CN),
Figure FSB00000088219700129
And modulating and spreading the decision result output by the symbol decision device (430) to obtain a chip-level transmission signal estimation value on each active code channel:
wherein
Figure FSB00000088219700133
Representing the chip-level transmit signal estimate on the nth active code channel.
25. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 10, wherein the number of said plurality of convolvers (460) is N, corresponding to N active code channels; the input ends of the N convolvers (460) are respectively connected with a channel impulse responder (470);
the N convolvers (460) perform convolution operation on the chip sequence on each active code channel output by the modulation spreader (440) and the channel impulse response generated by the channel impulse response device (470) to obtain a reconstructed signal on each active code channel:
Figure FSB00000088219700134
Figure FSB00000088219700135
wherein,
Figure FSB00000088219700137
representing the reconstructed signal on the nth code channel.
26. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 10, wherein the active code channel signal superimposer (450) superimposes the reconstructed signal on each active code channel to complete the active code channel combination and the cell signal reconstruction, so as to obtain the reconstructed signal of the cell
Figure FSB00000088219700138
Figure FSB000000882197001310
Representing the reconstructed signal on the nth code channel.
27. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 17, wherein said cell signal reconstruction apparatus further comprises a weight multiplier, an input terminal of which is connected to an output terminal of said active code channel signal superimposer (450);
the weight multiplier is used for reconstructing a cell reconstruction signal output by an active code channel signal adder (450)
Figure FSB000000882197001311
Multiplication by a particular weighting factor ps
Figure FSB000000882197001312
28. The apparatus for canceling co-channel cell signal interference based on parallel interference cancellation according to claim 10, wherein the interference-canceled received signal is calculated according to the number of parallel interference cancellation stages S set by the system and the previous parallel interference cancellation stage
Figure FSB00000088219700141
And repeating the operation of eliminating the signal interference of the cells with the same frequency for each parallel interference cancellation stage until the parallel interference cancellation operation of all stages is completed.
CN2006101179156A 2006-11-03 2006-11-03 Method and apparatus for eliminating common-frequency cell signal interference based on parallel interference cancellation Active CN1949684B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2006101179156A CN1949684B (en) 2006-11-03 2006-11-03 Method and apparatus for eliminating common-frequency cell signal interference based on parallel interference cancellation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2006101179156A CN1949684B (en) 2006-11-03 2006-11-03 Method and apparatus for eliminating common-frequency cell signal interference based on parallel interference cancellation

Publications (2)

Publication Number Publication Date
CN1949684A CN1949684A (en) 2007-04-18
CN1949684B true CN1949684B (en) 2012-01-11

Family

ID=38019081

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2006101179156A Active CN1949684B (en) 2006-11-03 2006-11-03 Method and apparatus for eliminating common-frequency cell signal interference based on parallel interference cancellation

Country Status (1)

Country Link
CN (1) CN1949684B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI470950B (en) * 2012-01-19 2015-01-21 Alcatel Lucent And a method for eliminating the interference of the cell reference signal

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103580722B (en) * 2012-07-25 2016-06-22 中兴通讯股份有限公司 The apparatus and method that the interference of a kind of ascending control channel eliminates
CN103701735B (en) * 2013-12-26 2017-02-08 大唐移动通信设备有限公司 Multiple cell-based same-frequency joint detection method and device
CN104219179A (en) * 2014-08-06 2014-12-17 无锡高联信息技术有限公司 Parallel computing method for channel estimation of common-frequency cells with different RS biases in LTE (long term evolution)
CN108733617B (en) * 2018-09-20 2020-09-18 电信科学技术第五研究所有限公司 FPGA implementation method of Fibre channel 64-bit parallel scrambling descrambler

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1126630A2 (en) * 1998-06-05 2001-08-22 Matsushita Electric Industrial Co., Ltd. Transmission apparatus and base station apparatus using the same
CN1716814A (en) * 2004-06-28 2006-01-04 华为技术有限公司 Multiple code receiver of multiple input and multiple output under broad band channel
CN1770650A (en) * 2004-10-15 2006-05-10 展讯通信(上海)有限公司 Maximum ratio combining of channel estimation for joint detection in TD-SCDMA systems

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1126630A2 (en) * 1998-06-05 2001-08-22 Matsushita Electric Industrial Co., Ltd. Transmission apparatus and base station apparatus using the same
CN1716814A (en) * 2004-06-28 2006-01-04 华为技术有限公司 Multiple code receiver of multiple input and multiple output under broad band channel
CN1770650A (en) * 2004-10-15 2006-05-10 展讯通信(上海)有限公司 Maximum ratio combining of channel estimation for joint detection in TD-SCDMA systems

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
CN 1716814 A,全文.

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI470950B (en) * 2012-01-19 2015-01-21 Alcatel Lucent And a method for eliminating the interference of the cell reference signal

Also Published As

Publication number Publication date
CN1949684A (en) 2007-04-18

Similar Documents

Publication Publication Date Title
CN1874189B (en) Method and device for concurrent eliminating same frequency interference in TDS-CDMA
CN1949682B (en) Method and apparatus for cancellation eliminating common-frequency cell signal interference based on serial interference
CN100370718C (en) Joint detection receiving equipment and method without considering orthogonal code length
EP1147620B1 (en) Apparatus and methods for interference cancellation in spread spectrum communication systems
EP1686696B1 (en) Single user detection
EP1391048B1 (en) Fast joint detection
EP1606888B1 (en) Multi user detection using equalization and successive interference cancellation
EP1523810B1 (en) Scaling using gain factors for use in data detection for wireless code division multiple access communication systems
EP1358718B1 (en) Low complexity data detection using fast fourier transform of channel correlation matrix
US6574270B1 (en) Baseband interference canceling spread spectrum communications methods and apparatus
US20060062283A1 (en) Iterative and turbo-based method and apparatus for equalization of spread-spectrum downlink channels
EP2434654B1 (en) Successive multi-user detection for wireless communication
US9083417B2 (en) Method and device for interference cancellation
CN101888259A (en) Method, apparatus and system used for CDMA communication
CN1949684B (en) Method and apparatus for eliminating common-frequency cell signal interference based on parallel interference cancellation
CN102460987B (en) Method and system for interference cancellation
US20090245219A1 (en) Active spread code detection
US6757321B2 (en) Segment-wise channel equalization based data estimation
CN1949685B (en) Method and apparatus for eliminating common-frequency cell signal interference based on parallel interference
EP1372308B1 (en) Method and apparatus for decision directed channel equalization in spread spectrum receivers
US7443908B2 (en) Low complexity detection in digital receivers
CN1949683B (en) Method and apparatus for cancellation eliminating common-frequency cell signal interference based on serial interference
US8295329B2 (en) Efficient computation of soft scaling factors for linear multi-user detector
CN1953343B (en) A method to check soft bit of output generated channel encoder by linear joint detection
CN101902246A (en) Method and equipment for detecting multicast single-frequency network received signal

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
ASS Succession or assignment of patent right

Owner name: SHANGHAI XUANPU INDUSTRY CO., LTD.

Free format text: FORMER OWNER: KAIMING INFORMATION SCIENCE CO., LTD.

Effective date: 20090807

C41 Transfer of patent application or patent right or utility model
TA01 Transfer of patent application right

Effective date of registration: 20090807

Address after: D District, Xhenzhuang Industrial Zone, Shanghai, China: 201108

Applicant after: Shanghai Xuanpu Industrial Co., Ltd.

Address before: Shanghai city Xhenzhuang Industrial Zone No. 18 Shen road, post encoding: 201108

Applicant before: Kaiming Information Science & Technology Co., Ltd.

C14 Grant of patent or utility model
GR01 Patent grant