0 views

Uploaded by Husam Abduldaem Mohammed

yft

- RFI Suppression for Synchronous Impulse Reconstruction UWB Radar Using RELAX
- Comparison 4T8R With 2T2R
- QAM Implementation Using LabVIEW
- sem2
- Federico - Master Thesis
- 3G LTE Simulations Using Measured MIMO Channels
- VSAT Installation and Maintenance Training_Version_1
- IJARECE-VOL-1-ISSUE-3-1-10_JAVA.pdf
- Location, Localization, and Localizability
- Intercell Interference Coordination Through Limited Feedback
- LTE TDD Peak Data Rate Computation
- IEEE_IMS_2014_Suyama_etal_SuperHighBitRateRAT.pdf
- Base Band
- Ber Analysis of Ieee80211n Mimo System Using Mmse and Zf Detectors
- Wireless Local Positioning
- wivi.docx
- 069217
- 14 Cellular LTE
- 05371632
- embms

You are on page 1of 10

6, AUGUST 2008

Communications and MIMO Free-Space Optical

Communications with PPM

Chadi Abou-Rjeily, Member IEEE and Wissam Fawaz, Member IEEE

Abstract—In this paper, we consider the problem of Space- symbols. In the same way, transmitting unipolar signals is

Time (ST) coding with Pulse Position Modulation (PPM). While crucial for FSO communications with direct detection where

all the existing ST block codes necessitate rotating the phase or the information can only be conveyed by the presence or

amplifying the amplitude of the transmitted symbols, the pro-

posed scheme can be associated with unipolar PPM constellations absence of the light pulses. For TH-UWB and FSO systems,

without introducing any additional constellation extension. In the extension of the existing single-antenna solutions to the

other words, full transmit diversity can be achieved while convey- multi-antenna scenarios is feasible only if the ST code applied

ing the information only through the time delays of the modulated at the transmitter side necessitates controlling only the time

signals transmitted from the different antennas. The absence of delay of each transmitted pulse (without controlling its phase

phase rotations renders the proposed scheme convenient for low-

cost carrier-less Multiple-Input-Multiple-Output (MIMO) Time- or amplitude). In this context, combining the power-efficient

Hopping Ultra-WideBand (TH-UWB) systems and for MIMO MIMO techniques with the power-efficient PPM constellations

Free-Space Optical (FSO) communications with direct detection. is of substantial importance for the low power consumption

In particular, we propose two families of minimal-delay ST block UWB systems. On the other hand, the bandwidth efficiency

codes that achieve a full transmit diversity order with PPM. is not a key concern in UWB systems. However, designing

Designate by n the number of transmit antennas and by M

the number of modulation positions. For a given set of values MIMO systems transmitting PPM pulses that occupy the same

of (n, m), the first family of codes achieves a rate of 1 symbol bandwidth results in simple mono-band transceivers that have

per channel use (PCU) which is the highest possible achievable a much simpler structure compared to the alternate multi-band

rate when no constellation extensions are introduced. The second UWB solution.

family of codes can be applied with a wider range of (n, m) at

log2 (M −1) While a huge amount of work considered the problem

the expense of a reduced rate given by: R = n1 + n−1 n log (M )

.

2 of ST coding with QAM, PAM and PSK [9]–[13], the ST

code design with PPM remains a research domain that is

Index Terms—Multiple-Input-Multiple-Output (MIMO), not much explored. It can be easily shown that the codes

Ultra-WideBand (UWB), Free-Space Optical (FSO)

communications, Space-Time (ST) coding, Pulse Position proposed in [9]–[13] for QAM, PAM and PSK can achieve full

Modulation (PPM). transmit diversity when associated with PPM. However, the

disadvantage of such an approach is an additional constellation

extension that results from the phase rotations or ampli-

tude amplifications introduced by all the existing ST coding

I. I NTRODUCTION

schemes. These codes will fail in achieving full transmit

(ST) coding techniques on Impulse Radio Time-Hopping

Ultra-WideBand (IR-TH-UWB) [1]–[5]. In the same way,

diversity if these additional modifications are not introduced.

Consider for example the orthogonal ST codes proposed in

[9], [10]. In this case, the entries of the n × n codewords

recent studies showed that ST coding can be a possible (where n is the number of transmit antennas) can be equal

solution for solving the ‘last mile’ problem using Free- to either ±si or ±s∗i where s1 , . . . , sn are the QAM symbols

Space-Optical (FSO) links since spatial diversity can combat and x∗ stands for the complex conjugate of x. The orthogonal

the atmospheric turbulence that degrades the performance of codes do not introduce any constellation extension with this

such systems [6]–[8]. In this context, Multiple-Input-Multiple- modulation since s∗ and −s are both QAM symbols whenever

Output (MIMO) techniques can be extended to FSO systems s is a QAM symbol. This property will be referred to as the

where the transmitter is equipped with a laser array and the shape preserving constraint in what follows.

receiver is equipped with multiple photodetectors. Consider a M -ary PPM constellation. This is a M -

Pulse Position Modulation (PPM) is a very popular mod- dimensional constellation where the information symbols are

ulation scheme for low-cost TH-UWB where it is difficult represented by M -dimensional vectors belonging to the set:

to control the phase and amplitude of the very low duty-

cycle sub-nanosecond pulses used to convey the information C = {em ; m = 1, . . . , M } (1)

Manuscript received July 26, 2007; revised October 23, 2007. where em is the m-th column of the M × M identity matrix

The authors are with the Department of Electrical and Computer Engineer- IM . The orthogonal codes are not shape preserving with M -

ing of the Lebanese American University (LAU), Byblos, Lebanon. (e-mail:

{chadi.abourjeily,wissam.fawaz}@lau.edu.lb). PPM since s and −s can never belong to the signal set given

Digital Object Identifier 10.1109/JSAC.2008.080810. in eq. (1) simultaneously.

0733-8716/08/$25.00

c 2008 IEEE

Authorized licensed use limited to: LEBANESE AMERICAN UNIVERISTY. Downloaded on February 23, 2009 at 08:28 from IEEE Xplore. Restrictions apply.

ABOU-RJEILY and FAWAZ: SPACE-TIME CODES FOR MIMO ULTRA-WIDEBAND COMMUNICATIONS 939

In the same way, consider the rate-1 minimal-delay codes achieves full transmit diversity for {M ≥ 2}, {M ≥ 3},

proposed in [11] where the codewords are given by: {M ≥ 3} and {M ≥ 7} with n = 2, 3, 4, 5 transmit

⎡ ⎤ antennas respectively. However, in this case, enlarging the sets

s1 s2 · · · sn

⎢ .. ⎥ of validity of M comes at the expense of a reduction in the

⎢ γsn s1 . . . . ⎥ achievable data rates. In particular, the second family of codes

C (s1 , . . . , sn ) = ⎢

⎢ ..

⎥

⎥ (2) log2 (M−1)

⎣ . .. .. transmits at the normalized rate R = n1 + n−1 log2 (M) < 1.

. . s2 ⎦ n

The rest of the paper is organized as follows. In section

γs2 · · · γsn s1

II, we present the system model of MIMO TH-UWB systems

where s1 , . . . , sn are PSK symbols. Multiplying the lower and MIMO FSO systems. The two families of PPM-specific

triangular part of the codeword in eq. (2) by γ permits to ST codes are presented in section III. Simulations over realistic

achieve full transmit diversity. Moreover, this code becomes indoor UWB channels and turbulent atmospheric links are

shape preserving when γ is chosen such that γs is a M -ary represented in section IV while section V concludes.

PSK symbol whenever s is a M -ary PSK symbol for a certain Notations: 0m×n stands for the m × n matrix whose

value of M . The only value of γ that is shape preserving with components are all equal to zero. 0M stands for the M -

PPM is γ = 1. However, this value of γ fails to assure a full dimensional all-zero vector. IM is the M × M identity matrix

transmit diversity order (refer to [11]). The same argument and ⊗ stands for the Kronecker product. Q is the set of rational

applies to the diversity schemes proposed in [1] for TH-UWB numbers.

and that are not shape preserving with PPM.

To the authors’ best knowledge, the main contribution in II. SYSTEM MODEL

