Decision Window Based Detection Technique for Multiuser MIMO CDMA Systems with Single Spreading Code Per

User
Phaneendra Kumar Vaka #1, R.Santha Kumar *2
*

Student, M. Tech., Communication Engg., VIT University, Assistant Professor (Sr), School Of Electronics Engineering, VIT University, 1 vakaphani@yahoo.com 2 santhakumar@vit.ac.in

Abstract - We consider multiuser MIMO CDMA systems where each user has multiple transmit antennas and different transmit antennas of the same user use the same spreading code. Because transmit antennas of the same user use the same spreading code, inter antenna interference would degrade the system performance. A novel decision-window-based data detection (sequential detection) method is proposed to mitigate the inter antenna interference. The simulation results show that, under the same channel estimation algorithm, the proposed sequential detection scheme with decision window of two symbols significantly outperforms the non-sequential one which is a special case of the proposed one when the decision window is of one symbol. It also outperforms the existing SIC-VBLAST, decorrelator-VBLAST, and MMSE-VBLAST schemes. Keywords-Decision window, ML Metric, MMSE front-end, decision ambiguity I.INTRODUCTION CDMA (Code Division Multiple Access) is a promising technique for beyond 3G wireless systems. In addition, multiple-input and multiple-output (MIMO) is a technique is a technique to increase data rate significantly with multiple antennas both at the transmitter and receiver. By combining MIMO and CDMA, the resulting MIMO CDMA system can further improve the system transmission rate over the traditional CDMA system. In the MIMO CDMA systems considered in the literature, there are two different approaches to assign spreading codes. The one is multiple spreading code approach, in which different antennas are assigned to different spreading codes such as. Since the data streams of different antennas are distinguishable by different spreading codes, the inter antenna interference (IAI) is greatly reduced.

The other is single spreading code approach, in which different antennas are assigned to the same spreading code. In this case, the error rate performance is dictated by IAI.A detection method has been proposed with single spreading code approach in the V-BLAST coded DS-CDMA system. This scheme uses a redundant bit (spatial code rate = the number of transmit antenna for one user/2) in order to identify the transmit antenna. This coding scheme results in data rate loss. In order to avoid data rate loss in MIMO CDMA systems using single spreading approach, a window-based sequential detection method is proposed in this paper, which is the main contribution of this paper. II.THE SYSTEM MODEL We consider a K-user uplink CDMA system. Each user (mobile station) has Nt transmit antennas and the base station has Nr receive antennas. For simplicity, we assume BPSK modulation. The extension to higher-order modulation formats is straightforward but at the cost of higher complexity. A. Transmitter At the transmitter, data streams are passed through serial to-parallel converter, modulation, and spreading. The structure of the transmitter is depicted in Fig. 1. At the m-th symbol interval [(m 1)T,mT], the data symbol , is transmitted through the i-th transmit antenna of the k-th user, i = 1, . . . , k = 1, . . .,K, where denotes the number of the transmit antenna. T denotes the symbol interval and m denotes the symbol index, m = 1, 2, . . .,M, where M is the number of symbols in one data frame. Then, the data symbol is spread by the aperiodic spreading sequence (periodic spreading sequence is its special case) (t-(m-1)T)=
.

(t-(m-1)T-n )

Rayleigh fading process from all transmit antennas and the noise in the receive antennas. Thus, the received signal at the j-th receive antenna has the low pass equivalent representation given by
,

, ,

,, ,

where is the additive white Gaussian noise. We show the receiver structure for the training period and the data transmission period in Fig. 3 and Fig. 4, respectively.

Fig.1. structure of the transmitter where N is the processing gain,{ c(m1)N+n,k } , n = 0, . . .,N 1, is the spreading sequence for the user k, and (t) is the normalized chip waveform with duration [0, Tc]. The spreading sequence is independent of the transmit antenna index i, because we use the same spreading sequence in all transmit antennas of one user. In (1), the scalar makes each users transmitted power be independent of the number of the transmit antenna ( ). The equation of signal transmission for the k-th users i-th transmit antenna is given by , i=1,2,
,

