• 沒有找到結果。

Space-time adaptive interference-canceling equalizer for W-CDMA with known and unknown interference

N/A
N/A
Protected

Academic year: 2021

Share "Space-time adaptive interference-canceling equalizer for W-CDMA with known and unknown interference"

Copied!
6
0
0

加載中.... (立即查看全文)

全文

(1)

Space-Time Adaptive Interference-Canceling Equalizer for W-CDMA with Known

and Unknown Interference

Hsiao-Yung Chen Yumin Lee

Dept. of Electrical Engineering and Graduate Institute of Communication Eng., National Taiwan University, Taipei 10617, Taiwan

TEL: +886-2-23626508 FAX: +886-2-23683824 E-mail: yuminlee@cc.ee.ntu.edu.tw

Abstract – Space-time parallel interference cancellation

(ST-PIC) is an effective multi-stage multiuser detection scheme for wideband code-division multiple access (W-CDMA). However, the realization of ST-PIC requires accurate channel estimate, a sufficient number of stages, and knowledge of all user’s spreading waveforms. With inaccurate channel estimate or insufficient number of stages, the residual multiple access interference (MAI) degrades performance significantly. Furthermore, the performance of ST-PIC is also affected by the presence of interference for which the spreading waveforms are unknown. This paper introduces a new structure for enhancing the performance of ST-PIC in these situations. Simulation results show that a bit error rate (BER) reduction of as much as an order of magnitude is achievable using the proposed structure in the presence of strong MAI.

I. INTRODUCTION

Direct-sequence code division multiple access (DS-CDMA) is one of the most popular multiple access schemes for current and future wireless communication systems. A DS-CDMA system allows simultaneous transmissions in the same frequency band. Users are differentiated using spreading codes (spreading sequences) that have low cross-correlation. Conventionally, a DS-CDMA receiver uses the RAKE receiver that performs a time correlation operation in alignment with each dispersive delay path to detect the desired information symbols [1]. All other user signals are considered as noise. In general, the performance of this receiver suffers from the multiple access interference (MAI), and if the powers of the users are not controlled properly, strong signals will capture the demodulator in a receiver, resulting in what is known as the near-far problem. Since MAI is the major source of performance of degradation, a DS-CDMA system is an interference-limited system.

Multiuser detection (MUD)[2] is a strategy for jointly detecting mutually interfering signals of information. It has been shown that MUD offers a significant improvement over the conventional RAKE receiver. With advances in hardware technologies, implementation of sophisticated MUD algorithms is becoming more and more feasible. A very effective MUD scheme is a multistage algorithm known as parallel interference cancellation (PIC) [3], in which MAI

is estimated and canceled at every stage using symbol decisions from the previous stage. The performance of PIC can be enhanced even more when integrated with transmit and/or receiver antenna diversity [4].

Despite the promising analytical and simulation results, PIC suffers from at least three practical problems. First, just like most MUD schemes, PIC requires an estimate of the propagation channel. Any inaccuracy in the channel estimate results in residual MAI, which can degrade performance significantly. Secondly, even when the channel estimate is very accurate, PIC still requires a sufficient number of stages in order to work properly. Insufficiency in the number of stages due to, e.g., hardware or power constraints, results in residual MAI that degrade performance. Finally, knowledge of every user’s spreading waveform is in general required for the PIC, just like most MUD schemes. This information may be unavailable in many situations, e.g., in forward link applications or in the presence of other-cell or other-system interference, making PIC impractical. Interference signals for which the spreading waveforms are unknown are collectively referred to as unknown interference in this paper. Solutions for these problems include the partial PIC (PPIC) [5], adaptive PIC (APIC) [6], and decision-feedback detectors (DFD)[7]. The idea of the PPIC is to remove only part of the MAI at each stage because the estimated MAI is inaccurate. As the MAI estimate becomes more accurate for each successive stage, the amount of removed MAI is also increased. APIC, on the other hand, uses adaptive (usually linear) MAI estimators in each stage, and can be regarded as a more general version of the PPIC. DFD uses a completely different structure for MUD. A DFD includes a feedforward section and a feedback section. The feedforward section cancels the known MAI while the feedback section can reduce the effect of unknown interference as well as residual known MAI. Although the PPIC and APIC are effective and elegant, they still require a sufficient number of stages in order to work properly. On the other hand, the complexity of DFD is significantly higher the PIC, and is difficult to optimize. We therefore propose a structure for enhancing the performance of a space-time PIC (ST-PIC) against unknown interference as well as residual known MAI due to channel estimation error and insufficiency in the number of stages. The key

