Scholarly article on topic 'The Alamouti Scheme with CDMA-OFDM/OQAM'

The Alamouti Scheme with CDMA-OFDM/OQAM Academic research paper on "Electrical engineering, electronic engineering, information engineering"

Share paper

Academic research paper on topic "The Alamouti Scheme with CDMA-OFDM/OQAM"

Hindawi Publishing Corporation EURASIP Journal on Advances in Signal Processing Volume 2010, Article ID 703513, 13 pages doi:10.1155/2010/703513

Research Article

The Alamouti Scheme with CDMA-OFDM/OQAM

Chrislin Lele,1 Pierre Siohan,2 and Rodolphe Legouable2

1 CNAM, Laetitia group, 292, rue Saint Martin, 75141 Paris, France

2 Orange Labs, 4, rue du Clos Courtel, BP 91226, 35512 Cesson Sevigne Cedex, France

Correspondence should be addressed to Pierre Siohan, Received 23 June 2009; Revised 4 October 2009; Accepted 29 December 2009 Academic Editor: Behrouz Farhang-Boroujeny

Copyright © 2010 Chrislin Lele et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

This paper deals with the combination of OFDM/OQAM with the Alamouti scheme. After a brief presentation of the OFDM/OQAM modulation scheme, we introduce the fact that the well-known Alamouti decoding scheme cannot be simply applied to this modulation. Indeed, the Alamouti coding scheme requires a complex orthogonality property; whereas OFDM/OQAM only provides real orthogonality. However, as we have recently shown, under some conditions, a transmission scheme combining CDMA and OFDM/OQAM can satisfy the complex orthogonality condition. Adding a CDMA component can thus be seen as a solution to apply the Alamouti scheme in combination with OFDM/OQAM. However, our analysis shows that the CDMA-OFDM/OQAM combination has to be built taking into account particular features of the transmission channel. Our simulation results illustrate the 2 X 1 Alamouti coding scheme for which CDMA-OFDM/OQAM and CP-OFDM are compared in two different scenarios: (i) CDMA is performed in the frequency domain, (ii) CDMA is performed in time domain.

1. Introduction

Increasing the transmission rate and/or providing robustness to channel conditions are nowadays two of the main research topics for wireless communications. Indeed, much effort is done in the area of multiantennas, where Space Time Codes (STCs) enable to exploit the spatial diversity when using several antennas either at the transmitting side or at the receiving side. One of the most known and used STC technique is Alamouti code [1]. Alamouti code has the nice property to be simple to implement while providing the maximum channel diversity. On the other hand, multicarrier modulation (MCM) is becoming, mainly with the popular Orthogonal Frequency Division Multiplexing (OFDM) scheme, the appropriate modulation for transmission over frequency selective channels. Furthermore, when appending the OFDM symbols with a Cyclic Prefix (CP) longer than the maximum delay spread of the channel to preserve the orthogonality, CP-OFDM has the capacity to transform a frequency selective channel into a bunch of flat fading channels which naturally leads to various efficient combinations of the STC and CP-OFDM schemes. However, the insertion of the CP yields spectral efficiency loss. In addition, the conventional OFDM modulation is based on

a rectangular windowing in the time domain which leads to a poor (sinc(x)) behavior in the frequency domain. Thus CP-OFDM gives rise to two drawbacks: loss of spectral efficiency and sensitivity to frequency dispersion, for example, Doppler spread.

These two strong limitations may be overcome by some other OFDM variants that also use the exponential base of functions. But then, in any case, as it can be deduced from the Balian-Low theorem, see, for example, [2], it is not possible to get at the same time (i) Complex orthogonality; (ii) Maximum spectral efficiency; (iii) A well-localized pulse shape in time and frequency. With CP-OFDM conditions (ii) and (iii) are not satisfied, while there are two main alternatives that satisfy two of these three requirements and can be implemented as filter bank-based multicarrier (FBMC) modulations. Relaxing condition (ii) we get a modulation scheme named Filtered MultiTone (FMT) [3], also named oversampled OFDM in [4], where the authors show that the baseband implementation scheme can be seen as the dual of an oversampled filter bank. But if one really wants to avoid the two drawbacks of CP-OFDM the only solution is to relax the complex orthogonality constraint. The transmission system proposed in [5] is a pioneering work that illustrates this possibility. Later on an efficient Discrete

Fourier Transform (DFT) implementation of the Saltzberg system [5], named Orthogonally Quadrature Amplitude Modulation (O-QAM), has been proposed by Hirosaki [6]. To the best of our knowledge, the acronym OFDM/OQAM, where OQAM now corresponds to Offset QAM, appeared for the first time in [7]. In [7] the authors also present an invention of Alard, named Isotropic Orthogonal Transform Algorithm (IOTA), and explicitly use a real inner product to prove the orthogonality of the OFDM/OQAM-IOTA modem. A formal link between these continuous-time modulation models and a precise filter bank implementation, the Modified Discrete Fourier Transform (MDFT) [8], is established in [9].

It is now recognized in a large number of applications, with cognitive radio being the most recent and important one [10], that appropriate OFDM/OQAM pulse shapes which satisfy conditions (ii) and (iii) can be designed, and these can lead to some advantages over the CP-OFDM. However, most of these publications are related to a single user case and to Single-Input-Single-Output (SISO) systems. On the contrary, only a few results are available concerning more general requirements being related either to multiaccess techniques or multiantenna, that is, of Multiple Input Multiple Output (MIMO) type. In a recent publication [11], we have shown that, under certain conditions, a combination of Coded Division Multiple Access (CDMA) with OFDM/OQAM could be used to provide the complex orthogonal property. On the other hand, it has also been shown in [12] that spatial multiplexing MIMO could be directly applied to OFDM/OQAM. However, in the MIMO case there is still a problem which has not yet found a fully favorable issue: It concerns the combined use of the popular STBC Alamouti code together with OFDM/OQAM. Basically the problem is related to the fact that OFDM/OQAM by construction produces an imaginary interference term. Unfortunately, the processing that can be used in the SISO case, for cancelling it at the transmitter side (TX) [13] or estimating it at the receiver side (RX) [14], cannot be successfully extended to the Alamouti coding/decoding scheme. Indeed, the solutions proposed so far are not fully satisfactory. The Alamouti-like scheme for OFDM/OQAM proposed in [15] complicates the RX and introduces a processing delay. The pseudo-Alamouti scheme recently introduced in[ 16] is less complex but requires the appending of a CP to the OFDM/OQAM signal which means that condition (ii) is no longer satisfied.

