[go: up one dir, main page]

CN1155189C - A Simplified Method of Two-layer Weighted Parallel Interference Cancellation Method - Google Patents

A Simplified Method of Two-layer Weighted Parallel Interference Cancellation Method Download PDF

Info

Publication number
CN1155189C
CN1155189C CNB011355271A CN01135527A CN1155189C CN 1155189 C CN1155189 C CN 1155189C CN B011355271 A CNB011355271 A CN B011355271A CN 01135527 A CN01135527 A CN 01135527A CN 1155189 C CN1155189 C CN 1155189C
Authority
CN
China
Prior art keywords
mrow
user
tanh
msubsup
signal
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.)
Expired - Fee Related
Application number
CNB011355271A
Other languages
Chinese (zh)
Other versions
CN1411189A (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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies 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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CNB011355271A priority Critical patent/CN1155189C/en
Priority to PCT/CN2002/000711 priority patent/WO2003032545A1/en
Priority to EP02772004A priority patent/EP1443694B1/en
Priority to DE60218329T priority patent/DE60218329T2/en
Priority to US10/492,096 priority patent/US7321581B2/en
Priority to AT02772004T priority patent/ATE354894T1/en
Publication of CN1411189A publication Critical patent/CN1411189A/en
Application granted granted Critical
Publication of CN1155189C publication Critical patent/CN1155189C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B1/00Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69Spread spectrum techniques
    • H04B1/707Spread spectrum techniques using direct sequence modulation
    • H04B1/7097Interference-related aspects
    • H04B1/7103Interference-related aspects the interference being multiple access interference
    • H04B1/7107Subtractive interference cancellation
    • H04B1/71075Parallel interference cancellation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B1/00Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69Spread spectrum techniques
    • H04B1/707Spread spectrum techniques using direct sequence modulation
    • H04B1/7097Interference-related aspects
    • H04B1/7103Interference-related aspects the interference being multiple access interference
    • H04B1/7107Subtractive interference cancellation
    • H04B2001/71077Partial interference cancellation

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Noise Elimination (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The present invention puts forward a simplified algorithm of a two-layer weighted parallel interference cancellation algorithm, which keeps the performance of the two-layer weighted parallel interference cancellation algorithm and simultaneously greatly reduces operation volume. Because hyperbolic tangent calculation is related in the two-layer weighted parallel interference cancellation algorithm, the two-layer weighted parallel interference cancellation algorithm can hardly realize the hyperbolic tangent calculation. For solving the problem, the simplified algorithm of the two-layer weighted parallel interference cancellation algorithm of the present invention uses a piecewise linear judgment method or a table lookup method to replace hyperbolic tangent judgment; the substance is to use a piecewise linear judgment function L(x) or the judgment function T(x) of the table lookup method to approach a hyperbolic tangent function tanh(x).

Description

Method for simplifying double-layer weighted parallel interference cancellation method
Technical Field
The invention relates to a multi-user detection technology of a base station in a CDMA mobile communication system, in particular to a parallel interference cancellation method in the CDMA system.
Background
CDMA systems have been the development direction of third generation mobile communications due to their advantages of high capacity, high quality of service, and good security. Multiple Access Interference (Multiple Access Interference) limits the improvement in CDMA system capacity and performance. The single-user receiver cannot eliminate the influence of multiple access interference on user signal detection, and the detection performance of the receiver is reduced under the conditions of increased number of users and near-far effect. Designing a receiver resistant to multiple access interference is the key to taking advantage of the high capacity and high quality of service of the CDMA system.
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 in 1986 a multi-user detector based on maximum a posteriori probability, i.e. a maximum likelihood sequence detector. Although this detector is an optimal detector, it is highly complex and requires an estimate of the received signal amplitude and phase information. This makes the maximum likelihood sequence detector difficult to apply. Therefore, sub-optimal multi-user detection methods must be studied.
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. Such methods mainly comprise: a decorrelation Detector (Decorrelating Detector), a minimum mean Square Error Detector (minimum mean Square Error Detector), a Polynomial Expansion Detector (Polynomial Expansion Detector), and the like. 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 (Serial Interference Cancellation) and Parallel Interference Cancellation (Parallel Interference Cancellation). The successive interference cancellation method sequences the user signals in descending power order. Firstly, the user with the maximum power is judged and detected, then the user signal is regenerated, the signal of the user is removed from the received signal, and the detection of other users is not interfered by the user signal. And then, detecting the user signal with the second largest power, and regenerating and eliminating the signal of the user with the second largest power, so that the detection of the rest users is not interfered by the user with the second largest power. And then removing the interference of other users from the received signal according to the sequence. The performance of the method is better than that of a single-user detector, but the method has the disadvantages of large delay, power sequencing, large calculation amount and sensitivity 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 parallel interference cancellation method has a large performance improvement relative to a single-user detector under a high signal-to-noise ratio, but has a reduced performance improvement relative to the single-user detector under a low signal-to-noise ratio. In a CDMA system, power control can compensate for the fading characteristics of the channel to some extent, allowing the system to operate at a lower signal-to-noise ratio to increase the capacity of the system as much as possible. Therefore, how to improve the performance of the parallel interference cancellation method under the condition of lower signal-to-noise ratio has important significance.
The performance of the parallel interference cancellation method can be effectively improved by the partial parallel interference cancellation method. Different from the traditional parallel interference cancellation method, the method comprises the following steps: the traditional parallel interference cancellation method completely eliminates the multiple access interference to which the user is expected to be subjected from the received signal; and the method for partly parallel interference cancellation sets a weight value for each stage of interference cancellation, weights the multiple access interference suffered by the expected user, and only partly eliminates the multiple access interference in the process of interference cancellation. Michael Buehrer and strong p. nicoloso published a news report on "Partial Parallel Interference Cancellation for CDMA" by the institute of electrical and electronic engineering, fifth generation 1999 (IEEE transactions on Communications, pp.658-661, vol.47, No.5, 1999). This paper was obtained from a theoretical analysis: under the Gaussian channel, the traditional parallel interference cancellation method completely eliminates the multiple access interference suffered by the expected user from the received signal, and the estimation of the signal of the expected user is biased estimation in the situation; the partial parallel interference cancellation method only partially cancels the multiple access interference, can correct the deviation of the signal estimation of the expected user, and leads the judgment result to be more reliable. Under the condition of lower signal-to-noise ratio, the performance of the partial parallel interference cancellation method is obviously superior to that of the traditional parallel interference cancellation method.
A weighted parallel interference cancellation method based on bayesian criterion is disclosed by US patent 5418814, which is also a weighting method. The method is different from the weighting basic principle of a partial parallel interference cancellation method, and is a bit-level weighting method based on the minimum mean value of decision cost. The method sets a cost function of judgment, determines a reliability coefficient of a judgment result of each bit by taking the minimum mean value of the judgment cost as a criterion, and performs bit-level weighting on a signal regenerated by the bit by using the coefficient, so that the interference generated by the bit of a user is only partially eliminated in the elimination of the multiple access interference. Compared with the traditional parallel interference cancellation method, the method has the advantages that the performance is improved, and particularly under the condition of low signal-to-noise ratio, the performance is obviously improved.
Although the two methods effectively improve the performance of the traditional parallel interference cancellation method under the condition of lower signal-to-noise ratio, the improvement amplitude is limited. The double-layer weighted parallel interference cancellation method combines a partial parallel interference cancellation method and a weighted parallel interference cancellation method based on a Bayesian rule, so that the method performance is further improved, and the method performance is greatly improved particularly under the condition of low signal-to-noise ratio.
A two-tier weighted parallel interference cancellation method is described below.
The structure of the double-layer weighted parallel interference cancellation receiver is shown in fig. 1, and the internal structures of the PIC structure 1 and the PIC structure 2 at the last stage are respectively shown in fig. 2 and fig. 3. The first-stage PIC structure takes the baseband signal of the received signal as the input signal of each user and processes the baseband signal to obtain the output signal of each user, which is the input signal of each user in the next-stage PIC structure; the second-level PIC structure processes input signals of all users, and the obtained output signals of all users are the input signals of all users in the next-level PIC structure; thus, the final stage of PIC structure processes the input signal of each user to obtain the final result of the multi-stage PIC structure.
In a fading channel environment, the baseband signal of the received signal can be expressed as:
<math> <mrow> <mi>r</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>K</mi> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>l</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>L</mi> </munderover> <msub> <mi>a</mi> <mi>il</mi> </msub> <msub> <mi>S</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <msub> <mi>&tau;</mi> <mi>il</mi> </msub> <mo>)</mo> </mrow> <mo>+</mo> <mi>Z</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>K</mi> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>l</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>L</mi> </munderover> <msub> <mi>a</mi> <mi>il</mi> </msub> <msqrt> <msub> <mi>P</mi> <mi>i</mi> </msub> </msqrt> <msub> <mi>b</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <msub> <mi>&tau;</mi> <mi>il</mi> </msub> <mo>)</mo> </mrow> <msub> <mi>c</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <msub> <mi>&tau;</mi> <mi>il</mi> </msub> <mo>)</mo> </mrow> <mo>+</mo> <mi>Z</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </math>
wherein r (t) represents a baseband signal of the received signal; a isilThe channel fading value of the ith path of the ith user is represented, and L is the number of paths; tau isilThe time delay of the ith path of the ith user is represented; si(t) represents a transmission signal of a user i, and K represents the total number of users; piRepresents the power of user i; bi(t) represents the bit stream of user i, <math> <mrow> <msub> <mi>b</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>m</mi> <mo>=</mo> <mo>-</mo> <mo>&infin;</mo> </mrow> <mo>&infin;</mo> </munderover> <msubsup> <mi>a</mi> <mi>i</mi> <mrow> <mo>(</mo> <mi>m</mi> <mo>)</mo> </mrow> </msubsup> <mi>p</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <mi>m</mi> <msub> <mi>T</mi> <mi>b</mi> </msub> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> ai (m)m bit representing the ith user, p (T) representing a period of TbLet p (T) be a rectangular pulse (when T ∈ [0, T ] without disturbing the conclusion of the methodb]When p (t) is 1; when in use <math> <mrow> <mi>t</mi> <mo>&NotElement;</mo> <mo>[</mo> <mn>0</mn> <mo>,</mo> <msub> <mi>T</mi> <mi>b</mi> </msub> <mo>]</mo> </mrow> </math> When p (t) is 0); c. Ci(t) represents the spreading code of user i; z (t) represents channel noise.
As shown in fig. 2, in the kth-stage PIC configuration, the input signal of RAKE receiver 3 for user i is ri (k)(t) of (d). When k is equal to 1, the first step is carried out, r i ( 1 ) ( t ) = r ( t ) . RAKE receiver pair ri (k)(t) performing multipath despreading, channel estimation, and then performing multipath combining. The hard decision device 4 in fig. 2 performs hard decision on the multipath combining result of the RAKE receiver 3 to obtain the decision result of the kth stage PIC method. When k is 1, the decision result is the output of the single-user detector. The decision reliability calculator 7 in fig. 2 calculates the reliability coefficient of the hard-decision-maker decision result. The signal regenerator 5 in fig. 2 regenerates the signal of the user i according to the decision result, the reliability coefficient of the decision result and the channel estimation result. The multiple access interference estimation and interference cancellation apparatus 6 in fig. 2 performs multiple access interference estimation and interference cancellation to obtain the output signal of user i in the kth stage PIC structure. This signal is the input signal to the RAKE receiver for user i in a (k +1) stage PIC architecture.
As shown in fig. 3, in the last stage PIC structure of the S-stage PIC method, the RAKE receiver of user i is coupled to the input signal ri (S)And (t) performing multipath despreading, channel estimation and multipath combination. The soft output obtained by multipath combination is the final result of user i in the S-stage PIC method. In the receiver, the result is sent to the decoder of user i for decoding. The final stage PIC structure does not include devices for reliability calculation, signal regeneration, estimation of multiple access interference, interference cancellation and the like.
The double-layer weighting PIC method comprises the following steps:
step 1: in the kth stage PIC architecture, RAKE receiver 3 for user i is coupled to input signal ri (k)And (t) carrying out multipath de-spreading, channel estimation and multipath combination, and carrying out hard decision on the multipath combination result of the RAKE receiver.
Step 2: and calculating the reliability of the decision result of each bit.
In the kth level PIC structure, the result of multipath combining for user i 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> <msub> <mrow> <mo>=</mo> <mi>&mu;</mi> </mrow> <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> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow> </math>
niis white Gaussian noise and follows normal distribution N (0, sigma)i 2);ai (m)Is the mth bit of user i, and has a value of +1 or-1, muiIs a real number associated with channel fading.
Calculating the decision result of the mth bit of the user i according to the following formula a ^ i ( m ) ( k ) = sgn ( Y i ( m ) ( k ) ) Coefficient of reliability fi (m)(k)
<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>tanh</mi> <mo>{</mo> <mi>w</mi> <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> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> </mrow> </math>
w is a positive real number.
And step 3: bit-level weighting of the user signal is reproduced.
The bit-level weighted reproduction signal for user i can be expressed as:
<math> <mrow> <msubsup> <mi>g</mi> <mi>i</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>l</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>L</mi> </munderover> <msub> <mi>A</mi> <mi>il</mi> </msub> <munderover> <mi>&Sigma;</mi> <mrow> <mi>n</mi> <mo>=</mo> <mo>-</mo> <mo>&infin;</mo> <mi>&phi;</mi> </mrow> <mrow> <mo>&infin;</mo> <mi>&phi;</mi> </mrow> </munderover> <msubsup> <mi>f</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mi>p</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <mi>n</mi> <msub> <mi>T</mi> <mi>b</mi> </msub> <mo>-</mo> <msub> <mi>&tau;</mi> <mi>il</mi> </msub> <mo>)</mo> </mrow> <msub> <mi>c</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <msub> <mi>&tau;</mi> <mi>il</mi> </msub> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </mrow> </math>
Ailis thatEstimated value of ailIs shown asChannel fading value, P, of i users' first pathiRepresenting the power of user i.
And 4, step 4: and calculating the multiple access interference.
In the kth-level PIC method, the estimation of the multiple access interference experienced by user i is:
<math> <mrow> <msubsup> <mover> <mi>I</mi> <mo>^</mo> </mover> <mi>i</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </msubsup> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mi>j</mi> <mo>&NotEqual;</mo> <mi>i</mi> </mrow> <mi>K</mi> </munderover> <msubsup> <mi>g</mi> <mi>j</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <mo>&equiv;</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mi>j</mi> <mo>&NotEqual;</mo> <mi>i</mi> </mrow> <mi>K</mi> </munderover> <munderover> <mi>&Sigma;</mi> <mrow> <mi>l</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>L</mi> </munderover> <msub> <mi>A</mi> <mi>il</mi> </msub> <munderover> <mi>&Sigma;</mi> <mrow> <mi>n</mi> <mo>=</mo> <mo>-</mo> <mo>&infin;</mo> </mrow> <mo>&infin;</mo> </munderover> <msubsup> <mi>f</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mi>p</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <mi>n</mi> <msub> <mi>T</mi> <mi>b</mi> </msub> <mo>-</mo> <msub> <mi>&tau;</mi> <mi>il</mi> </msub> <mo>)</mo> </mrow> <msub> <mi>c</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <msub> <mi>&tau;</mi> <mi>il</mi> </msub> <mo>)</mo> </mrow> </mrow> </math>
and 5: and (4) interference cancellation.
Let the weight of the kth-level PIC method be p(k)And (3) carrying out weighted cancellation on the multiple access interference obtained in the step (4) according to the following formula:
r i ( k + 1 ) ( t ) = r ( t ) - p ( k ) I ^ i ( k ) - - - ( 6 )
ri (k+1)(t) is the output signal of user i in the kth stage PIC configuration and is also the input signal to the RAKE receiver of user i in the next stage PIC configuration.
And (5) repeating the steps 1-5, and calculating the PIC of the next stage.
And for the PIC structure at the last stage, only the calculation of multipath de-spreading and multipath combination in the step 1 is carried out. And taking the soft output of the user i obtained by combining the multipath as the final result of the user i in the multi-level PIC structure. In the receiver, the result is sent to the decoder of user i for decoding.
However, by analyzing the calculation formulas (2-6) of the two-layer weighted parallel interference cancellation method, the method can be considered to have the following defects:
1 in formula (6)The operation amount is large for chip-level multiplication;
equation (3) 2 relates to the hyperbolic tangent operation, which cannot be realized.
Disclosure of Invention
The invention aims to provide a simplified method of a double-layer weighted parallel interference cancellation method. The method reduces the complexity of the method while maintaining the performance of the double-layer weighted parallel interference cancellation method. The basic idea is to replace the chip-level multiplication with the bit-level multiplication method as much as possible, so as to reduce the operation amount; a simple judgment method is used for replacing the hyperbolic tangent judgment which can hardly be operated.
The invention is realized in this way, and a simplified method of a double-layer weighting parallel cancellation method comprises the following steps:
a. in the kth stage PIC architecture, RAKE receiver 3 for user i is coupled to input signal ri (k)(t) multipath despreading, channel estimation and multipath combining are performed, and the result of multipath combining is sent to the soft decision device, and the result of channel estimation is sent to the soft decision device 8 and the signal regenerator 5 at the same time, and when k is 1, the input signal r is inputi (k)(t) is the baseband signal r (t) of the received signal; the result of multipath combining for user i 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> <msub> <mrow> <mo>=</mo> <mi>&mu;</mi> </mrow> <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> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow> </math>
niis white Gaussian noise and follows normal distribution N (0, sigma)i 2);ai (m)Is the mth bit of user i, and has a value of +1 or-1, muiIs a real number related to channel fading;
b. the soft decision device makes soft decision for each bit
The soft decision of the multipath combining result of the RAKE receiver of user i is <math> <mrow> <msubsup> <mi>&zeta;</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> <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> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <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> </math> And is
Figure C0113552700102
Satisfies the following formula:
<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> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <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>tanh</mi> <mo>{</mo> <mi>w</mi> <mfrac> <mrow> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <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> </mrow> <msubsup> <mi>&sigma;</mi> <mi>i</mi> <mn>2</mn> </msubsup> </mfrac> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>7</mn> <mo>)</mo> </mrow> </mrow> </math>
w is a positive real number and, a ^ i ( m ) ( k ) = sgn ( Y i ( m ) ( k ) ) , fi (m)(k)is composed of
Figure C0113552700105
The reliability coefficient of (4) is calculated by adopting a piecewise linear judgment method or a table look-up method to replace hyperbolic tangent judgment in the formula (7)i (m)(k)
c. The soft decision device sends the soft decision result of each bit to the soft decision weighting device to weight it according to the following formula,
<math> <mrow> <msubsup> <mi>&rho;</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> <msubsup> <mi>&zeta;</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>&CenterDot;</mo> <msup> <mi>p</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>8</mn> <mo>)</mo> </mrow> </mrow> </math>
p(k)the weight value of the kth-level PIC method is obtained, and the calculation result is sent to a signal regenerator;
d. the signal regenerator obtains the regenerated signal of the user from two input signals according to the following formula, and sends the regenerated signal to the estimation and interference cancellation device of the multiple access interference, and the bit-level weighted regenerated signal of the user i can be expressed as:
<math> <mrow> <msubsup> <mi>g</mi> <mi>i</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>l</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>L</mi> </munderover> <msub> <mi>A</mi> <mi>il</mi> </msub> <munderover> <mi>&Sigma;</mi> <mrow> <mi>n</mi> <mo>=</mo> <mo>-</mo> <mo>&infin;</mo> </mrow> <mo>&infin;</mo> </munderover> <msubsup> <mi>&rho;</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mi>p</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <mi>n</mi> <msub> <mi>T</mi> <mi>b</mi> </msub> <mo>-</mo> <msub> <mi>&tau;</mi> <mi>il</mi> </msub> <mo>)</mo> </mrow> <msub> <mi>c</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <msub> <mi>&tau;</mi> <mi>il</mi> </msub> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> </mrow> </math>
Ailis thatEstimated value of ailIndicating the channel fading value, P, of the ith path of the ith useriRepresents the power of user i;
e. calculation of multiple access interference
In the kth-level PIC method, the estimation of the multiple access interference experienced by user i is:
<math> <mrow> <msubsup> <mover> <mi>I</mi> <mo>^</mo> </mover> <mi>i</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </msubsup> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mi>j</mi> <mo>&NotEqual;</mo> <mi>i</mi> </mrow> <mi>K</mi> </munderover> <msubsup> <mi>g</mi> <mi>j</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>10</mn> <mo>)</mo> </mrow> </mrow> </math>
f. interference cancellation
And e, carrying out interference cancellation on the multiple access interference obtained in the step e according to the following formula:
r i ( k + 1 ) ( t ) = r ( t ) - I ^ i ( k ) - - - ( 11 )
ri (k+1)(t) is the output signal of user i in the kth stage PIC configuration, and is also the input signal of the RAKE receiver of user i in the next stage PIC configuration;
h. repeating the steps a-f, calculating the next-stage PIC, only calculating the step a for the last-stage PIC structure, calculating multipath de-spread and multipath combination for the input signal of the user i, taking the soft output of the user i obtained by multipath combination as the final result of the user i in the multi-stage PIC structure, and in the receiver, sending the result to the decoder of the user i for decoding.
In the step b, the piecewise linear decision is used to replace the hyperbolic tangent decision in the formula (7), i.e. the piecewise linear decision function l (x) is used to approximate the hyperbolic tangent function tanh (x), and the steps are as follows:
defining a piecewise linear decision function L (x)
Since the hyperbolic tangent function is an odd function: tan (-x) ═ tan h (x); definition of
L(-x)=-L(x)
Determining threshold theta
When x → ∞, tanh (x) → 1; therefore, the threshold θ > 0 is set, and when x > θ, l (x) is set to 1;
determining linearization parameter Q
When x is more than or equal to 0 and less than or equal to theta, dividing the interval of [0, theta%]Is divided into Q sub-intervals, the Q sub-interval is [ xq-1,xq], <math> <mrow> <msub> <mi>x</mi> <mi>q</mi> </msub> <mo>=</mo> <mfrac> <mi>q&theta;</mi> <mi>Q</mi> </mfrac> <mo>,</mo> </mrow> </math> x0=0,xQ=θ;
In the qth interval, the expression of L (x) is:
in the interval [ xq-1,xq]L (x) is defined as the point of attachment CqAnd point DqA line segment of (2), wherein CqHas the coordinate of Cq=(xq-1,tanh(xq-1))、DqHas the coordinate Dq=(xq,tanh(xq) Using the line segment C)qDqApproximate interval [ xq-1,xq]Tan h (x) curve of (A), line segment CqDqThe equation of (a) is:
L q ( x ) = tanh ( x q - 1 ) + tanh ( x q ) - tanh ( x q - 1 ) x q - x q - 1 ( x - x q - 1 ) - - - ( 12 )
utilizing L (-x) ═ L (x), interval [ -x [ - ]q,-xq-1]The expression for the above L (x) is:
L(x)=-Lq(-x)
according to the above 5 steps, the piecewise linear decision function l (x) can be obtained, and the expressions of x in four intervals are respectively:
when x > θ, l (x) is 1;
when x is equal to [ x ]q-1,xq]When the temperature of the water is higher than the set temperature, L ( x ) = tanh ( x q - 1 ) + tanh ( x q ) - tanh ( x q - 1 ) x q - x q - 1 ( x - x q - 1 ) ;
when x is equal to [ x ]q-1,xq]When the temperature of the water is higher than the set temperature, L ( x ) = - tanh ( x q - 1 ) + tanh ( x q ) - tanh ( x q - 1 ) x q - x q - 1 ( x + x q - 1 ) ;
when x ∈ [ -xq,-xq-1]When the temperature of the water is higher than the set temperature, L ( x ) = - tanh ( x q - 1 ) + tanh ( x q ) - tanh ( x q - 1 ) x q - x q - 1 ( x + x q - 1 ) ;
when x < - θ, l (x) is-1.
Namely:
Figure C0113552700124
in the step b, a table look-up method may be used to replace the hyperbolic tangent decision method in the formula (7), that is, the decision function t (x) of the table look-up method is used to approximate the hyperbolic tangent function tanh (x), and the derivation process is as follows:
defining the decision function of the table look-up method as T (x)
Since the hyperbolic tangent function is an odd function: tan (-x) ═ tan (x), therefore, the definition
T(-x)=-T(x);
Determining threshold theta
When x → ∞, tanh (x) → 1; therefore, when x > θ, threshold θ > 0 is set, and t (x) is set to 1
Determining linearization parameter Q
When x is more than or equal to 0 and less than or equal to theta, dividing the interval of [0, theta%]Is divided into Q sub-intervals, the Q sub-interval is [ xq-1,xq], <math> <mrow> <msub> <mi>x</mi> <mi>q</mi> </msub> <mo>=</mo> <mfrac> <mi>q&theta;</mi> <mi>Q</mi> </mfrac> <mo>,</mo> </mrow> </math> x0=0,xQ=θ;
The expression of T (x) in the qth cell interval is as follows:
in the interval [ xq-1,xq]Taking the midpoint of the intervalT (x) is defined as follows:
T ( x ) = tanh ( x q - 1 + x q 2 ) - - - ( 14 )
t (-x) ═ T (x) is used to obtain the expression of T (x) in the interval [ - θ, 0 ];
according to the 5 steps, the expressions of a decision function T (X) of a table look-up method when X is in four intervals are respectively as follows:
when x > θ, t (x) is 1;
when x is equal to [ x ]q-1,xq]When the temperature of the water is higher than the set temperature, T ( x ) = tanh ( x q - 1 + x q 2 ) ;
when x ∈ [ -xq,-xq-1]When the temperature of the water is higher than the set temperature, T ( x ) = - tanh ( x q - 1 + x q 2 ) ;
when x < - θ, t (x) ═ 1.
Namely:
Figure C0113552700133
Figure C0113552700134
drawings
FIG. 1: multi-stage structure schematic diagram of double-layer weighted parallel interference cancellation receiver
FIG. 2: PIC structure schematic diagram
FIG. 3: final stage PIC structure schematic diagram
FIG. 4: PIC structure schematic diagram of simplified method of double-layer weighted parallel interference cancellation method
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and specific embodiments.
The multilevel structure of the simplified method is shown in fig. 1, the PIC structure of the simplified method is shown in fig. 4, and the last stage PIC structure of the simplified method is shown in fig. 3.
One embodiment of the invention is:
as shown in fig. 1, the baseband signal r (t) of the received signal enters the first stage PIC architecture 1 in fig. 1 in a parallel manner. As shown in fig. 4, the input signals r (t) entering the PIC architecture in parallel enter the RAKE receiver 3 of each user, respectively. The RAKE receiver 3 despreads the input signal, performs channel estimation, and performs multipath combining. The RAKE receiver 3 supplies the multipath combining result to the soft decision device 8, and supplies the channel estimation result to both the soft decision device 8 and the signal regenerator 5. In the kth level PIC structure, the result of multipath combining for user i 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> <msub> <mrow> <mo>=</mo> <mi>&mu;</mi> </mrow> <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> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow> </math>
niis white Gaussian noise and follows normal distribution N (0, sigma)i 2);ai (m)Is the mth bit of user i, and has a value of +1 or-1. Mu.siIs a real number associated with channel fading.
The soft decision device 8 makes soft decision for the input signal, the soft decision of the multipath combining result of the RAKE receiver of user i is <math> <mrow> <msubsup> <mi>&zeta;</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> <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> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <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> </math> And is
Figure C0113552700142
Satisfies the following formula:
<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> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <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>tanh</mi> <mo>{</mo> <mi>w</mi> <mfrac> <mrow> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <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> </mrow> <msubsup> <mi>&sigma;</mi> <mi>i</mi> <mn>2</mn> </msubsup> </mfrac> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>7</mn> <mo>)</mo> </mrow> </mrow> </math>
wherein,
Figure C0113552700144
is the decision result of the mth bit of user i, a ^ i ( m ) ( k ) = sgn ( Y i ( m ) ( k ) ) , fi (m)(k)is composed of
Figure C0113552700146
The reliability coefficient of (2).
The piecewise linear decision is used for replacing the hyperbolic tangent decision in the original double-layer weighted parallel cancellation method, a piecewise linear decision function is set as L (x), the piecewise linear decision is used for replacing the hyperbolic tangent decision, namely, the piecewise linear decision function L (x) is used for approximating the hyperbolic tangent function tanh (x), and the derivation process of the piecewise linear decision function is as follows:
defining a piecewise linear decision function L (x)
Since the hyperbolic tangent function is an odd function: tan (-x) ═ tan h (x); therefore, define
L(-x)=-L(x)。
Determining threshold theta
The hyperbolic tangent function has the characteristics that: when x → ∞, tanh (x) → 1; therefore, the invention takes the threshold value theta > 0, and when x > theta, let L (x) be 1;
determining linearization parameter Q
When x is more than or equal to 0 and less than or equal to theta, dividing the interval of [0, theta%]Is divided into Q sub-intervals, the Q sub-interval is [ xq-1,xq], <math> <mrow> <msub> <mi>x</mi> <mi>q</mi> </msub> <mo>=</mo> <mfrac> <mi>q&theta;</mi> <mi>Q</mi> </mfrac> <mo>,</mo> </mrow> </math> x0=0,xQ=θ;
In the qth interval, the expression of L (x) is:
in the interval [ xq-1,xq]L (x) is defined as the point of attachment CqAnd point DqThe line segment of (2). Wherein, CqHas the coordinate of Cq=(xq-1,tanh(xq-1))、DqHas the coordinate Dq=(xq,tanh(xq)). By the line segment CqDqApproximate interval [ xq-1,xq]Tan h (x) curve above. Line segment CqDqOfThe process is as follows:
L q ( x ) = tanh ( x q - 1 ) + tanh ( x q ) - tanh ( x q - 1 ) x q - x q - 1 ( x - x q - 1 ) - - - ( 12 )
the expression of the function L (x) of piecewise linear decision is:
Figure C0113552700153
the soft decision 8 feeds the soft decision result to the soft decision weighting means 9. The soft decision weighting means 9 weights the soft decision result by the formula (8) and sends the weighted result to the signal regenerator 5;
<math> <mrow> <msubsup> <mi>&rho;</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> <msubsup> <mi>&zeta;</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>&CenterDot;</mo> <msup> <mi>p</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>8</mn> <mo>)</mo> </mrow> </mrow> </math>
the signal regenerator 5 obtains the regenerated signals of the users from the two input signals according to the following formula and feeds the regenerated signals to the estimation and interference cancellation device 6 of the multiple access interference, and the bit-level weighted regenerated signals of the users i can be expressed as:
<math> <mrow> <msubsup> <mi>g</mi> <mi>i</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>l</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>L</mi> </munderover> <msub> <mi>A</mi> <mi>il</mi> </msub> <munderover> <mi>&Sigma;</mi> <mrow> <mi>n</mi> <mo>=</mo> <mo>-</mo> <mo>&infin;</mo> </mrow> <mo>&infin;</mo> </munderover> <msubsup> <mi>&rho;</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mi>p</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <mi>n</mi> <msub> <mi>T</mi> <mi>b</mi> </msub> <mo>-</mo> <msub> <mi>&tau;</mi> <mi>il</mi> </msub> <mo>)</mo> </mrow> <msub> <mi>c</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <msub> <mi>&tau;</mi> <mi>il</mi> </msub> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> </mrow> </math>
as can be seen from fig. 4, the baseband signal r (t) of the received signal also enters the estimation and interference cancellation device 6 for multiple access interference. The device estimates the multiple access interference suffered by each user according to the regenerated signals of each user input in parallel, and in the kth-level PIC method, the estimation of the multiple access interference suffered by a user i is as follows:
<math> <mrow> <msubsup> <mover> <mi>I</mi> <mo>^</mo> </mover> <mi>i</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </msubsup> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mi>j</mi> <mo>&NotEqual;</mo> <mi>i</mi> </mrow> <mi>K</mi> </munderover> <msubsup> <mi>g</mi> <mi>j</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>10</mn> <mo>)</mo> </mrow> </mrow> </math>
after calculating the multiple access interference of user i, eliminating the multiple access interference suffered by user i from the baseband signal r (t) of the received signal, and performing interference cancellation on the multiple access interference according to the formula (11):
r i ( k + 1 ) ( t ) = r ( t ) - I ^ i ( k ) - - - ( 11 )
ri (k+1)(t) is the output signal of user i in the kth stage PIC configuration and is also the input signal to the RAKE receiver of user i in the next stage PIC configuration.
The signal obtained by eliminating the multiple access interference suffered by the user i 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 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 stage PIC architecture, the parallel input signals enter the RAKE receiver 3 for each user separately, as shown in fig. 3. The RAKE receiver 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 each 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.
Another embodiment of the present invention is:
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 r (t) entering the PIC architecture in parallel enter the RAKE receiver 3 of each user, respectively. The RAKE receiver 3 despreads the input signal, performs channel estimation, and performs multipath combining. The RAKE receiver supplies the multipath combining result to the soft decision unit 8, and supplies the channel estimation result to both the soft decision unit 8 and the signal regenerator 5. In the kth level PIC structure, the result of multipath combining for user i 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> <msub> <mrow> <mo>=</mo> <mi>&mu;</mi> </mrow> <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> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow> </math>
niis white Gaussian noise and follows normal distribution N (0, sigma)i 2);ai (m)Is the mth bit of user i, and has a value of +1 or-1. Mu.siIs a real number associated with channel fading.
The soft decision device 8 makes soft decision for the input signal, the soft decision of the multipath combining result of the RAKE receiver of user i is <math> <mrow> <msubsup> <mi>&zeta;</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> <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> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <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> </math> And is
Figure C0113552700163
Satisfies the following formula:
<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> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <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>tanh</mi> <mo>{</mo> <mi>w</mi> <mfrac> <mrow> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <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> </mrow> <msubsup> <mi>&sigma;</mi> <mi>i</mi> <mn>2</mn> </msubsup> </mfrac> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>7</mn> <mo>)</mo> </mrow> </mrow> </math>
wherein,
Figure C0113552700165
is the decision result of the mth bit of user i, a ^ i ( m ) ( k ) = sgn ( Y i ( m ) ( k ) ) , fi (m)(k)is composed ofThe reliability coefficient of (2).
The method comprises the following steps of replacing hyperbolic tangent judgment in the original double-layer weighted parallel cancellation method by a table look-up method, setting a judgment function of the table look-up method as T (x), and replacing the hyperbolic tangent judgment by the table look-up method, namely approximating the hyperbolic tangent function tanh (x) by the judgment function T (x) of the table look-up method, wherein the derivation process of the judgment function of the table look-up method is as follows:
defining decision function T (x) of table look-up method
Since the hyperbolic tangent function is an odd function: tan (-x) ═ tan (x), therefore, the definition
T(-x)=-T(x);
Determining threshold theta
The hyperbolic tangent function has the characteristics that: when x → ∞, tanh (x) → 1; therefore, in the present invention, threshold θ > 0 is taken, and when x > θ, t (x) is made to be 1;
determining linearization parameter Q
When x is more than or equal to 0 and less than or equal to theta, dividing the interval of [0, theta%]Is equally divided into Q small intervals,the qth interval is [ x ]q-1,xq], <math> <mrow> <msub> <mi>x</mi> <mi>q</mi> </msub> <mo>=</mo> <mfrac> <mi>q&theta;</mi> <mi>Q</mi> </mfrac> <mo>,</mo> </mrow> </math> x0=0,xQ=θ;
The expression of T (x) in the qth cell interval is as follows:
in the interval [ xq-1,xq]Taking the midpoint of the interval
Figure C0113552700171
T (x) is defined as follows:
T ( x ) = tanh ( x q - 1 + x q 2 ) - - - ( 14 )
t (-x) ═ T (x), an expression of T (x) in the interval [ - θ, 0] can be obtained.
The expression of the decision function T (x) of the table look-up method is:
Figure C0113552700173
Figure C0113552700174
Figure C0113552700175
the soft decision 8 feeds the soft decision result to the soft decision weighting means 9. The soft decision weighting means 9 weights the soft decision result by the formula (8) and sends the weighted result to the signal regenerator 5;
<math> <mrow> <msubsup> <mi>&rho;</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> <msubsup> <mi>&zeta;</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>&CenterDot;</mo> <msup> <mi>p</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>8</mn> <mo>)</mo> </mrow> </mrow> </math>
the signal regenerator 5 obtains the regenerated signals of the users from the two input signals according to the following formula and feeds the regenerated signals to the estimation and interference cancellation device 6 of the multiple access interference, and the bit-level weighted regenerated signals of the users i can be expressed as:
<math> <mrow> <msubsup> <mi>g</mi> <mi>i</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>l</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>L</mi> </munderover> <msub> <mi>A</mi> <mi>il</mi> </msub> <munderover> <mi>&Sigma;</mi> <mrow> <mi>n</mi> <mo>=</mo> <mo>-</mo> <mo>&infin;</mo> </mrow> <mo>&infin;</mo> </munderover> <msubsup> <mi>&rho;</mi> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <msubsup> <mover> <mi>a</mi> <mo>^</mo> </mover> <mi>i</mi> <mrow> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </mrow> </msubsup> <mi>p</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <mi>n</mi> <msub> <mi>T</mi> <mi>b</mi> </msub> <mo>-</mo> <msub> <mi>&tau;</mi> <mi>il</mi> </msub> <mo>)</mo> </mrow> <msub> <mi>c</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>-</mo> <msub> <mi>&tau;</mi> <mi>il</mi> </msub> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> </mrow> </math>
as can be seen in fig. 4: the baseband signal r (t) 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 according to the regenerated signals of each user input in parallel, and in the kth-level PIC method, the estimation of the multiple access interference suffered by a user i is as follows:
<math> <mrow> <msubsup> <mover> <mi>I</mi> <mo>^</mo> </mover> <mi>i</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </msubsup> <mo>=</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mi>j</mi> <mo>&NotEqual;</mo> <mi>i</mi> </mrow> <mi>K</mi> </munderover> <msubsup> <mi>g</mi> <mi>j</mi> <mrow> <mo>(</mo> <mi>k</mi> <mo>)</mo> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>10</mn> <mo>)</mo> </mrow> </mrow> </math>
after calculating the multiple access interference of user i, eliminating the multiple access interference suffered by user i from the baseband signal r (t) of the received signal, and performing interference cancellation on the multiple access interference according to the formula (11):
r i ( k + 1 ) ( t ) = r ( t ) - I ^ i ( k ) - - - ( 11 )
ri (k+1)(t) is the output signal of user i in the kth stage PIC configuration and is also the input signal to the RAKE receiver of user i in the next stage PIC configuration.
The signal obtained by eliminating the multiple access interference suffered by the user i 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 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 stage PIC architecture, the parallel input signals enter the RAKE receiver 3 for each user separately, as shown in fig. 3. The RAKE receiver 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 each 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.

