CN1482754A - Double-layer weighted parallel interference cancellation method and device under MQAM modulation - Google Patents

Abstract

The invention proposes a double-layer weighted parallel interference cancellation method and a device thereof under MQAM modulation. Compared with the PIC structure of BPSK, the PIC structure under the MQAM modulation is improved, and the hard decision device is omitted. Under MQAM modulation, the soft decision result f _iR ^(m)(k) ⋊ _iR ^(m)(k) of the real part and the soft decision result f _iM ^(m)(k)  of the imaginary part of the transmitted symbol can be directly obtained _iM ^(m)(k) , the user's regenerated signal is obtained from the soft decision result of the real part, the soft decision result of the imaginary part and the channel estimation result. In this way, not only the structure can be simplified and the number of multiplications can be reduced, but also the method and device can minimize the decision cost of the symbols sent by the user under MQAM modulation, and can compensate for the deviation of user signal estimation in a statistical sense.

Description

Double-layer weighted parallel interference cancellation method under MQAM modulation and device thereof

Technical Field

The present invention relates to a multi-user detection technology of a base station in a mobile communication system, particularly to a method and a device for parallel interference cancellation under MQA (M-ary orthogonal Amplitude Modulation) Modulation.

Background

The multi-user detection technique is an enhanced technique for overcoming the influence of multiple access interference and improving the capacity of a CDMA system. The method can make full use of the information of a plurality of users to carry out joint detection on the signals of the plurality of users, thereby reducing the influence of multiple access interference on the performance of a receiver as much as possible and improving the capacity of a system.

Verdu proposed an optimal multi-user detector in 1986, but such a detector is complex and difficult to apply. Sub-optimal multi-user detection methods are roughly divided into two categories: a linear detection method and an interference cancellation method. The linear detection method performs a linear transformation on the soft output of the single-user detector to produce a set of new outputs that improve performance. The linear detection method has good performance, but the calculation is complex. The interference cancellation method treats the signal of the desired user as a useful signal and treats the signals of other users as interference signals; the interference of other users is eliminated from the received signal to obtain the signal of the expected user, and then the signal of the expected user is detected, thereby improving the performance of the system.

The interference cancellation method can be divided into: serial interference cancellation and parallel interference cancellation. The performance of the serial interference cancellation method is superior to that of a single-user detector, but the time delay is large, power sequencing is needed, the calculation amount is large, and the method is sensitive to initial signal estimation. The parallel interference cancellation method cancels the signal interference of all other users for each user in parallel from the received signal. The method has the advantages of better performance than a single-user detector, small time delay and small calculation complexity, and is the most possible method at present.

The invention application with Chinese patent application number 01132754.5 provides a double-layer weighted parallel interference cancellation method. The method is an improvement of the traditional parallel interference cancellation method, not only minimizes the cost of symbol-level judgment, but also can make up for the deviation of user signal estimation in statistical sense, and greatly improves the performance of the traditional parallel interference cancellation method.

The multi-stage structure of the receiver used in the two-layer weighted parallel interference cancellation method is shown in fig. 1. The PIC (Parallel Interference Cancellation) structure 1 of the receiver is shown in fig. 2. The final stage PIC architecture 2 of the receiver is shown in figure 3. In the last stage of PIC architecture, the RAKE receiver 3 of the user despreads, channel estimates, and combines multipath on the input signal to obtain the soft output of the user. The soft output of the user is the final result of the multi-level PIC architecture. In the receiver, the soft output of the user is decoded by a decoder that is fed to the user.

Under BPSK modulation, the principle of the double-layer weighted parallel interference cancellation method is as follows:

let the multipath combining result of the Rake receiver of user i in the kth level PIC structure be expressed as:

<math> <mrow> <msubsup> <mi>Y</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>i</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mo>+</mo> <msub> <mi>n</mi> <mi>i</mi> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </math>

Y_i ^(m)(k)represents the result of multipath combining, mu, for the mth symbol of user i in the kth level PIC structure_iIs a real number related to channel fading, obtained by channel estimation; n is_iIs white Gaussian noise and follows normal distribution N (0, sigma)_i ²)；a_i ^(m)The value under BPSK modulation is + -1.

From the formula (1), it is possible to obtain: when in use $a_i^{\left(m\right)}=1$ When, Y_i ^(m)(k)Obeying a normal distribution N (u)_i，σ_i ²) (ii) a When in use $a_i^{\left(m\right)}=-1$ When, Y_i ^(m)(k)Obeying a normal distribution N(-μ_i，σ_i ²)。

