36

IEEE COMMUNICATIONS LETTERS, VOL. 14, NO. 1, JANUARY 2010

Design of Spreading Permutations for MIMO-CDMA Based on Space-Time Block Codes

Min Shi, Claude DAmours, Member, IEEE, and Abbas Yongacoglu, Senior Member, IEEE
AbstractIn this paper we propose a new method for designing the spreading permutations based on space time block code matrices for MIMO-CDMA systems. The new designs improve the bit error rate (BER) compared to MIMO-CDMA systems that use spreading permutations based on T-designs. This BER improvement comes without any increase in system complexity. Index TermsCDMA, MIMO, error correction coding.
serial to b1 b2 BPSK Modulator BPSK Modulator BPSK Modulator Bank of matched filters Filter matched to c1(t) Filter matched to c2(t) r11 r12

Filter matched to cN(t) Bank of matched filters Bank of matched filters

r1N r21 r22

w1(t)

w2(t)

I. I NTRODUCTION

Data in

parallel converter

bNt

HE parity bit selected spreading code technique, based on systematic linear block codes, was rst proposed in [1]. In code division multiple access (CDMA) systems employing this technique, the calculated parity bits are used to select a spreading sequence from a set of mutually orthogonal spreading sequences. This technique was extended to CDMA systems using multiple input multiple output (MIMO) techniques in [2]. In a MIMO-CDMA system with transmit antennas, instead of selecting one spreading sequence, the parity bits select different spreading sequences from a set of mutually orthogonal spreading sequences; and each transmit antenna uses one of the selected spreading sequences. A different permutation of spreading sequences is assigned to different sequences of parity bits, hence the technique is referred to as permutation spreading. In [2], T-designs are used to design the different spreading permutations. In this paper, we design the spreading code permutations based on Space-Time Block Codes (STBC). Compared to the results presented in [2], the STBC-based design can improve the bit error rate (BER) performance over the at fading channel without increasing the system complexity. We compare the performance of the two techniques for MIMO-CDMA systems operating on frequency-at slowly Rayleigh fading channels. In section II, we provide a block diagram of the MIMO-CDMA system employing permutation spreading. In section III, we provide the STBC-based spreading code permutation design for a system employing 4 transmit antennas. In section IV, we provide a union bound for the BER. The simulated BER performance for the MIMO-CDMA case considered in this paper is shown in section V. Conclusions are provided in section VI. II. MIMO-CDMA S YSTEM E MPLOYING P ERMUTATION S PREADING The block diagram of a MIMO-CDMA transmitter receiver pair employing permutation spreading is shown in Figure

wNt(t)

r2N rNr1 rNr2 rNrN

Spreading Sequence selector

Fig. 1. Block diagram of MIMO-CDMA system employing permutation spreading.

1. The input bit stream is converted into parallel data streams. On one signaling interval, the bits to be transmitted are used to select spreading sequences from a set of mutually orthogonal spreading sequences, where > . The message bits are then modulated using binary phase shift keying (BPSK) and each bit is spread using the spreading sequence selected in the previous step. The spreading sequences employed on a given signaling interval {1 (), ..., ()} are chosen from a set of orthogonal spreading sequences {1 (), 2 (), , ()}. At the receiver, the output of each antenna is connected to a bank of matched lters. There is one matched lter for each of the spreading codes in the users set {1 (), 2 (), , ()}. We can estimate the transmitted data sequence based on the received vector, which is given by: r = [11 , 12 , ..., 1 , 21 , .., 1 , ..., ] (1)

III. S PACE -T IME B LOCK C ODE BASED P ERMUTATION The design of the spreading code permutations is based on a STBC matrix. The 4 transmit antenna MIMO-CDMA system in [2] that employs permutation spreading requires 8 spreading sequences per user. An 8 8 space-time block code matrix, given in [3], can be used for designing the permutation table. This matrix is: 2 3 4 5 6 7 8 1 2 1 4 3 6 5 8 7 3 4 1 2 7 8 5 6 4 3 2 1 8 7 6 5 (2) 5 6 7 8 1 2 3 4 6 5 8 7 2 1 4 3 7 8 5 6 3 4 1 2 8 7 6 5 4 3 2 1

Manuscript received September 4, 2009. The associate editor coordinating the review of this letter and approving it for publication was H. Liu. The authors are with the School of Information Technology and Engineering, University of Ottawa, Ottawa, Canada (e-mail: damours@site.uottawa.ca). Digital Object Identier 10.1109/LCOMM.2010.01.091797