Claims (3)

l、一种双层加权并行对消方法的简化方法,其特征在于,所述简化方法包括以下步骤:1, a kind of simplified method of double-layer weighted parallel cancellation method, it is characterized in that, described simplified method comprises the following steps: a.在第k级PIC结构中,用户i的RAKE接收机对输入信号ri (k)(t)进行多径解扩、信道估计和多径合并,并将多径合并结果送给软判决器,将信道估计结果同时送给软判决器和信号再生器,当k=1时,输入信号ri (k)(t)就是接收信号的基带信号r(t),用户i的多径合并结果可以表示为a. In the k-level PIC structure, the RAKE receiver of user i performs multipath despreading, channel estimation and multipath combination on the input signal r i (k) (t), and sends the multipath combination result to the soft decision The device sends the channel estimation result to the soft decision device and the signal regenerator at the same time. When k=1, the input signal r i (k) (t) is the baseband signal r(t) of the received signal, and the multipath combination of user i The result can be expressed as YY ii (( mm )) (( kk )) == &mu;&mu; ii aa ii (( mm )) ++ nno ii -- -- -- (( 22 )) ni为高斯白噪声,服从正态分布N(0,σi 2);ai (m)是用户i的第m个比特,值为+1或-1,μi是与信道衰落相关的实数;n i is Gaussian white noise, subject to normal distribution N(0, σ i 2 ); a i (m) is the mth bit of user i, the value is +1 or -1, μ i is related to channel fading real number; b.软判决器对每比特进行软判决b. The soft decision device makes a soft decision for each bit 用户i的RAKE接收机的多径合并结果的软判决为 &zeta; i ( m ) ( k ) = f i ( m ) ( k ) a ^ i ( m ) ( k ) , 满足下式:The soft decision of the multipath combination result of user i’s RAKE receiver is &zeta; i ( m ) ( k ) = f i ( m ) ( k ) a ^ i ( m ) ( k ) , and Satisfies the following formula: ff ii (( mm )) (( kk )) aa ^^ ii (( mm )) (( kk )) == tanhtanh {{ ww &mu;&mu; ii YY ii (( mm )) (( kk )) &sigma;&sigma; ii 22 }} -- -- -- (( 77 )) w是正实数, a ^ i ( m ) ( k ) = sgn ( Y i ( m ) ( k ) ) , fi (m)(k)的可靠性系数,采用分段线性判决方法或者查表法来代替(7)式中的双曲正切判决,计算ζi (m)(k)w is a positive real number, a ^ i ( m ) ( k ) = sgn ( Y i ( m ) ( k ) ) , f i (m)(k) is Reliability coefficient, adopt piecewise linear judgment method or look-up table method to replace hyperbolic tangent judgment in (7) formula, calculate ζ i (m) (k) ; c.软判决器将每比特软判决结果送给软判决加权装置,按下述公式对其进行加权,c. The soft decision device sends the soft decision result of each bit to the soft decision weighting device, and weights it according to the following formula, &rho;&rho; ii (( mm )) (( kk )) == &zeta;&zeta; ii (( mm )) (( kk )) &CenterDot;&Center Dot; pp (( kk )) -- -- -- (( 88 )) p(k)为第k级PIC方法的权值,并将上述计算结果送给信号再生器;p (k) is the weight of the k-level PIC method, and the above calculation results are sent to the signal regenerator; d.信号再生器按照下述公式由两个输入信号得到用户的再生信号,并将再生信号送入多址干扰的估计和干扰对消装置,用户i的比特级加权再生信号可以表示为:d. The signal regenerator obtains the user's regenerated signal from two input signals according to the following formula, and sends the regenerated signal to the estimation and interference cancellation device of multiple access interference. The bit-level weighted regenerated signal of user i can be expressed as:
Figure C0113552700028
Figure C0113552700028
Ail
Figure C0113552700029
的估计值,ail表示第i个用户第l径的信道衰落值,Pi表示用户i的功率;
Ail is
Figure C0113552700029
The estimated value of , a il represents the channel fading value of the i-th user on the l-th path, and P i represents the power of user i;
e.多址干扰的计算e. Calculation of Multiple Access Interference 第k级PIC方法中,用户i受到的多址干扰的估计为:In the k-level PIC method, the estimation of the multiple access interference received by user i is: II ^^ ii (( kk )) == &Sigma;&Sigma; jj == 11 ,, jj &NotEqual;&NotEqual; ii KK gg jj (( kk )) (( tt )) -- -- -- (( 1010 )) f.干扰对消f. Interference cancellation 按照下式对步骤e中得到的多址干扰进行干扰对消:Perform interference cancellation on the multiple access interference obtained in step e according to the following formula: rr ii (( kk ++ 11 )) (( tt )) == rr (( tt )) -- II ^^ ii (( kk )) -- -- -- (( 1111 )) ri (k+1)(t)是第k级PIC结构中用户i的输出信号,也是下一级PIC结构中用户i的RAKE接收机的输入信号;r i (k+1) (t) is the output signal of user i in the k-level PIC structure, and is also the input signal of the RAKE receiver of user i in the next-level PIC structure; g.重复步骤a-f,进行下一级PIC的计算,对于最后一级PIC结构,只进行步骤a的计算,对用户i的输入信号进行多径解扩、多径合并,将多径合并得到的用户i的软输出作为多级PIC结构中用户i的最终结果,在接收机中,该结果被送给用户i的译码器进行译码。g. Repeat steps a-f to calculate the next level of PIC. For the last level of PIC structure, only perform the calculation of step a, perform multipath despreading and multipath combination on the input signal of user i, and combine the multipath to obtain The soft output of user i is the final result of user i in the multi-stage PIC structure, and in the receiver, the result is sent to the decoder of user i for decoding.
2、如权利要求1所述的简化方法,其进一步特征在于,在步骤b中,所述的分段线性判决代替公式(7)中的双曲正切判决的方法,即用分段线性判决函数L(x)逼近双曲正切判决函数tanh(x),其步骤如下:2, the simplified method as claimed in claim 1, it is further characterized in that, in step b, described piecewise linear decision replaces the method for the hyperbolic tangent decision in formula (7), promptly uses piecewise linear decision function L(x) approximates the hyperbolic tangent decision function tanh(x), and the steps are as follows: ①.定义分段线性判决函数L(x)①. Define the piecewise linear decision function L(x) 由于双曲正切函数是奇函数:tanh(-x)=-tanh(x);定义Since the hyperbolic tangent function is an odd function: tanh(-x)=-tanh(x); definition           L(-x)=-L(x)L(-x)=-L(x) ②.确定阈值θ②. Determine the threshold θ 当x→∞时,tanh(x)→1;因此,取阈值θ>0,当x>θ时,令L(x)=1;When x→∞, tanh(x)→1; therefore, take the threshold θ>0, when x>θ, let L(x)=1; ③.确定线性化参数Q③. Determine the linearization parameter Q 当0≤x≤θ时,将区间[0,θ]等分为Q个小区间,第q个小区间为[xq-1,xq], x q = q&theta; Q , x0=0,xQ=θ;When 0≤x≤θ, the interval [0, θ] is equally divided into Q small intervals, and the qth small interval is [x q-1 , x q ], x q = q&theta; Q , x 0 = 0, x Q = θ; ④.在第q个小区间内L(x)的表达式为:④. The expression of L(x) in the qth cell interval is: 在区间[xq-1,xq],将L(x)定义为连接点Cq和点Dq的线段,其中,Cq的坐标为Cq=(xq-1,tanh(xq-1))、Dq的坐标为Dq=(xq,tanh(xq)),用该线段CqDq近似区间[xq-1,xq]上的tanh(x)曲线,线段CqDq的方程为:In the interval [x q-1 , x q ], define L(x) as the line segment connecting point C q and point D q , where the coordinates of C q are C q =(x q-1 , tanh(x q -1 )), the coordinates of D q are D q = (x q , tanh(x q )), use this line segment C q D q to approximate the tanh(x) curve on the interval [x q-1 , x q ], The equation of line segment C q D q is: LL qq (( xx )) == tanhtanh (( xx qq -- 11 )) ++ tanhtanh (( xx qq )) -- tanhtanh (( xx qq -- 11 )) xx qq -- xx qq -- 11 (( xx -- xx qq -- 11 )) -- -- -- (( 1212 )) ⑤.利用L(-x)=-L(x),区间[-xq,-xq-1]上L(x)的表达式为:⑤. Using L(-x)=-L(x), the expression of L(x) on the interval [-x q ,-x q-1 ] is:           L(x)=-Lq(-x)L(x)=-L q (-x) ⑥.根据以上5个步骤,可以得到分段线性判决函数L(x)当x在四个区间时的表达式分别为:⑥. According to the above 5 steps, the expressions of the piecewise linear decision function L(x) when x is in the four intervals can be obtained as follows: 当x>θ时,L(x)=1;When x>θ, L(x)=1; 当x∈[xq-1,xq]时, L ( x ) = tanh ( x q - 1 ) + tanh ( x q ) - tanh ( x q - 1 ) x q - x q - 1 ( x - x q - 1 ) ; When x ∈ [x q-1 , x q ], L ( x ) = tanh ( x q - 1 ) + tanh ( x q ) - tanh ( x q - 1 ) x q - x q - 1 ( x - x q - 1 ) ; 当x∈[-xq,-xq-1]时, L ( x ) = - tanh ( x q - 1 ) + tanh ( x q ) - tanh ( x q - 1 ) x q - x q - 1 ( x + x q - 1 ) ; When x∈[ -xq ,-xq -1 ], L ( x ) = - tanh ( x q - 1 ) + tanh ( x q ) - tanh ( x q - 1 ) x q - x q - 1 ( x + x q - 1 ) ; 当x<-θ时,L(x)=-1。When x<-θ, L(x)=-1. 3、如权利要求1所述的简化方法,其进一步特征在于,在步骤b中,所述的查表法代替公式(7)中的双曲正切判决的方法,即用查表法的判决函数T(x)逼近双曲正切函数tanh(x),其步骤如下:3, simplified method as claimed in claim 1, it is further characterized in that, in step b, described table look-up method replaces the method for the hyperbolic tangent judgment in formula (7), promptly uses the decision function of table look-up method T(x) approximates the hyperbolic tangent function tanh(x), the steps are as follows: ①.定义查表法的判决函数T(x)①. Define the decision function T(x) of the look-up table method 由于双曲正切函数是奇函数:tanh(-x)=-tanh(x),所以,定义Since the hyperbolic tangent function is an odd function: tanh(-x)=-tanh(x), so define        T(-x)=-T(x);T(-x)=-T(x); ②.确定阈值θ②. Determine the threshold θ 当x→∞时,tanh(x)→1;因此,取阈值θ>0,当x>θ时,令T(x)=1When x→∞, tanh(x)→1; therefore, take the threshold θ>0, when x>θ, set T(x)=1 ③.确定线性化参数Q③. Determine the linearization parameter Q 当0≤x≤θ时,将区间[0,θ]等分为Q个小区间,第q个小区间为[xq-1,xq], x q = q&theta; Q , x0=0,xQ=θ;When 0≤x≤θ, the interval [0, θ] is equally divided into Q small intervals, and the qth small interval is [x q-1 , x q ], x q = q&theta; Q , x 0 = 0, x Q = θ; ④.在第q个小区间内T(x)的表达式为:④. The expression of T(x) in the qth cell interval is: 在区间[xq-1,xq],取区间的中点
Figure C0113552700044
将T(x)定义如下:
In the interval [x q-1 , x q ], take the midpoint of the interval
Figure C0113552700044
Define T(x) as follows:
TT (( xx )) == tanhtanh (( xx qq -- 11 ++ xx qq 22 )) -- -- -- (( 1414 )) ⑤.利用T(-x)=-T(x),可以得到区间[-θ,0]上T(x)的表达式;⑤. Using T(-x)=-T(x), the expression of T(x) on the interval [-θ, 0] can be obtained; ⑥.根据上述5个步骤,可以得到查表法的判决函数T(x)当X在四个区间时的表达式分别为:⑥. According to the above 5 steps, the expressions of the decision function T(x) of the look-up table method can be obtained when X is in four intervals: 当x>θ时,T(x)=1;When x>θ, T(x)=1; 当x∈[xq-1,xq]时, T ( x ) = tanh ( x q - 1 + x q 2 ) ; When x ∈ [x q-1 , x q ], T ( x ) = tanh ( x q - 1 + x q 2 ) ; 当x∈[-xq,-xq-1]时, T ( x ) = - tanh ( x q - 1 + x q 2 ) ; When x∈[ -xq ,-xq -1 ], T ( x ) = - tanh ( x q - 1 + x q 2 ) ; 当x<-θ时,T(x)=-1。When x<-θ, T(x)=-1.
CNB011355271A 2001-10-09 2001-10-09 A Simplified Method of Two-layer Weighted Parallel Interference Cancellation Method Expired - Fee Related CN1155189C (en)