(2)

component in the proposed structure is an adaptive equalizer referred to as the space-time adaptive interference-canceling equalizer (STAICE). The key idea is that instead of treating the output of ST-PIC as the final detected symbols, a reference is derived to drive the settings of the STAICE towards the “optimal” value so that the effects of signal dispersion caused by the channel, residual known MAI due to channel estimation error and insufficient number of PIC stages, unknown interference, as well as AWGN are mitigated at the same time. Performance improvement achieved by the proposed structure is very significant. Simulation results show that the proposed structure can reduce the bit error rate floor by as much as an order of magnitude in the presence of both known MAI and unknown interference. Although the proposed receiver is simulated only for the synchronous case, it is also applicable to the asynchronous case.

II. SYSTEM MODEL

Considering a cellular DS-CDMA system in which signals of a total of K known users are transmitted synchronously and simultaneously over the same frequency band. The continuous-time baseband equivalent transmitted signal of the k-th user is expressed as

) ( ) ( ) (t D t S t xk = k k , (1)

where Dk(t) and Sk(t) are, respectively, data and spreading

waveforms of the k-th user. They are defined as1

[ ]

( ) ) ( 0 T mT t p m b t D m k k − =

∞ = (2) and

[ ]

( ) c ) ( 0 c c m k k T mT t p m t S =

− ∞ = , (3)

where bk[•] is the information symbols of the k-th user, T and

Tc are the symbol and chip durations, respectively, ck[•] is the

spreading sequence for the k-th user, and p(•) is a rectangular pulse shaping function defined as

   ≤ < ≡ else , 0 1 0 , 1 ) (t t p (4)

It is assumed that knowledge of the spreading waveforms of these K users is available at the receiver; therefore these K users are referred to as the known users.

At the receiver, we assume that there are a total of P receiving antennas, and the channel between the k-th user and p-th antenna consists of Lk,p resolvable paths. Assume that

,

, pl

k

τ is the arrival time of the l-th resolvable path of the channel between the k-th user and p-th antenna, by the

1 We use square brackets to denote the time index of discrete-time signals.

superposition principle the received signal at the p-th antenna can be expressed as ) ( ) ( ) ( ) ( 1 1 , , , , , t n t i t x t r p p K k L l p l k k p l k p p k + + − =

∑∑

= = τ α (5)

where αk,l,p denote the complex gain of the l-th resolvable

path that takes both channel and antenna gains into account, ip(t) is the unknown interference signal received at the p-th

antenna, and np(t) is the additive white Gaussian noise

(AWGN) whose two-sided power spectrum density (PSD) is equal to N0/2. The received signals are then processed by the proposed receiver described in the next section.

III. PROPOSED RECEIVER STRUCTURE

Figure 1 shows the block diagram of the proposed receiver. The structure is divided into two sub-blocks: the space-time parallel interference canceller (ST-PIC) and space-time adaptive interference-canceling equalizer (STAICE). The ST-PIC partially cancels the MAI generated by known users and provides a somewhat “clean” reference signal for the subsequent STAICE. Using the reference signal, an adaptive algorithm is employed to drive the settings of the STAICE towards the “optimal” value so that the effects of signal dispersion caused by the channel, residual known MAI, unknown interference, and AWGN are mitigated at the same time.

ST-PIC

The initial stage of the ST-PIC consists of a bank of K coherent spatio-temporal RAKE receivers – one for each known user – where K is the number of users with known spreading waveforms as mentioned previously. In this paper, the coherent spatio-temporal RAKE receiver for the k-th user is implemented as a bank of

= P p p k L 1

, correlators, with each correlator aligned with one resolvable path between the corresponding user and antenna. The output of the correlators are weighted by the complex conjugates of the estimates of the corresponding path gains, and combined to obtain the output given by

∑∑

= =

+ + = P p L l k T m mT p l k p p l k k p k dt t S t r m Z 1 1 * ) 1 ( , , * , , ) 0 ( , ) ( ) ˆ ( ˆ ] [ α τ . (6)

where αˆk ,,lp and τˆk ,,lpare, respectively, estimates of the path gain αk ,,lp and arrival time τk, pl, . The output in (6) is then sliced to yield

(

[ ]

)

] [ ˆ(0) (0) m Z D m bk = k , (7)

where D(•) is the appropriate slicing operation. The quantity in (7) is an initial estimate of the symbols transmitted by the k-th user, and is used by the subsequent

(3)

ST-PIC stage.

The ST-PIC used in this paper consists of S stages and is a straightforward extension of the conventional PIC algorithm to the receiver antenna diversity case. In the s-th stage (s=1,2,…,S) of the ST-PIC detector, chip-spaced samples of each known user’s transmitted signal is first estimated as

[

]

= − − = 0 ) 1 ( ) 1 ( [ ] [ ] ˆ [ ] ˆ m s k k s k n c n b mun mR x , (8) where bˆ(s1)[m]

k is the estimate of the m-th symbol

transmitted by the k-th user obtained in the previous [(s-1)-th] stage of the ST-PIC detector,

c

T T

R≡ (9)

is the spreading factor and is assumed to be an integer, and

[ ]

   ≤ < ≡ else , 0 0 , 1 n R n u . (10)

The MAI contributed by each known user is then derived from the estimated transmitted signals and estimated path gains and arrival times, and subtracted from the chip-spaced samples of the signal received from each antenna. The result is a set of KP discrete-time signals with reduced MAI given by

∑∑

≠ = = − − = K k i i L l p l i s i p l i c p s p k i n x nT r n r 1 1 , , ) 1 ( , , ) ( , [ ] ( ) ˆ ˆ [ ˆ ] ˆ α τ (11)

for k = 1,2, …, K and p = 1, 2, …, P. These signals are next processed by a bank of K discrete-time coherent spatio-temporal RAKE receivers to obtain outputs given by

∑∑

= =

+= − + = P p L l R m mR j k p l k s p k p l k s k p k j c j r m Z 1 1 1 ) 1 ( * , , ) ( , * , , ) ( , ] [ ] ˆ [ ˆ ˆ ] [ α τ (12)

for k = 1,2, …, K. Finally, the output in (12) is sliced to obtain estimates of the symbols transmitted by the k-th user, given by

(

[ ]

)

] [ ˆ() () m Z D m b s k s k = , (13)

for the s-th stage. STAICE

The output ˆ( )[ ] m

bkS of the last ST-PIC stage is the

final hard-decision output of a conventional ST-PIC. Various studies [3-7] in the literature have shown that very good performance is achievable using a conventional ST-PIC with sufficient number of stages when the spreading waveforms all users are known and an accurate estimate of the channel is available. However, when the number of ST-PIC stages is insufficient, or when the channel estimate is inaccurate, the resulting residual MAI from known users degrade the performance of ST-PIC significantly. Furthermore, the performance of the conventional ST-PIC is

also affected by the presence of unknown interference. To improve the performance of the ST-PIC in these situations, we enhance the conventional ST-PIC with the space-time adaptive interference-canceling equalizer (STAICE).

The STAICE is shown in Figure 2 for one particular user for P=2. The key idea is that instead of treating the output of the last ST-PIC stage as the final hard-decision output, we form signals xˆ(S)[n]

k , k = 1,…,K, according to (8),

and use them as reference signals to drive a bank of KP adaptive equalizers (one for each user on each antenna). Each adaptive equalizer is a linear finite impulse response (FIR) filter with ND chip-spaced coefficients adapted at the

chip-rate using the normalized least-mean-square (NLMS) algorithm[8]. NLMS is chosen here because of its simplicity and robustness against eigenvalue spread of the correlation matrix of the input signal vector [8]. The input of the adaptive equalizers for the k-th user on the p-th antenna is the signal ˆ( )[ ]

, n

rkSp given in (11), and the corresponding

output is given by

[

]

ˆ ] , [ ] [ ˆ 1 0 ) ( , * , ,

− = − = D N j S p k p k p k n w n j r n j r (12)

where wk,p*[n,j] is the j-th filter coefficient at time n. The

outputs of the P equalizers for the k-th user are then linearly combined to give a single output given by

= < > = P p kp p k k n e n r n r 1 2 , , ] [ ] [ ˆ ] [ ˆ , (13)

where <|ek,p[n]|2> is the linearly smoothed magnitude-square

of the error defined as

] [ ˆ ] [ ˆ ] [ , ( ) , n r n x n ekp = kpkS . (14)

Finally, rˆ nk[ ] is despreaded using the spreading sequence of the k-th user to obtain

+= − = 1 ) 1 ( *[ ] ] [ ˆ ] [ R m mR j k k k m r j c j Z , (15)

which is then sliced to obtain the final output

(

[ ]

)

] [

ˆ m DZ m

bk = k . (16)

Several points are worth mentioning regarding the proposed structure. First, on the p-th antenna, the input signal ˆ( )[ ]

, n

rS p

k of the STAICE, given in (11), consists of the

k-th user’s signal distorted by the multipath fading channel, the residual MAI from known users, unknown intereference, and AWGN. On the other hand, the reference signal

] [ ˆ( ) n

xkS of the STAICE given in (8) is an estimate of the transmitted signal of the k-th user. It can thus be seen that the STAICE plays the role of a chip-rate equalizer that takes signal dispersion, residual known MAI, unknown interference, and AWGN jointly into account. Although the statistics of the residual known MAI and unknown intereference are not exactly known to the receiver, the NLMS algorithm can drive

(4)

the coefficients of the STAICE towards the “optimal” settings provided that ˆ( )[ ]

n

xkS reasonably resembles the actual

transmitted signal xk[n]. Secondly, xˆ(S)[n]

k is obviously

different from xk[n] because xˆk(S)[n] is derived from the

detected symbols bˆk(S)[m], which inevitably contain errors due to the residual known MAI, unknown interference, and AWGN. However, as will be shown later by simulation, even when bˆ(S)[m]

k contains too many errors to be useful

directly, ˆ( )[ ] n

xkS still resembles xk[n] enough to be a useful

reference signal for the adaptive algorithm. In this case the performance can be significantly improved by the STAICE, as will be shown by simulation. Thirdly, the linear combining in (13) is similar to maximal ratio combining (MRC) in the sense that the combining weight is inversely proportional to the estimation error power. It may be argued that by jointly adapting the P equalizers for the k-th user and simply adding their outputs, possibly better performance may be achievable. However, preliminary simulation results show that the performance of the proposed scheme is at least as good as the joint adaptation scheme. One plausible explanation is that the dimensionality of the coefficient vector is larger for joint adaptation, thus requiring training signals of better quality and larger quantity. Finally, the assumption of synchronous DS-CDMA is made only to simplify the modeling and simulation of the ST-PIC. This assumption is not used for the STAICE, therefore the STAICE can also be used for enhancing the performance of MUD for asynchronous DS-CDMA.

IV. SIMULATION RESULTS

The performance of the proposed receiver is evaluated by simulating a total of 10 known users (K=10) in a synchronous DS-CDMA system with dual antenna reception (P=2). In the simulations, the transmitter is implemented according to the W-CDMA unplink technical specifications [9]. Each known user has one dedicated physical data channel (DPDCH) and is assigned a channelization orthogonal variable spreading factor (OVSF) code with spreading factor (SF) equal to R = 64. A total of 2000 bursts of random user data are simulated, where each burst is 20 frames long and each frame has a length2 of 38400 chip-periods (10ms), as defined in the W-CDMA specifications. The scrambling code for each user is the short scrambling code with different initial states, as specified in the W-CDMA specifications. The number of pilot bits in each time-slot is equal to 8 (Npilot=8). The modulation is

binary phase shift keying (BPSK). Perfect power control is assumed for the known users so that each user has the same average received energy.

2 For simplicity, we assume that mobile units use all 15 time-slots in a frame.

Unless otherwise stated, the wireless channel is modeled as a Gaussian wide-sense stationary uncorrelated scattering (GWSSUS) multipath propagation channel corrupted by AWGN and zero or two unknown interferers. A two-path power-delay profile is assumed, where the relative delay between the two paths is 4 chip-periods and relative power levels of the two paths are 0 and –10 dB, respectively. It is also assumed that there is no line-of-sight component in the multipath propagation channel and that the channel stays approximately constant during each burst, but is uncorrelated from burst to burst.

At the receiver, it is assumed that the number Lk,p and

arrival time τk,l,p of each user’s propagation paths are known.

Estimates αˆk ,,lpof the path gains are then obtained using either the least-squares (LS) or turbo multiuser space-time channel estimators previously proposed in [10]. The received signal is then processed by the ST-PIC and STAICE in the proposed receiver structures as previously described. The performance of the conventional (ST-PIC-only) receiver is also simulated as a baseline for comparison. In the simulation results, the number of stages in the ST-PIC is set to S = 1, and the number of coefficients for STAICE is set to ND = 8.

The performance of the conventional (ST-PIC-only) and proposed receivers (ST-PIC enhanced by STAICE) is shown in Figure 3 for the AWGN channel with no unknown interference. The average bit error rates (BER) of both the LS and turbo channel estimators are plotted in this figure as functions of Eb/N0, where Eb is the transmitted energy per bit.

For the ST-PIC, it can be seen that the BER curves saturate at high Eb/N0 as expected. Here the performance is dominated by the large amount of residual known MAI because only one stage (S=1) is used in the ST-PIC. It can also be seen that the performance of the turbo channel estimator is significantly better than the LS channel estimator for the ST-PIC, which is consistent with the result reported in [10]. The turbo channel estimator provides more accurate channel estimates, thus reducing the effect of residual known MAI. Finally, it can be seen that the proposed structure significantly improves the performance of the ST-PIC for both types of channel estimators. The BER floor of the proposed receiver is 5 to 10 times lower than the ST-PIC. These results indicate that, at least for the AWGN channel without unknown interference, the proposed STAICE can suppress residual known MAI and provide significant performance enhancement, even though its reference signals contain errors.

The performance of the proposed receiver is next evaluated for the two-path GWSSUS channel with and without unknown interference. The average BER of the proposed receiver and ST-PIC are plotted as functions of Eb/N0 in Figure 4 using the LS channel estimator. The curves labeled with “ST-PIC/UI” and “Proposed/UI” are obtained assuming the presence of two unknown interferers.

(5)

These unknown interferers transmit at the same power levels as the known interferers, however the receiver does not know their spreading waveforms. It can be seen that the presence of unknown interference indeed significantly affects the performance of both the ST-PIC and proposed receivers. However, the performance of the proposed receiver is still significantly better than the ST-PIC regardless of the number of unknown interferers. In particular, the BER floor of the proposed receiver is again 5 to 10 times lower than the ST-PIC. These results again verify the ability of the proposed STAICE to suppress residual known MAI and unknown interference and enhance performance for the two-path fading channel with and without unknown interference.

Similar performance curves are shown in Figure 5 using the turbo channel estimator. Comparing this figure to Figure 4, one can see that the performance of the turbo channel estimator is significantly better than the LS estimator for all cases simulated, just as for the AWGN channel. Furthermore, the performance of the proposed receiver is also significantly better than the ST-PIC regardless of the number of unknown interferers, just as in Figure 4. The performance improvement is not as large, however, because here the effect of residual known MAI is much less because a better channel estimator is used for the ST-PIC. However the ability of the proposed STAICE to suppress residual known MAI and unknown interference is still evident from Figure 5.

V. CONCLUSION

The performance of the space-time parallel interference canceller (ST-PIC) is affected by residual MAI caused by

channel estimation error and insufficiency in the number of PIC stages, unknown interference, and AWGN. The space-time adaptive interference-canceling equalizer (STAICE) is proposed for enhancing the performance of the ST-PIC) against these impairments. By using the output of ST-PIC to derive a reference signal for the adaptation algorithm, the STAICE can indeed achieve significant performance gains in the presence of strong MAI. Although only the synchronous case is simulated, the proposed STAICE is equally applicable to the asynchronous case.