The aim of this paper is to take advantage of the orthogonality property resulting from the CDMA-OFDM/OQAM combination introduced in [11] to get a new MIMO Alamouti scheme with OFDM/OQAM. The contents of our paper is as follows. In Section 2, after some general descriptions of the OFDM/OQAM modulation in Section 2.1 and the MIMO Alamouti scheme in Section 2.2, we will combine both techniques. However, as we will see in Section 2.3, the MIMO decoding process is very difficult because of the orthogonality mismatch between Alamouti and OFDM/OQAM. In Section 3, we propose to combine Alamouti and CDMA-OFDM/OQAM in order to solve the problem. Indeed, in [11], we have shown that the combination

of CDMA and OFDM/OQAM (CDMA-OFDM/OQAM) can provide the complex orthogonality property; this interesting property is first recalled in Section 3.1. Then, two different approaches with Alamouti coding are proposed, by considering either a spreading in the frequency (in Section 3.2) or in the time domain (in Section 4.2). When spreading in time is considered, 2 strategies of implementing the Alamouti coding are proposed. Some simulation results finally show that, using particular channel assumptions, the Alamouti CDMA-OFDM/OQAM technique achieves similar performance to the Alamouti CP-OFDM system.

2. OFDM/OQAM and Alamouti

2.1. The OFDM/OQAM Transmultiplexer. The baseband equivalent of a continuous-time multicarrier OFDM/OQAM signal can be expressed as follows [7]:

s(t) = £ Xamnng(t - mo)ej2nmFoty„ (1)

m=0 neZ ' ' '


with Z the set of integers, M = 2N an even number of subcarriers, F0 = 1/T0 = 1/2T0 the subcarrier spacing, g the prototype function assumed here to be a real-valued and even function of time, and vm,n an additional phase term such that vm,n = jm+nej<P°, where 00 can be chosen arbitrarily. The transmitted data symbols amn are real-valued. They are obtained from a 22K-QAM constellation, taking the real and imaginary parts of these complex-valued symbols of duration T0 = 2t0, where T0 denotes the time offset between the two parts [2, 6, 7, 9].

Assuming a distortion-free channel, the Perfect Reconstruction (PR) of the real data symbols is obtained owing to the following real orthogonality condition:

R (gm,n, gp,q}} = RjJ gm,n(t)gpq (t)dtj = 8m,p8n,q, (2)

where * denotes conjugation, (•, •} denotes the inner product, and Sm,p = 1 if m = p and Sm,p = 0 if m = p. Otherwise said, for (m, n) = (p, q), (gm,n, gp,q} is a pure imaginary number. For the sake of brevity, we set

