Scaling using gain factors for use in data detection for wireless code division multiple access communication systems

[0001] This application is a continuation of U.S. patent application Ser. No. 10/327,299, filed Dec. 20, 2002 now U.S. Pat. No. 6,928,104, which in turn claims priority from U.S. provisional application No. 60/396,823, filed Jul. 18, 2002, which are incorporated by reference as if fully set forth herein.

[0002] This invention generally relates to wireless code division multiple access (CDMA) communication systems. In particular, the invention relates to scaling using gain factors during data detection in such systems.

[0003] In wireless CDMA communication systems, multiple communications are transmitted over a shared spectrum. The individual communications are distinguished by a code used to transmit each communication. In frequency division duplex (FDD) CDMA systems, uplink and downlink communications are separated by frequency spectrum. In time division duplex (TDD) CDMA or time division synchronous code division multiple access (TD-SCDMA) systems, uplink and downlink communications are separated by time.

[0004] One approach to receive communications in such systems is referred to as single user detection (SUD). In general, SUD is typically performed in a two part process. First, the received signal is equalized to compensate for the response of the wireless channel. Second, the equalized signal is despread using the codes of the user or users. SUD is typically utilized when all communications experience a same channel response. The preferred uses for the SUD is in the downlink and in the uplink when a single user monopolizes a frequency spectrum (in FDD) or time slot (in TDD or TD-SCDMA). Another approach to receive communications in such systems is referred to as multi-user detection (MUD). In MUD, the data from all users data is estimated simultaneously.

[0005] In such systems, the individual communications, transmitted simultaneously, may have varying transmission power levels. To illustrate, in the uplink, a single User Equipment (UE) may transmit multiple coded composite transport channels (CCTrCHs). Each CCTrCH may have a differing quality of service (QOS), requiring a different transmit power level to reach the required QOS. In the downlink, each UE in addition to each individual UE's CCTrCH may require a differing transmission power level.

[0006] Due to the varying power levels between communications, the orthogonality between the received codes is degraded, reducing the performance of the data detection. Accordingly, it is desirable to have alternate approaches to data detection.

[0007] Data from a plurality of communications is transmitted in a code division multiple access communication system. The transmitted communications are received at a receiver and converted into a baseband signal. The baseband signal is sampled to produce a received vector. An estimating device estimates channel responses as a channel response matrix and estimates a noise variance of the received communications. The noise variance is then scaled using a scaling factor derived from at least one gain factor determined for at least one received communication. The received communications are then equalized using the channel response matrix and the scaled noise variance to produce a spread data vector. The spread data vector is despread in order to detect data transmitted as part of the received communications. In an alternate embodiment, the channel response matrix is scaled instead of the noise variance.

[0016] FIGS. 1A, for the uplink, and 1B, for the downlink, are simplified diagrams of a transmitter and a receiver using gain factor scaling in a UE and base station. In FIG. 1A at the UE 20, data is spread by a modulation and spreading device 24 using the appropriate codes and modulated, such as by using quadrature phase shift keying (QPSK), M-ary quadrature amplitude modulation (QAM) or other modulation scheme. The spread signal is modulated to radio frequency by a modulation device 26 and radiated by an antenna 28 or antenna array.

[0017] After passing through the wireless air interface 30, an antenna 32 or antenna array at the base station 22 receives the communications. The received communications are converted to a baseband signal, such as by a demodulation device 34. A sampling device 36 samples the baseband signal, such as at the chip rate or a multiple of the chip rate, to produce a received vector r. A channel estimation device 38 estimates the channel responses for the received communications, as a channel response matrix H. All of the H matrixes in the following equations are presumed to be normalized. The channel estimation is typically performed using a reference signal, such as the midambles of communication bursts or a pilot code. The channel estimation device 38 also preferably estimates a variance of the noise σ², although the estimated noise variance may be derived from other sources. The noise variance σ² is scaled by a scaling device, such as by a factor of 1/P. Preferred derivations for the value of P are explained in detail later. Although the preferred embodiment scales the noise variance σ², the channel response matrix H may be scaled by a scaling device 61 instead of the noise variance, producing H′, as shown in FIG. 1C. One approach to derive H′ is to multiply H by the square root of P, H′=H·√{square root over (P)}. For such an H′, H′^HH′ equals PH^HH

[0018] A channel equalizer 42 uses the channel response matrix H and the scaled noise variance σ²/P to produce a spread data vector s. Preferably, the spread data vector s is scaled by a scaling device 64, such as by a factor 1/P Λ^H, although this scaling device 64 may not be used. (·)^H is the conjugate transpose operation. When the scaling device 64 is not used, the spread data vector s is passed directly to the despreader 46. Λ^H is a diagonal matrix, which preferred derivations are explained in detail later. The despreader 46 despreads the scaled spread data or spread data using the codes C of the communications to recover the data d.