ST code design for PPM can be found in [6] where a shape-

preserving ST code was proposed for binary PPM with n = 2 The system model that we present corresponds to a multi-

emitting lasers (or transmit antennas). For binary PPM, this antenna TH-UWB system with P transmit antennas, Q re-

code is shape preserving because of the structure of this ceive antennas and a Rake equipped with L fingers. For M -

constellation that is composed of a signal and its compliment dimensional constellations, the linear dependence between the

defined as the signal obtained by reversing the roles of “on” baseband inputs and outputs of the channel can be expressed

and “off” [6]. This code was extended to systems with n = 4 as:

emitting lasers with On-Off Keying (OOK) and binary PPM X = HC + N (3)

in [7]. However, the codes given in [6], [7] are based on the

where C is the P M × T codeword whose ((p − 1)M + m, t)-

orthogonal design [9], [10] and hence can not be applied with

th entry corresponds to the amplitude of the pulse (if any)

any number of sources (transmit antennas or lasers). Another

transmitted at the m-th position of the p-th antenna during

main disadvantage is that these codes are exclusive to binary

the t-th symbol duration for p = 1, . . . , P , m = 1, . . . , M and

PPM and can not be extended to M -ary PPM with M > 2

t = 1, . . . , T . The matrices X and N are QLM × T matrices

without introducing a constellation extension (even though this

extension does not result from phase rotations or amplitude corresponding to the decision variables and the additive white

Gaussian noise terms respectively.

amplifications [6]).

Compared with the time-switched transmit diversity H is the QLM × P M channel matrix given by H =

schemes considered in [5], the proposed schemes can be [H1T · · · HQ T T

] where Hq = [Hq,1T

· · · Hq,L

T T

] for q = 1, . . . , Q.

applied even when the number of pulses used to transmit The matrix Hq,l is given by Hq,l = [Hq,l,1 · · · Hq,l,P ] for

one information symbol is less than the number of transmit l = 1, . . . , L. Hq,l,p is a M × M matrix for p = 1, . . . , P .

antennas. This renders the proposed schemes suitable for very The (m, m )-th element of Hq,l,p corresponds to the impact

high data-rate UWB systems that employ few (or no) pulse of the signal transmitted during the m -th position of the p-

repetitions. In the same way, the schemes proposed in [5] are th antenna on the m-th correlator (corresponding to the m-th

not suitable for FSO systems where no pulse repetitions are position) placed after the l-th Rake finger of the q-th receive

used. On the other hand, it can be seen that the proposed antenna. The (m, m )-th element of Hq,l,p is given by [2]:

schemes and those proposed in [5] and [6] coincide in the Hq,l,p (m, m ) = hq,p ((m − m )δ + Δl ) (4)

special case of binary PPM with two transmit antennas.

In this work, instead of adopting the classical approach of where δ stands for the modulation delay and Δl for the l-

constructing ST codes over infinite fields, we profit from the th finger delay. In what follows, we consider a Rake that

particular structure of the PPM constellation given in eq. (1) to combines the first arriving multi-path components and we

construct new coding schemes that are shape-preserving with fix Δl = (l − 1)M Tw where Tw stands for the duration of

PPM. In particular, we propose two new families of ST codes the UWB pulse (with δ ≥ Tw ). Designate by gq,p (t) the

for MIMO TH-UWB and MIMO FSO systems with M -ary convolution of the pulse waveform w(t) with the impulse

PPM. For both families of codes, and for systems equipped response of the frequency selective

T channel between antennas

with n transmit antennas, we determine the set of values of p and q. In this case, hq,p (τ ) = 0 f gq,p (t)w(t − τ )dt where

M for which the proposed ST codes are fully diverse with M - Tf stands for the average separation between two consecutive

PPM. For example, the first family of rate-1 codes achieves pulses.

full transmit diversity for {M ≥ 2}, {M = 3, M ≥ 5}, Note that the impact of the interference between the

{M = 2, M ≥ 4} and {M = 5, 7, M ≥ 9} with n = 2, 3, 4, 5 different modulation positions is included in eq. (3). This

transmit antennas respectively. The second family of codes interference is present when δ < Γ where Γ stands for the

Authorized licensed use limited to: LEBANESE AMERICAN UNIVERISTY. Downloaded on February 23, 2009 at 08:28 from IEEE Xplore. Restrictions apply.

940 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 26, NO. 6, AUGUST 2008

channel delay spread (Γ >> Tw ). In the absence of Inter- diverse for given values of M and n if all the non-zero M -

Position-Interference (IPI), eq. (4) becomes: dimensional vectors that result in a rank-deficient matrix C do

not belong to the set A given in eq. (8). Following from eq.

Hq,l,p (m, m ) = hq,p (Δl )δ(m − m ) (5) (8), elements of A can have a maximum number of two non-

where δ(.) stands for Dirac’s delta function. zero components. Moreover, one of these components must be

The previous model can be easily extended to MIMO FSO equal to +1 while the other component must be equal to −1.

communications in a shot-noise limited scenario obtained The transmit diversity is achieved because of this particular

at high signal-to-noise ratios (SNR) (refer to [6] and the structure of A. For example, the matrix C(a1 , . . . , an ) does

references therein). We suppose that the channel is flat and not have a full rank when a1 , . . . , an have all their components

P now stands for the number of laser sources at the transmit equal to 1. However, these vectors do not belong to the set A

array and Q stands for the number of photodetectors at the for all values of M .

receiver side. Equation (3) can be readily applied where the In order to have more insights on the properties of the

codeword C keeps the same structure as before but now X proposed code, we first consider the special case of n = 2:

and N are (QM × T )-dimensional matrices. In other words,

s1 s2

L = 1 since the channel is flat and no multi-path combining C (s1 , s2 ) = (9)

Ωs2 s1

techniques are applied at the receiver.

For FSO systems, H is the QM × P M channel matrix ¿From eq. (9), rank(C(a1 , a2 )) < 2 if C2 = kC1 where Ci

whose (q, p)-th M × M constituent sub-matrix is denoted by stands for the i-th column of C and k is a non-zero integer.

Hq,p for p = 1, . . . , P and q = 1, . . . , Q. The (m, m )-th Given that the components of the elements of A can be equal

element of Hq,p corresponds to the contribution, of the signal to {0, ±1}, then k must be equal to ±1. Moreover, C2 =

transmitted during the m -th position of the p-th source, that kC1 implies that a2 = ka1 and a1 = kΩa2 implying that

results when the waveform received at the q-th detector is a2 = k 2 Ωa2 = Ωa2 . This implies that a2 is an eigenvector

projected onto the m-th basis vector for m, m = 1, . . . , M . of Ω associated with the eigenvalue k 2 = 1. Following from

In the absence of IPI, Hq,p = hq,p ⊗ IM where hq,p stands the structure of Ω given in eq. (7), all the components of this

for the scintillation at the optical path between the p-th source eigenvector must be equal to each other. On the other hand,

and the q-th detector. the only vector of A having equal components is the all-zero

In what follows, and for the sake of simplicity, the term vector and consequently a2 = 0M implying that a1 = 0M for

transmit antennas will be used to refer to elements of both the all values of M . Therefore, the only rank-deficient matrix is

UWB transmit array and the FSO laser array. In the same way, the all-zero 2M × 2 matrix and the proposed code is fully

elements of the receive antenna array and the photodetector diverse with n = 2 transmit antennas for all values of M ≥ 2.

array will be referred to as receive antennas. Note that for the special case of n = 2, the code given in

eq. (9) is equivalent to the code proposed in [6]. However, by

III. C ODES C ONSTRUCTIONS writing the codewords and system model in convenient matrix

A. Rate-1 Codes forms, we proved that eq. (9) can be applied with M -ary PPM

without introducing a constellation extension for all values of

For M -PPM with n = P transmit antennas, the minimal- M (rather than simply M = 2 as indicated in [6]).

delay codewords are represented by the matrices of dimensions We now consider the case n > 2. In what follows, for

nM × n having the following structure: notational simplicity, C(a1 , . . . , an ) will be referred to as C

⎡ ⎤

s1 s2 · · · sn when there is no ambiguity. The codeword C (associated with

⎢ .. .. ⎥ n elements of A) is rank-deficient if there exits n − 1 rational