(g^n = i (gm ,n, gp,q }. The orthogonality condition for the

prototype filter can also be conveniently expressed using its ambiguity function

Ag(n, m) = g(u — nT0)g(u)e2inmF°udu.

J — o

It is well-known [7] that to satisfy the orthogonality condition (2), the prototype filter should be chosen such that Ag(2n,2m) = 0 if (n, m) = (0,0) and Ag(0,0) = 1.

In practical implementations, the baseband signal is directly generated in discrete time, using the continuous-time signal samples at the critical frequency, that is, with Fe = MF0 = 2NF0. Then, based on [9], the discrete-time

Figure 1: Transmultiplexer scheme for the OFDM/OQAM modulation.

Figure 2: The transmission scheme based on OFDM/OQAM.

baseband signal taking the causality constraint into account, is expressed as

s[k] = X Xam,ng(k - nN)ej2n

m(k-(Lg -1)/2)

m=0 neZ

gm,n [k]

The parallel between (1) and (4) shows that the overlapping of duration t0 corresponds to N discrete-time samples. For the sake of simplicity, we will assume that the prototype filter length, denoted Lg, is such that Lg = bM = 2bN, with b being a positive integer. With the discrete time formulation, the real orthogonality condition can also be expressed as:

R {gm,n, gp,q)} = R X gm,n[k]gpq [k][ = Sm,pSn,q-[keZ J

As shown in [9], the OFDM/OQAM modem can be realized using the dual structure of the MDFT filter bank. A simplified description is provided in Figure 1, where it has to be noted that the premodulation corresponds to a single multiplication by an exponential whose argument depends on the phase term vm,n and on the prototype length. Note also that in this scheme, to transmit QAM symbols of a given duration, denoted T0, the IFFT block has to be run twice faster than for CP-OFDM. The polyphase block contains the polyphase components of the prototype filter g. At the RX side, the dual operations are carried out.

The prototype filter has to be PR, or nearly PR. In this paper, we use a nearly PR prototype filter, with length Lg = 4M, resulting from the discretization of the continuous time function named Isotropic Orthogonal Transform Algorithm (IOTA) in [7].

Before being transmitted through a channel the baseband signal is converted to continuous-time. Thus, in the rest of this paper, we present an OFDM/OQAM modulator that

delivers a signal denoted s(t), but keeping in mind that this modulator corresponds to an FBMC modulator as shown in Figure 1.

The block diagram in Figure 2 illustrates our OFDM/ OQAM transmission scheme. Note that compared to Figure 1, here a channel breaks the real orthogonality condition thus an equalization must be performed at the receiver side to restore this orthogonality.

Let us consider a time-varying channel, with maximum delay spread equal to A. We denote it by h(t, t) in time, and it can also be represented by a complex-valued number H^n for subcarrier m at symbol time n. At the receiver side, the received signal is the summation of the s(t) signal convolved with the channel impulse response and a noise component n(t). For a locally invariant channel, we can define a neighborhood, denoted QAm,An, around the (m0, n0) position, with


= {(p, q), I p\ - Am, M ^ дп i Hi


Hi') i,

mo,no j > (6)

and we also define QAm,An = ^Am,An -{(0,0)}.

Note also that An and Am are chosen according to the time and bandwidth coherence of the channel, respectively. Then, assumingg(t - t - nT0) « g(t - nT0),forall t e [0, A], the demodulated signal can be expressed as [13, 14, 17]

yl0,n0 = Hm0,no (amo,no + jam0,n0^) + Jmo,no + tfmo,n

with nm0,n0 = in,gm0,n0) the noise component, ^0,^ interference created by the neighbor symbols, given by

X amo+p,no+q (g)


mo+ p,no+q,

and Jm0,n0 the interference created by the data symbols outside QAm,A«-

It can be shown that, even for small size neighborhoods, if the prototype function g is well localized in time and frequency, Jm0,n0 becomes negligible when compared to the noise term nm0,«0- Indeed a good time-frequency localization [7] means that the ambiguity function of g, which is directly related to the (g} m°+p „o+q terms, is concentrated around its origin in the time-frequency plane, that is, only takes small values outside the QAm,A« region. Thus, the received signal can be approximated by


For the rest of our study, we consider (9) as the expression of the signal at the output of the OFDM/OQAM demodulator.

2.2. Alamouti Scheme: General Case. In order to describe the Alamouti scheme [1], let us consider the one-tap channel model described as

yk = hk,uSk,u + nk,

where, at time instant k, hk,u is the channel gain between the transmit antenna u and the receive antenna and nk is an additive noise. We assume that hk,u is a complex-valued Gaussian random process with unitary variance. One transmit antenna and one receive antenna are generally referred as SISO model. We consider coherent detection, that is, we assume that the receiver has a perfect knowledge ofhk,u.

The Alamouti scheme is implemented with 2 transmit and one receive antennas. Let us consider s2k and s2k+1 to be the two symbols to transmit at time (time and frequency axis can be permuted in multicarrier modulation.) instants 2k and 2k + 1, respectively. At time instant 2k, the antenna 0 transmits s2k/V2 whereas the antenna 1 transmits s2k+1^V2. At time instant 2k + 1, the antenna 0 transmits —(s^+ova/2 whereas the antenna 1 transmits s|k/V2. The 1/V2 factor is added to normalize the total transmitted power. The received signal samples at time instants 2 k and 2 k + 1 are given by

y2k = (h2k,oS2k + h2k,is2k+i) + n2k,

y2k+1 = {-^2k+1,o(S2k+l)* + h2k+1,l(S2k )*) + .2k+1-

Assuming the channel to be constant between the time instants 2k and 2k + 1, we get

y2*k+1 = v2

h2k,1 -(h2k,o)

S2k n2k

s2k+1 n2*k+1

Note that H2k is an orthogonal matrix with H2kHH = (1/2)( | h2k,012 + |h2k,il2)I2, where I2 is the identity matrix of size (2,2) and H stands for the transpose conjugate

operation. Thus, using the Maximum Ratio Combining (MRC) equalization, the estimates s2k and s2k+1 are obtained as

S2k v2

s2k+1 1 h2k,0 1 2 + 1 h2k,11

= S2k s2k+1 + ^2k ^2k+1


^2k v2

^2k+1 h2k,0 1 2 + 1 h2k,1 1

h* h2k,0

h2k,1 - (h2k,o)

y2k y2k+1

h2k,0 h2k,1

h2k,1 - (h2k,o)

n*k+1 (14)

Since the noise components n2k and n2k+1 are uncorrelated, №kI2) = -E(l№k+1|2) = 2No/(|h2k,ol2 + |h2k,112), where N0 denotes the monolateral noise density. Thus, assuming a QPSK modulation, based on [18], the bit error probability, denoted pb, is given by

pb = Q

| h2k,0 | + | h2k,1 | 2

where SNRf denotes the Signal-to-Noise Ratio (SNR) at the transmitter side. When the two channel coefficients are uncorrelated, we will have a diversity gain of two [18].

2.3. OFDM/OQAM with Alamouti Scheme. Equation (9) indicates that we can consider the transmission of OFDM/OQAM on each subcarrier as a flat fading transmission. Moreover, recalling that in OFDM/OQAM each complex data symbol, dd$,n, is divided into two real symbols, Rid^n} and lid^n}, transmitted at successive time instants, transmission of a pair of data symbols, according to Alamouti scheme, is organized as follows:

am,2n,0 R dLC)2n}, am,2n,1 = R{ dm,2n+1}, am,2n+1,0 = dm?2^, am,2n+1,1 = ^J,