[0019] In FIG. 1B at the base station 22, data is spread and modulated by multiple modulation and spreading devices 48₁ to 48_N for transmission to one or multiple UEs 20. The spread signals are combined by a combiner 50 and modulated to radio frequency by a modulator 52. The modulated signal is radiated by an antenna 32 or antenna array.

[0020] At a UE 20, an antenna 28 or antenna array receives the communications sent through the wireless air interface 30. The received communications are demodulated by a demodulator 54 to baseband. A sampling device 56 samples the baseband signal to produce a received vector r. A channel estimation device 58 estimates the channel response matrix H and the noise variance σ². The noise variance is scaled by a scaling device 60, such as by a factor of 1/P. Alternately, as shown in FIG. 1C, the channel response matrix H can be scaled. A channel equalizer 62 processes the samples using the channel response matrix H and scaled noise variance to produce a spread data vector s. The spread data vector s is scaled by a scaling device 64, such as by a factor 1/P Λ^H, although scaling device 64 may not be used. When the scaling device 64 is not used, the spread data vector s is passed directly to the despreader 66. The despreader 66 despreads either the scaled or unscaled spread data using the codes C of that UE's communications to recover the data of the UE's communications. Typically, if some of the received communications are for other UEs 20, the codes of those communications are not used to despread the other UEs' data.

[0021] Discussion of preferred algorithms for scaling in data detection are explained in conjunction with a preferred wideband CDMA (WCDMA) TDD system, although the invention is applicable to other systems, such as FDD/WCDMA, TD-SCDMA, CDMA 2000 as well as others.

[0022] The received vector r can be modeled per Equation 1.
r=AΛd+n  Equation 1

[0023] A is the normalized symbol response matrix. Λ is the signal amplitude gain matrix and is a diagonal matrix. n is the noise vector.

[0024] When K codes are transmitted at the same time (within the same timeslot), A=[A₁, . . . , A_K] is the normalized symbol response matrix of the K codes. Λ is preferably of size K·N_S.N_S is the number of data symbols in a data field. d=[d₁, . . . , d_K] is the data sequence carried by the K codes. Λ is per Equation 2.

[0025] $\begin{array}{cc}\Lambda =\left[\begin{array}{cccc}{\Lambda }_1& & & \\ & {\Lambda }_2& & \\ & & ⋰& \\ & & & {\Lambda }_K\end{array}\right]& \mathrm{Equation}2\end{array}$

[0026] Each amplitude gain sub-matrix for a k^th code of the K codes, Λ_k, is a diagonal matrix of size of N_s with all the diagonals equal to the signal amplitudes, g_k, of the k^th code, per Equation 3.

[0027] $\begin{array}{cc}{\Lambda }_k=\left[\begin{array}{cccc}{g}_k& & & 0\\ & g_k& & \\ & & ⋰& \\ 0& & & g_k\end{array}\right]& \mathrm{Equation}3\end{array}$

[0028] To estimate data {circumflex over (d)} in joint detection, a minimum mean square error (MMSE) approach per Equation 4 and 5 may be used.
{circumflex over (d)}=Λ⁻¹(A^HA+Λ⁻²σ²I)⁻¹A^Hr  Equation 4
{circumflex over (d)}=Λ⁻¹A^H(AA^H+Λ⁻²σ²I)⁻¹r  Equation 5
{circumflex over (d)} is the estimated data vector. Equation 4 and 5 are interchangeable by the matrix inversion lemma.

[0029] When all the communications pass through the same propagation channel H, the symbol response matrix A is per Equation 6.
A=[A₁, . . . , A_K]=[HC₁, . . . , HC_K]=H[C₁, . . . , C_K]=HC  Equation 6

[0030] H is preferably of size Q·N_s+W−1 by Q·N_s. N_s is the number of data symbols per data block that the data detection is performed. Q is the spreading factor of the communications and W is the length of the delay spread. C is preferably of size Q·N_s by K·N_s.

[0031] The received signal for a common channel can be modeled per Equation 7.
r=HCΛd+n  Equation 7

[0032] Applying a MMSE solution to determine d is per Equation 8.
{circumflex over (d)}=Λ^HC^HH^H(HMH^H+σ²I)⁻¹r  Equation 8

[0033] The matrix M is the code correlation matrix per Equation 9.
M=CGC^H  Equation 9