⎢ Ωsn s1 . . ⎥

⎢

C (s1 , . . . , sn ) = ⎢ . ⎥ (6) numbers k1 , . . . , kn−1 such that:

⎣ .. . .. . .. s ⎥ ⎦

2

n−1

Ωs2 · · · Ωsn s1 Cn = ki Ci (10)

where s1 , . . . , sn ∈ C given in eq. (1) are the M -dimensional i=1

vector representations of the information symbols. Ω is a M × After some manipulations and following from eq. (6), eq.

M cyclic permutation matrix given by: (10) implies that:

01×(M−1) 1
T

Ω= (7) [C(−1, k1 , . . . , kn−1 )]T aTn · · · aT1 = 0M (11)

IM−1 0(M−1)×1

Evidently, Ωs ∈ C given in eq. (1) whenever s ∈ C and the where in the last equation Ω and ai for i = 1, . . . , n are

code is shape preserving with PPM. considered as parameters (rather than a M × M matrix and

Denote by A the set of all possible differences between two M -dimensional vectors belonging to A respectively).

information vectors: Equation (11) is verified if:

T

The proposed code is fully diverse if the matrix where R = [C(−1, k1 , . . . , kn−1 )] and when calculating the

C(a1 , . . . , an ) has a full rank for (a1 , . . . , an ) ∈ determinant in eq. (12), R is considered as a n × n matrix. In

An \{(0M , . . . , 0M )} [14]. In other words, the code is fully this case, ai ∈ A for i = 1, . . . , n.

Authorized licensed use limited to: LEBANESE AMERICAN UNIVERISTY. Downloaded on February 23, 2009 at 08:28 from IEEE Xplore. Restrictions apply.

ABOU-RJEILY and FAWAZ: SPACE-TIME CODES FOR MIMO ULTRA-WIDEBAND COMMUNICATIONS 941

Since Ω is contained only in the upper triangular part of R, for practical systems having n = 2, . . . , 6 transmit antennas

then det(R) is a polynomial of degree n − 1 in Ω. Therefore, respectively. On the other hand, a numerical evaluation (that

the linear dependance between the columns of the codeword is feasible only for small values of M and n) shows that the

implies the following relation: proposed code is fully diverse with the additional sets S4 =

n−1 {2, 4} and S6 = {3} for n = 4 and n = 6 respectively. In

λi Ωi ai = 0M ; i = 1, . . . , n (13) the same way, the numerical analysis shows that full transmit

i=0 diversity is lost for (n, M ) ∈ {(3, 2), (3, 4), (4, 3), (5, M ≤

4), (6, 2), (6, 4), (6, 5)}.

Following from the structure of R, it can be easily shown

As a conclusion, the rate-1 shape-preserving codes are fully

that λ0 = 1 and λn−1 = −(k1 )n for all values of n. In

diverse with M -PPM for the values of M belonging to the sets

what follows, we limit ourselves to the case M ≥ n. For

S2 , S3 and S4 ∪ S4 for n = 2, 3, 4 respectively. On the other

convenience, eq. (13) will be written as:

hand, the sets S5 and S6 ∪ S6 constitute subsets of the sets of

MX = 0M ; X = a1 , . . . , an (14) values of M for which full transmit diversity is achieved for

n = 5 and n = 6 respectively.

M−1

M= λi Ωi ; λi = 0 for i = n, . . . , M − 1 (15)

i=0 B. Reduced-Rate Codes

Being a function of the rational numbers k1 , . . . , kn−1 , then For M -PPM with n transmit antennas, the codewords of the

λi is a rational number for all values of i. second family of codes will have the same structure as that

For a given value of n > 2, the proposed code is fully given in eq. (6) but now the M × M permutation matrix Ω

diverse with M -PPM if M verifies at least one of the three given in eq. (7) will be replaced by:

propositions stated in what follows.

01×(M−1) −1

Proposition 1: The proposed code is fully diverse for the Ω= (16)

IM−1 0(M−1)×1

values of M verifying ϕ(M ) ≥ n where ϕ(.) stands for

Euler’s totient function. Because the (1, M )-th element of Ω is equal to −1, a

Proof : The proof is provided in Appendix A. polarity inversion will be introduced (on the pulse occupying

Proposition 2: The proposed code permits to achieve full the M -th position) when s1 , . . . , sn ∈ C given in eq. (1). From

transmit diversity for: eq. (6), it can be seen that Ω multiplies only the symbols

1) n ≤ M − d(M ) if M is odd or if M is a multiple of 4. s2 , . . . , sn . Therefore, in order to obtain an encoding scheme

2) n ≤ M − d(M ) + 1 if M is an even number that is not that transmits unipolar pulses uniquely, s2 , . . . , sn are not

a multiple of 4. allowed to occupy the M -th modulation position.

In other words, the second family of shape preserving codes

where d(M ) stands for the biggest integer divisor of M in the

is obtained by associating eq. (6) and eq. (16) with the symbols

set {1, . . . , M − 1}. For example, when M is even d(M ) =

s1 ∈ C and s2 , . . . , sn ∈ C where C is defined as:

M/2 and the two conditions of proposition 2 imply that the

code is fully diverse for M ≥ 2n (resp. M ≥ 2n − 1) when C = {em ; m = 1, . . . , M − 1} (17)

M is a multiple (resp. not multiple) of 4. For prime numbers,

the first condition implies that the code is fully diverse for Evidently, limiting the values of s2 , . . . , sn in C rather

M ≥ n + 1. than C results in a reduced rate. The normalized bit rate with

Proof : The proof of proposition 2 is provided in Appendix B. respect to single-antenna systems whose transmitted pulses

Proposition 3: For prime values of M , the proposed code can occupy M positions is given by:

is fully diverse for n = M . log2 (M ) + (n − 1) log2 (M − 1)

R= (18)

Proof : The proof is provided in Appendix C. n log2 (M )

Note that the above propositions follow from the structure

Evidently, R ≤ 1 and R is an increasing function of M

of the matrix M in eq. (15) and from the values taken

and a decreasing function of n. Consequently, the second

by λ0 and λn−1 . The provided proofs do not take into

family of codes is particularly appealing for high order PPM

consideration the specific values taken by λ1 , . . . , λn−2 . These

in−1 constellations with practical systems having a limited number

variables correspond to linear combinations of k1i1 · · · kn−1 for

of antennas per antenna array. For example, for 8-PPM with

i1 , . . . , in−1 ∈ {0, . . . , n} and, consequently, their expressions

two transmit antennas, R 0.95 and the data rate reduction

become intractable for large values of n.

(introduced by the shaping constraint) is negligible.

For the sake of completeness and without discussing the

Given that C ⊂ C, we will next find the set of values of

feasibility of an analysis that is based on λ1 , . . . , λn−2 , we

(n, M ) for which this second family of codes is fully diverse

can state that the set of values of M respecting at least one

for s1 , . . . , sn ∈ C. Given that the codewords of the two

of the three preceding propositions constitutes a subset of the

families of codes have the same structure (only the value of

set of values of M for which full transmit diversity can be

Ω is changing), then equations (10)-(15) will hold.

achieved.

Proposition 4: For a system equipped with n transmit an-

Based on the above three propositions and on the analysis

tennas, the second family of codes permits to achieve a full

presented for n = 2, full transmit diversity can be achieved

transmit diversity order with M -PPM for:

for S2 = {M ≥ 2}, S3 = {M = 3, M ≥ 5}, S4 = {M ≥ 5},

S5 = {M = 5, 7, M ≥ 9} and S6 = {M = 7, M ≥ 9} n ≤ M − d(M ) (19)

Authorized licensed use limited to: LEBANESE AMERICAN UNIVERISTY. Downloaded on February 23, 2009 at 08:28 from IEEE Xplore. Restrictions apply.

942 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 26, NO. 6, AUGUST 2008

TABLE I

N ORMALIZED RATES ACHIEVED BY THE PROPOSED CODES

M =2 M =3 M =4 M =5 M =6 M =7 M =8 M =9 M = 10 M = 11 M = 12

n= 2 1 1 1 1 1 1 1 1 1 1 1