am,2n+2,0 = -R| (dm?2n+0 | = -R{d<m,2n+^ = -am,2n,1, R j (^n) | = R{dm?24 = am,2n,0, (dm?2n+0 } = ^n+J = am,2 (d(K)2^ | = dm?24 = am,2

am,2n+2,1 am,2n+3,0 = — am,2n+3,1



We also assume that in OFDM/OQAM the channel gain is a constant between the time instants 2n and 2n + 3. Let us denote the channel gain between the transmit antenna i and the receive antenna at subcarrier m and time instant n by hm,n,i. Therefore, at the single receive antenna we have

This results in

zm ,2 n

(zm,2n+1 )

hm,2n,0 hm,2n,1

(hm,2n,0* _ (hm,2n,0)*


ym,2n — hm,2n,0 ( am,2n,0 + jam,2n,0)

+ hm,2n,1 ( am,2n,1 + jam,2n,1^j + nm,2n,0,

ym,2n+1 — hm,2n,0 ( am,2n+1,0 + jaam;2n+1fi)

+ hm,2n,1 ( am,2n+1,1 + jam,2n+1,1^ + nm,2n+1,1,

ym,2n+2 — hm,2n,0^ am,2n+2,0 + ja^l^22n+2,0)

+ hm,2n,1 ( am,2n+2,1 + ja!j),2n+2,^ + nm,2n+2,0,

ym,2n+3 — hm,2n,0 («m,2n+3,0 + jam)2n+3,0)

+ hm,2n,1 ( «m,2n+3,1 + ja!î)2n+3,^ + «m,2n+3,1-


zm,2n ym,2n + jym,2n+1, zm,2n+1 ym,2n+2 + jym,2n+3,

and using (16), we obtain

— k /-/(c) I L j(c)

zm,2n — hm,2n,0dm,2n + hm,2n,1 dm,2n+1

+ hm,2n,0xm,2n,0 + hm,2n,1xm,2n,1 + Km,2n,0,

((c) \ ^ / (c) \ ^

dm,2n+1y + hm,2n,1 y dm,2n j

— hm,2n,0 (xm,2n+2,0) + hm,2n,1 (xm,2n+2,1 ) + Km,2n+2,0,


V - _/7(i) + in(i)

xm,2n,0 — am,2n+1,0 + jam,2n,0,

xm,2n,1 — am,2n+1,1 + ]am,2n,1, Km,2n,0 nm,2n,0 + jnm,2n+1,0, Km,2n,0 — nm,2n+2,0 + Jnm,2n+3,0,

xm ,2 n+2,0 — am,2n+3,0 + jam,2n+2,0,

(i) (i) xm ,2 n+2,1 — am,2n+3,1 jam,2n+2,1-

hm,2n,0 hm,2n,1 0 0

0 0 (hm,2n,0

xm,2n,0 xm,2n,1 xm ,2 n+2,0 xm ,2 n+2,1

Km ,2 n (Km,2n+1 )

We note that Q2n is an orthogonal matrix which is similar to the one found in (12) for the conventional 2 x 1 Alamouti scheme. However, the K2nX2n term appears, which is an interference term due to the fact that OFDM/OQAM

(17) has only a real orthogonality. Therefore, even without noise and assuming a distortion-free channel, we cannot achieve a good error probability since K2nxjn is an inherent "noise interference" component that, differently from the one expressed in (9), cannot be easily removed. (in a particular case, where hm,2n,0 = hm,2n,1, one can nevertheless get rid of

(18) the interference terms.)

To tackle this drawback some research studies are being carried out. However, as mentioned in the introduction, the first one [15] significantly increases the RX complexity, while the second one [16] fails to reach the objective of theoretical maximum spectral efficiency, that is, does not satisfy condition (ii). The one we propose hereafter is based on a combination of CDMA with OFDM/OQAM and avoids these two shortcomings.

3. CDMA-OFDM/OQAM and Alamouti

3.1. CDMA-OFDM/OQAM. In this section we summarize the results obtained, assuming a distortion-free channel, in [19] and [11] for CDMA-OFDM/OQAM schemes transmitting real and complex data symbols, respectively. Then, we show how this latter scheme can be used for transmission over a realistic channel model in conjunction with Alamouti coding.

3.1.1. Transmission of Real Data Symbols. We denote by Nc the length of the CDMA code used and assume that NS — M/Nc is an integer number. Let us denote by cu — (20) [c0,u ■■■ cNc_1,u] , where (■) stands for the transpose operation, the code used by the uth user. When applying spreading in the frequency domain such as in pure MC-CDMA (Multi-Carrier-CDMA) [20], for a user U0 at a given time n0, NS different data are transmitted denoted by: du0,n0,0,du0,n„,1,•••,du0,n0,Ns-1. Then by spreading with

Real data

^ Channel

Figure 3: Transmission scheme for the CDMA-OFDM/OQAM system with spreading in frequency of real data.

the cu codes, we get the real symbol am0,n0 frequency m0 and time n0 by

amo,no = ^ cm0/Nc,udu,no,[mo/Nd, u=0

transmitted at

where [7 is the number of users, / the modulo operator, and LJ the floor operator. From the am0,n0 term, the reconstruction of du,n0,p (for p <E [0,NS - 1]) is insured thanks to the orthogonality of the code, that is, c^1cu2 = <5u1,u2; see [21] for more details. Therefore, noise taken apart, the despreading operator leads to

du,no,p X cm,uapNc+m,no • m=0

In [19], it is shown that, since no CP is inserted, the transmission of these spread real data (du,n0,p) can be insured at a symbol rate which is more than twice the one used for transmitting complex MC-CDMA data. Figure 3 depicts the real CDMA-OFDM/OQAM transmission scheme for real data and a maximum spreading length (limited by the number of subcarriers), where after the despreading operation, only the real part of the symbol is kept whereas the imaginary component iu,n is not detected. This scheme satisfies a real orthogonality condition and can work for a number of users up to M.

3.1.2. Interference Cancellation. A closer examination of the interference term is proposed in [11] assuming that the CDMA codes are Walsh-Hadamard (W-H) codes of length M = 2N = 2n, with n an integer. The prototype filter being of length Lg = bM, its duration is also given by the indicating function I|n-n0|<2b, equal to 1 if In - n0l < 2b and 0 elsewhere. Then, the scalar product of the base functions can be expressed as

{gm,n, gp,n0^ = $m-p,n-n0 + jym,n Iln-n0l<2b, (24)

where yim,'nno) is given by

ympf = (-1)m(n+no) jm+n-p-no Ag (n-no, m-p)j • (25)

For a maximum spreading length, that is, M = 2N = Nc, based on [11, Equation (18)], the interference term when transmitting real data can be expressed as

U-1 2b-1

u=o n = -2b+1, n = o

Î2N -1 2N -1

n+no,u I

y y c c Y(p>no)

p = o m = o

It is shown in [11] that if U < M/2 spreading codes are properly selected then the iu,n interference is cancelled. The W-H matrix being of size M = 2N = 2n can be divided into two subsets of column indices, SI and S", with cardinal equal to M/2 making a partition of all the index set. To guarantee the absence of interference between users, the construction rule for theses two subsets is as follows.

For n0 = 1, each subset is initialized by setting: S1 = {0} and S1 = {1}.

Let us now assume that, for a given integer n = n0, the two subsets contain the following list of indices:

ST = {¿1,1, ¿1,2, ¿1,3, •••, ¿1,2"o-i}, ST = {¿2,1, ¿2,2, ¿2,3, •••, ¿2,2"o-i} •

These subsets are used to build two new subsets of identical size such that

sno = {¿2,1 + 2no, ¿2,2 + 2no, ¿2,3 + 2no, ••• , ¿2,2»o-1 + 2no }, S"2° = {¿u + 2no, ¿1,2 + 2no, ¿1,3 +2no, •••, ¿1,2no-1 +2no }•

Then, we get the subsets of higher size, n = n0 + 1, as follows:

Sn0+1 = Sn0 u sT, S2n0+1 = s"0 u S2n0. (29)

Applying this rule one can check that for n = 5, as an example, we get

S5 = {1,4,6,7,10,11,13,16,18,19,21,24,25,28,30,31},

S2 = {2,3,5,8,9,12,14,15,17,20,22,23,26,27,29,32}.

Hence, for a given user and at a given time, we get du,n = du,n and iu,n = 0 and these equalities hold for a number of U users up to M/2. The complete proof given in [11] takes advantage ofthree properties ofW-H codes.

Complex data d$

Figure 4: Transmission scheme for the CDMA-OFDM/OQAM system with spreading in frequency of complex data.

3.1.3. Transmission of Complex Data Symbols. As the imaginary component can be cancelled when transmitting real data through a distortion-free channel when using CDMA-OFDM/OQAM, one can imagine to extend this scheme to the transmission of complex data. Indeed, the transmission system being linear, real and imaginary parts will not interfere if the previous rule is satisfied.

Then, denoting by d^u the complex data to transmit, the OFDM/OQAM symbols transmitted at time пт0 over the carrier m and for the code u are complex numbers, that is, are complex symbols. The corresponding complex CDMA-OQAM transmission scheme is depicted in Figure 4. The baseband equivalent of the transmitted signal, with a spreading in frequency, can be written as

2N -1 U-1

SF (t) =X X Xm,ngm,n(t) with Xm,n =X a^)n,u- (31)

neZ m=0 u=0

In this expression, as in [11], we assume that the phase term is vn,m = jn+m(-1)nm,thatis, ф0 = nnm. Then, if the U codes are all in SI, or S;>, the interference terms are cancelled and we get

vn, u, 4cu = dnu. (32)

Otherwise said, this CDMA-OFDM/OQAM scheme satisfies a complex orthogonality condition, that is, the back-to-back transmultiplexer is a PR system for the transmission of complex data. Note also that, differently from what we saw for the transmission of real data symbols, as explained in Section 3.1.2, here the maximum number of users is M/2 instead of M. In both cases the overall data rate is therefore the same.

In the presence of a channel, an equalization must be performed before the despreading since the signal at the output of the equalization block is supposed to be free from any channel distortion or attenuation. Then, the signal at the equalizer output is somewhat equivalent to the one obtained with a distortion-free channel. Then, despreading operation will recover the complex orthogonality.

Now, the question is: "Can we use this complex orthogonality for combining Alamouti coding scheme and CDMA-OFDM/OQAM?". Let us analyze this problem assuming a one-tap equalization.

3.2. Alamouti with CDMA-OFDM/OQAM with Spreading in the Frequency Domain. In a realistic transmission scheme the

channel is no longer distortion-free. So, we assume now that we are in the case of a wireless Down-Link (DL) transmission and perfectly synchronized.

3.2.1. Problem Statement. Before trying to apply Alam-outi scheme to CDMA-OFDM/OQAM, one must notice that the channel equalization process is replaced by the Alamouti decoding. When adapting Alamouti scheme to CDMA-OFDM/OQAM, the equalizer component, depicted in Figure 4, must be replaced by the Alamouti decoding process and the despreading operation must be carried out just after the OFDM/OQAM modulator. Then, contrary to the DL conventional MC-CDMA case, the despreading operation must be performed before the Alamouti decoding. Indeed, with OFDM/OQAM, we can only recover a complex orthogonality property at the output of the despreading block. This point is critical since it rises the question: does complex orthogonality hold in CDMA-OFDM/OQAM if we perform despreading operation before equalization? and if yes, at which cost? The first point leads to the following problem: let us consider complex quantities tj, fy, A;. Does it sound possible to obtain Xм-1 в;(Ъ/А;) (equalization + despreading) from Xы)1 ejtj (despreading)? Here, equalization is materialized by e; = tj/Aj and the despreading operation by £в;е;. The answer is in general (obviously) NO, except if all the A; are the same, that is, A; = Aj = A. That is the case if we are in the presence of a constant channel over frequencies. Indeed, only in this case the order of the equalization and despreading operations can be exchanged without impairing the transmission performance. Conversely, applying despreading before equalization should have an impact in terms of performance for a channel being nonconstant in frequency. So, let us consider at first a flat channel. Then the subset of subcarriers where a given spreading code is applied will be affected by the same channel coefficient.

3.2.2. Implementation Scheme. In a SISO configuration, if we denote by hn,; the single channel coefficient between the transmit antenna j and the single receive antenna at time instant n, the despreaded signal is given by:

z(c) = h d(c) ■ (33)

zno,uo hno,;dno,uo,j, (33)

where dn0,uo,; is the complex data of user u0 being transmitted at time instant n0 by antenna j. Now, if we consider a system

Figure 5: An Alamouti CDMA-OFDM/OQAM transmitter.

W 10"2 «

Figure 6: An Alamouti CDMA-OFDM/OQAM receiver.

0 5 10 15 20

- Alamouti with CDMA-OFDM/OQAM

-*- Alamouti with CP-OFDM

Figure 7: BER for the complex version of the Alamouti CDMA-OFDM/OQAM with spreading in frequency domain, versus Alamouti CP-OFDM for transmission over a flat fading channel.

be performed in the same way. Figures 5 and 6 present the Alamouti CDMA-OFDM/OQAM transmitter and receiver, respectively.

with 2 antennas with indexes 0 and 1, respectively, and if we apply Alamouti coding scheme to every user u data, denoting by sk,uthe main stream of complex data for user u, we have

at time 2k,

2k,u,0 (c) _ s2k+1,u

2k,u,1 , at time 2k + 1,

j(c) _ " (s2k+1,u)

2k+1,u,0 (c)


s2k v2 '

For a flat fading channel, ignoring noise, the despreaded signal for user u is given by


r z(c) 1 z2k,u 1

(z(c) V \z2k+1,u) " v2

Zn,u _ hn,0dn,u,0 + hn,1 dn,u,1-

^2k,0 h2k,1 (^2k+1,0 * " (^2k+1,^ *

s2k,u s2k+1,u

This is the same decoding equation as in the Alamouti scheme presented in Section 2.2. Hence, the decoding could

3.2.3. Performance Evaluation. We compare the proposed Alamouti CDMA-OFDM/OQAM scheme with the Alamouti OFDM using the following parameters:

(i) QPSK modulation

(ii) M = 128 subcarriers

(iii) maximum spreading length, implying that the W-H spreading codes are of length Nc = 128,

(iv) flat fading channel (one single Rayleigh coefficient for all 128 subcarriers);

(v) the IOTA prototype filter with length 512,

(vi) zero forcing one tap equalization for both transmission schemes,

(vii) no channel coding.

Figure 7 gives the performance results. As expected, both systems perform the same.

4. Alamouti and CDMA-OFDM/OQAM with Time Domain Spreading

In this section, we keep the same assumptions as the ones used for the transmission of complex data with a spreading in frequency. Firstly, we again suppose that the prototype function is a real-valued symmetric function and also that the W-H codes are selected using the procedure recalled in Section 3.1.2.

Figure 8: Transmission scheme for the CDMA-OFDM/OQAM system with spreading in time of complex data.

4.1. CDMA-OFDM/OQAM with Spreading in the Time Domain. Let us first consider a CDMA-OFDM/OQAM system carrying out a spreading in the time domain, that is, on each subcarrier m the data are spread over the time duration frame length. Let us consider Lf the length of the frame, that is, the frame is made of M data in the frequency domain and Lf data in time domain. Nc is the length of the spreading code. We assume that NS = Lf/Nc is an integer number. Let us denote by: cu = [c0,u ■■■ cNc_1,u]r the code used by the uth user. Then, for a user u0 at a given frequency m0, NS different data are transmitted denoted by: du0,m0,0, d«0,m0,1, •••, du0,m0,NS"1. By spreading with the Çu codes, we get the real symbol flm„,«0 transmitted at frequency m0 and time n0 by

= X cn„/Nc,udu,m0,[n0/Nci, u=0

where U is the number of users. From the am0,n0 term, the reconstruction of du,m0,p (for p <E [0, NS — 1]) is insured thanks to the orthogonality of the code, that is, c^jcu2 = Uu1,u2, see [21] for more details. Therefore, the despreading operator leads to

du,m0,p = cn,uamQ,pNc+n•

We now propose to consider the transmission of complex data, denoted d(c)u,p, using U well chosen W-H codes. In order to establish the theoretical features of this complex CDMA-OFDM/OQAM scheme, we suppose that the transmission channel is free of any type of distortion. Also, for the sake of simplicity, we now assume a maximum spreading length (in time domain, Lf = Nc). We denote by d^u the complex data and by a^^u. = cn,ud(m)u the complex symbol transmitted at time nr0 over the carrier m and for the code u. As usual, the length of the W-H codes are supposed to be a power of 2, that is, Lf = 2L = 2q with q an integer.

The block diagram of the transmitter is depicted in Figure 8. For a frame containing 2L OFDM/OQAM data symbols, the baseband signal spread in time, can be written as

2L-1 2N -1

ST (t) = X X


n=0 m=0

with xm,n = X 1

c d(c) cn,udm,u.

In (39), we assume that the phase term is vm,n = jm+n as in [7]. Let us also recall that the prototype function g satisfies the real orthogonality condition (2) and is real-valued and symmetric, that is, g(t) = g( —t). To express the complex inner product of the base functions gm,n, using a similar procedure that led to (24), we get

{gm,n, gp,n0 ^ = Um—p,n—n0 + j^m,n I\n—n0\<2b, (40)

where Am,«0' is given by

tâf = (-1)n(p+m) jm+n-p-nAg(n - «0,m - p)}

As the channel is distortion-free, the received signal is y(t) s(t) and the demodulated symbols are obtained as follows:

ym^,n0 = (y,gm0,n0) •

In this configuration, the demodulation operation only takes place when the whole frame is received. Then, the despreading operation gives us the despreaded data for the code u0 as

2L-1 2L-12N-1

zm°,u0 = X cq,u0 ym0,,q = X cq,u X S xm,n(gm,n, gmo,q)•

q=0 n=0 m=0

Replacing xm,n and {gm>n,gm0>q) by their expression given in (39) and (40), respectively, we get:

2L—1 2L—12N—1 U— 1

z(c) _ y c y y y c d(c) (x + a(m°,q})

zm0,u0 Z.. cq,u0 Z.. Z.. Z.. cn,udm,u\um—m0,n—q + j^m,n J-

q=0 n=0 m=0 u=0

Splitting the summation over m in two parts, with m equal to m0 or not to m0, (44) can be rewritten as:

U-1 2L-1

Z(c) - V d(c) y c c

zm0,u0 Z.. dm0,u Z-, cp,u0 cp,u u=0 q=0

U-1 2N-1 /2L-12L-1

+ j X X ^u X Xcq,u0 cn,u^m,n


^u=0 m=0,m = m0 \q=0 n=0

Considering the W-H codes, we obtain

z(c) = d(c)

m0,u0 — m0,u0

fU-1 2N-1

+ j I X X dmA X X

(m0,q) q,uo cn,u^m,n

yu—0 m—0,m — iq

^ q—0 n—0

In [11], for W-H codes of length 2L, we have shown that for n = n0,


Y Y c c Jf,^ - 0

/ . / . cp,u0 cm,u/m,n+n0 — 0, p—0 m—0

where y!,'nno) is given by

= (-1)m(n+n0) jm+n-P-n0Ag {n-no, m-p)j. (48)

To prove the result given in (47), we had the following requirements:

(i) W-H codes satisfy the set of mathematical properties that are proved in [11].

(ii) Since g is a real-valued function, Ag(n,0) is real valued and the ambiguity function of the prototype function g also satisfies the identities Ag(-n, m) = (-1)nmAg(n, m) and Ag(n, m) = A*(n, -m).

Using these results, (47) can be proved straighforwardly.

It is worth mentioning that the above requirements are independent of the phase term and thus are satisfied in the case of the CDMA-OFDM/OQAM system with spreading in time. It can also be shown that the modification of the phase term vm,n leads to the substitutions n — m and p + m — n + n0, in obtaining (48) from (41). Accordingly the second term on the right hand side of (46) vanishes and we obtain

Уmo, ^ £cL — dllu^

4.2. Alamouti with CDMA-OFDM/OQAM with Spreading in Time. Now, if we consider the CDMA-OFDM/OQAM with spreading in time, contrary to the case of a spreading in frequency domain, as long as the channel is constant during the spreading time duration, we can perform despreading before equalization. At the equalizer output we will have a complex orthogonality. Indeed, considering at first a SISO case, if we denote by hmj the channel coefficient between a single transmit antenna i and the receive antenna at subcarrier m, the despreaded signal is given by

z(c) = h d('

where d^uj is the complex data of user u being transmitted at subcarrier m by antenna i. Thus, we can easily apply the Alamouti decoding scheme knowing the channel is constant for each antenna at each frequency. Otherwise said, the method becomes applicable for a frequency selective channel. Actually two strategies can be envisioned.

(1) Strategy 1. Alamouti performed over pairs of frequencies. If we consider a system with 2 transmit antennas, 0 and 1, and if we apply the Alamouti coding scheme to every user u data, that is, if we denote by sm,u the main stream of complex data for user u, then we have the following at subcarrier 2m:

and at subcarrier 2m + 1,

(c) s2m,u

2m,u,0 V2

(c) s2m+1,u

2m,u,1 V2

- {s2m+1,u)

(c) 2m+1,u,0

d(c) _ hm d2m+1,u,1 •

Then, considering a flat fading channel, the despreaded signal for user u is given by

zl)u hm,0dmu,0 + hm,1dm,u,1•

Therefore, we get

r ¿f] 1 2m,u 1

(z2m+1,u) — 72

h2m,0 h2m+1,1

(h2m+1,0 * - (hi

h2m,1 h2m+1,0

s2m,u s2m+1 ,u

That means, when assuming the channel to be flat over two consecutive subcarriers, that is, h2mj = h2m+1,; for all i, we have exactly the same decoding equation as the Alamouti scheme presented in Section 3.2, by permuting the frequency and time axis. Then, the decoding is performed in the same way.

(2) Strategy 2. Alamouti performed over pairs of spreading codes. In this second strategy, we apply the Alamouti scheme on pairs of codes, that is, we divide the U codes in two groups (assuming U to be even). That is, we process the codes by pair (u0, u1). We denote by sm,Uo,Ul the main stream of complex data for user pair (u0, u1). At subcarrier m, antennas 0 and 1 transmit


j(c) _ sm+1,uo,u1 dm,uo,1 — ,


(sm+1 ,u0,u1

dm,u1,1 •

At the receiver side we get,

hm,0 hm,1

(hm,0 * - (hm,o) *

r z(c) 1 zm,uo 1

{zm>u1 ^ — 72


2L 1 2L 1

(c) sm,uo,u1


-Alamouti-CDMA-OFDM/OQAM (strategy2)

-0- Alamouti-CDMA-OFDM/OQAM (strategyl) -0- Alamouti CP-OFDM

Figure 9: BER for two complex versions of the Alamouti CDMA-OFDM/OQAM with spreading in time domain, versus Alamouti CP-OFDM for transmission over the 4-path frequency selective channel.

-*- Alamouti-CDMA-OFDM/OQAM (strategyl)

- Alamouti-CDMA-OFDM/OQAM (strategy2)

-0- Alamouti CP-OFDM

Figure 10: BER for two complex versions of the Alamouti CDMA-OFDM/OQAM with spreading in time domain, versus Alamouti CP-OFDM for transmission over the 7-path frequency selective channel.

Then, we do not need to consider the channel constant over two consecutive subcarriers. We have exactly the same decoding equation as the Alamouti scheme presented in Section 3.2. Hence, the decoding is performed in the same way.

We have tested two different channels considering each time the same channel profile, but with different realizations, between the 2 transmit antennas and one receive antenna. The Guard Interval (GI) is adjusted to take into account the delay spread profiles corresponding to a 4-path and to a 7-path channel. The 4-path channel is characterized by the following parameters:

(i) power profile (in dB): 0, -6, -9, -12,

(ii) delay profile (in samples): 0, 1, 2, 3,

(iii) GI for CP-OFDM: 5 samples,

and the 7-path by

(i) power profile (in dB): 0, -6, -9, -12, -16, -20, -22,

(ii) delay profile (in samples): 0, 1, 2, 3, 5, 7, 8,

(iii) GI for CP-OFDM: 9 samples;

We also consider the following system parameters:

(i) QPSK modulation,

(ii) M = 128 subcarriers,

(iii) time invariant channel (no Doppler),

(iv) the IOTA prototype filter of length 512,

(v) spreading codes of length 32, corresponding to the frame duration (32 complex OQAM symbols),

(vi) number of CDMA W-H codes equals to 16 in complex OFDM/OQAM, with symbol duration r0 and this corresponds to 32 codes in OFDM, with symbol duration 2r0, leading to the same spectral efficiency

(vii) zero forcing, one tap equalization,

(viii) no channel coding.

In Figures 9 and 10, the BER results of the Alamouti CDMA-OFDM/OQAM technique for the two proposed strategies are presented.

The two strategies perform the same until a BER of 10-3 or 10-2 for the 4 and 7-path channel, respectively. For lower BER the strategy 2 performs better than the strategy 1. This could be explained by the fact that strategy

1 makes the approximation that the channel is constant over two consecutive subcarriers. This approximation leads to a degradation of the performance whereas the strategy

2 does not consider this approximation. If we compare the performance of Alamouti CDMA-OFDM/OQAM strategy 2 with the Alamouti CP-OFDM, we see that both system perform approximately the same. It is worth mentioning that however the corresponding throughput is higher for the OFDM/OQAM solutions (no CP). Indeed, it is increased by approximately 4 and 7% for the 4 and 7-path channels, respectively.

5. Conclusion

In this paper, we showed that the well-known Alam-outi decoding scheme cannot be directly applied to the OFDM/OQAM modulation. To tackle this problem, we proposed to combine the MIMO Alamouti coding scheme with CDMA-OFDM/OQAM. If the CDMA spreading is carried out in the frequency domain, the Alamouti decoding scheme can only be applied if the channel is assumed to be flat. On the other hand, for a frequency selective channel, the CDMA spreading component has to be applied in the time domain. For the Alamouti scheme with time spreading CDMA-OFDM/OQAM, we elaborate two strategies for implementing the MIMO space-time coding scheme. Strategy 1 implements the Alamouti over pairs of adjacent frequency domain samples whereas the strategy 2 processes the Alamouti coding scheme over pairs of spreading codes from two successive time instants. Strategy 2 appears to be more appropriate since it requires less restrictive assumptions on the channel variations across the frequencies. We also made some performance comparisons with Alamouti CP-OFDM. It was found that, under some channel hypothesis, the combination of Alamouti with complex CDMA-OFDM/OQAM is possible without increasing the complexity of the Alamouti decoding process. Furthermore, in the case of a frequency selective channel, OFDM/OQAM keeps its intrinsic advantage with a SNR gain in direct relation with the CP length. To find a simpler Alamouti scheme, that is, without adding a CDMA component, remains an open problem. Naturally, some other alternative transmit diversity schemes for OFDM/OQAM, as for instance cyclic delay diversity, could also deserve further investigations.


The authors would like to thank the reviewers and Professor Farhang-Boroujeny for their careful reading of our manuscript and for their helpful suggestions. This work was partially supported by the European ICT-2008-211887 project PHYDYAS.


[1] S. M. Alamouti, "A simple transmit diversity technique for wireless communications," IEEE Journal on Selected Areas in Communications, vol. 16, no. 8, pp. 1451-1458, 1998.

[2] H. Bolcskei, "Orthogonal frequency division multiplexing based on offset QAM," in Advances in Gabor Analysis, Birkhauser, Boston, Mass, USA, 2003.

[3] G. Cherubini, E. Eleftheriou, and S. Olcer, "Filtered multitone modulation for very high-speed digital subscriber lines," IEEE Journal on Selected Areas in Communications, vol. 20, no. 5, pp. 1016-1028,2002.

[4] R. Hleiss, P. Duhamel, and M. Charbit, "Oversampled OFDM systems," in Proceedings of the International Conference on Digital Signal Processing (DSP '97), vol. 1, pp. 329-331, Santorini, Greece, July 1997.

[5] B. R. Saltzberg, "Performance of an efficient parallel data transmission system," IEEE Transactions on Communication Technology, vol. 15, no. 6, pp. 805-811, 1967.

[6] B. Hirosaki, "An orthogonally multiplexed QAM system using the discrete Fourier transform," IEEE Transactions on Communications Systems, vol. 29, no. 7, pp. 982-989, 1981.

[7] B. Le Floch, M. Alard, and C. Berrou, "Coded orthogonal frequency division multiplex," Proceedings of the IEEE, vol. 83, pp. 982-996, 1995.

[8] T. Karp and N. J. Fliege, "MDFT filter banks with perfect reconstruction," in Proceedings of IEEE International Symposium on Circuits and Systems (ISCAS '95), vol. 1, pp. 744-747, Seattle, Wash, USA, May 1995.

[9] P. Siohan, C. Siclet, and N. Lacaille, "Analysis and design of OFDM/OQAM systems based on filterbank theory," IEEE Transactions on Signal Processing, vol. 50, no. 5, pp. 1170-1183, 2002.

[10] B. Farhang-Boroujeny and R. Kempter, "Multicarrier communication techniques for spectrum sensing and communication in cognitive radios," IEEE Communications Magazine, vol. 46, no. 4, pp. 80-85, 2008.

[11] C. Lélé, P. Siohan, R. Legouable, and M. Bellanger, "CDMA transmission with complex OFDM/OQAM," EURASIP Journal on Wireless Communications and Networking, vol. 2008, Article ID 748063, 12 pages, 2008.

[12] M. El Tabach, J.-P. Javaudin, and M. Helard, "Spatial data multiplexing over OFDM/OQAM modulations," in Proceedings of the IEEE International Conference on Communications (ICC '07), pp. 4201-4206, Glasgow, Scotland, June 2007.

[13] J.-P. Javaudin, D. Lacroix, and A. Rouxel, "Pilot-aided channel estimation for OFDM/OQAM," in Proceedings of the IEEE Vehicular Technology Conference (VTC '03), vol. 3, pp. 15811585, Jeju, South Korea, April 2003.

[14] C. Lele, J.-P. Javaudin, R. Legouable, A. Skrzypczak, and P. Siohan, "Channel estimation methods for preamble-based OFDM/OQAM modulations," in Proceedings of the 13th European Wireless Conference (EW '07), Paris, France, April 2007.

[15] M. Bellanger, "Transmit diversity in multicarrier transmission using OQAM modulation," in Proceedings of the 3rd International Symposium on Wireless Pervasive Computing (ISWPC '08), pp. 727-730, Santorini, Greece, May 2008.

[16] H. Lin, C. Lele, and P. Siohan, "A pseudo alamouti transceiver design for OFDM/OQAM modulation with cyclic prefix," in Proceedings of the IEEE Workshop on Signal Processing Advances in Wireless Communications (SPAWC '09), pp. 300304, Perugia, Italy, June 2009.

[17] D. Lacroix-Penther and J.-P. Javaudin, "A new channel estimation method for OFDM/OQAM," in Proceedings of the 7th International OFDM Workshop (InOWo '02), Hamburg, Germany, September 2002.

[18] D. Tse and P. Viswanath, Fundamentals of Wireless Communication, Cambridge University Press, Cambridge, Mass, USA, 2004.

[19] C. Lele, P. Siohan, R. Legouable, and M. Bellanger, "OFDM/OQAM for spread spectrum transmission," in Proceedings of the International Workshop on Multi-Carrier Spread-Spectrum (MCSS '07), Herrsching, Germany, May 2007.

[20] K. Fazel and L. Papke, "On the performance of convolu-tionnally-coded CDMA/OFDM for mobile communication

system," in Proceedings of the Symposium on Personnal, Indoor and Mobile Radio Communications (PIMRC '93), pp. 468-472, Yokohama, Japan, September 1993.

[21] E. H. Dinan and B. Jabbari, "Spreading codes for direct sequence CDMA and wideband CDMA cellular networks," IEEE Communications Magazine, vol. 36, no. 9, pp. 48-54, 1998.