[0034] M is preferably of size Q·N_s. The matrix G is the code power matrix, per Equation 10.

[0035] $\begin{array}{cc}G={\mathrm{\Lambda \Lambda }}^H=\left[\begin{array}{cccc}{\Lambda }_1^2& & & \\ & {\Lambda }_2^2& & \\ & & ⋰& \\ & & & {\Lambda }_K^2\end{array}\right]& \mathrm{Equation}10\end{array}$

[0036] The code correlation matrix M is a diagonal dominant matrix with all the diagonals having a same value, such as P. One value for P is the total power of all bursts per Equation 11.

[0037] $\begin{array}{cc}P=\sum _{k=1}^K{g}_k^2& \mathrm{Equation}11\end{array}$

[0038] In general, P is referred to as the code power scale factor. By ignoring the edge effects of the non-diagonal part of the matrix, an approximation for M, {circumflex over (M)}, is per Equation 12.
{circumflex over (M)}=P·I  Equation 12

[0039] By substituting Equation 12 into Equation 8, Equation 13 or 14 results.

[0040] $\begin{array}{cc}\underset{\_}{\hat{d}}=\frac{1}{P}{\Lambda }^H{C}^H{H^H\left({\mathrm{HH}}^H+\frac{{\sigma }^2}{P}I\right)}^{-1}\underset{\_}{r}& \mathrm{Equation}13\\ \underset{\_}{\hat{d}}=\frac{1}{P}{\Lambda }^H{C^H\left(H^{H}H+\frac{{\sigma }^2}{P}I\right)}^{-1}{H}^H\underset{\_}{r}& \mathrm{Equation}14\end{array}$

[0041] Equation 13 and 14 are interchangeable by the matrix inversion lemma.

[0042] Equation 14 can be broken down in two stages per Equations 15 and 16.

[0043] $\begin{array}{cc}\underset{\_}{\hat{s}}={\left(H^{H}H+\frac{{\sigma }^2}{P}I\right)}^{-1}{H}^H\underset{\_}{r}& \mathrm{Equation}15\\ \underset{\_}{\hat{d}}=\frac{1}{P}{\Lambda }^H{C}^H\underset{\_}{\hat{s}}& \mathrm{Equation}16\end{array}$

[0044] In Equation 15, the channel equalization is performed. Preferably, the scaling in Equation 15 is performed by scaling devices 40, 60. Preferably, to reduce the complexity in solving equation 15 by the channel equalizer 42, 62, an approximate Cholesky or fast Fourier transform based solution is used, although other techniques may be used.

[0045] In Equation 16, the despreading is performed. The scaling,

[0046] $\frac{1}{P}{\Lambda }^H,$
during or prior to despreading may or may not be performed. Such scaling tends to improve the decoding performance of turbo-encoded signals.

[0047] By careful selection of the code power scaling factor, the overall performance of the receiver can be improved. The performance of the receiver can be modeled by Equation 17.
ŝ=s+I_f+w  Equation 17

[0048] I_f represents the residual interference after equalization due to the incomplete equalization of channel distortion that results in the inter-symbol interference (ISI) and multiple access interference (MAI). ŝ_est of Equation 18 represents the impact of I_f on the estimated spread data.

[0049] $\begin{array}{cc}{\underset{\_}{\hat{s}}}_{\mathrm{est}}=\underset{\_}{\hat{s}}+{\underset{\_}{I}}_f={\left(H^{H}H+\frac{{\sigma }^2}{P}I\right)}^{-1}{H}^{H}H\underset{\_}{s}& \mathrm{Equation}18\end{array}$

[0050] w represents the noise after equalization and is per Equation 19.

[0051] $\begin{array}{cc}\underset{\_}{w}={\left(H^{H}H+\frac{{\sigma }^2}{P}I\right)}^{-1}{H}^H\underset{\_}{n}& \mathrm{Equation}19\end{array}$

[0052] The interference I_f and noise w cannot be reduced simultaneously. Decreasing one tends to increase the other. For a large P, the residual interference is reduced, but the noise is increased. For a small P, the noise is reduced but at the cost of increased residual interference.

[0053] Two preferred embodiments for power scaling, determining P, are total power scaling and selective scaling. In total power scaling, P is determined per Equation 20.

[0054] $\begin{array}{cc}P=P_T=K·g_{\mathrm{avg}}^2=\sum _{m,n=1}^{M,N}{K}_{m,n}{g}_{m,n}^2& \mathrm{Equation}20\end{array}$

[0055] M is the number of UEs and N is the number of CCTrCHs per UE. K_m,n is the total number of codes in the n^th CCTrCH of the m^th UE and g_m,n is the gain factor for the n^th CCTrCH of the m^th UE.