n= 3 − 1 0.8617 1 1 1 1 1 1 1 1

n= 4 − − 0.8444 1 1 1 1 1 1 1 1

n= 5 − − − 1 − 1 0.9486 1 1 1 1

n= 6 − − − − − 1 0.9465 1 1 1 1

n= 7 − − − − − 1 0.9450 − 0.9608 1 0.97

n= 8 − − − − − − 0.9438 − 0.96 1 0.9694

where d(M ) = 0 when M = 2j and j is a non-zero natural resulting in IPI between the different modulation positions. At

integer. When M is not a power of 2, d(M ) stands for the receiver side, perfect channel state information is assumed.

the biggest integer divisor of M in the set {1, . . . , M − 1} A modified version of the sphere decoder is applied [16].

M

verifying the condition that d(M) is odd. This assures that the output of the decoder corresponds to

Proof : The proof is provided in Appendix D. the closest point of the multi-dimensional PPM constellation

For example, when M = 6, d(M ) = 2 and proposition 4 (and not simply to the closest lattice point). Note that no

implies that the code is fully diverse for n ∈ {2, 3, 4}. For reference to the TH sequence or to the number of pulses per

prime numbers, proposition 4 implies that the code is fully symbol was made since these parameters have no impact on

diverse for M ≥ n + 1. Based on the above proposition, full the performance in a single user scenario. Moreover, all the

transmit diversity can be achieved with M -PPM for S2 = transmit antennas of the same user are supposed to share the

{M ≥ 2}, S3 = {M ≥ 3}, S4 = {M ≥ 3}, S5 = {M ≥ same TH sequence.

7} and S6 = {M ≥ 7} for n = 2, . . . , 6 transmit antennas Fig. 1 compares the performance of single-antenna IR-

respectively. UWB systems with that of MIMO UWB systems using coding

If both families of codes are fully diverse for a ceratin value scheme 1 with three transmit antennas. Fig. 2 shows the perfor-

of (n, M ), it is more convenient to apply the first family mance gains that result from applying the first family of codes

of codes that achieves a higher rate. Table-1 shows the set with 5-PPM when increasing the number of transmit antennas.

of values of (n, M ) for which the proposed codes can be In both cases, the receiver consists of one antenna with a 5-

applied. The achievable normalized rate (R) is also shown. In finger Rake. Results show the enhanced diversity order and

Table-1, R = 1 implies that the first family of codes must be the high performance levels achieved by the proposed rate-1

applied while R < 1 implies that the second family of codes coding scheme.

must be applied (because the first family of codes will not be

Fig. 3 shows the performance of the second family of codes

fully diverse in this case). In Table-1, when no value of R is

with 4-PPM, 3 transmit antennas, 1 receive antenna and a L-

given, this indicates that neither one of the above codes can

finger Rake for L = 1, 20. For 4-PPM, MIMO-UWB must

be applied.

be associated with the second family of codes since the first

family of codes (having a higher rate) is not fully diverse

C. Coding Gain with this constellation. Results show that, despite the induced

Proposition 5: The coding gain of both families of codes rate losses, applying the proposed coding scheme results in

with n sources and M -PPM is equal to 2 for all values of n important performance gains even with systems that profit

and M . from a high multi-path diversity order (L = 20). Therefore,

Proof : The proof is provided in Appendix E. applying the MIMO techniques can be beneficial in increasing

Finally, note that propositions 1-5 will still hold if the the communication ranges of TH-UWB systems.

columns and (or) rows of the matrix Ω given in eq. (7) or To highlight the advantages of ST coding with UWB

eq. (16) are permuted among each other. In other words, the systems, Fig. 4 compares 1 × 1 and 2 × 1 systems having the

properties of the rate-1 codes (diversity order and coding gain) same overall diversity that is given by P QL. In this simulation

remain invariant with an arbitrary permutation matrix while setup, 2-PPM is used with Q = 1 receive antenna. The product

the properties of the reduced-rate codes remain invariant with P QL takes the values of 5, 10 and 20 respectively. Results

any permutation matrix introducing one sign inversion. show that exploiting multi-path diversity by increasing the

number of Rake fingers is more beneficial at low SNRs. In

IV. S IMULATIONS AND RESULTS this case, performance is dominated by noise and the energy

We first show the performance of IR-UWB over the IEEE capture is enhanced by high-order Rakes resulting in better

802.15.3a channel model recommendation CM2 that corre- performance. For high SNRs, performance is dominated by

sponds to non-line-of-sight (NLOS) conditions [15]. The an- fading and transmit diversity becomes more beneficial even

tenna arrays are supposed to be sufficiently spaced so that the though it does not increase the energy capture. This follows

P Q sub-channels can be generated independently. A Gaussian from the fact that consecutive multi-path components of the

pulse with a duration of Tw = 0.5 ns is used. In order to same sub-channel can be simultaneously faded because of

eliminate the inter symbol interference, the symbol duration cluster and channel shadowing [15]. In all cases, the proposed

is set to 100 ns which is larger than the channel delay spread. ST codes result in high performance levels even with low-

The modulation delay is chosen to verify δ = Tw = 0.5 ns order Rakes. In other words, they can shift the complexity

Authorized licensed use limited to: LEBANESE AMERICAN UNIVERISTY. Downloaded on February 23, 2009 at 08:28 from IEEE Xplore. Restrictions apply.

ABOU-RJEILY and FAWAZ: SPACE-TIME CODES FOR MIMO ULTRA-WIDEBAND COMMUNICATIONS 943

0 0

10 10

−1 −1

10 10

−2 −2

10 10

SER

SER

−3 −3

10 10

−4 −4

10 10

−5 3×1, 3−PPM −5

3×1, 1 finger

10 10

1×1, 6−PPM 1×1, 20 fingers

3×1, 6−PPM 3×1, 20 fingers

1×1, 8−PPM

3×1, 8−PPM

−6 −6

10 10

5 10 15 20 25 30 0 5 10 15 20 25 30

SNR per bit (dB) SNR per bit (dB)

Fig. 1. Performance of the rate-1 code with 3 transmit antennas and M -PPM Fig. 3. Performance of single-antenna systems and 3 × 1 ST-coded systems

for M = 3, 6, 8. One receive antenna and a 5-finger Rake are used. using the second family of codes with 4-PPM.

0

10 0

10

−1

10 −1

10

−2

10 −2

10

SER

−3

10

SER

−3

10

−4

10 −4

10

1×1, 2 fingers

−5

10 1 transmitter −5 2×1, 1 finger

2 transmitters 10

1×1, 10 fingers

3 transmitters 2×1, 5 fingers

4 transmitters

1×1, 20 fingers

5 transmitters

−6

10 2×1, 10 fingers

−6

5 10 15 20 25 10

SNR per bit (dB) 5 10 15 20 25 30

SNR per bit (dB)

Fig. 2. Performance of the rate-1 code with n transmit antennas and 5-PPM Fig. 4. Transmit diversity versus multi-path diversity over CM2 with 2-PPM.

for n = 2, . . . , 5. One receive antenna and a 5-finger Rake are used.

from the receiver side to the transmitter side. Further com- However, this performance loss is not associated with any

ments on the utility of spatial diversity with UWB can be degradation in the diversity order and the same diversity

found in [17]. advantage is obtained in both cases.

Given the very short duration of the transmitted UWB Next, we study the performance of MIMO FSO systems.

pulses, the differences in the propagation delays of the dif- In this case, flat fading channels are considered (no IPI)

ferent sub-channels can be comparable to the pulse-width. and, as in [7], the channel irradiances are drawn from an

To show the impact of having different channel delays, we exponential distribution whose mean is equal to 1. Fig. 6

performed simulations over the space-variant UWB channel compares the performance of 1 × 1 FSO systems with ST

model proposed in [18] since the relative delays between the coded MIMO FSO systems when M -PPM constellations are

elements of the antenna arrays are provided by this model. used where M = 4. For n = 2 emitting lasers, (n, M )

Fig. 5 shows the performance of the first family of codes verifies proposition 1 and the rate-1 code can be applied (note

over profile 3 that corresponds to an “office-to-office” scenario that in this case proposition 2 is also verified). For n = 3,