Fig.2.The receiver structure in the training period. M.F.: matched filter.MMSE: MMSE front-end. At the m-th symbol interval, k-th user matched filter output is sampled at t=mT+ , , ,l=1,2,.L(L multiple paths) to form the statistics
, , ,

1 T ,

B. Multipath Fading Channel and Receiver Let L denote the number of multiple paths. , , denotes the l-th multipath delay from the k-th users transmit antennas to the j-th receive antenna at the m-th symbol interval. denotes the l-th ,, multipath channel coefficient from the k-th users i-th transmit antenna to the j-th receive antenna at the mth symbol interval. We assume these L multipaths from one transmit antenna to one receive antenna are correlated [14], [15, p. 317]. The channel is a timevarying correlated multipath fading channel with normalized Doppler frequency

= Where
, ,

,,

, ,

, , , ,

, ,

where , , and c denote maximum velocity of the mobile unit, radio carrier frequency, and speed of light, respectively. The received signal includes all of the transmitted signals multiplied by an L-path

and contains ,, , , , ,, ,, , , filtered noise. In this paper, the users spreading sequences and multipath delays are known as a prior. Given such a model, our objective is to estimate , , , and ultimately
,

, from the observation

C.. FOVAR Model for Vector Channel Estimation The scalar auto-regressive (AR) model is often used to model a time-varying fading channel [16], [17]. In this paper, we consider a time-varying correlated multipath fading channel. In order to accommodate the nonzero cross-correlation among multipath, we model the channel as a first order vector autoregressive (FOVAR) model [14] to approximate the vector channel process. Its state equation and the measurement equation can be expressed as follows:
,, ,, ,, ,, , ,

,,

Where , the auto-regressive matrix is for the multipath from the k-th users i-th transmit antenna to the j-th receive antenna at the m-th symbol interval and is the FOVAR model noise which is ,, assumed to be a zero-mean complex white Gaussian process with covariance matrix
,, ,, ,,

. This algorithm is proved to be optimal under standard Gaussian approximation in correlated multipath fading channel. For details, the readers are referred to [14]. The vector channel estimation algorithm in [14] considers single user and single antenna case, so we propose some modification for multiuser MIMO CDMA systems in the training period. First we put a MMSE front-end to suppress multiuser interference (MUI) before channel estimation to improve initial channel estimation accuracy. Second, we propose that each users transmit antennas transmit training symbols in turns. This scheme is shown in Fig. 4 (e.g. Nt = 2). It is like ON-OFF keying in order to suppress IAI. In Fig. 4, Antenna 1, for example, sends training symbols half of the time, so in the receiver, we used linear interpolation to reconstruct the other half [18].

III. VECTOR CHANNEL ESTIMATION We use the fixed and adaptive expectation and maximization (EM) vector channel estimation algorithm [14] for training period and data transmission period, respectively, to estimate the unknown channel model parameter set , ,
,, ,,

is approximated as a The measurement noise , Gaussian process with the covariance matrix
, , ,

which can be computed by averaging the outer products of the off-peak samples [14]. Then we define the unknown parameter set ,,
,, ,,

Fig. 4. The training symbol pattern for each user. IV. PROPOSED DECISION-WINDOW-BASED SYMBOL DETECTION If the estimated channel coefficients are known for the receiver, we can use the maximum likelihood (ML) MIMO detector to detect the symbols of the transmit antenna of each user. In the ML detector, we combine the ML metrics among all receive antennas and obtain the antenna diversity. Of course, if the number of receive antenna increases; the system can get more diversity order. The metric of the ML function is given by argmin argmin |
, , , , ,,

Fig. 3. Receiver structure for the data transmission period.

=argmin

,, , , be the k-th users channel coefficient matrix from the transmit antennas to the jth receiver antenna, and , be the estimated , .
, ,

where k-th users , ,, , transmitted symbol vector at the m-th symbol interval is the detected .Let and ,