[0056] Total power scaling tends to optimize performance over all connections equally and not to optimize any connection over the others. To illustrate, the code power matrix G is per Equation 21.

[0057] $\begin{array}{cc}G=\left[\begin{array}{cccccccc}{\Lambda }_{1,1}^2& & & & & & & \\ & ⋰& & & & & & \\ & & {\Lambda }_{1,N}^2& & & & & \\ & & & ⋰& & & & \\ & & & & ⋰& & & \\ & & & & & {\Lambda }_{M,1}^2& & \\ & & & & & & ⋰& \\ & & & & & & & {\Lambda }_{M,N}^2\end{array}\right]& \mathrm{Equation}21\end{array}$

[0058] Λ_m,n² is the code power sub-matrix corresponding to the n^th CCTrCH of the m^th UE. The code power g_m,n² in the matrix G and in G's sub-matrix can be approximated by one single common power in a least square error approach by minimizing Equation 22.

[0059] $\begin{array}{cc}{x}_{\mathrm{lse}}=\arg \underset{x}{\min }\sum _{m,n}^{M,N}{\left(x-g_{m,n}^2\right)}^2& \mathrm{Equation}22\end{array}$

[0060] The solution of least-square-error-power is the average power of all codes per Equation 23.

[0061] $\begin{array}{cc}{g}_{\mathrm{avg}}^2=\frac{1}{K}\sum _{m=1,n=1}^{M,N}{K}_{m,n}{g}_{m,n}^2& \mathrm{Equation}23\end{array}$

[0062] K is the total number of codes transmitted in the time period of interest for the system and is per Equation 24.

[0063] $\begin{array}{cc}K=\sum _{m=1,n=1}^{M,N}{K}_{m,n}& \mathrm{Equation}24\end{array}$

[0064] The code power scale factor is determined by Equation 25.

[0065] $\begin{array}{cc}P=K·g_{\mathrm{avg}}^2=\sum _{m,n=1}^{M,N}{K}_{m,n}{g}_{m,n}^2& \mathrm{Equation}25\end{array}$

[0066] g_avg² is the average code power. A measure of the mismatch between code powers Δ_m,n is per Equation 26.
Δ_m,n=|g_m,n²−g_avg²|  Equation 26

[0067] As illustrated, total power scaling is optimal over all connections by minimizing the code power mismatch over all connections.

[0068] In selective code power scaling, P is determined to optimize a particular UE connection. To optimize a j^th UE's connection, Equation 27 is used.
P=α_jP_T  Equation 27

[0069] α_j is a factor for the j^th UE that is based on the interference and noise level. α_j should be adaptively adjusted based on the interference and noise level for optimum performance of the data detection. Two preferred equations for deriving α_j are per Equations 28 and 29.

[0070] $\begin{array}{cc}{\alpha }_j=\frac{\frac{K}{K_j}\sum _{i=1}^I{K}_{i,j}{g}_{i,j}^2}{P_T}=\frac{K}{K_j}\sum _{i=1}^I{\alpha }_{i,j}& \mathrm{Equation}28\\ {\alpha }_j=\frac{\frac{1}{K_j}\sum _{i=1}^I{K}_{i,j}{g}_{i,j}^2}{P_T}=\frac{1}{K_j}\sum _{i=1}^I{\alpha }_{i,j}& \mathrm{Equation}29\end{array}$

[0071] K_j is the total number of codes carried by that j^th UE. K_i,j is the number of codes for the i^th CCTrCH of the j^th UE. g_i,j is the gain factor for the i^th CCTrCH for the j^th UE. I is the number of CCTrCHs of the UE.

[0072] Selective code power scaling may also be used to optimize a particular CCTrCH of a UE. To optimize the i^th CCTrCH of the j^th UE, Equation 30 is used.
P=α_i,jP_T  Equation 30

[0073] α_i,j is a factor for the i^th CCTrCH of the j^th UE.

[0074] Selective code power scaling may also be used to optimize a particular code of a particular CCTrCH of a UE. To optimize the n^th code of the i^th CCTrCH of the j^th UE, Equation 31 is used.
P=α_n,i,jP_T  Equation 31

[0075] α_n,i,j is a factor for the n^th code of the i^th CCTrCH of the j^th UE. Two preferred equations for determining α_n,i,j are Equations 32 and 33.

[0076] $\begin{array}{cc}{\alpha }_{n,i,j}=\frac{K{g}_{i,j}^2}{P_T}& \mathrm{Equation}32\\ {\alpha }_{n,i,j}=\frac{g_{i,j}^2}{P_T}& \mathrm{Equation}33\end{array}$