in the case where the elements of the transmit and receive proposition 4 is verified while neither one of propositions 1-3

antenna arrays are separated by 10 cm. 3-PPM modulations are holds. Consequently, the second family of codes is used to

used and the receiver is equipped with a 1-finger Rake. Results encode the 3 × 1 and 3 × 3 FSO systems in Fig. 6. The slopes

show that different propagation delays result in a performance of the error curves show that FSO links suffer from severe

loss with respect to the case where the first arriving multi- fading. Consequently, the enhanced diversity orders offered

path components of the different sub-channels are aligned. by the proposed schemes can be very useful for these links.

Authorized licensed use limited to: LEBANESE AMERICAN UNIVERISTY. Downloaded on February 23, 2009 at 08:28 from IEEE Xplore. Restrictions apply.

944 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 26, NO. 6, AUGUST 2008

0 0

10 10

−1

10

−1

10

−2

10

−2

10

SER

SER

−3

10

−3

10

−4

10

−4

10

1×1 −5 1×1

10

2×2, same delays 2×1, rate−1 code

2×2, different delays 2×2, rate−1 code

3×3, same delays 3×1, reduced−rate code

3×3, different delays 3×3, reduced−rate code

−6

10

0 5 10 15 20 25 0 5 10 15 20 25 30

SNR per bit (dB) SNR per bit (dB)

Fig. 5. Performance of TH-UWB systems over the Kunisch-Pamp channel Fig. 6. Performance of FSO systems with 4-PPM. The 2 × 1 and 2 × 2

model (profile 3) using 3-PPM and a 1-finger Rake. The separation between systems are encoded by the first family of codes. The second family of codes

the elements of the transmit and receive arrays is equal to 10 cm. is used to encode the 3 × 1 and 3 × 3 systems.

We investigated the problem of constructing ST coding (14) can be determined from a single parameter t. Without

schemes that are suitable for MIMO IR-UWB systems and loss of generality, we fix t = YM . In this case, X can be

MIMO FSO systems using unipolar PPM. We proposed the written as: X = t[β1 , . . . , βM−1 , 1]T with βm ∈ Q∗ for m =

first known families of ST block codes that verify the shape- 1, . . . , M − 1 since M ∈ QM×M . On the other hand, X ∈ A

preserving constraint with PPM for any number of transmit given in eq. (8) only if X has no more than two non-zero

antennas (or laser sources) and for a wide range of the components. Consequently, since we are considering the case

dimensionality of the transmitted constellation. For TH-UWB M ≥ n ≥ 3, the only vector of the set A that has the preceding

systems, the proposed solutions are appealing since the ex- structure is the all-zero vector. In other words, X ∈/ A when

tension of the existing single-antenna systems to the multi- t = 0. Since eq. (14) is verified for X = a1 , . . . , an , this

antenna scenarios will not necessitate additional constraints on implies that when r = M − 1 and M ≥ 3, the only rank-

the RF circuitry to control the phase or the amplitude of the deficient codeword is the all-zero matrix. On the other hand,

very low duty cycle sub-nanosecond pulses. For MIMO FSO the condition M ≥ n is verified when ϕ(M ) ≥ n (since

communications with direct detection, an enhanced transmit M > ϕ(M ) ∀M ). Consequently, the code is fully diverse for

diversity order can be achieved with several lasers switching all values of M verifying ϕ(M ) ≥ n.

between the “on” and “off” modes.

A PPENDIX B

A PPENDIX A Given that M is circulant, then Mm = Ωm−m Mm where

From eq.(15), M is a circulant matrix that can be expressed Mi stands for the i-th column of M. On the other hand, given

as: M = M i M that any non-zero vector of A in eq. (8) must have M − 2

i=1 λi Ω with λM = 1 since Ω = IM . The

eigenvalues of M are given by [19]: zero components and two components that are equal to +1

and −1 respectively. Therefore, it is possible for a non-zero

M−1

vector of A to verify eq. (14) only if two (or more) columns

μk = ki

ωM λM−i ; k = 0, . . . , M − 1 (20)

of the matrix M are equal to each other. In other words, eq.

i=0

(14) admits a non-trivial solution if ∃m, m | Mm = Mm

where ωM = exp 2πi

M is the M -th root of unity. implying that Mm = Ωm−m Mm . In the same way, since

Any subset composed of n distinct elements of M m = Ω m −1

M1 , then eq. (14) can admit a non-trivial

{1, ωM , . . . , ωMM−1

} forms a free set over Q if 2 ≤ n ≤ solution if the following relation is verified:

ϕ(M ) where ϕ(.) stands for Euler’s function. Consider the

case where ϕ(M ) ≥ n. In this case, μk = 0 for k = ∃ m ∈ {1, . . . , M − 1} | Y = Ωm Y (21)

1, . . . , M − 1 since λ1 , . . . , λn−1 , λM multiply different el-

where for notational simplicity we fix Y = M1 . The i-th

ements of the set {1, . . . , ωM M−1

} and since λM = 1. Only

M component of Ωm Y is equal to Yπm (i) where π m stands for the

μ0 = i=1 λi can be equal to zero. Therefore, the rank of cyclic permutation of order m given by: π m (i) = (i − m − 1)

M verifies: r rank(M) ≥ M − 1. mod M + 1. Therefore, for a given value of m, eq. (21) can

For r = M , eq. (14) is verified only if a1 = · · · = an = 0M be written as a set of M equations given by:

implying that the non-zero matrices given by C(a1 , . . . , an )

with (a1 , . . . , an ) ∈ An have full rank. Yi = Yπm (i) ; i = 1, . . . , M (22)

Authorized licensed use limited to: LEBANESE AMERICAN UNIVERISTY. Downloaded on February 23, 2009 at 08:28 from IEEE Xplore. Restrictions apply.

ABOU-RJEILY and FAWAZ: SPACE-TIME CODES FOR MIMO ULTRA-WIDEBAND COMMUNICATIONS 945

Designate by k = gcd(m, M ) the greatest common divisor Suppose that there exist n−1 rational numbers k1 , . . . , kn−1

n−1

between m and M (with m ∈ {1, . . . , M − 1}). Follow- for which eq. (26) is verified. In this case, det(R) = i=0 Ωi

ing from the periodicity of the cyclic permutations, the M and consequently det(R) = 0 when the parameter Ω is

equations given in eq. (22) can be separated into k groups of replaced by ωM (the M -th root of unity).

T

equations where each group is composed of M/k equalities. On the other hand, the matrix R = [C(−1, k1 , . . . , kn−1 )]

The equations of the i-th group can be written as: has the structure of the rate-1 M × M ST codes constructed

from cyclotomic field extensions (eq. (2) in [11]). For Ω =

Yi = Yi+k = · · · = YM−k+i ; i = 1, . . . , k (23)

ωM , the polynomial xM −ωM is irreducible over Q according

Setting i = k − i + 1 in the last equation implies that M/k to proposition 5 in [11]. Consequently, the matrix R has a full

components of Y are equal to YM−i +1 for i = k, . . . , 1. rank because it can not be equal to the all-zero matrix since

Consider for example the case of M = 10 with a permutation its diagonal elements are equal to −1. This is in contradiction

of order m = 4. In this case, the vectors that verify eq. (21) with det(R) = 0 implying that there are no rational numbers

can be parameterized by two parameters Y9 and Y10 . In this k1 , . . . , kn−1 that result in a matrix M having all of its

case, all the components of Y having odd indices must be components equal to 1. Therefore, when n = M is a prime

equal to Y9 while the components with even indices are all number eq. (21) can not be verified implying that the code is

equal to Y10 . fully diverse.

In all cases, Y1 = 1 since λ0 = 1 in eq. (15). Therefore, for

i = 1, the first group of equations given in eq. (23) contains A PPENDIX D

the following equality: Denote by Mi the i-th column of M. From eq. (15),

the columns of M are related to each other by the relation:

YM−k+1 = Y1 = 1 (24)

Mm = Ωm−m Mm for m, m = 1, . . . , M . On the other

On the other hand, from eq. (15), Yi = λi−1 for i = hand, each non-zero vector of A in eq. (8) can have two com-