Setting hard decision result ${\hat{a}}_i^{\left(m\right)\left(k\right)}=\mathrm{sgn}\left\{Y_i^{\left(m\right)\left(k\right)}\right\}$ Has a reliability coefficient of f_i ^(m)(k). The double-layer weighted parallel interference cancellation method is based on Bayes criterion and is calculated  according to the following formula_i ^(m)(k)The reliability coefficient of (2): <math> <mrow> <msubsup> <mi>f</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <mi>tan</mi> <mi> h</mi> <mo>{</mo> <mfrac> <mrow> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <mo>|</mo> <msubsup> <mi>Y</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> </mrow> <msubsup> <mi>&sigma;</mi> <mi>i</mi> <mn>2</mn> </msubsup> </mfrac> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow> </math>

in the double-layer weighted parallel interference cancellation method, the channel estimation result, the hard decision result and  are used_i ^(m)(k)Reliability system of decision f_i ^(m)(k)A reproduction signal of the user is obtained. During the signal regeneration process, _i ^(m)(k)And f_i ^(m)(k)To obtain a_i ^(m)Soft decision f of_i ^(m)(k)_i ^(m)(k)Then, the soft decision result is used as the estimation of the symbol sent by the user to regenerate the signal. Here, the soft decision resultThe effect in signal regeneration is equivalent to the effect of hard decision results in signal regeneration of the conventional parallel interference cancellation method.

The double-layer weighted parallel interference cancellation method adopts partial interference cancellation, and sets r (t) to represent baseband signals of received signals, r_i ^(k+1)(t) represents the output signal of user i in the k-th stage PIC configuration (which is also the input signal to the RAKE receiver of user i in the (k +1) -th stage PIC configuration), the interference cancellation procedure is as follows:

$r_i^{(k+1)}\left(t\right)=r\left(t\right)-p^{\left(k\right)}{\hat{I}}_i^{\left(k\right)}----\left(3\right)$

wherein p is^(k)Weight for kth level PIC method: p is a radical of⁽¹⁾＜p⁽²⁾...＜p^(S)S is the number of PIC stages; _i ^(k)Representing an estimate of the multiple access interference experienced by the ith user in the kth stage PIC architecture.

The above-mentioned two-layer weighted parallel interference cancellation method is proposed under BPSK modulation. Higher order modulation can increase the information transmission rate compared to BPSK modulation at the same bandwidth. Therefore, only high-order modulation can be used in a case where the information transmission rate is high so as not to increase the bandwidth. MQAM is a common modulation method in high-order modulation, so that the research on a multi-user detection method under MQAM modulation is of great significance.

Disclosure of Invention

The invention aims to provide a double-layer weighting parallel interference cancellation method and a device thereof under MQAM modulation, the method can minimize the judgment cost of symbols under MQAM modulation, and can make up the deviation of user signal estimation in statistical sense.

The invention aims to realize the purpose, and the method for the double-layer weighted parallel interference cancellation under the MQAM comprises the following specific steps:

a. in each stage of PIC (parallel interference cancellation) structure, the RAKE receiver of the user performs the operations of multipath despreading, channel estimation and multipath combination on the input signal, and sends the channel estimation result to the soft decision generator of the user and the signal regenerator of the user, and simultaneously sends the multipath combination result to the soft decision generator of the user, under the MQAM modulation, the multipath combination result of the RAKE receiver of the user in the kth stage PIC structure can be expressed as:

<math> <mrow> <msubsup> <mi>Y</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>i</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mo>+</mo> <msub> <mi>n</mi> <mi>i</mi> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </math>

b. the soft decision generator of the user of this stage generates the soft decision result of each symbol according to the multipath combination result and the channel estimation result of each symbol of the user, and sends the soft decision result to the signal regenerator of the user;

real part and imaginary part P under MQAM modulation_iR、P_iMWhen independently determined, the formula (1) can be written separately as the following two formulas:

<math> <mrow> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <mi>Re</mi> <mrow> <mo>(</mo> <msubsup> <mi>Y</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>iR</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mo>+</mo> <msub> <mi>n</mi> <mi>iR</mi> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </mrow> </math>

<math> <mrow> <msubsup> <mi>Y</mi> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <mi>Im</mi> <mrow> <mo>(</mo> <msubsup> <mi>Y</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>iM</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mo>+</mo> <msub> <mi>n</mi> <mi>iM</mi> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> </mrow> </math>

wherein,

$a_i^{\left(m\right)}=a_{\mathrm{iR}}^{\left(m\right)}+j{a}_{\mathrm{iM}}^{\left(m\right)},$ n_i＝n_iR+jn_iM。

to formula (1) wherein Y_i ^(m)(k)The decision of (A) is then decomposed into two independent decisions, i.e. from Y_iR ^(m)(k)The decision results in _iR ^(m)(k)From Y_iM ^(m)(k)The decision results in _iM ^(m)(k)，Y_i ^(m)(k)Has the result of judgment of ${\hat{a}}_i^{\left(m\right)\left(k\right)}={\hat{a}}_{\mathrm{iR}}^{\left(m\right)\left(k\right)}+j{\hat{a}}_{\mathrm{iM}}^{\left(m\right)\left(k\right)},$ Wherein, <math> <mrow> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>&Element;</mo> <mo>{</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>&Element;</mo> <mi>R</mi> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>0,1</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> <mo>}</mo> <mo>,</mo> </mrow> </math> <math> <mrow> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>&Element;</mo> <mo>{</mo> <msub> <mi>B</mi> <mi>i</mi> </msub> <mo>&Element;</mo> <mi>R</mi> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>0,1</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> <mo>}</mo> <mo>.</mo> </mrow> </math> the decision criteria are as follows:

<math> <mrow> <mo>|</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>-</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <mo>=</mo> <msubsup> <mi>min</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mo>{</mo> <mo>|</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>-</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow> </math>

<math> <mrow> <mo>|</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>-</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <mo>=</mo> <msubsup> <mi>min</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mo>{</mo> <mo>|</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>-</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow> </math>

let decision result _iR ^(m)(k)Has a reliability coefficient of f_iR ^(m)(k)Setting the cost function of the decision as:

<math> <mrow> <mi>C</mi> <mo>=</mo> <msup> <mrow> <mo>[</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <msubsup> <mi>a</mi> <mi>iR</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mo>-</mo> <msubsup> <mi>f</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>)</mo> </mrow> <mo>]</mo> </mrow> <mn>2</mn> </msup> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mrow> <mo>(</mo> <mn>8</mn> <mo>)</mo> </mrow> </mrow> </math>

mean of the decision costs:

<math> <mrow> <mi>E</mi> <mrow> <mo>(</mo> <mi>C</mi> <mo>)</mo> </mrow> <msubsup> <mi>&mu;</mi> <mi>i</mi> <mn>2</mn> </msubsup> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <msup> <mrow> <mo>(</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>-</mo> <msubsup> <mi>f</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mi>P</mi> <mo>{</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>|</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> </mrow> </math>

in the above formula, the symbol P { A \ B } represents the probability of A occurrence under the condition of known B, and f for minimizing the above formula can be obtained_iR ^(m)(k)Satisfies the following formula:

<math> <mrow> <msubsup> <mi>f</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <mfrac> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <msub> <mi>A</mi> <mi>i</mi> </msub> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>}</mo> </mrow> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>}</mo> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>10</mn> <mo>)</mo> </mrow> </mrow> </math>

wherein,

<math> <mrow> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>}</mo> <mo>=</mo> <msup> <mrow> <mfrac> <mn>1</mn> <mrow> <msqrt> <mn>2</mn> <mi>&pi;</mi> </msqrt> <msub> <mi>&sigma;</mi> <mi>i</mi> </msub> </mrow> </mfrac> <mi>e</mi> </mrow> <mrow> <mo>-</mo> <mfrac> <msup> <mrow> <mo>(</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>-</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <msubsup> <mrow> <mn>2</mn> <mi>&sigma;</mi> </mrow> <mi>i</mi> <mn>2</mn> </msubsup> </mfrac> </mrow> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>11</mn> <mo>)</mo> </mrow> </mrow> </math>

f_iR ^(m)(k)_iR ^(m)(k)real part a of the mth symbol transmitted for user i_iR ^(m)The soft decision result of (2);

similarly, let _iM ^(m)(k)Has a reliability coefficient of f_iM ^(m)(k)Then f is_iM ^(m)(k)Satisfies the following formula:

<math> <mrow> <msubsup> <mi>f</mi> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <mfrac> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <msub> <mi>B</mi> <mi>i</mi> </msub> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>B</mi> <mi>i</mi> </msub> <mo>}</mo> </mrow> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>B</mi> <mi>i</mi> </msub> <mo>}</mo> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>12</mn> <mo>)</mo> </mrow> </mrow> </math>