[0077] Two special cases of selective code power scaling are maximum code power and minimum code power scaling. In maximum code power scaling, the maximum code power is used for the scaling. Maximum code power scaling is most applicable when the over-scaling of code power degrades less than the under-scaling of code power. In minimum code power scaling, the minimum code power is used for scaling. Minimum code power scaling is most applicable when the under-scaling of code power degrades less than the over-scaling of code power.

[0078] FIG. 2 is one flow chart for applying code power scaling. One UE or UE's CCTrCH is selected for optimum performance, Step 70. If SUD is being performed at the UE the selected CCTrCH is typically with the highest required QOS. If SUD is being performed at the base station, the UE of interest may be the furthest UE, to reduce that UE's transmission power level. Alternatively, the UE or UE CCTrCH of interest may be the UE or UE CCTrCH requiring the highest quality of service. For the UEIUE CCTrCH of interest, the gain factor(s) for that UE/CCTrCH is determined, Step 72. The code scaling factor P is determined from the gain factor(s). SUD is performed using the determined P, Step 74. The code scaling factor P is used in the data detection, such as by scaling devices 40, 44, 60, 64, Step 76. As a result, that UE's/UE CCTrCH's performance is optimized.

[0079] FIG. 3 is a flow chart for total power scaling. Total power scaling is preferably performed if all the CCTrCHs at a UE or base station require the same QOS. Additionally, total power scaling may be applied to reduce the complexity by eliminating the need to optimize the SUD for a particular UE. The gain factors of all UE codes are determined, Step 78, and the resulting code scaling factor P is determined, Step 80. The SUD is performed using the determined P, Step 82. This approach equally optimizes all codes.

[0080] In some cases P is not necessarily determined from the gain factors. For instance, when a common midamble is used in a downlink allocation, the estimated channel response, H′, has the total power information. Accordingly, the total power is embedded in the estimated channel response at the output of the channel estimator, i.e. H′=H·√{square root over (P)}. In this alternative, gain scaling is not required and steps 78 and 80 of FIG. 3 in this situation can be avoided.

[0081] FIG. 4 is a flow chart of iterative selective code power scaling. To optimize the performances, each UE or UE CCTrCH can be optimized. Sequentially for each UE/UE CCTrCH, the gain factor(s) are determined and the resulting code scaling factor P is determined, Step 86. Using P, SUD is performed and the data for that UE/UE CCTrCH is estimated, Step 88. The process is repeated until each of the UEs/UE CCTrCHs have been processed or all the UEs/UE CCTrCHs of interest have been processed, Step 90. This approach optimizes overall performance for each UE/UE CCTrCH at the expense of added complexity and delay.

[0082] FIGS. 5A and 5B are simplified block diagrams of gain factor scaling used in a multiuser detection receiver. In multiuser detection, data from all codes is detected simultaneously. These approaches to data detection can also experience improved performance by using gain factor scaling.

[0083] In FIG. 5A, the received communications are received by an antenna 100 or antenna array. The received communications are demodulated to baseband by a demodulator 102. The baseband signal is sampled by a sampling device 104 to produce a received vector, r. A channel estimation device 106 estimates the channel response as a channel response matrix, H. The noise variance σ² is also determined, such as by the channel estimation device 106 or by another device. The noise variance σ² is scaled by a scaling device 110, such as by a value 1/P. The channel response matrix H and the noise variance σ² as well as the received vector and spreading codes C are input into a multiuser detection device 108. The multiuser detection device 108 produces a data vector d.

[0084] In an alternate approach as shown in FIG. 5B, the channel response matrix H is scaled. The received communications are received by an antenna 112 or antenna array. The received communications are demodulated to baseband by a demodulator 114. The baseband signal is sampled by a sampling device 116 to produce a received vector, r. A channel estimation device 118 estimates the channel response as a channel response matrix, H. The noise variance σ² is also determined, such as by the channel estimation device 118 or by another device. For some multiuser detection algorithms, the noise variance σ² is not used. For those algorithms, the noise variance σ² is not detected. The channel response matrix H is scaled by a scaling device 122, such as by a value √{square root over (P)}. The channel response matrix H and the noise variance σ² as well as the received vector r and spreading codes C are input into a multiuser detection device 120. The multiuser detection device 120 produces a data vector d. Preferably, for use with multiuser detectors, P is derived using total power scaling.

[0085] Alternately, the gain factor scaling can be performed in conjunction with the multiuser detection. For such gain scaling, the multiuser detection device 108, 120 performs the gain factor scaling.