Priority Applications (6)

Application Number Priority Date Filing Date Title
CNB011355271A CN1155189C (en) 2001-10-09 2001-10-09 A Simplified Method of Two-layer Weighted Parallel Interference Cancellation Method
PCT/CN2002/000711 WO2003032545A1 (en) 2001-10-09 2002-10-09 A method of double weighting parallel interference cancellation
EP02772004A EP1443694B1 (en) 2001-10-09 2002-10-09 A method of double weighting parallel interference cancellation
DE60218329T DE60218329T2 (en) 2001-10-09 2002-10-09 Method for parallel interference suppression with double weighting
US10/492,096 US7321581B2 (en) 2001-10-09 2002-10-09 Method of double weighting parallel interference cancellation
AT02772004T ATE354894T1 (en) 2001-10-09 2002-10-09 METHOD FOR PARALLEL INTERFERENCE SUPPRESSION WITH DOUBLE WEIGHTING

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB011355271A CN1155189C (en) 2001-10-09 2001-10-09 A Simplified Method of Two-layer Weighted Parallel Interference Cancellation Method

Publications (2)

Publication Number Publication Date
CN1411189A CN1411189A (en) 2003-04-16
CN1155189C true CN1155189C (en) 2004-06-23

Family

ID=4673181

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB011355271A Expired - Fee Related CN1155189C (en) 2001-10-09 2001-10-09 A Simplified Method of Two-layer Weighted Parallel Interference Cancellation Method