wherein,

<math> <mrow> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>B</mi> <mi>i</mi> </msub> <mo>}</mo> <mo>=</mo> <msup> <mrow> <mfrac> <mn>1</mn> <mrow> <msqrt> <mn>2</mn> <mi>&pi;</mi> </msqrt> <msub> <mi>&sigma;</mi> <mi>i</mi> </msub> </mrow> </mfrac> <mi>e</mi> </mrow> <mrow> <mo>-</mo> <mfrac> <msup> <mrow> <mo>(</mo> <msubsup> <mi>Y</mi> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>-</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msub> <mi>B</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <msubsup> <mrow> <mn>2</mn> <mi>&sigma;</mi> </mrow> <mi>i</mi> <mn>2</mn> </msubsup> </mfrac> </mrow> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>13</mn> <mo>)</mo> </mrow> </mrow> </math>

f_iM ^(m)(k)_iM ^(m)(k)a of imaginary part of m-th symbol transmitted for user_iR ^(m)A soft decision result; under MQAM modulation, a soft decision result f of the real part of the symbol can be directly obtained_iR ^(m)(k)_iR ^(m)(k)Soft decision result f of sum imaginary part_iM ^(m)(k)_iM ^(m)(k)And obtaining the regenerated signal of the user according to the soft decision results of the real part and the imaginary part and the channel estimation result.