REFERENCES

[1] J. G. Proakis, Digital Communications, 3rd ed., pp. McGraw Hill, Inc., 1995.

[2] S. Verdu, Multiuser Detection, Cambridge Univ. Press, 1998.

[3] M. K. Varanasi and B. Aazhang, “Multistage detection in asynchronous code-division multiple-access communications,” IEEE Trans. Commun., vol. 38, pp. 509-519, Apr. 1990.

[4] J. Weng et. al., “Multistage Interference Cancellation with Diversity Reception for Asynchronous QPSK DS/CDMA Systems over Multipath Fading Channels,” IEEE J. on Sel. Areas in Comm., Vol. 17, No. 12, pp. 2162 – 80, December 1999.

[5] D. Divsalar et. al., “Improved Parallel Interference Cancellation for CDMA,” IEEE Trans. On Comm., Vol. 46, pp. 258 – 68, February 1998. [6] G. Xue, et. al., “Adaptive Multistage Parallel Interference Cancellation for CDMA,” IEEE J. Select. Areas Commun., vol. 17, pp. 1815-1827, Oct. 1999.

[7] A. Duel-Hallen, “A Family of Multiuser Decision-Feedback Detectors for Asynchronous CDMA Channels,” IEEE Trans. On Commun., Vol. 43, pp. 421 – 34, Feb./Mar./Apr. 1995.