1, . . . , M with Yi = 0 for i > n. In other words, eq. (24) ponents that are different from zero. In this case, it is possible

can never be verified when M − k + 1 > n. In other words, for a non-zero vector of A to verify eq. (14) only if two

eq. (21) can never be verified when n ≤ M − k. (or more) columns of the matrix M are proportional to each

In order to have a fully diverse code, eq. (21) must not other. In other words, eq. (14) admits a non-trivial solution if

be verified for all values of m ∈ {1, . . . , M − 1} (and ∃ m , m | Mm = qMm where q is a non-zero rational

consequently for all the corresponding values of k). Therefore, number. The last relation implies that M1 = qΩm −m M1

the values of n that verify eq. (24) for all possible values of k where m − m ∈ {−(M − 1), . . . , M − 1}. Given that

must verify the inequality n ≤ M − d(M ) where d(M ) is the Ωm −m = Ωm −m +2M , then eq. (14) can admit a non-trivial

biggest divisor of M in the set {1, . . . , M − 1}. For the values solution if the following relation is verified:

of n respecting this inequality, eq. (21) can not be verified for

∃ m ∈ {1, . . . , M − 1}, ∃ q ∈ Q | Y = qΩm Y (27)

all values of m and consequently eq. (14) does not admit a

non-trivial solution resulting in a full transmit diversity order. where we fix Y = M1 .

Suppose that M is an even number that is not a multiple of Designate by π m the cyclic permutation of order m given

4. Consider the value of n given by: n = M − d(M ) + 1 = by: π m (i) = (i − m − 1) mod M + 1. Following from

M/2 + 1. The integer n is an even number and eq. (24) can eq. (7), the i-th component of Ωm Y is equal to −Yπm (i) for

not be verified for k = d(M ). In fact, for this value of k, eq. i = 1, . . . , m and it is equal to Yπm (i) for i = m + 1, . . . , M .

(24) implies that: Therefore, for a given value of m, eq. (27) can be written as

a set of M equations given by:

YM−d(M)+1 = Yn = λn−1 = −k1n = Y1 = 1 (25)

−qYπm (i) ; i = 1, . . . , m

Since n is even, the equation k1n = −1 can not be verified Yi = (28)

qYπm (i) ; i = m + 1, . . . , M

for real values of k1 and consequently eq. (24) can not be

verified. Therefore, in this case the proposed code is fully Designate by k = gcd(m, M ) the greatest common divisor

diverse not only for n ≤ M − d(M ) but also for n = M − between m and M (with m ∈ {1, . . . , M − 1}). Follow-

d(M ) + 1 resulting in n ≤ M − d(M ) + 1. ing from the periodicity of the cyclic permutations, the M

equations given in eq. (28) can be separated into k groups

A PPENDIX C of equations where each group corresponds to the relations

verified by M/k components of Y . The equations of the i-th

When M is a prime number, the set {π m (m ) ; m =

group are given by:

1, . . . , M } is equal to the set {1, . . . , M } for all integer values

of m. Therefore, eq. (21) can be verified only if all the Yi = Ii,1 qYπm (i) = Ii,2 q 2 Yπ2m (i) = · · ·

components of the vector Y are equal. Since Y1 = 1, this M

−1

implies that Ym = 1 for m = 1, . . . , M . For M = n, this = Ii, M −1 q k Y ( M −1)m ; i = 1, . . . , k (29)

k π k (i)

implies that:

where Ii,j = ±1 for i = 1, . . . , k and j = 1, . . . , Mk − 1.

λi = 1 ; i = 0, . . . , n − 1 (26)

From eq. (28), Ii,1 = −1, however, the values taken by Ii,j

¿From eq. (12), λi is the coefficient of Ωi in the for j = 1 will depend on m, k and M .

polynomial obtained from calculating det(R) where R = Denote by X (m) the M -dimensional vector given by

T (m)

[C(−1, k1 , . . . , kn−1 )] and C is given in eq. (6). X = Ωm [1 · · · 1]T . The structure of the matrix Ω implies

Authorized licensed use limited to: LEBANESE AMERICAN UNIVERISTY. Downloaded on February 23, 2009 at 08:28 from IEEE Xplore. Restrictions apply.

946 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 26, NO. 6, AUGUST 2008

(m) (m)

that Xm = −1 for m = 1, . . . , m and Xm = 1 for Consider for example the case of M = 10 and m = 4. In

m = m + 1, . . . , M . Following from eq. (28) and eq. (29), this case, the vectors that verify eq. (27) can be parameterized

the value of Ii,j can be obtained from the following relation: by two parameters Y9 and Y10 . All the components of Y hav-

(m)

ing odd indices are proportional to Y9 while the components

Ii,j = Ii,j−1 Xπ(j−1)m (i) (30) with even indices are all proportional to Y10 .

with Ii,1 = −1. In all cases, Y1 = 1 since λ0 = 1 in eq. (15). Therefore, for

For a given value of i, completing the iterations given in i = 1, the first group of equations given in eq. (29) contains

eq. (29) will result in the additional equality given by: the following equality:

Yi = Ii, M q

M

k Y Mm = Ii, M q

M

k Yi (31) p1 q p2 YM−k+1 = Y1 = 1 ; p1 ∈ {−1, +1} ; p2 ∈ Q\{0}

k π k (i) k

(36)

where the second equality follows from the fact that k divides On the other hand, from eq. (15), Yi = λi−1 for i =

m and π l (i) = i if l is a multiple of M . From eq. (30), Ii, M 1, . . . , M with Yi = 0 for i > n. In other words, eq. (36)

k

can be written as: can never be verified when M − k + 1 > n. In other words,

M

−1 eq. (27) can never be verified when n ≤ M − k.

k

Ii, M =

(m)

Xπjm (i) (32) In order to have a fully diverse code, the relation n ≤ M −k

k

j=0

must be verified for all values of m ∈ {1, . . . , M − 1} (and

consequently for the corresponding values of k) respecting the

Given that k = gcd(m, M ), we fix M = kM and m = condition that M k is odd (because as shown before if this value

km . On the other hand: is even then eq. (27) will imply that Y = 0M ).

π jm (i) = (i − jm − 1) mod M + 1 Therefore, the values of n that verify eq. (36) for all possible

values of k must verify the inequality n ≤ M − d(M ) where

= i − jm − 1 + cM + 1 d(M ) is the biggest divisor of M in the set {1, . . . , M −

= i + k(cM − jm ) i + c k (33) 1} verifying the condition that d(M) M

is odd. When M is not

a power of 2, d(M ) always exists and for the values of n

where c is an integer verifying the condition that 1 ≤ i+c k ≤

respecting n ≤ M − d(M ), eq. (27) can not be verified for

M where c = cM − jm . By reordering the elements i + c k

all values of m and consequently eq. (14) does not admit a

in increasing order we obtain:

non-trivial solution resulting in a full transmit diversity order.

M M

(m) −1 (m) −1 Consider now the case where M is a power of 2. Given

{Xπjm (i) }j=0

k

= {Xi+jk }j=0

k

(34)

that n ≤ M , the M × M matrix M can be expressed as:

(m) ⎡ ⎤

Following from the structure of X (m) , Xi+jk = −1 for

(m)

λ0 γλM−1 · · · γλ1

i + jk ≤ m = km . Consequently, Xi+jk = −1 when i ≤ ⎢ .. .. ⎥

⎢ λ1 . ⎥

k(m − j). Given that i ≤ k, then the last inequality holds for M=⎢ ⎢ λ0 . ⎥ (37)

.. .. .. ⎥

j < m . Therefore, combining eq. (32) and eq. (34) results in: ⎣ . . . γλM−1 ⎦

m −1

M

−1 λM−1 ··· λ1 λ0

(m)

k (m) M

Ii, M = Xi+jk = (−1)m (1) k −m = (−1)m where γ = −1 and λ = 1.

Xi+jk

k 0

j=0 j=m

(35) Equation (37) has the structure of the rate-1 M × M ST

M

Consider the case where M = k = 2M is an even code constructed from cyclotomic field extensions (eq. (2) in

number. Suppose that m is an even number, then m can be [11]). For γ = −1, the polynomial xM − γ is irreducible over