c 1089-7798/10$25.00 2010 IEEE

SHI et al.: DESIGN OF SPREADING PERMUTATIONS FOR MIMO-CDMA BASED ON SPACE-TIME BLOCK CODES

37

TABLE I STBC-BASED C ODE P ERMUTATIONS FOR = 4. Coset Message Vector 0000 1111 0001 1110 0010 1101 0011 1100 0100 1011 0101 1010 0110 1001 0111 1000 1 () 2 () 3 () 4 ()

1 2 3 4 5 6 7 8

1 () 2 () 3 () 4 () 5 () 6 () 7 () 8 ()

5 () 6 () 7 () 8 () 1 () 2 () 3 () 4 ()

8 () 7 () 6 () 5 () 4 () 3 () 2 () 1 ()

6 () 5 () 8 () 7 () 2 () 1 () 4 () 3 ()

distance between the different u s and the u corresponding to b = [1, 1, 1, 1]. Let us start by considering the distance between the received vectors associated with messages [1,1,1,1] and [0,0,0,0]. This scenario corresponds to messages in the same coset. We will refer to this distance as . It is given by: 2 =
4 2 =1 =1

(5)

The STBC-based spreading code permutation is given in Table I. Columns 1, 5, 8, and 6 in (2) are respectively assigned to columns 1, 2, 3 and 4 of Table I. The output (normalized to the signalling interval) from the th matched lter of the th receive antenna would be given as { + if () = (), = (3) otherwise ,

We can show that 2 has a chi-square distribution with 2 degrees of freedom. Therefore the probability that we transmit 0000 but detect 1111 is given by [4]: ( )( ) ( ) 1 1 1 + 1 + = 2 2 =0 (6) where = 4 and is the average received energy +4 per bit to single sided noise spectral density ratio. Next let us consider the probability of detecting a message vector in a different coset that does not have any spreading codes in common as the desired message 0000. In Table I, we see that coset 7 does not share any spreading codes with coset 1 . We refer to this distance as 0 . We can show that 2 is: 0 2 2 0 = 2 (7) =1
=1

where is the complex channel gain for the th transmit-th receive antenna link; is the average received energy per bit; and is the sampled noise from the th matched lter of the th receive antenna. The received vector, r = u + n where u is the received data vector that is dependent on the transmitted data vector, b = [1 , 2 , ..., ] and n = [11 , ..., 1 , 21 , ..., 2 , ..., 1 , ..., ] is a vector made up of noise samples. For example, if the transmitted message m = [0, 0, 0, 0], then b = [1, 1, 1, 1] and u = [11 , 0, 0, 0, 12, 14 , 0, 13 , 21 , 0, 0, 0, 22 , 24 , 4 ) 2 ( 0, 23 , ..., 1 , 0, 0, 0, 2 , 4 , 0, 3 ] . 1 2 2 + 1 2 2 2 = 2 + 5,1 =1 Maximum likelihood detection (MLD) is used to detect =3 which message has been transmitted by nding the minimum (8) squared Euclidean distance between the received vector and We can show that + 2 + 2 = all the possible received vectors in the absence of noise. The 22 + 22 , therefore the last term in (8) becomes ( ) 2 2 2 2 expression is given as =1 1 + 2 . Therefore 5,1 has the same dis 2 b = min r u 2 (4) tribution as 0 . Since the STBC-based design maintains the code symmetry between all cosets that share two spreading b codes then they all have the same distance properties, therefore the probability of incorrectly detecting a message from a coset IV. B IT E RROR P ROBABILITY A NALYSIS that shares two spreading codes with the desired message is Let us consider the case when the transmitted message 2 also given by (6) with = m = [0, 0, 0, 0]. Let us assume that we are transmitting a +2 . Therefore the union narrowband MIMO-CDMA signal so that the channel can bound for the BER for a single user MIMO-CDMA system be assumed to be frequency-nonselective. We further assume employing STBC-based permutation spreading is given by: that the channel gains are independent. We can determine a 2 (9) < + union bound on the BER by nding the squared Euclidean 2

Therefore the probability of incorrectly detecting a message from a coset that does not have spreading codes in any common is given by (6) where = 2 . +2 Next we consider the incorrect detection of a message from a coset that shares 2 spreading waveforms with the desired message. If we observe Table I, we see that six cosets share two spreading codes with coset 1 . However it is important to note that the common codes of coset simply swap transmit antennas compared to those of coset 1 . For example 1 uses 1 () from antenna 1 and 5 () from antenna 2 while 5 uses 1 () from antenna 2 and 5 () from antenna 1. We refer to this as code symmetry. The distance between a message in 5 and the desired message is then given by

38
0

IEEE COMMUNICATIONS LETTERS, VOL. 14, NO. 1, JANUARY 2010

10

TABLE II T- DESIGN P ERMUTATION S PREADING TABLE FOR = 4. Coset Message Vector 0000 1111 0001 1110 0010 1101 0011 1100 0100 1011 0101 1010 0110 1001 0111 1000 1 () 2 () 3 () 4 ()

10

-1

10 BER

-2

1 2

1 () 8 () 2 () 5 () 6 () 3 () 7 () 4 ()

3 () 1 () 4 () 2 () 7 () 6 () 8 () 5 ()

5 () 4 () 3 () 6 () 1 () 8 () 2 () 7 ()

7 () 5 () 8 () 3 () 4 () 1 () 6 () 2 ()

10

-3

10

-4

10

-5

Conventional Nr=1 T-design Nr=1 STBC design Nr=1 Conventional Nr=4 T-design Nr=4 STBC design Nr=4 0 2 4 6 8 SNR(dB) 10 12 14

3 4 5 6 7 8

Fig. 2. BER for STBC Permutation vs. T-Design Permutation with = 4, = 1 and = 4.

provided that the code symmetry discussed above is maintained. In (9) is given in (6) with = 4 , while +4 2 is also given by (6) but with = +2 and is the total number of message which is 16 in our case. V. S IMULATION R ESULTS The simulation results for bit error rate (BER) performances are presented in this section. MIMO-CDMA system with 4 transmit antennas and 1 or 4 receive antennas are considered. The following assumptions are used in the simulation model: 1) The channel is a frequency nonselective (at), slowly Rayleigh fading channel, and there is no channel induced intersymbol interference (ISI). 2) The channel gains of different transmit and receive links are uncorrelated. 3) It is assumed that perfect channel state information (CSI) is available at the receiver. Figure 2 shows the BER performances of MIMO-CDMA system employing STBC permutation vs. the system employing T-design permutation with 4 transmit antennas and 1 or 4 receive antenna. The T-design permutation table of [2] is given in Table II. The BER performances of MIMO-CDMA systems employing conventional spreading are also given as references. In the conventional system, each transmit antenna is assigned a unique spreading sequence that is orthogonal to the others. The spreading code assignment is xed and does not depend on the data being transmitted. From Figure 2, we see that permutation spreading provides signicant gains over conventional MIMO-CDMA. Also the MIMO-CDMA system using STBC-based code permutations has a better BER performance compared to the system employing T-design permutations. From Table II, we see that the T-design method does not respect the code symmetry discussed in the previous section for cosets that have two spreading codes in common and therefore some degrees of freedom are lost in the squared Euclidean distance between different messages. The lack of code symmetry accounts for