c. The signal regenerator of this stage obtains the regenerated signal of the user from the soft decision result of the user and the channel estimation result of the user, and send the regenerated signal of the user to the estimation and interference cancellation device of the multiple access interference of this stage;

d. the estimating and interference cancellation device of the multi-address interference of the present stage accumulates the regeneration signals of other users to obtain the multi-address interference suffered by the expected user, and partially eliminates the multi-address interference suffered by the signal of the expected user from the baseband signal of the received signal, thereby obtaining the output signal of the user in the present stage PIC structure, and simultaneously the signal is used as the input signal of the RAKE receiver of the same user in the next stage PIC structure;

e. repeating the steps a-d, and carrying out the processing of the next level of parallel interference cancellation;

f. and (c) for the last stage PIC structure, only calculating multipath de-spreading, channel estimation and multipath combination in the step (a), taking the soft output of the user i obtained by multipath combination as the final result of the user i in the multistage PIC structure, and in a receiver, sending the result to a decoder of the user i for decoding.

The device for realizing the method is a double-layer weighted parallel interference cancellation receiver which consists of a plurality of layers of PIC structures, wherein each layer of PIC structure consists of a plurality of groups of RAKE receivers, a soft decision generator, a signal regenerator and a multi-address interference estimation and interference cancellation device which are connected in sequence.

The invention provides a method and a device for double-layer weighted parallel interference cancellation under MQAM modulation. The method can minimize the judgment cost of the symbol under MQAM modulation, and can make up for the deviation of user signal estimation in the statistical sense. Meanwhile, compared with the PIC structure of BPSK, the PIC structure of MQAM is improved, it can directly calculate the soft decision result, and does not need to calculate the hard decision result first and then calculate the reliability coefficient, thereby simplifying the structure and reducing the calculation amount.

Drawings

FIG. 1 is a schematic diagram of a multi-stage architecture for a two-tier weighted parallel interference cancellation receiver;

FIG. 2 is a diagram of a PIC architecture for a dual-layer weighted parallel interference cancellation receiver;

FIG. 3 is a diagram of the final stage PIC structure of a dual-layer weighted parallel interference cancellation receiver;

fig. 4 is a schematic diagram of a PIC structure of a double-layer weighted parallel interference cancellation receiver under MQAM modulation.

Detailed Description

The invention is further described below with reference to the figures and examples.

The device for implementing the double-layer weighted parallel interference cancellation method under the MQAM modulation is a double-layer weighted parallel interference cancellation receiver, the multistage structure of which is shown in figure 1, the final stage PIC structure of which is shown in figure 3, and the PIC structure of which is shown in figure 4.

As shown in fig. 1, the receiver is composed of several stages of the same PIC architecture and the last stage of the PIC architecture connected in sequence. The PIC stage number is generally 3-4.

As shown in fig. 3, in the last stage PIC architecture, the device 3 is a RAKE receiver, and there are several RAKE receivers in the PIC architecture, one and only one RAKE receiver for each user. The RAKE receiver of the user performs multipath de-spread and channel estimation on the input signal from the same user at the previous stage, and then performs multipath combination to obtain the soft output of the user. In the last level of the PIC architecture, the soft output of the user is the final result of the multi-level PIC architecture.

As shown in fig. 4, the PIC architecture consists of several RAKE receivers, a soft decision generator, a signal regenerator, and an interference cancellation and estimation device for multiple access interference, connected in sequence. The device 3 is a RAKE receiver which performs multipath despreading of an input signal, channel estimation from the despreading result, and then multipath combining, and feeds the RAKE combining result to a soft decision generator 8 and the channel estimation result to a soft decision generator and signal regenerator 5. The means 8 is a soft decision generator which derives soft decisions from the RAKE combining result and the channel estimation result and supplies the soft decision results to the signal regenerator 5. The means 5 are signal regenerators which derive the user's regenerated signal from the two input signals and feed the user's regenerated signal to the multiple access interference estimation and interference cancellation means 6. The device 6 is a multiple access interference estimation and interference cancellation device, which calculates the multiple access interference of each user from the input regeneration signal of each user, and partially cancels the multiple access interference of a certain user from the baseband signal of the received signal to obtain a signal as the input signal of the RAKE receiver of the user in the next stage PIC structure.

The method for double-layer weighted parallel interference cancellation under MQAM modulation is specifically realized by the following steps:

as shown in fig. 1, the baseband signal r (t) of the received signal enters the first stage PIC architecture 1 in the figure in a parallel manner. As shown in fig. 4, the input signals entering the PIC architecture 1 in parallel enter the RAKE receivers 3 of each user, respectively. The RAKE receiver 3 despreads the input signal, performs channel estimation and multipath combining from the despreading result, and sends the multipath combining result to the soft decision generator 8 and the channel estimation result to the soft decision generator 8 and the signal regenerator 5. The soft decision generator 8 obtains a soft decision result from the multipath combining result and the channel estimation result.