[8] S. Haykin, Adaptive Filter Theory, Prentice Hall, 3rd ed., 1996. [9] 3rd Generation Partnership Project: Technical Specification 3GTS 25.213

V. 4.1.0, June 2001.

[10] M. C. Tournier et. al., “Direct and Turbo Multi-User Spatio-Temporal Channel Estimation Schemes for CDMA FDD UMTS Uplink,” IEEE

ICASSP '00, Vol. 5, pp. 2805-2808, Jun. 2000.

r1(t) …rP(t) ˆ [ ] ) ( , • S p k r

,

k=1 …K p=1,…,P ] [ ˆ(0) • k b

,

k=1 …K Spatio-Temporal RAKE (Initial Stage) PIC Stages (S Stages) Channel Estimation STAICE ] [ ˆ( ) • S k x

,

k=1 …K ST-PIC

Fig. 1. The proposed receiver structure.

] [ ˆ m bk ] [ ˆ( ) n xkS ] [ ˆ( ) 2 , n rkS ] [ ˆ( ) 1 , n rkS FIR Filter FIR Filter ek,1[n] ek,2[n]

+

+

_

_

<| ek,1[n]|2> <| ek,2[n]|2> Despread and Slice Zk[m]

(6)

1.E-05 1.E-04 1.E-03 1.E-02 1.E-01 0 5 10 15 20 25 Eb/N0 (dB)

Average Bit Error Rate

ST-PIC/LS Proposed/LS ST-PIC/Turbo Proposed/Turbo

Fig. 3. BER of the proposed receiver for the AWGN channel without unknown interference. The number of known users is 10.

1.E-04 1.E-03 1.E-02 1.E-01 1.E+00 0 5 10 15 20 25 Eb/N0 (dB)

Average Bit Error Rate

ST-PIC/UI ST-PIC Proposed/UI Proposed

Fig. 4. BER of the proposed receiver for the two-path fading channel with and without unknown interference. LS channel estimator is used.

1.E-05 1.E-04 1.E-03 1.E-02 1.E-01 0 5 10 15 20 25 Eb/N0 (dB)

Average Bit Error Rate

ST-PIC/UI Proposed/UI ST-PIC Proposed

Fig. 5. BER of the proposed receiver for the two-path fading channel with and without unknown interference. The turbo channel estimator is used.

數據

Fig. 2.    Block diagram of STAICE for one particular user for P = 2.
Fig. 3.    BER of the proposed receiver for the AWGN channel without  unknown interference

參考文獻

相關文件

(c) Draw the graph of as a function of and draw the secant lines whose slopes are the average velocities in part (a) and the tangent line whose slope is the instantaneous velocity

Here, a deterministic linear time and linear space algorithm is presented for the undirected single source shortest paths problem with positive integer weights.. The algorithm

This discovery is not only to provide a precious resource for the research of Wenxuan that has a long and excellent tradition in Chinese literature studies, but also to stress

Two sources to produce an interference that is stable over time, if their light has a phase relationship that does not change with time: E(t)=E 0 cos( w t+ f ).. Coherent sources:

The entire moduli space M can exist in the perturbative regime and its dimension (∼ M 4 ) can be very large if the flavor number M is large, in contrast with the moduli space found

In fact, his teachers believe that it is his good ear for music that has helped him with the precise pronunciation of different languages – especially with a tonal language like

• When a number can not be represented exactly with the fixed finite number of digits in a computer, a near-by floating-point number is chosen for approximate

For the data sets used in this thesis we find that F-score performs well when the number of features is large, and for small data the two methods using the gradient of the