Country Status (6)

Country Link
US (1) US7321581B2 (en)
EP (1) EP1443694B1 (en)
CN (1) CN1155189C (en)
AT (1) ATE354894T1 (en)
DE (1) DE60218329T2 (en)
WO (1) WO2003032545A1 (en)

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7386057B2 (en) * 2003-02-20 2008-06-10 Nec Corporation Iterative soft interference cancellation and filtering for spectrally efficient high-speed transmission in MIMO systems
GB2403104B (en) * 2003-06-16 2006-06-14 Inmarsat Ltd Communication method and apparatus
JP4890473B2 (en) * 2005-01-05 2012-03-07 エイティーシー・テクノロジーズ,リミテッド・ライアビリティ・カンパニー Adaptive beamforming with multi-user detection and interference reduction in satellite communication systems and methods
US8223904B2 (en) * 2005-08-22 2012-07-17 Qualcomm Incorporated Multiple hypothesis decoding
US20070217429A1 (en) * 2006-03-14 2007-09-20 International Business Machines Corporation Method and apparatus for automatic power saving mode insertion when an unknown or an offensive receiver detected in a wireless access system
CN101277279B (en) * 2007-03-30 2010-12-08 中兴通讯股份有限公司 A serial interference elimination method and device for a multi-antenna system
US8238499B2 (en) * 2008-08-29 2012-08-07 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for low-complexity interference cancellation in communication signal processing
US8494029B2 (en) * 2009-05-04 2013-07-23 Qualcomm Incorporated Method and system for multi-user detection in the presence of multiple spreading factors
US8615030B2 (en) * 2009-05-04 2013-12-24 Qualcomm Incorporated Method and system for multi-user detection using two-stage processing
US8331504B2 (en) * 2009-05-04 2012-12-11 Qualcomm Incorporated Method and system for multi-user interference cancellation
US8494098B2 (en) 2009-05-04 2013-07-23 Qualcomm Incorporated Method and system for inter-cell interference cancellation
US8451963B2 (en) * 2009-06-09 2013-05-28 Qualcomm Incorporated Method and system for interference cancellation
CN102118180B (en) * 2011-01-04 2014-01-01 京信通信系统(中国)有限公司 A Parallel Interference Cancellation Method for CDMA Communication System
CN102201835B (en) * 2011-05-16 2016-09-07 中兴通讯股份有限公司 A kind of interference eliminates method, device and the interference cancelling system that multipath selects
US9042428B2 (en) * 2012-05-04 2015-05-26 Telefonaktiebolaget L M Ericsson (Publ) Efficient frequency domain (FD) MMSE equalization weight updates in a multi-stage parallel interference cancellation receiver
CN107749771B (en) * 2017-09-18 2019-11-12 哈尔滨工程大学 A Parallel Interference Elimination Algorithm Based on Likelihood Feedback

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2279851B (en) * 1993-07-01 1997-10-01 Roke Manor Research Threshold cancellation means for use in digital mobile radio networks
US5644592A (en) * 1995-04-24 1997-07-01 California Institute Of Technology Parallel interference cancellation for CDMA applications
JP3305639B2 (en) 1997-12-24 2002-07-24 株式会社エヌ・ティ・ティ・ドコモ RAKE receiver in direct spread CDMA transmission system
US6154443A (en) 1998-08-11 2000-11-28 Industrial Technology Research Institute FFT-based CDMA RAKE receiver system and method
DE60017219T2 (en) 1999-05-24 2005-12-15 Texas Instruments Inc., Dallas Spread spectrum system with interference suppression
KR100343773B1 (en) * 1999-06-28 2002-07-19 한국전자통신연구원 Apparatus and method of partial parallel interference cancellation system for CDMA
FI20000158A0 (en) 2000-01-27 2000-01-27 Nokia Networks Oy Procedure and recipient in a communication system
CN1138369C (en) 2000-12-06 2004-02-11 华为技术有限公司 An Interference Suppression Method for Code Division Multiple Access System
US6931052B2 (en) * 2001-11-16 2005-08-16 Nortel Networks Limited Symbol-directed weighting in parallel interference cancellation