The double-layer weighted parallel interference cancellation method under MQAM still adopts a partial interference cancellation method, but the calculation method of the hard decision reliability coefficient is provided aiming at the MQAM. The soft decision result under MQAM modulation is obtained by the following calculation.

Under MQAM modulation, the mth symbol transmitted by user i can be represented as:

<math> <mrow> <msubsup> <mi>a</mi> <mi>i</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mo>&Element;</mo> <mo>{</mo> <msub> <mi>P</mi> <mi>i</mi> </msub> <mo>-</mo> <msub> <mi>P</mi> <mi>iR</mi> </msub> <mo>+</mo> <msub> <mi>jP</mi> <mi>iM</mi> </msub> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>0,1</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <mi>M</mi> <mo>-</mo> <mn>1</mn> <mo>}</mo> <mo>,</mo> </mrow> </math>

wherein,

<math> <mrow> <msub> <mi>P</mi> <mi>iR</mi> </msub> <mo>&Element;</mo> <mo>{</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>&Element;</mo> <mi>R</mi> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>0,1</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> <mo>}</mo> <mo>,</mo> </mrow> </math> <math> <mrow> <msub> <mi>P</mi> <mi>iM</mi> </msub> <mo>&Element;</mo> <mo>{</mo> <msub> <mi>B</mi> <mi>i</mi> </msub> <mo>&Element;</mo> <mi>R</mi> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>0,1</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> <mo>}</mo> <mo>,</mo> </mrow> </math> under MQAM modulation, the multipath combining result of the Rake receiver of user i in the kth stage PIC structure can still be expressed as:

<math> <mrow> <msubsup> <mi>Y</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>i</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mo>+</mo> <msub> <mi>n</mi> <mi>i</mi> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </math>

however, under MQAM modulation, Y in the above equation_i ^(m)(k)、a_i ^(m)Is a plurality; n is_iIs complex white Gaussian noise, let n_iRespectively obey normal distribution N (0, sigma)_i ²)，σ_i ²May be derived from a noise power estimation method, used herein as a known quantity; mu.s_iIs a real number and is calculated from the channel estimation result.

Order to $N=\mathrm{lo}{g}_2^M,$ Then under MQAM modulation, N bits determine the symbol of one MQAM. There are only two possible cases for the determination of MQAM symbols:

in the first case of N bitsThe bits determining the real part of the MQAM symbol, andthe bits determine the imaginary part of the MQAM symbol, i.e. the real part and imaginary part P under MQAM modulation_iR、P_iMAre independently determined;

real and imaginary part P under MQAM modulation in the second case_iR、P_iMAre not independently determined;

typically, the real and imaginary parts of a symbol under MQAM modulation are independently determined, such as 16QAM and 64QAM modulation. The invention only considers the situation that the real part and the imaginary part of the symbol under MQAM modulation are independently determined.

Real part and imaginary part P under MQAM modulation_iR、P_iMWhen independently determined, the formula (1) can be written separately as the following two formulas:

<math> <mrow> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <mi>Re</mi> <mrow> <mo>(</mo> <msubsup> <mi>Y</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>iR</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mo>+</mo> <msub> <mi>n</mi> <mi>iR</mi> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </mrow> </math>

$a_i^{\left(m\right)}=a_{\mathrm{iR}}^{\left(m\right)}+j{a}_{\mathrm{iM}}^{\left(m\right)},$

wherein, <math> <mrow> <msubsup> <mi>Y</mi> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <mi>Im</mi> <mrow> <mo>(</mo> <msubsup> <mi>Y</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>iM</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mo>+</mo> <msub> <mi>n</mi> <mi>iM</mi> </msub> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> </mrow> </math> n_i＝n_iR+jn_iM。

to formula (1) wherein Y_i ^(m)(k)The decision of (A) is then decomposed into two independent decisions, i.e. from Y_iM ^(m)(k)The decision results in _iR ^(m)(k)From Y_iM ^(m)(k)The decision results in _iM ^(m)(k)。Y_i ^(m)(k)Has the result of judgment of ${\hat{a}}_i^{\left(m\right)\left(k\right)}={\hat{a}}_{\mathrm{iR}}^{\left(m\right)\left(k\right)}+j{\hat{a}}_{\mathrm{iM}}^{\left(m\right)\left(k\right)}.$ Wherein, <math> <mrow> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>&Element;</mo> <mo>{</mo> <msub> <mi>B</mi> <mi>i</mi> </msub> <mo>&Element;</mo> <mi>R</mi> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>0,1</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> <mo>}</mo> <mo>,</mo> </mrow> </math> <math> <mrow> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>&Element;</mo> <mo>{</mo> <msub> <mi>B</mi> <mi>i</mi> </msub> <mo>&Element;</mo> <mi>R</mi> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>0,1</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> <mo>}</mo> <mo>.</mo> </mrow> </math> the decision criteria are as follows:

<math> <mrow> <mo>|</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>-</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <mo>=</mo> <msubsup> <mi>min</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mo>{</mo> <mo>|</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>-</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow> </math>

<math> <mrow> <mo>|</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>-</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <mo>=</mo> <msubsup> <mi>min</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mo>{</mo> <mo>|</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>-</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow> </math>

let decision result _iR ^(m)(k)Has a reliability coefficient of f_iR ^(m)(k)Setting the cost function of the decision as:

<math> <mrow> <mi>C</mi> <mo>=</mo> <msup> <mrow> <mo>[</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <msubsup> <mi>a</mi> <mi>iR</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mo>-</mo> <msubsup> <mi>f</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>)</mo> </mrow> <mo>]</mo> </mrow> <mn>2</mn> </msup> </mrow> </math><math> <mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>8</mn> <mo>)</mo> </mrow> </mrow> </math>

mean of the decision costs:

<math> <mrow> <mi>E</mi> <mrow> <mo>(</mo> <mi>C</mi> <mo>)</mo> </mrow> <mo>=</mo> <msubsup> <mi>&mu;</mi> <mi>i</mi> <mn>2</mn> </msubsup> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <msup> <mrow> <mo>(</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>-</mo> <msubsup> <mi>f</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mi>P</mi> <mo>{</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>|</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> </mrow> </math>

the notation P { A \ B } in the above equation represents the probability of A occurring under the condition of known B.

F can be obtained to minimize the above formula_iR ^(m)(k)Satisfies the following formula:

<math> <mrow> <msubsup> <mi>f</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <mfrac> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <msub> <mi>A</mi> <mi>i</mi> </msub> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>}</mo> </mrow> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>}</mo> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>10</mn> <mo>)</mo> </mrow> </mrow> </math>

wherein, <math> <mrow> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>}</mo> <mo>=</mo> <msup> <mrow> <mfrac> <mn>1</mn> <mrow> <msqrt> <mn>2</mn> <mi>&pi;</mi> </msqrt> <msub> <mi>&sigma;</mi> <mi>i</mi> </msub> </mrow> </mfrac> <mi>e</mi> </mrow> <mrow> <mo>-</mo> <mfrac> <msup> <mrow> <mo>(</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>-</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <msubsup> <mrow> <mn>2</mn> <mi>&sigma;</mi> </mrow> <mi>i</mi> <mn>2</mn> </msubsup> </mfrac> </mrow> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>11</mn> <mo>)</mo> </mrow> </mrow> </math>

f_iR ^(m)(k)_iR ^(m)(k)real part a of the mth symbol transmitted for user i_iR ^(m)The soft decision result of (2).

Similarly, let _iM ^(m)(k)Has a reliability coefficient of f_iM ^(m)(k)Then f is_iM ^(m)(k)The following are satisfied:

<math> <mrow> <msubsup> <mi>f</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <mfrac> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <msub> <mi>A</mi> <mi>i</mi> </msub> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>}</mo> </mrow> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>}</mo> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>10</mn> <mo>)</mo> </mrow> </mrow> </math>

wherein,

<math> <mrow> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>}</mo> <mo>=</mo> <msup> <mrow> <mfrac> <mn>1</mn> <mrow> <msqrt> <mn>2</mn> <mi>&pi;</mi> </msqrt> <msub> <mi>&sigma;</mi> <mi>i</mi> </msub> </mrow> </mfrac> <mi>e</mi> </mrow> <mrow> <mo>-</mo> <mfrac> <msup> <mrow> <mo>(</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>-</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <msubsup> <mrow> <mn>2</mn> <mi>&sigma;</mi> </mrow> <mi>i</mi> <mn>2</mn> </msubsup> </mfrac> </mrow> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>11</mn> <mo>)</mo> </mrow> </mrow> </math>

f_iM ^(m)(k)_iM ^(m)(k)i.e. the imaginary part a of the mth symbol sent by user i_iM ^(m)The soft decision result of (2). Under MQAM modulation, the method can directly realizeFinding a soft decision result f of the real part of the transmitted symbol_iR ^(m)(k)_iR ^(m)(k)Soft decision result f of sum imaginary part_iM ^(m)(k)_iM ^(m)(k)And obtaining the regenerated signal of the user according to the soft decision result of the real part, the soft decision result of the imaginary part and the channel estimation result. In this way, the structure can be simplified while reducing the number of multiplications.