written as m = 2m . Consequently, M = kM = 2kM Q according to proposition 5 in [11]. Consequently, M has

and m = km = 2km implying that in this case 2k will be a full rank because it can not be equal to the all-zero matrix

the greatest common divisor between m and M which is in since its diagonal elements are equal to 1. Therefore, eq. (14)

contradiction with k = gcd(m, M ). Therefore, m is always imply that a1 = · · · = an = 0M implying thatj the proposed

odd when M is even. Consequently, eq. (35) will result in code is fully diverse for n ≤ M when M = 2 .

k

Ii, M = −1. Replacing this value of Ii, M in eq. (31) results

k k

M

in (1 + q k )Yi = 0 implying that Yi = 0 given that M k is even

A PPENDIX E

and q is a rational number. Replacing Yi = 0 for i = 1, . . . , k

For a given value of n, denote by dM the coding gain

in eq. (29) results in Yi = 0 for i = 1, . . . , M . Therefore, for

M of the proposed schemes when associated with M -PPM.

a given value of m, if gcd(m,M) is an even number, then the

dM ≥ dM for M ≥ M since in this case the M -PPM

only vector Y that satisfies eq. (27) is the all-zero vector.

constellation is obtained by adding new dimensions to the M -

Since eq. (34) follows only from the properties of the cyclic

PPM constellation. Consequently:

permutation, then this equation will hold if X (m) is replaced

by Y . Therefore, for a given value of i, the component of d2 ≤ d3 ≤ · · · ≤ d∞ (38)

Y having the highest index in eq. (29) is Yi+jk = Yi+M−k

obtained by setting j = M k − 1. Setting i = k − i + 1 On the other hand, consider the matrix C1 that is equal

implies that, from eq. (29), M/k components of Y are equal to the difference between two codewords given by C1 =

to YM−i +1 for i = k, . . . , 1. C(a1 , . . . , an ) for a1 = [1, −1, 01×(M−2) ]T ∈ A and a2 =

Authorized licensed use limited to: LEBANESE AMERICAN UNIVERISTY. Downloaded on February 23, 2009 at 08:28 from IEEE Xplore. Restrictions apply.

ABOU-RJEILY and FAWAZ: SPACE-TIME CODES FOR MIMO ULTRA-WIDEBAND COMMUNICATIONS 947

· · · = an = 0M ∈ A where A is given in eq. (8). The coding [10] V. Tarokh, H. Jafarkhani, and A. R. Calderbank, “Space-time block

gain verifies the relation: codes from orthogonal design,” IEEE Trans. Inform. Theory, vol. 45,

pp. 1456–1466, July 1999.

1 [11] B. A. Sethuraman, B. S. Rajan, and V. Shashidhar, “Full-diversity,

dM min det (C(a1 , . . . , an ))T C(a1 , . . . , an ) n high rate space-time block codes from division algebras,” IEEE Trans.

(a1 ,...,an )∈A0

Inform. Theory, vol. 49, pp. 2596–2616, October 2003.

1 1

≤ det C1T C1 n = [det (2In )] n = 2 ∀ M (39) [12] F. Oggier, G. Rekaya, J.-C. Belfiore, and E. Viterbo, “Perfect space time

block codes,” IEEE Trans. Inform. Theory, vol. 52, no. 9, pp. 3885 –

where A0 An \{(0M , . . . , 0M )}. 3902, September 2006.

[13] A. J. Hammons and H. El Gamal, “On the theory of space-time codes

On the other hand, for M = 2, the set A can be written as: for PSK modulation,” IEEE Trans. Inform. Theory, vol. 46, no. 2, pp.

524 – 542, March 2000.

A = [0 0]T ; [1 − 1]T ; [−1 1]T [14] V. Tarokh, N. Seshadri, and A. Calderbank, “Space-time codes for

high data rate wireless communication : Performance criterion and code

= a[1 − 1]T ; a = 0, ±1 (40) construction,” IEEE Trans. Inform. Theory, vol. 44, pp. 744–765, 1998.

[15] J. Foerster, “Channel modeling sub-committee Report Final,” Technical

Therefore, the difference between two codewords can be report IEEE 802.15-02/490, IEEE 802.15.3a Wireless Personal Area

written as: C = C0 ⊗ [1 − 1]T where the elements of the Networks, 2002.

[16] C. Abou-Rjeily, N. Daniele, and J.-C. Belfiore, “MIMO UWB communi-

matrix C0 belong to the set {0, ±1}. Consequently: cations using modified Hermite pulses,” in Proceedings IEEE Int. Conf.

on Personal, Indoor and Mobile Radio Commun., September 2006.

C T C = C0T ⊗ [1 − 1] C0 ⊗ [1 − 1]T [17] C. Abou Rjeily, N. Daniele, and J. C. Belfiore, “Diversity-multiplexing

tradeoff of single-antenna and multi-antenna indoor ultra-wideband

= C0T C0 ⊗ 2 = 2C0T C0 (41) channels,” in Proceedings IEEE Conference on UWB, September 2006,

1
1 pp. 441 – 446.

Consequently, det C T C n = 2 det C0T C0 n and the [18] J. Kunisch and J. Pamp, “An ultra-wideband space-variant multipath

1 indoor radio channel model,” in Proceedings IEEE Conference on UWB

minimum

T nonzero

value of det C T C n is equal to 2 since Systems and Technologies, November, pp. 290 – 294.

det C0 C0 is a natural integer given that elements of C0 [19] T. De-Mazancourt and D. Gerlic, “The inverse of a block-circulant

matrix,” IEEE Trans. Antennas Propagat., vol. 31, no. 5, pp. 808–810,

belong to the set {0, ±1}. Consequently: September 1983.

d2 ≥ 2 (42)

Finally, combining eq. (38), eq. (39) and eq. (42) results in:

Chadi Abou-Rjeily is an assistant professor at the

2 ≤ d2 ≤ d3 ≤ · · · ≤ d∞ ≤ 2 (43) department of Electrical and Computer Engineer-

ing of the Lebanese American University (LAU),

resulting in dM = 2 for all values of M . Byblos, Lebanon. He received his B.E. degree in

computer and electrical engineering in 2002 from

the Lebanese University, Roumieh, Lebanon. He

R EFERENCES received his M.S. and Ph.D. degrees in electrical

engineering in 2003 and 2006 respectively from

[1] L. Yang and G. B. Giannakis, “Analog space-time coding for multi- the cole Nationale Suprieure des Tlcommunications

antenna ultra-wideband transmissions,” IEEE Trans. Commun., vol. 52, (ENST) , Paris, France. From September 2003 to

pp. 507–517, March 2004. February 2007, he was also a research fellow at

[2] C. Abou-Rjeily, N. Daniele, and J.-C. Belfiore, “Space time coding the Laboratory of Electronics and Information Technology of the French

for multiuser ultra-wideband communications,” IEEE Trans. Commun., Atomic Energy Commission (CEA-LETI). His research interests are in code

vol. 54, pp. 1960–1972, November 2006. construction and transceiver design for wireless communication systems.

[3] C. Abou-Rjeily and J.-C. Belfiore, “On space-time coding with pulse

position and amplitude modulations for time-hopping ultra-wideband

systems,” IEEE Trans. Inform. Theory, vol. 53, pp. 2490–2509, July

2007.

[4] H. Liu, R. Qiu, and Z. Tian, “Error performance of pulse-based ultra- Wissam Fawaz received a B.S. in Computer and

wideband MIMO systems over indoor wireless channels,” IEEE Trans. Telecommunications Engineering with high honors

Wireless Commun., vol. 4, pp. 2939–2944, November 2005. from the Lebanese University Faculty of Engineer-

[5] L. C. Wang, W. C. Liu, and K. J. Shieh, “On the performance of using ing in 2001. In 2002, he earned a M.S. degree in Net-

multiple transmit and receive antennas in pulse-based ultrawideband work and Computer Science with high honors from

systems,” IEEE Trans. Wireless Commun., vol. 4, pp. 2738–2750, the University of Paris VI. Next, he received a Ph.D.

November 2005. degree in Network and Information Technology with

[6] M. K. Simon and V. A. Vilnrotter, “Alamouti-type space-time coding excellent distinction from the University of Paris