Also Published As

Publication number Publication date
CN1411189A (en) 2003-04-16
US7321581B2 (en) 2008-01-22
EP1443694A4 (en) 2005-03-23
EP1443694A1 (en) 2004-08-04
DE60218329D1 (en) 2007-04-05
EP1443694B1 (en) 2007-02-21
ATE354894T1 (en) 2007-03-15
US20040246927A1 (en) 2004-12-09
WO2003032545A1 (en) 2003-04-17
DE60218329T2 (en) 2007-11-15

Similar Documents

Publication Publication Date Title
CN1155189C (en) A Simplified Method of Two-layer Weighted Parallel Interference Cancellation Method
CN1172472C (en) Receiving processing method and receiving device in mobile communication system
CN1287531C (en) Adaptive blanced device and its program
CN1120595C (en) Coherent detecting method using pilot symbol and tentatively determined data symbol, mobile communication receiver and interference removing apparatus using coherent detecting method
CN1617534A (en) OFDM receiver
CN1151669A (en) Signal judgment, receiving device and signal judgment, channel state estimation method
CN1860712A (en) Iterative decoding and equalingzing method for hgih speed communications on multiple antenna channels during transmission and reception
CN1684450A (en) Receiver,transmitter and radio communication system and channel estimation method
CN1263660A (en) Interference cancellation device and interference cancellation method
CN1913388A (en) Reception device, communication control method in mobile communication system
CN100347967C (en) Period Adaptive Receiver for Direct Sequence-CDMA Signals
CN1929353A (en) Method and device for channel estimation of common-frequency cell
CN1992581A (en) Partial parallel interference cancellation method combined with error retransmission and receiver
CN1599259A (en) Space hour coding method and corresponeded transmitting method, transmitter and communication system
CN1188975C (en) Space-time iterative multiuser detecting algorithm based on soft sensitive bit and space grouping
CN1164045C (en) Interference suppression transmission device and interference suppression transmission method
CN1155180C (en) Double-weighing parallel interference-counteracting algorithm
CN1149753C (en) Receiving device and replica signal generating method
CN1905383A (en) Shared frequency cell channel estimating apparatus and method
CN1225855C (en) Method and apparatus for two-level weight and parallel disturbance cancellation under MQAM modulation
CN1705242A (en) Grouping vertical layered space-time detecting method and device
CN1913390A (en) Method of implementing interference removing based on cholesky decomposition
CN1154272C (en) Receiving method based on interference elimination
CN1194492C (en) Multi-user Detection Method of Base Station in Code Division Multiple Access Mobile Communication System
CN1716814A (en) Multiple code receiver of multiple input and multiple output under broad band channel

Legal Events

Date Code Title Description
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
DD01 Delivery of document by public notice

Addressee: Huawei Technology Co Ltd

Document name: Notification to Pay the Fees

DD01 Delivery of document by public notice
DD01 Delivery of document by public notice

Addressee: Huawei Technologies Co., Ltd.

Document name: Notification of Termination of Patent Right

CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20040623

Termination date: 20161009