The soft decision generator 8 sends the soft decision result obtained by the above method to the signal regenerator 5. The signal regenerator 5 obtains the regenerated signal of the user from the two input signals and sends the regenerated signal to the estimating and interference canceling device 6 of the multiple access interference. As can be seen from the figure, the baseband signal r (k) of the received signal also enters the estimation and interference cancellation means 6 of the multiple access interference. The device estimates the multiple access interference suffered by each user from the regenerated signal of each user input in parallel, and the signal obtained by partially eliminating the multiple access interference suffered by a certain user from the baseband signal r (t) of the received signal is used as the output signal of the user in the PIC structure of the current stage, and the input signal of the RAKE receiver of the user in the PIC structure of the next stage. The next stage PIC architecture performs the same processing on the parallel input signals. This is done in stages, and when processing is to the final PIC architecture (as shown in fig. 3), the parallel input signals enter the RAKE receiver 3 for each user separately. The RAKE receiver 3 of the user performs despreading, channel estimation and multipath combining on the input signal to obtain the soft output of the user. The soft output of the user is the final result of the multi-level PIC architecture. In the receiver, the soft output of the user is decoded by a decoder that is fed to the user.

It should be noted that any insubstantial changes, or obvious substitutions, made by those skilled in the art are intended to be within the scope of the invention.

Claims (2)

1. A method for double-layer weighted parallel interference cancellation under MQAM modulation in a mobile communication system is characterized by comprising the following steps:

a. in each stage of parallel interference cancellation structure, a RAKE receiver of a user performs operations of multipath despreading, channel estimation and multipath combining on an input signal, and sends a channel estimation result to a soft decision generator of the user and a signal regenerator of the user, and simultaneously sends a multipath combining result to the soft decision generator of the user, and under MQAM modulation, a multipath combining result of a RAKE receiver of a user i in a kth stage PIC structure can be expressed as:

<math> <mrow> <msubsup> <mi>Y</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>i</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mo>+</mo> <msub> <mi>n</mi> <mi>i</mi> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </math>

b. the soft decision generator of the user of this stage generates the soft decision result of each symbol according to the multipath combination result and the channel estimation result of each symbol of the user, and sends the soft decision result to the signal regenerator of the user;

real part and imaginary part P under MQAM modulation_iR、P_iMWhen independently determined, the formula (1) can be written separately as the following two formulas:

<math> <mrow> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <mi>Re</mi> <mrow> <mo>(</mo> <msubsup> <mi>Y</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>iR</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mo>+</mo> <msub> <mi>n</mi> <mi>iR</mi> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </mrow> </math>

<math> <mrow> <msubsup> <mi>Y</mi> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <mi>Im</mi> <mrow> <mo>(</mo> <msubsup> <mi>Y</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msubsup> <mi>a</mi> <mi>iM</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mo>+</mo> <msub> <mi>n</mi> <mi>iM</mi> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> </mrow> </math>

wherein, $a_i^{\left(m\right)}=a_{\mathrm{iR}}^{\left(m\right)}+j{a}_{\mathrm{iM}}^{\left(m\right)},$ n_i＝n_iR+jn_iM。

to formula (1) wherein Y_i ^(m)(k)The decision of (A) is then decomposed into two independent decisions, i.e. from Y_iR ^(m)(k)The decision results in _iR ^(m)(k)From Y_iM ^(m)(k)The decision results in _iR ^(m)(k)，Y_i ^(m)(k)Has the result of judgment of ${\hat{a}}_i^{\left(m\right)\left(k\right)}={\hat{a}}_{\mathrm{iR}}^{\left(m\right)\left(k\right)}+{j\hat{a}}_{\mathrm{iM}}^{\left(m\right)\left(k\right)},$ Wherein, <math> <mrow> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>&Element;</mo> <mo>{</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>&Element;</mo> <mi>R</mi> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>0,1</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> <mo>}</mo> <mo>,</mo> </mrow> </math> <math> <mrow> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>&Element;</mo> <mo>{</mo> <msub> <mi>B</mi> <mi>i</mi> </msub> <mo>&Element;</mo> <mi>R</mi> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>0,1</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> <mo>}</mo> <mo>,</mo> </mrow> </math>

the decision criteria are as follows:

<math> <mrow> <mo>|</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>-</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <mo>=</mo> <msubsup> <mi>min</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mo>{</mo> <mo>|</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>-</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow> </math>

<math> <mrow> <mo>|</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>-</mo> <msubsup> <mi>Y</mi> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <mo>=</mo> <msubsup> <mi>min</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mo>{</mo> <mo>|</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msub> <mi>B</mi> <mi>i</mi> </msub> <mo>-</mo> <msubsup> <mi>Y</mi> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>7</mn> <mo>)</mo> </mrow> </mrow> </math>

let decision result _iR ^(m)(k)Has a reliability coefficient of f_iR ^(m)(k)Setting the cost function of the decision as:

<math> <mrow> <mi>C</mi> <mo>=</mo> <msup> <mrow> <mo>[</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <msubsup> <mi>a</mi> <mi>iR</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mo>-</mo> <msubsup> <mi>f</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>)</mo> </mrow> <mo>]</mo> </mrow> <mn>2</mn> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>8</mn> <mo>)</mo> </mrow> </mrow> </math>

mean of the decision costs:

<math> <mrow> <mi>E</mi> <mrow> <mo>(</mo> <mi>C</mi> <mo>)</mo> </mrow> <mo>=</mo> <msubsup> <mi>&mu;</mi> <mi>i</mi> <mn>2</mn> </msubsup> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <msup> <mrow> <mo>(</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>-</mo> <msubsup> <mi>f</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mi>P</mi> <mo>{</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>|</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> </mrow> </math>

in the above formula, the symbol P { A \ B } represents the probability of A occurrence under the condition of known B, and the minimum satisfying f of the above formula can be obtained_iR ^(m)(k)The following formula:

<math> <mrow> <msubsup> <mi>f</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <mfrac> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <msub> <mi>A</mi> <mi>i</mi> </msub> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>}</mo> </mrow> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>}</mo> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>10</mn> <mo>)</mo> </mrow> </mrow> </math>