for free-space optical communication with direct detection,” IEEE Trans. XIII in 2005. Between 2001 and 2004, he managed

Wireless Commun., vol. 4, pp. 35–39, January 2005. a scientific research project on Optical Service Man-

[7] A. Garcia-Zambrana, “Error rate performance for STBC in free-space agement with ALCATEL Research and Innovation,

optical communications through strong atmospheric turbulence,” IEEE Marcoussis, France. At the University of Paris XIII, between 2002 and 2006

Commun. Lett., vol. 11, pp. 390–392, May 2007. he worked as a Teaching Assistant of Computer and Telecommunications

[8] S. G. Wilson, M. Brandt-Pearce, Q. Cao, and J. H. Leveque, “Free-space Engineering. Since October 2006, he is an Assistant Professor at the Electrical

optical MIMO transmission with q-ary PPM,” IEEE Trans. Commun., and Computer Engineering department at the Lebanese American University.

vol. 53, pp. 1402–1412, August 2005. His research interests include but are not limited to Service Life Cycle

[9] S. M. Alamouti, “A simple transmit diversity technique for wireless Management in Next Generation Optical Networks, and Real Time Flow

communications,” IEEE J. Select. Areas Commun., vol. 16, pp. 1451– Scheduling. Dr. Fawaz is the recipient of the French Ministry of Research

1458, October 1998. and Education Scholarship for distinguished students in 2002.

Authorized licensed use limited to: LEBANESE AMERICAN UNIVERISTY. Downloaded on February 23, 2009 at 08:28 from IEEE Xplore. Restrictions apply.

- RFI Suppression for Synchronous Impulse Reconstruction UWB Radar Using RELAXUploaded bySEP-Publisher
- Comparison 4T8R With 2T2RUploaded byArdo Situmeank
- QAM Implementation Using LabVIEWUploaded byVijaya Shree
- sem2Uploaded byShravan Kumar
- Federico - Master ThesisUploaded bypnkc80
- 3G LTE Simulations Using Measured MIMO ChannelsUploaded byyanivscribd
- VSAT Installation and Maintenance Training_Version_1Uploaded byOladipupo Kola
- IJARECE-VOL-1-ISSUE-3-1-10_JAVA.pdfUploaded bynogoodskam
- Location, Localization, and LocalizabilityUploaded byragaconi
- Intercell Interference Coordination Through Limited FeedbackUploaded byChamp Rachod
- LTE TDD Peak Data Rate ComputationUploaded bybijithkr
- IEEE_IMS_2014_Suyama_etal_SuperHighBitRateRAT.pdfUploaded byQuốc Dũng
- Base BandUploaded byPrabhat Singh
- Ber Analysis of Ieee80211n Mimo System Using Mmse and Zf DetectorsUploaded byIJSTR Research Publication
- Wireless Local PositioningUploaded byCathy Xue
- wivi.docxUploaded byvishal
- 069217Uploaded byjimmydafe
- 14 Cellular LTEUploaded byFrancisco J Lopez
- 05371632Uploaded byKoushik Kashyap
- embmsUploaded byAshish Shukla
- (207318405) Ultrawideband MadhurUploaded byKarthikRahul
- 13755-29061-1-PBUploaded byShilpa
- SiteInformation_38068-Seisa_Ramabodu_Stadium_CEN_20110216.txtUploaded byharyantojogjaboy
- MIMOUploaded byAswin Tresna N
- Video_LTEUploaded byCarlos Trujillo Rojas
- Gov IndUploaded byGovind Ghintala
- TESIS SIMULACION MIMOUploaded byMaydé Ibañez
- CQI enhacement.txtUploaded byRama Krishna S
- rapidmimo-ofdmsrd-guptaUploaded byapi-269442319
- 1102.1552Uploaded byMario Cordina

- Performance Evaluation and Comparison Between LDPC AndUploaded byHusam Abduldaem Mohammed
- 289_LIMSWEEMEI2012.pdfUploaded byHusam Abduldaem Mohammed
- ABAZA_TAEECEUploaded byHusam Abduldaem Mohammed
- 113102-9494 IJECS-IJENSUploaded byHusam Abduldaem Mohammed
- SCCC-MCCDMA Combination Performance Over Multipath Rayleigh Fading ChannelUploaded byHusam Abduldaem Mohammed
- Chapter 332Uploaded byHusam Abduldaem Mohammed
- Measurement and Modelling of a Free-Space Optical Link and in-FieUploaded byHusam Abduldaem Mohammed
- Gradthesis.sl Ofdm Over AwgnUploaded byArmando Cajahuaringa
- OE_May2007Uploaded byHusam Abduldaem Mohammed
- PTL_15_July_2006Uploaded byHusam Abduldaem Mohammed
- Neda TCOM DraftUploaded byHusam Abduldaem Mohammed
- comm2aug05Uploaded byHusam Abduldaem Mohammed
- mimi_pract.pdfUploaded byJagdip Dhillon
- Ieee Tit Outage2008Uploaded byHusam Abduldaem Mohammed
- JCM-490Uploaded byHusam Abduldaem Mohammed
- Fyp 20112012Uploaded byHusam Abduldaem Mohammed
- 0 Good000 Thesis SPIJ-38Uploaded byHusam Abduldaem Mohammed
- Cap.rec.Diversity.optics.express.09Uploaded byHusam Abduldaem Mohammed
- 0 gooodUploaded byHusam Abduldaem Mohammed
- 1_5107490957108969555Uploaded byHusam Abduldaem Mohammed
- projectkara-130502125314-phpapp01Uploaded byHusam Abduldaem Mohammed
- 20160523wtonmonica19maio-160609142418Uploaded byEhsan Rohani
- coherentopticalcodedivisionmultipleaccessocdmasystems-pedrobertarini-140318153420-phpapp02.pdfUploaded byHusam Abduldaem Mohammed
- Book 1Uploaded byHusam Abduldaem Mohammed

- PRBT in Monolithic ArchitectureUploaded byKalaarangan
- CAA Internship ReportUploaded byNaveed Aijaz
- Wi-Max Communication System- By Salman HasanUploaded byapi-19781188
- Project ListUploaded byAnirudha Mhase
- Extron Price ListUploaded bybackch9011
- Ci00247 Rosier Lte ReportUploaded bypapis
- DxDiagUploaded byokay
- Fujitsu Scanner Tel: 63346455 / 63341373 Fax: 63341615 / SMS/Whatsapp - 8777 6955 / Wechat ID - BizgramSG Bizgram Asia Pte Ltd (ROC :200903547Z) Shop & Collection : 1 Rochor Canal Road, # 05-49 / 50 Simlim Square, Singapore 188504.Uploaded byBizgram Asia
- Quidway AR18-1x Series RoutersUploaded byDjamel Gounnar
- TcpipUploaded byapi-3721578
- 3G Test CasesUploaded byIrfan Patel
- presentation_4059_1492080639Uploaded byAdrian Ardeleanu
- R F Survey SitesUploaded byRam Yadav
- Blue Coat ProxySG TroubleshootingUploaded byDaniel Lemos
- INTRO TO FILM INDUSTRY (sta)Uploaded byadamrobbins
- Umts Omc Kpi ListUploaded byXuan Hong Mai
- Pz49x Tt001 en Webview LrUploaded byRELOJERIA
- DetectorUploaded byragvshah
- EconomyUploaded bymaruchi270405
- 03 CM0340 DataRep AudioUploaded byManoj Bagri
- Sony PMW-300 Serie ManualUploaded byEwerton Gustavo Soares Gomes
- FCN_TVUploaded byb9r9o9
- v73MUVPNAdministratorGuideUploaded bysrv42
- Nokia Hot CodesUploaded byRajipillai Ranjith
- Motorola i776 for Sprint NextelUploaded byWirefly
- Avize de Retransmisie Cablu 32015Uploaded byBurlacu Daniel Robert
- DEC_DOCUploaded byPolo Jorg
- Cisco Voip GuideUploaded byjbayone
- 266977d3a0a4b07d2658468e2c28624fUploaded byreasonorg
- 2G_Optim_Nokia.docUploaded byWawan Aji