the slightly increased BER. Figures 2 shows, at the BER of 103 , the STBC permutation systems have 0.7 dB and 0.2 dB gain over T-design permutation system in the case of 1 and 4 receive antennas, respectively. VI. C ONCLUSION A new design method to nd the permutation spreading table for MIMO-CDMA systems is proposed in this paper. Simulations show improvements in the BER performance without increase the system complexity compared to the MIMO-CDMA system employing permutation spreading in [2]. R EFERENCES
[1] C. DAmours, Parity bit selected spreading sequences: a block coding approach to spread spectrum, IEEE Commun. Lett., vol. 9, pp. 16-18, Jan. 2005. [2] C. DAmours and J.-Y. Chouinard, Parity bit selected and permutation spreading for CDMA/MIMO systems, in Proc. IEEE Veh. Tech. Conf., pp. 1475-1479, Apr. 2007. [3] V. Tarokh, H. Jafarkhani, and A. R. Calderbank, Space-time block codes from orthogonal designs, IEEE Trans. Inf. Theory, vol. 45, pp. 14561467, July 1999. [4] J. G. Proakis, Digital Communications, 4th. ed. New York: McGraw-Hill, 2001. [5] Y. Song, Parity bit selected spreading sequences for spread spectrum and code division multiple access systems, M. A. Sc thesis, University of Ottawa, 2005.