wherein,

<math> <mrow> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>}</mo> <mo>=</mo> <msup> <mrow> <mfrac> <mn>1</mn> <mrow> <msqrt> <mn>2</mn> <mi>&pi;</mi> </msqrt> <msub> <mi>&sigma;</mi> <mi>i</mi> </msub> </mrow> </mfrac> <mi>e</mi> </mrow> <mrow> <mo>-</mo> <mfrac> <msup> <mrow> <mo>(</mo> <msubsup> <mi>Y</mi> <mi>iR</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>-</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msub> <mi>A</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <msubsup> <mrow> <mn>2</mn> <mi>&sigma;</mi> </mrow> <mi>i</mi> <mn>2</mn> </msubsup> </mfrac> </mrow> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>11</mn> <mo>)</mo> </mrow> </mrow> </math>

f_iR ^(m)(k)_iR ^(m)(k)real part a of the mth symbol transmitted for user i_iR ^(m)The soft decision result of (2);

similarly, let _iM ^(m)(k)Has a reliability coefficient of f_iM ^(m)(k)Then f is_iM ^(m)(k)Satisfies the following formula:

<math> <mrow> <msubsup> <mi>f</mi> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>=</mo> <mfrac> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <msub> <mi>B</mi> <mi>i</mi> </msub> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>B</mi> <mi>i</mi> </msub> <mo>}</mo> </mrow> <mrow> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msqrt> <mi>M</mi> </msqrt> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>B</mi> <mi>i</mi> </msub> <mo>}</mo> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>12</mn> <mo>)</mo> </mrow> </mrow> </math>

wherein,

<math> <mrow> <mi>f</mi> <mo>{</mo> <msubsup> <mi>Y</mi> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>|</mo> <msub> <mi>B</mi> <mi>i</mi> </msub> <mo>}</mo> <mo>=</mo> <msup> <mrow> <mfrac> <mn>1</mn> <mrow> <msqrt> <mn>2</mn> <mi>&pi;</mi> </msqrt> <msub> <mi>&sigma;</mi> <mi>i</mi> </msub> </mrow> </mfrac> <mi>e</mi> </mrow> <mrow> <mo>-</mo> <mfrac> <msup> <mrow> <mo>(</mo> <msubsup> <mi>Y</mi> <mi>iM</mi> <mrow> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mo>-</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <msub> <mi>B</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <msubsup> <mrow> <mn>2</mn> <mi>&sigma;</mi> </mrow> <mi>i</mi> <mn>2</mn> </msubsup> </mfrac> </mrow> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>13</mn> <mo>)</mo> </mrow> </mrow> </math>

f_iM ^(m)(k)_iM ^(m)(k)imaginary part a of mth symbol transmitted for user i_iM ^(m)The soft decision result of (2);

c. the signal regenerator of this stage obtains the regenerated signal of the user from the soft decision result of the user and the channel estimation result of the user, and send the regenerated signal of the user to the estimation and interference cancellation device of the multiple access interference of this stage;

d. the estimating and interference cancellation device of the multi-address interference of the present stage accumulates the regeneration signals of other users to obtain the multi-address interference suffered by the expected user, and partially eliminates the multi-address interference suffered by the signal of the expected user from the baseband signal of the received signal, thereby obtaining the output signal of the user in the present stage PIC structure, and simultaneously the signal is used as the input signal of the RAKE receiver of the same user in the next stage PIC structure;

e. repeating the steps a-d, and carrying out the processing of the next level of parallel interference cancellation;

f. and (c) for the last stage PIC structure, only calculating multipath de-spreading, channel estimation and multipath combination in the step (a), taking soft output of the user i obtained by multipath combination as a final result of the user i in the multistage PIC structure, and in a receiver, sending the result to a decoder of the user i for decoding.

2. An apparatus for implementing the parallel interference cancellation method of claim 1, the apparatus comprising several stages of the same parallel interference cancellation structure and a final stage of different PIC structure, the final stage PIC structure comprising several RAKE receivers, wherein the same PIC structure of each stage is formed by connecting several RAKE receivers, a soft decision generator, a signal regenerator and an interference cancellation apparatus for estimating multiple access interference in sequence.

Images