Because we use the single spreading code approach, in which different antennas of one user are assigned to the same spreading sequence, symbol detection errors (decision ambiguity) may happen even though the channel coefficients can be estimated approximately. This detection error causes the channel prediction error, and ultimately error propagation, because the channel prediction process for the next time index uses the present symbol estimates. The decision ambiguity is illustrated by the following example: Example (decision ambiguity-a form of IAI) We assume for simplicity K = 1, Nt = 2, Nr = 1, L = =1 1 (the transmitted signal vector), 1, = 0.2 and , , , , , , = 0.1 (the channel coefficients). Let the matched filter output be 0.3 (noise= 0). After the channel estimation process, we can obtain the estimated channel coefficients. If the estimated channel coefficients are , , , = 0, 3 and
, , ,

= 0.1, all ML metrics are given by

candidates of at (p, q) position in the tree diagram), so the channel coefficient predictions (the candidates of at the (p, q) , , , , position of the tree diagram) are different. The ML metric at (p, q) in the tree diagram, , , is given By
, , , , , , , , , ,

these transmitted symbols are. This idea comes from the new V-BLAST detection algorithm [19]. It saves the potential symbols and distance metrics to detect the transmitted symbols from different antennas of one user successively in the spatial domain. We reform this idea to increase the reliability of the detected symbols in the time domain. Because the symbol detection is based on the ML metrics, we can compute the potential ML metrics for more than one symbol interval and select the most likely path to reduce the effect of decision ambiguity. We start the method when at least two ML metrics of one user are close to each other (there is a threshold D). In a decision window, we utilize all recorded ML metrics to find the most probable path. Fig. 5 shows the structure of one data frame, where the decision window is shown. The number of training symbols in one frame is . The number of symbols in the decision window is . Fig. 6 shows the tree diagram we used in the proposed decisionwindow-based detection scheme, where (p, q) denotes the coordinate in the tree diagram. The different positions (p, q) in the tree diagram correspond to different data estimates (the ,

, ,

1 1

Both hypotheses [1 1] and [1 1] have the same ML metric, so the detection ambiguity occurs.

p = 1, , q = 1, , where is the number of candidates for comparison with similar ML metrics at each branch during the decision window. For instance, when the modulation scheme is BPSK and Nt = 2, the maximum of is 4 (we can set < 4 for complexity reduction). In Example (decision ambiguity), = 2 is appropriate because only two candidates of d have similar ML metrics. The following subsection depicts this proposed method, where ceil() denotes ceiling operator which round toward . A. The Proposed Scheme with Embedded Channel Estimation Let p be the stage index (length of decision window) and q be the candidate index among candidates for detection

Fig. 5. Frame structure and decision window. This ambiguity results in channel prediction error, and ultimately error propagation, and affects the BER performance. To mitigate this problem, we propose a decision window method. The ML metrics in a window period (> 1 symbol interval) are recorded and we utilize these recorded ones to decide what

We select (D possible candidates, .. whose ML metrics are small, from all possible set in each branch by using the previous predicted channel coefficients. We use these possible candidates and the previous predicted channel coefficients to obtain the corresponding predicted channel coefficients and their corresponding ML metrics , , ,, , , ,, ,,j=1,.., , , , ,
, ,

Fig. 6. The tree diagram for the proposed decisionwindow-based detection algorithm. Of Stage 1 (q = 1, . . . , ) We are first given the previous predicted coefficients , , j = 1, . . .,Nr. possible candidates . We select ML metrics are small, from all possible set branch by using the previous predicted coefficients.

,,

channel , whose in each channel

Move index to the end of decision window m=m+ 1 Symbol decision choose the best candidate arg q=1,
, ,

We use these possible candidates and to , obtain the corresponding predicted channel coefficients and their corresponding ML metrics ( , , , , , , ),,( , , , , , , ) ,j = 1, . . .,Nr. . . . . . . . Stage p(q = 1, . . . , ) We are first given the previous predicted channel coefficients, , , , , , , , , , j = 1, . . .,Nr. We select possible candidates, whose ML metrics are small, from all possible set in each branch by using the previous predicted channel coefficients. We use these possible candidates and the previous predicted channel coefficients to obtain the corresponding predicted channel coefficients and their corresponding ML metrics
,
, ,

where the function ceil gets the possible values of q corresponding to different p(smaller p corresponds to smaller possible values of q). The summation can be treated as the time domain diversity gain due to the decision window. decide bits in the decision window = , p= 1.,

Update the channel estimate

,

, ,

use this two factors to predict the channel coefficients B. The Complexity Analysis of the Proposed Scheme

1, . . ,

, 2,

, , , ,

, , ,

, , ,

,, j=1,.

,,

, ,

, ,

, , ,

, , ,

,, ,

, , ,

,,

, ,

, , ,

j=1, . . .,Nr.

.. Stage D (q = 1, . . . , (D ) We are first given the previous predicted channel coefficients, , , , , , , , ,

The proposed scheme is used in the data transmission period only, because training symbols are known to the receiver during the training period. Assume the complexity of the ML detector without decision window (that is, = 1) is normalized to 1. The complexity of the proposed scheme with decision window size is at most . We activate decision window only if the D2 best ML metrics are close (less than a threshold), so the average complexity would be smaller than , the maximum complexity. For example, the complexity

of the proposed decision-window-based detection scheme with = = 2 is at most four times = 4 the complexity of the previous nondecision window- based detection scheme with = = 1. We start the proposed scheme ( = 2) only when there are two ( = 2)) ML metrics of one user are close to each other. Suppose the decision mechanism is activated only for 10% of data symbols in data frames, the average complexity is just 1 * 0.9+ 4 * 0.1 = 1.3.

Based on the simulation results, the decision window size = 2 is sufficient since the = 2 and =3 curves are not significantly apart in Figs. 7 and 8. In = 2, close addition, (decision window size candidate at each stage D2 = 2) case is only 1.4dB and 1.9dB away from the single user bound in Figs. 7 and 8, respectively. Thus the complexity is at most = 4 if decision ambiguity occurs (1 if the decision ambiguity doesnt occur). Thus the additional complexity is limited.

Fig. 7. Performance comparison under the same channel estimation algorithm.K = 3, N = 15 V. SIMULATION RESULTS We consider a K-user MIMO CDMA system with five transmit antennas ( = 5) for each user and five receive antennas ( = 5). The correlated fading channel coefficients are generated according to the modified Jakes model in [20]. The performance of symbol detection is evaluated by bit error rate. The number of symbols in one frame (M) is 300 and the number of training symbols in one frame ( ) is 40. The normalized Doppler frequency ( ) is 0.01. The symbols are spread by aperiodic random spreading sequences with processing gain (N). In our simulation, the threshold D is 0.1, D2 = 2. We compare the proposed scheme with other traditional multiuser detection/MIMO detection schemes: SIC-VBLAST, decorrelator-VBLAST, and MMSE-VBLAST [18]. In Fig. 7, we set K = 3 and N = 15. In Fig. 8, we set K = 12 and N = 15, which corresponds to heavier load. We see the proposed scheme outperforms all three traditional multiuser detection/MIMO detection scheme, assuming nonperfect channel estimation. The proposed scheme mitigates the decision ambiguity, so suppress error propagation in decision directed channel estimation.

Fig. 8. Performance comparison under the same channel estimation algorithm. K = 12, N = 15 VI. CONCLUSIONS In the multiuser MIMO CDMA system with single spreading code per user, symbol detection errors (decision ambiguity defined in Section IV) may happen even the channel estimate is accurate. This cause channel prediction errors and then error propagation. To mitigate this decision ambiguity and improve bit error rate performance, we propose a novel sequential detection scheme summarized steps by steps in Section IVA, which is the primary contribution. We also propose some modification to the previous proposed channel estimation algorithm in single-user single-antenna case [14], so it can extend to multiuser multiple-antenna case. The modifications include training symbol pattern design to reduce IAI and MMSE frontend before channel estimation to suppress MUI, which is the secondary contribution. The simulation results show that the proposed scheme significantly outperforms the existing SIC-VBLAST, Decorrelator-VBLAST, and MMSE-VBLAST schemes because it is resistant to decision ambiguity. The proposed scheme with decision window size 2 and close candidate count=2 can be within 2dB away from the single user bound.

ACKNOWLEDGMENT: The authors would like to thank the anonymous reviewers for their suggestions to improve the presentation of the paper. REFERENCES [1] H.-H. Chen and M. Guizani, Multiple access technologies for B3G wireless communications, IEEE Commun. Mag., vol. 43, no. 2, pp. 6567, Feb. 2005. [2] G. J. Foschini and M. J. Gans, On the limits of wireless communication in a fading environment when using multiple antennas, IEEE Wireless Personal Commun., vol. 6, no. 3, pp. 311335, 1998. [3] A. Paulrajetal, R. Nabar, and D. Gore, Introduction to Space-Time Wireless Communications. Cambridge University Press, 2003. [4] D. Gesbert, M. Shafi, D. S. Shiu, P. J. Smith, and A. Naguib, From theory to practice: an overview of MIMO space-time coded wireless systems, IEEE J. Select. Areas Commun., vol. 21, no. 3, pp. 281302, Apr. 2003. [5] Tarokh, et al., Space-time codes for high data rate wireless communications: performance criterion and code construction, IEEE Trans. Inform. Theory, vol. 44, no. 2, pp. 744765, Mar. 1998. [6] P. W. Wolniansky, G. J. Foschini, G. D. Golden, and R. A. Valenzuela, V-BLAST: an architecture for realizing very high data-rates over the richscattering wireless channel, in Proc. IEEE ISSSE, Sept. 1998, pp. 295300. [7] S.-M. Tseng and H.-L. Lee, An adaptive partial parallel multistage detection for MIMO systems, IEEE Trans. Commun., vol. 53, no. 4, pp. 587591, Apr. 2005. [8] D. Reynolds, X. Wang, and H. V. Poor, Blind adaptive space-time multiuser detection with multiple transmitter and receive antennas, IEEE Trans. Signal Processing, vol. 50, no. 6, pp. 12611276, June 2002. [9] K. Deng, Q. Yin, L. Ding, and Z. Zhao, Blind channel estimator for V-BLAST coded DS-CDMA system in frequency-selective fading environment, in Proc. IEEE VTC 2003-Fall, Oct. 2003, vol. 1, pp. 458462. [10] Y. Li, G. Liao, and F. Wang, A new application of DS-CDMA in BLAST systems, in Proc. ICCCAS, 2004, vol. 1, pp. 145148. [11] W. Choi and J. Andrews, On spatial multiplexing in cellular MIMOCDMA systems with linear receiver, in Proc. IEEE ICC, 2005, vol. 2, pp. 13371342. [12] A. Nordio and G. Taricco, Linear receivers for the multiple-input multiple-output multiple-access channel, IEEE Trans. Commun., vol. 54, no. 8, pp. 14461456, Aug. 2006.

[13] M. Juntti et al., MIMO MC-CDMA communications for future cellular system, IEEE Commun. Mag., vol. 43, no. 2, pp. 118124, Feb. 2005. [14] W. Gao, S. Tsai, and J. S. Lehnert, Diversity combining for DS/SS systems with time-varying, correlated fading branches, IEEE Trans. Commun., vol. 51, no. 2, pp. 284295, Feb. 2003. [15] M. K. Simon and M. S. Alouini, Digital Communications Over Fading Channels: A Unified Approach to Performance Analysis. New York: Wiley, 2000. [16] P. H.-Y. Wu and A. Duel-Hallen, Multiuser detectors with disjoint Kalman channel estimators for synchronous CDMA mobile radio channels, IEEE Trans. Commun., vol. 48, no. 5, pp. 752756, May 2000. [17] S.-M. Tseng, Iterative Kalman channel estimation and parallel interference cancellation for synchronous CDMA mobile radio channels, IEICE Trans. Commun., vol. E86-B, no. 6, pp. 1961 1966, June 2003. [18] S. M. Tseng, H. C. Yu, C. L. Chang, Y. C. Tseng, and K. C. Lin, EM vector channel estimation and V-BLAST/PIC detection for multiuser long-code MIMO CDMA in multipath rayleigh fading channels, in Proc. IEEE AINA, Mar. 2005, vol. 1, pp. 565569. [19] A. Bhargave, R. J. P. de Figueiredo, and T. Eltoft, A detection algorithm for the V-BLAST system, in Proc. IEEE Globecom, Nov. 2001, vol. 1, pp. 494498. [20] P. Dent, G. E. Bottomley, and T. Croft, Jakes fading model revisited, IEEE Electron. Lett., vol. 29, no. 13, pp.11621163, June 1993.