IEEE TRANSACTIONS ON WIRELESS …thomaszemen.org/papers/Saleh12-IEEETrWirelessCom-paper.pdfIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, ACCEPTED FOR PUBLICATION 1 Receive Antenna

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, ACCEPTED FOR PUBLICATION 1

Receive Antenna Selection forTime-Varying Channels Using Discrete

Prolate Spheroidal SequencesHassan A. Abou Saleh,Student Member, IEEE, Andreas F. Molisch,Fellow, IEEE,Thomas Zemen,Senior Member, IEEE, Steven D. Blostein,Senior Member, IEEE,

and Neelesh B. Mehta,Senior Member, IEEE

Abstract—Receive antenna selection (AS) has been shown tomaintain the diversity benefits of multiple antennas while poten-tially reducing hardware costs. However, the promised diversitygains of receive AS depend on the assumptions of perfect channelknowledge at the receiver and slowly time-varying fading. Byexplicitly accounting for practical constraints imposed by thenext-generation wireless standards such as training, packetizationand antenna switching time, we propose a single receive ASmethod for time-varying fading channels. The method exploitsthe low training overhead and accuracy possible from the useofdiscrete prolate spheroidal (DPS) sequences based reducedranksubspace projection techniques. It only requires knowledge ofthe Doppler bandwidth, and does not require detailed correlationknowledge. Closed-form expressions for the channel predictionand estimation error as well as symbol error probability (SEP)of M-ary phase-shift keying (MPSK) for symbol-by-symbol receiveAS are also derived. It is shown that the proposed AS scheme,after accounting for the practical limitations mentioned above,outperforms the ideal conventional single-input single-output(SISO) system with perfect CSI and no AS at the receiver andAS with conventional estimation based on complex exponentialbasis functions.

Index Terms—Antenna selection, time-varying fading, discreteprolate spheroidal sequences, Slepian basis expansion.

I. I NTRODUCTION

T O accommodate the rate and reliability requirements setby forthcoming applications such as wireless broadband

access and mobile television, next-generation wireless stan-dards such as IEEE 802.11n [1] and long term evolution (LTE)of the third generation partnership project (3GPP) [2] haveadopted multiple-input multiple-output (MIMO) technology,orthogonal frequency division multiplexing (OFDM) and/or

Manuscript received August 23, 2011; revised December 21, 2011; acceptedMarch 27, 2012. The associate editor coordinating the review of this paperand approving it for publication is G. Abreu.

This paper was presented in part at the IEEE International Conference onCommunications, Ottawa, ON, Canada, June 2012.

H. A. Saleh and S. D. Blostein are with the Dept. of ElectricalandComputer Eng., Queen’s University, Kingston, ON, Canada (e-mail: [email protected], [email protected]).

A. F. Molisch is with the Dept. of Electrical Eng., University of SouthernCalifornia (USC), Los Angeles, CA, USA (e-mail: [email protected]).

T. Zemen is with FTW Forschungszentrum Telekommunikation Wien(Telecommunications Research Center Vienna), Vienna, Austria (e-mail:[email protected]).

N. B. Mehta is with the Dept. of Electrical and CommunicationEng., Indian Institute of Science (IISc), Bangalore, India(e-mail: [email protected]).

Digital Object Identifier 10.1109/TWC.2012.12.111582

orthogonal frequency division multiple access (OFDMA) assignalling formats over the physical channel. Further, AS atthe transmitter and/or receiver has been standardized, e.g., inIEEE 802.11n, or is being standardized [3].

Antenna selection may be used to reduce hardware com-plexity at the transmitter and/or receiver of a wireless system.In AS, only a subset of the antenna elements (AEs) isconnected to a limited number of radio-frequency (RF) chainsbased on the current channel fades. This potentially retainsthe advantages of multiple antennas, despite using fewer ofthe expensive RF chains that are comprised of low-noiseamplifiers (LNAs), mixers, and oscillators [4], [5]. We focushere on the practical single receive AS scenario because itretains most of the diversity benefits of multiple antennaswhile minimizing hardware complexity. As will be shown,performance evaluation of even the single AS problem is verychallenging.

There are a number of existing studies on both optimal andsuboptimal AS algorithms [6], [7] as well as on the capacity,diversity, and diversity-multiplexing (D-M) performanceofAS [8]–[13]. However, to date, far fewer studies exist thatdeal with the practical issues of pilot-based training and ASimplementation. A media-access-control (MAC) based AStraining and calibration protocol, in which the AEs are trainedusing packets transmitted in burst mode is proposed in [14]for slowly time-varying environments. The protocol in [14]is adopted in the IEEE 802.11n standard for high-throughputwireless local area networks (WLANs).

In the above references, perfect channel knowledge isassumed. However, the mobile communication environmentexhibits a randomly time-varying channel due to the mobilityof users and reflections from multiple scatterers. This impliesthat channel state information (CSI) gets rapidly outdated,limiting the accuracy of the channel knowledge at the re-ceiver. The impact of erroneous CSI on the performance ofa space-time coded AS system in Rayleigh fading is studiedin [15]. The performance of maximal ratio transmission (MRT)and transmit antenna selection with space-time block coding(TAS/STBC) in MIMO systems with both CSI feedbackdelay and channel estimation error is analyzed in [16]. Ananalytical framework to evaluate the symbol error probability(SEP) performance for diversity systems in which a subsetof the available diversity branches are selected and combined

1536-1276/12$31.00c© 2012 IEEE

2 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, ACCEPTED FOR PUBLICATION

over flat Rayleigh fading with imperfect channel knowledgeis developed in [17]. Receive AS for space-time-frequency(STF) coded MIMO-OFDM systems with imperfect channelestimation is studied in [18]. The effects of feedback delayand channel estimation errors on the performance of a MIMOsystem employing AS at the transmitter and maximal ratiocombining (MRC) at the receiver is studied in [19]. In [19],it is shown that channel estimation errors result in a fixedsignal-to-noise ratio (SNR) loss while feedback delay altersthe diversity order.

Motivated by the fact that AE channel gain estimatesare outdated by different amounts in time-varying channels,a single-antenna selection rule is proposed in [20] whichminimizes the SEP ofM-ary PSK (MPSK)/MQAM by linearlyweighting the channel estimates before selection. In [20],it is shown that the optimal weights are proportional tothe temporal channel correlation coefficients of the antennas.The general case of selecting more than one antenna andthe problem of training voids have been recently treatedin [21]. However, it is worth mentioning that only channelgain estimates obtained during theAS training phase are usedin the selection and decoding mechanisms in [20] and [21]since channel gain estimates over thedata transmission phaseare not available, which incurs a loss in SNR. We also notethat the weighted selection criterion used in [20] and [21]requires temporal correlation knowledge.

The above observations motivate investigation into practicaltraining-based AS algorithms for time-varying channels whichuse channel knowledge in the data transmission phase inthe selection and decoding processes by utilizing channelprediction. It is important to highlight that the optimal Wienerpredictor utilizes detailed covariance knowledge, which isdifficult to obtain due to bursty transmission, or over theshort time interval in which the channel is wide-sense sta-tionary in vehicular scenarios [22]. This motivates the useofthe recently-proposed low-complexity Slepian basis expansionchannel estimator [23] and channel predictor [22] to obtainreliable CSI at the receiver. This Slepian basis expansionestimator/predictor uses discrete prolate spheroidal (DPS)sequences as basis functions which enables low-complexityreduced-rank channel estimation/prediction. Furthermore, incontrast to many linear estimation/prediction techniquesthatrequire detailed autocorrelation knowledge, it requires onlyknowledge of the Doppler bandwidth. In [23], the Slepianbasis expansion channel estimator is used to estimate thetime-varying channel for each subcarrier of a multiuser multi-carrier code division multiple access (MC-CDMA) system.It is shown that with a pilot-to-packet length ratio of only2%, the bit error rate (BER) of the system approaches thatof a system with perfect CSI. It is shown in [22] that for aprediction horizon of one eighth of a wavelength, the Slepianbasis expansion channel predictor outperforms the classicalpredictor that uses complex exponentials as the basis. Wenote that the complex exponential predictor utilizes the exactDoppler frequencies of each propagation path of the channel.For a prediction horizon of three eighths of a wavelength, theperformance of the Slepian basis expansion channel predictoris shown to be very close to that of the optimal Wienerpredictor.

In this paper, we propose and analyze the performance ofa training-based single receive AS system in time-varyingchannels that uses the Slepian basis expansion predictor andestimator. The paper’s contributions are summarized as fol-lows:

• A method for accurately estimating/predicting time-varying frequency-flat channels, which utilizes projec-tions onto a subspace spanned by orthonormal DPSsequences [22], [23], is extended to AS.

• Closed-form expressions are provided for the channelprediction and estimation error as well as the SEP ofMPSK with receive AS, and verified with Monte Carlosimulation results.

• Extensive simulation results are presented to comparethe performance of the proposed AS method with idealconventional single-input single-output (SISO) systemswith perfect CSI but no AS at the receiver and ASbased on prediction/estimation techniques that are basedon complex exponential basis functions.

The paper is organized as follows: the detailed systemmodel is described in Sec. II, and the Slepian basis expansionpredictor and estimator are then introduced in Sec. III. Thetraining-based receive AS method is described in Sec. IV.The SEP is analyzed in Sec. V. Analytical and simulationresults are discussed in Sec. VI. Our conclusions follow inSec. VII. Detailed mathematical derivations are provided inthe Appendix.

II. SYSTEM MODEL

Consider the downlink of a cellular radio system consistingof a single-antenna base station (BS) transmitting to aK-antenna element (AE) mobile station (MS) equipped with onlyone RF chain as depicted in Fig. 1. A micro-electromechanicalsystem (MEMS) based antenna switch connects the selectedAE to the RF chain; such switches provide sufficient switchingspeeds while keeping the insertion loss in the order of0.1 dB,which is negligible.

Each AS cycle consists of anAS training phase followedby a data transmission phase, as illustrated in Fig. 2. We firstintroduce DPS sequences which are used to predict/estimatethe time-varying channel over the data transmission phase asshown in Sec. III, and then describe the AS training and datatransmission phases.

A. Discrete Prolate Spheroidal (DPS) Sequences

The orthogonal DPS sequences are simultaneously band-limited to the frequency rangeW = (−νmax,+νmax)and energy-concentrated in the time intervalIbl ={0, 1, . . . ,M ′ − 1}, where the normalized one-sided Dopplerbandwidthνmax is given by

νmax△=vmaxfc

cTs ≪

1

2(1)

where vmax is the radial component of the user velocity,fc

is the carrier frequency, andc is the speed of light. TheM ′

DPS sequences{ui [m] |m ∈ Z}M′−1

i=0 are defined as the real

ABOU SALEH et al.: RECEIVE ANTENNA SELECTION FOR TIME-VARYING CHANNELS USING DISCRETE PROLATE SPHEROIDAL SEQUENCES 3

M obile rad io

channel

M obile rad io

channel 1 out of K

sw itch

1 out of K

sw itch

D ata sink(M S)

D ata sink(M S)

D ata source(BS)

D ata source(BS)

A E 1A E 1

A E K

Fig. 1. Antenna selection system model.

solutions to the following system of linear equations [23]

M ′−1∑

l=0

C [l −m] ui [l] = λi ui [m] , m ∈ Z, i ∈ Ibl

(2)where

C [l −m] =sin (2πνmax(l−m))

π (l −m). (3)

The eigenvalues{λi}M′−1

i=0 decay exponentially fori ≥ D′,where the essential subspace dimensionD′ is given by [23]

D′ = ⌈2 νmaxM′⌉+ 1 (4)

and⌈x⌉ denotes the smallest integer greater than or equal tox.

As mentioned earlier, the DPS sequences{ui [m] |m ∈ Z}M

′−1i=0 are orthogonal. Further, even

the restrictions of the DPS sequences onIbl, i.e.,{ui [m] |m ∈ Ibl}M

′−1i=0 , are orthonormal [23], and, thus,

form a set ofM ′-length basis vectors{ui}M′−1

i=0 . Basedon (2), the length-M ′ basis vectors{ui}M

′−1i=0 are, thus, the

eigenvectors of theM ′ ×M ′ matrix C [23]

C ui = λi ui (5)

where M ′ × 1 basis vector ui△=

[

ui [0] , ui [1] , . . . , ui [M′ − 1]

]Twith (·)T denoting the

transpose. The entries ofC are formed from (3) as[C]l,m = C [l −m] for l, m ∈ Ibl. As shown in Sec. III-A,the DPS sequences time-limited toIbl, which form anorthonormal set of basis functions{ui}M

′−1i=0 , can be used to

estimate the time-varying channel overIbl.

B. AS Training Phase

In eachAS training phase, the BS transmitsL ≥ 2 trainingsymbols sequentially in time to each antenna. We note herethat more than one pilot symbol is needed in order to employAS in time-varying channels to improve channel prediction.Pilot symbols are used to estimate the predictor’s basis expan-sion coefficients as discussed in Sec. III. We also note that the3GPP-LTE standard uses two training symbols within a 1 msduration to improve channel estimation. The duration between

consecutive pilots for AEk and AEk+1 is Tp△= αTs, where

Ts is the symbol duration andα ≥ 2. Two consecutive AStraining pilots transmitted for each AE are thus separated in

time by a duration ofTt△= K Tp = αK Ts. The pilot and data

symbol durationTs is assumed to be much longer than thedelay spread and much shorter than the coherence time of thechannel, i.e., the channel is frequency-flat time-varying.The

1

1 L

AE 1

AE 2

L

A S train ing phase

1 L '

Data transm ission phase

C onsecutive (K ×L) A S train ing pilots (N -L ' ) data sym bols w ith

L ' in terleaved pilots

T s

T p

T t

Selection &

Sw itching

T p-T s

Tim e m

Tim e m

Fig. 2. Antenna selection cycle consists of AS training and data transmissionphases. (AE1 is selected,K = 2, L = 2, L′ = 2, andTp = 2Ts).

data symbols are drawn with equal probability from anMPSKconstellation of average energyEs = 1.

Let m index discrete time with sampling rateRs△= 1

Ts. The

channel gainhk [m] is estimated from the AS training pilotsymbolpk [m] that is received by AEk at timem ∈ T k

tr . Thereceived signal is

yk [m] = hk [m] pk [m] + nk [m] , 1 ≤ k ≤ K, m ∈ T ktr

(6)where

T ktr

△= {α [(k − 1) +K (ℓ− 1)]} , 1 ≤ ℓ ≤ L (7)

denotes the set of time indices when theL AS training pilotsare received by AEk, hk [m] is the sampled time-varyingchannel gain, andnk [m] is additive white Gaussian noise(AWGN) with varianceN0 and is independent ofhk [m].

Based on (6), channel gain estimates{

hk [m] |m ∈ T ktr

}

forAE k can be expressed as

hk [m] = yk [m] p∗k [m]△= hk [m] + en

k [m] , 1 ≤ k ≤ K, m ∈ T ktr (8)

where (·)∗ denotes complex conjugate andenk [m]

△=

nk [m] p∗k [m] is the channel estimation error resulting fromthe AWGN. From (7) and accounting for the additionalselection and switching time of durationTp − Ts, it followsthat the AS training phase spans the discrete time intervalItr = {0, 1, . . . ,M − 1}, whereM = αK L.

Using the noisy channel estimates{

hk [m] |m ∈ T ktr

}

, thereceiver performs minimum-energy (ME) band-limited chan-nel prediction [22] for each antenna over thedata transmissionphase time interval Idt = {M,M + 1, . . . ,M +N − 1}.

Denote the predicted channel gains by{

hSPk [m] |m ∈ Idt

}

,

where the superscript(·)SP indicates Slepian prediction [22].The MS selects its receive antenna according to a certaincriterion, and then switches its RF chain accordingly.

Depending on the AS switching time, either per-packet orsymbol-by-symbol AS can be used. For example, solid-stateswitches achieve switching times on the order of hundredsof nanoseconds, which is less than typical cyclic prefixes,and thus enable the switching of antennas between symbols.Thus, different symbols of a packet may be received by their


most suitable AEs as the channel varies with time. However,these switches have attenuations on the order of1 to 3 dB.In contrast, MEMS switches have attenuations on the orderof 0.1 to 0.3 dB, but achieve switching times on the orderof microseconds, and thus typically enable only per-packetswitching. We note as the AS switching times and attenuationsdecrease, symbol-by-symbol switching may become viable infuturistic systems. Furthermore, similar to 802.11n, per-packetswitching can be enabled by modifications of the MAC layer,while per-symbol switching requires changes to the physical-layer standard. Therefore, both symbol-by-symbol and per-packet switching are relevant, and are both considered in ouranalysis. We denote byι the index of the selected antenna,with (·) indicating that the selection is based on (imperfect)prediction and/or estimation.

C. Data Transmission Phase

In eachdata transmission phase the BS sends out a length-N data packet, which consists ofN−L′ data symbols andL′

interleaved post-selection pilot symbols. The symbol locationsin the packet that carry the pilots are given by [23]

P △=

{⌊

(ℓ′ − 1)N

L′ +N

2L′

⌋

∣

∣ 1 ≤ ℓ′ ≤ L′}

(9)

where⌊x⌋ denotes the largest integer not greater thanx. Afterselection, the pilots are received by AEι at timesm ∈ Tdt,where

Tdt△=

{

M − 1 +

⌊

(ℓ′ − 1)N

L′ +N

2L′

⌋

∣

∣ 1 ≤ ℓ′ ≤ L′}

(10)andM = αK L. Thus, in total,Ltot

△= L+ L′ pilot symbols

are received by AEι at timesm ∈ T ιtot, where

T ιtot = T ι

tr ∪ Tdt (11)

with T ιtr andTdt given in (7) and (10), respectively. From these

Ltot pilots, refined channel gain estimates{

hSEι [m] |m ∈ Idt

}

of the selected AEι are obtained using the Slepian basisexpansion channel estimator [23] and used to decode data.The received signal at AEι can be expressed as

yι [m] = hι [m] s [m] + nι [m] , m ∈ Idt (12)

where the transmitted symbols [m] is given by

s [m] =

{

d [m] , m ∈ Idt\Tdt

p [m] , m ∈ Tdt. (13)

Here, d [m] and p [m] denote the transmitted data and post-selection pilot symbols, respectively.

III. R EDUCED-RANK CHANNEL ESTIMATION AND

MINIMUM -ENERGY BAND-LIMITED PREDICTION

A. Reduced-Rank Channel Estimation

To enable estimation of a time-varying channel for a length-M ′ block of data transmission,M ′ − J data symbols andJinterleaved pilot symbols are transmitted in a pattern specifiedby index setJ .

The aforementioned DPS sequences time-limited toIbl ={0, 1, . . . ,M ′ − 1} are used to estimate the time-varying

channel over time intervalIbl. The basis expansion esti-

mator approximates theM ′ × 1 true channel vectorh△=

[

h [0] , h [1] , . . . , h [M ′ − 1]]T

in terms of a linear combina-

tion hSE

of D length-M ′ basis vectors{ui}D−1i=0 as [22]

h ≈ hSE

= U γ =

D−1∑

i=0

γi ui (14)

whereU△=[

u0, . . . ,uD−1

]

is an M ′ × D matrix, ui△=

[

ui [0] , ui [1] , . . . , ui [M′ − 1]

]T, andD is the optimal sub-

space dimension which minimizes the mean-square-error(MSE) in the above approximation. It is given by

D = argmind∈{1,...,J}

(

1

2 νmaxJ

J−1∑

i=d

λi +d

JN0

)

(15)

whereη△= Es

N0

is the average SNR. In (15), the eigenvaluesare assumed to be ranked asλ0 ≥ λ1 ≥ . . . ≥ λJ−1. The

D × 1 vector γ△=[

γ0, γ1, . . . , γD−1

]Tcontains the basis

expansion coefficients. It is estimated using theJ interleavedpilot symbols{p [l] | l ∈ J }, received at timesl ∈ J , via [23]

γ = G−1∑

l∈Jy [l] p∗ [l] f∗ [l] (16)

where y [l] is the received signal, theD × 1 vector f [l] isdefined as

[

u0 [l] , . . . , uD−1 [l]]T

, andG is aD ×D matrixgiven by

G =∑

l∈Jf [l] f† [l] (17)

where(·)† denotes Hermitian transpose.

B. Minimum-Energy Band-Limited Channel Prediction

The ME band-limited predictor uses the extension of theDPS sequences that are time-limited toIbl as the basis vectors.They are calculated by [22]

ui [m] =1

λi

M ′−1∑

l=0

C [l−m] ui [l] , m ∈ Z \ Ibl. (18)

The ME band-limited prediction of a time-varying frequency-flat channel can be expressed as [22]

hSP[m] = fT [m] γ =D−1∑

i=0

γi ui [m] , m ∈ Z \ Ibl (19)

wheref [m] = [u0[m], . . . , uD−1[m]]T .

IV. D OWNLINK RECEIVE ANTENNA SELECTION

ALGORITHM

We propose the following training-based “one out ofK”receive AS algorithm for time-varying channels for per-packetswitching:

1) Following an AS request, each AE is trained usingL ≥2 pilot symbols. The spacing between consecutive AStraining pilots transmitted for each AE isTt = αK Ts.


To keep theAS training phase as short as possible,α ischosen as

α =

⌈

Tsw

Ts

⌉

+ 1 (20)

whereTsw is the antenna switching time.2) On receiving these AS training pilots, the receiver then:

a) Obtains the preliminary channel gain estimates{

hk [m] |m ∈ T ktr

}K

k=1using (8).

b) Performs channel prediction for each AE over thedata time intervalIdt via (19)

hSPk [m] = fT [m] γk =

D−1∑

i=0

γk,i ui [m] (21)

where1 ≤ k ≤ K, m ∈ Idt, andD is calculatedfrom (15)(with L replacingJ). Slepian predictionsequences{ui [m] |m ∈ Idt}D−1

i=0 are calculated

from (18), andγk

△=[

γk,0, γk,1, . . . , γk,D−1

]Tis

of size D × 1 and contains the basis expansioncoefficients for AEk which are estimated via (16)(

with T ktr replacingJ

)

.c) Selects its receive AEι which maximizes the post-

processing SNR over the data time intervalIdt,which consists ofN symbol durations, as

ι = argmax1≤k≤K

M+N−1∑

m=M

∣

∣

∣hSPk [m]

∣

∣

∣

2

. (22)

3) The single-antenna BS then sends out a length-N datapacket which consists ofN − L′ data symbols plusL′

post-selection pilot symbols interleaved according to (9).Using theLtot = L + L′ pilots, refined channel gainestimates

{


}

are obtained by

hSEι = U ′ γ ι =

D−1∑

i=0

γι,i u′i (23)

where the N × 1 vector hSEι

△=

[

hSEι [M ] , hSE

ι [M + 1] , . . . , hSEι [M +N − 1]

]T, D is

obtained from (15)(with Ltot replacingJ), theD × 1

vector γ ι

△=[

γι,0, . . . , γι,D−1

]Tcontains AE ι basis

expansion coefficients which are estimated using (16)

(with T ιtot replacing J ), U ′ △

=[

u′0, . . . ,u

′D−1

]

is the N × D submatrix of the complete(M +N) × D DPS sequences matrixU . The vector

u′i

△=[

ui [M ] , ui [M + 1] , . . . , ui [M +N − 1]]T

is ofsizeN × 1.

We note that while other selection criteria may alternativelybe used [20]; we consider the maximum total post-processingSNR criterion in (22).

Remark: In symbol-by-symbol AS, for each symbol anAE is selected. Since different AEs might be selected duringthe data transmission phaseIdt, L′ pilots should be sentto each AE in the data transmission phase so that refinedchannel gain estimates can be obtained for each AE. Thus,the number of pilots is nowKL′. Note that we still haveIdt = {M,M + 1, . . . ,M +N − 1} since the switching timeis less than the symbol duration. The above algorithm is

converted into a symbol-by-symbol receive AS algorithm asfollows: (i) In Step 2(c) the receiver then selects its receiveAE, ιm, for the data symbol at timem according to

ιm = argmax1≤k≤K

∣

∣

∣hSPk [m]

∣

∣

∣

2

. (24)

To denote this alternative AS strategy, symbol indexm hasbeen added toι in (24). (ii) In Step 3 the BS sends out a length-N data packet which consists ofN −KL′ data symbols plusKL′ pilots for theK AEs. Note that no AS is employed duringthe transmission of theKL′ pilots. Thus, in total,Ltot = L+L′ pilot symbols are received by each AE. From theseLtot

pilots, refined channel gain estimates{

hSEιm

[m] |m ∈ Idt

}

areobtained using the Slepian basis estimator and used to decodedata. To reduce overheadL′ can be set to1.

V. SYMBOL ERROR PROBABILITY (SEP) ANALYSIS

In this section, we analyze the proposed receive AS al-gorithm from Section IV as well as the symbol-by-symbolreceive AS, to evaluate the SEP ofMPSK in time-varyingchannels.

A. Prediction and Estimation CSI Models

To derive closed-form expressions for the variances of thepredicted/estimated channel gains and prediction/estimationerrors, we first define the CSI uncertainty model for Slepianbasis expansion estimation as

hSEk [m] = hk [m] + eSE

k [m] , 1 ≤ k ≤ K, m ∈ Idt (25)

where hSEk [m] is the estimated channel gain,hk [m] is the

true channel gain, andeSEk [m] is the estimation error. We

assume the variableshk [m] andeSEk [m] are uncorrelated. The

true channel gainhk [m] is modeled as a zero-mean circularlysymmetric complex Gaussian random variable (RV) with unit-variance. The true channel gain is correlated over time.From (25), the variance of the channel gain estimatehSE

k [m]can be expressed as

σ2hSEk

[m] = σ2hk

[m] + σ2eSEk

[m] = 1 +MSESEk [m] (26)

whereMSESEk [m] is the MSE per sample for the Slepian basis

expansion estimator of AEk.The MSE per sample of the Slepian basis expansion estimatorfor AE k takes the form [22]

MSESEk [m] =

(

biasSEk [m]

)2

+ varSEk [m] (27)

where biasSEk [m] and varSE

k [m] are the bias and varianceterms, respectively. In (27), the squared bias term can beexpressed as [22]

(

biasSEk [m]

)2

=

∫ + 1

2

− 1

2

ESEk [m, ν] Sh (ν) dν (28)

whereSh (ν) is the power spectral density (PSD) of the time-varying channel{h [m]}, andESE

k [m, ν] is the instantaneouserror characteristic given by

ESEk [m, ν] =

∣

∣1−GSEk [m, ν]

∣

∣

2. (29)


Here, the instantaneous amplitude frequency responseGSE

k [m, ν] is given by

GSEk [m, ν] = f

T [m] G−1k

∑

l∈Tktot

f∗ [l] exp (−j2πν (m− l)) .

(30)In (27), varSE

k [m] can be well approximated by [23]

varSEk [m] ≈ N0 f

† [m] G−1k f [m] . (31)

The CSI model for the Slepian basis expansion predictor canbe obtained from (25)–(31) by replacing superscript(·)SE by(·)SP andT k

tot by T ktr in (30).

B. SEP Analysis

1) SEP of Per-Packet Basis Selection: We now analyze theSEP of anMPSK symbol received at timem of a system whichemploys the per-packet basis receive AS algorithm in Sec. IV.

Note that the predicted channel gains{

hSPk [m] |m ∈ Idt

}K

k=1are used to select AEι to receive the length-N data packet,while the estimated channel gainhSE

ι [m] is used to decode thereceived symbol at timem. The maximum-likelihood (ML)soft estimate for the symbol received by AEι at timem canbe expressed as

rι [m] =(

hSEι [m]

)∗yι [m]

=∣

∣

∣hSEι [m]

∣

∣

∣

2

d [m]−(

hSEι [m]

)∗d [m] eSE

ι [m]

+(

hSEι [m]

)∗nι [m] (32)

where the last equality follows from substitution of (12), (13),and (25). Conditioned onhSE

ι [m] andd [m], rι [m] in (32) isa complex Gaussian RV whose conditional meanµrι [m] andvarianceσ2

rι[m], as shown in the Appendix, are given by

µrι [m]△= E

{

rι [m]∣

∣ hSEι [m] , d [m]

}

=∣

∣

∣hSEι [m]

∣

∣

∣

2

d [m] ζSEι [m] (33)

σ2rι[m]

△= var

{

rι [m]∣

∣ hSEι [m] , d [m]

}

=∣

∣

∣hSEι [m]

∣

∣

∣

2

|d [m]|2(

1− ζSEι [m]

)

+N0

∣

∣

∣hSEι [m]

∣

∣

∣

2

(34)

where E {·} and var {·} denote statistical expectation and

variance, respectively.ζSEι [m]

△= 1

1+σ2

eSEι

[m]= 1

1+MSESEι[m]

,

and the other symbols are defined in (13) and (26).

Conditioned on

{

{

hSPk [m]

}M+N−1

m=M

}K

k=1

, ι, and hSEι [m],

the SEP of an MPSK symbol received at timem

SEPm

(

{

{

hSPk [m]

}M+N−1

m=M

}K

k=1

, ι, hSEι [m]

)

, which is de-

noted by SEPm (κ), is [20], [24]

SEPm (κ) =1

π

∫M−1

M π

0

exp

(

− |µrι [m]|2 sin2(

πM

)

σ2rι[m] sin2 (θ)

)

dθ

=1

π

∫M−1

M π

0

exp

−∣

∣

∣hSEι [m]

∣

∣

∣

2

bSEι [m]

sin2 (θ)

dθ

(35)

wherebSEk [m]

△=

(ζSEk [m])

2

sin2(πM )

(1−ζSEk[m])+ 1

η

and the last equality follows

from substitution of (33) and (34). Note that the SEP expres-sion above depends onlyι and hSE

ι [m]. We shall, therefore,

denote (35) by SEPm(

ι, hSEι [m]

)

henceforth.Now averaging over the index ι to get

SEPm

(

{

{

hSPk [m]

}M+N−1

m=M

}K

k=1

,{

hSEk [m]

}K

k=1

)

, which

is denoted by SEPm (Ξ), yields

SEPm (Ξ) =

K∑

k=1

Pr

(

ι = k

∣

∣

∣

∣

{

{

hSPk [m]

}M+N−1

m=M

}K

k=1

)

×SEPm(

ι = k, hSEι [m]

)

=1

π

K∑

k=1

K∏

l=1l 6=k

Pr

(

M+N−1∑

m=M

∣

∣

∣hSPl [m]

∣

∣

∣

2

<

M+N−1∑

m=M

∣

∣

∣hSPk [m]

∣

∣

∣

2∣

∣

∣

∣

∣

{

{

hSPk [m]

}M+N−1

m=M

}K

k=1

))

×∫

M−1

M π

0

exp

−∣

∣

∣hSEk [m]

∣

∣

∣

2

bSEk [m]

sin2 (θ)

dθ.

(36)

After averaging over fading(i.e., Ξ), the SEP as a functionof the SNR per branchη = Es

N0

is

SEPm (η) =1

π

K∑

k=1

∫M−1

M π

0

∫ ∞

0

∫ ∞

0

exp

(−x′ bSEk [m]

sin2 (θ)

)

×fX′

k,Y ′

k(x′, y′)

K∏

l=1l 6=k

FY ′

l(y′) dx′dy′dθ (37)

where fX′

k, Y ′

k(x′, y′) is the joint probability distribution of

the exponentially distributed RVX ′k

△=∣

∣

∣hSEk [m]

∣

∣

∣

2

and RV

Y ′k

△=

M+N−1∑

m=M

∣

∣

∣hSPk [m]

∣

∣

∣

2

. Thus,Y ′k is the sum of correlated

exponentially distributed RVs, andFY ′

k(y′) denotes its cu-

mulative distribution function (CDF). Deriving a closed-formexpression for SEPm (η) in (37) is analytically intractablesince closed-form expressions forfX′

k,Y ′

k(x′, y′) andFY ′

k(y′)

do not exist. Therefore, Monte Carlo averaging techniques [25]are used to evaluate the fading-averaged SEP SEPm (η) fromSEPm (Ξ).


We now derive the SEP ofMPSK for a system that performsreceive AS on a symbol-by-symbol basis. As shown in thenext section, symbol-by-symbol AS is analytically tractableand provides insights for per-packet AS.

2) Symbol-By-Symbol AS SEP For MPSK: Receive AS ison an instantaneous symbol-by-symbol basis according to (24)with the channel gain estimatehSE

ιm[m] used to decode the

MPSK symbol received at timem.

Theorem 1 The SEP of anMPSK symbol received at timemin a time-varying channel for a system with one transmit andK receive antennas employing selection criterion (24) withchannel gain estimatehSE

ιm[m] to decode anMPSK symbol

received at timem is given by

SEP′m (η) =

1

π

K∑

k=1

K−1∑

r=0

K∑

l0,...,lr=1l0=1, l1 6=...6= lr 6=k

(−1)r

r!(

4σ2k,c1

[m])

× 1

σ2k,c2

[m](

1−[

ρ2k,c1c2 [m] + ρ2k,c1s2 [m]])

∫M−1

M π

0

∫ ∞

0

∫ ∞

0

exp

(

−x bSEk [m]

sin2 (θ)

−yr∑

j=1

ζSPlj

[m]−[

x

σ2k,c1

[m]+

y

σ2k,c2

[m]

]

× 1

2(

1−[

ρ2k,c1c2 [m] + ρ2k,c1s2 [m]])

)

×I0(

√

ρ2k,c1c2 [m] + ρ2k,c1s2 [m](

1−[

ρ2k,c1c2 [m] + ρ2k,c1s2 [m]])

×√xy

σk,c1 [m]σk,c2 [m]

)

dxdy dθ (38)

where the notationK∑

l0,...,lr=1l0=1, l1 6=...6= lr 6=k

compactly denotes

1∑

l0=1

K∑

l1=1(l1 6=k)

K∑

l2=1(l2 6=k,l2 6=l1)

. . .K∑

lr=1(lr 6=k, lr 6=l1,..., lr 6=lr−1)

, ζSPlj

[m]△=

1σ2

hSPlj

[m]= 1

1+σ2

eSPlj

[m]= 1

1+MSESPlj

, bSEk [m]

△=

(ζSEk [m])

2

sin2( πM )

(1−ζSEk[m])+ 1

η

,

and I0 (·) is the zeroth-order modified Bessel functionof the first kind. In (38),ρk,c1c2 [m] and ρk,c1s2 [m] de-note the correlation coefficients of(Xk,c1 [m] , Xk,c2 [m])

and (Xk,c1 [m] , Xk,s2 [m]), respectively, whereXk△=

∣

∣

∣hSEk [m]

∣

∣

∣

2

= Xk,c1 [m] + jXk,s1 [m] andYk△=∣

∣

∣hSPk [m]

∣

∣

∣

2

=

Xk,c2 [m] + jXk,s2 [m], and (Xk,c1 [m] , Xk,s1 [m]) and(Xk,c2 [m] , Xk,s2 [m]) are i.i.d. zero-mean Gaussian RVs withvariancesσ2

k,c1[m] = σ2

k,s1[m] and σ2

k,c2[m] = σ2

k,s2[m],

respectively.

Proof: The proof is given in the Appendix.

VI. SIMULATIONS

We now present numerical results to gain further insightinto the previous analysis and study performance over time-

0 5 10 15 20 25 3010

−3

10−2

10−1

100

SNR (dB)

Pac

ket e

rror

rat

e (P

ER

)

1 × 1 DPS prediction & no AS1 × (1,2) DPS prediction & AS1 × (1,2) DFT method & AS1 × (1,2) no prediction & AS1 × 1 perfect CSI & no AS1 × (1,2) proposed AS algorithm1 × (1,2) perfect CSI & AS

Fig. 3. PER performance of the proposed AS algorithm for a1 × (1, 2)system. (4PSK, data packet lengthN = 40, training pilotsL = 2, post-selection pilotsL′ = 2, andTp = 3Ts).

varying channels. In the sequel, a system with one transmit andone receive antenna is denoted as1× 1, while a system withone transmit andK receive antennas out of which only one isselected is denoted as1 × (1,K). Unless otherwise stated, a1× (1,K) system is simulated with the following parameters:(i) symbol durationTs = 20.57 µs chosen according to [23],(ii) packet sizeN = 40 symbols, (iii) packet duration of0.8228 ms, (iv) user velocityvmax = 100 km/h = 27.8m/s,(v) carrier frequencyfc = 2GHz, (vi) normalized Dopplerbandwidthνmax = 3.8×10−3, (vii) symmetric spectral supportW = (−νmax, νmax), (viii) MPSK modulation with Graylabeling, and (ix) channel gains generated assuming plane-wave propagation [26], i.e.,

h [m] =

P−1∑

p=0

ap exp(j2πνpm) (39)

where the number of propagation paths is set toP = 30, thenormalized Doppler shift per pathνp = νmax cosαp, wherepath anglesαp are uniformly distributed over[−π π), thepath weights areap = 1√

Pexp(jψp), and ψp is uniformly

distributed over [−π π). We note that the random pathparametersap and νp are assumed to be constant over anAS cycle time intervalIcycle = {0, 1, . . . ,M +N − 1} butchange independently from cycle to cycle. The covariancefunction of{h [m]} converges toRh [∆m] = J0 (2πνmax∆m)for P → ∞, whereJ0 (·) is the zeroth order Bessel function ofthe first kind [22]. The channel model in (39) is also suitablefor the evaluation of channel prediction algorithms [22].

Figs. 3 and 4 show the PER of the proposed receive ASalgorithm as a function of average SNR for1 × (1, 2) and1×(1, 4) systems, respectively. For comparison, we also showthe PER performance of (i) a1 × 1 system with perfect CSIand no AS, (ii) a1 × 1 system employing Slepian basisexpansion channel prediction and no AS, (iii)1 × (1, 2) and1×(1, 4) systems employing discrete Fourier transform (DFT)basis expansion channel prediction and AS according to themaximum total post-processing SNR selection criterion, as


0 5 10 15 20 25 3010

−4

10−3

10−2

10−1

100

SNR (dB)

Pac

ket e

rror

rat

e (P

ER

)



in (22). DFT channel estimation is used for data decoding, (iv)1×(1, 2) and1×(1, 4) systems employing AS without channelprediction. We note that the antenna with the highest channelgain estimatehk [m] in (8) is selected since no channel pre-diction is used, (v)1×(1, 2) and1×(1, 4) systems employingSlepian channel prediction and AS according to (22), with thepredicted channel gains

{

hSPk [m] |m ∈ Idt

}

used not only for

selection but also data decoding, (vi)1× (1, 2) and1× (1, 4)systems employing the AS algorithm proposed in Sec. IV.Now the predicted channel gains are used for AE selection,while the refined channel gain estimates

{


}

are used for decoding, and (vii)1 × (1, 2) and 1 × (1, 4)systems with perfect CSI and employing AS according to (22)(

with hk [m] replacinghSPk [m]

)

. Inspection of Figs. 3 and 4reveal that the1 × (1, 2) and 1 × (1, 4) systems employingthe proposed AS algorithm achieve SNR performance gains inexcess of3 dB and9 dB over the1×1 system with perfect CSIand no AS, respectively, at a PER equal to10−2. To highlightthe importance of channel estimation, the performance of thesame proposed1 × (1, 2) and1 × (1, 4) systems are about5dB and6 dB worse than1 × (1, 2) and 1 × (1, 4) systemsemploying AS with perfect CSI at the same PER of10−2,respectively. Also, error-floors exist at moderate to high SNRfor the1× (1, 2) and1× (1, 4) systems employing AS eitherwith DFT basis expansion or without channel prediction. Incontrast, no error-floors arise with Slepian basis expansion.

Fig. 5 shows the PER of the proposed receive AS algorithmfor a 1 × (1, 2) system withL = 3 AS training pilots ratherthanL = 2 as in Fig. 3. Comparison of Figs. 3 and 5 confirmsan SNR performance gain of about1 dB at a PER= 10−2

due to the addition of one AS training pilot.The analytical and simulation results for the sample mean

of the Slepian estimator and predictor for AEk denoted

by MSESEk,N

△= 1

N

M+N−1∑

m=M

MSESEk [m] and MSESP

k,N

△=

1N

M+N−1∑

m=M

MSESPk [m], respectively, are depicted in Fig. 6.

0 5 10 15 20 25 3010

−3

10−2

10−1

100

SNR (dB)

Pac

ket e

rror

rat

e (P

ER

)



0 5 10 15 20 25 3010

−4

10−3

10−2

10−1

100

SNR (dB)

Mea

n S

quar

e E

rror

(M

SE

)

MSES P1 , N for AE 1 (s im.)

MSES P1 , N for AE 1 (analys is)

MSES P2 , N for AE 2 (s im.)

MSES P2 , N for AE 2 (analys is)

MSES E

[ 1] , Nfor AE [1] ( s im.)

MSES E

[ 1] , Nfor AE [1] (analys is)

Predictor

Estimator

Fig. 6. Sample mean MSEN of the basis expansion predictor and estimatorfor a 1 × (1, 2) system. (Prediction/Estimation horizonN = 15, trainingpilots L = 2, post-selection pilotsL′ = 2, andTp = 5Ts).

The sample mean is plotted for a1 × (1, 2) system witha packet lengthN = 15, L = 2 training pilot symbols,L′ = 2 post-selection pilot symbols, andTp = 5Ts. Thatis, AS training symbols for AE1 and AE 2 are received attime indicesT 1

tr = {0, 10} and T 2tr = {5, 15}, respectively.

To evaluate the MSE per sampleMSESEk [m] andMSESP

k [m],given in Sec. V-A, we use Clarke’s spectrum:

Sh (ν) =

{ 1

πνmax

√

1−( ννmax)

2|ν| < νmax,

0 otherwise.(40)

It can be observed that: (i) there is a very good match betweenthe analytical and simulation results, (ii) the sample meanofthe estimator is less than the sample mean of the predictor,(iii) the sample meanMSESP

2,N of AE 2 is slightly less thanthe sample meanMSESP

1,N of AE 1. This is expected since theAS training pilots for AE2 are received closer in time to theprediction horizonIdt = {20, 21, . . . , 34} than the AS training


0 5 10 15 20 25 30 350

0.05

0.1

0.15

0.2

0.25

0.3

0.35

0.4

0.45

0.5

Discrete time m

Var

ianc

e

MSESP[m] (analysis)σ2

eSP[m] (sim.)

MSESE[m] (analysis)σ2

eSE[m] (sim.)

Predictor

Estimator

Fig. 7. Comparison of the simulated and calculated expressions for the basisexpansion error variance for a1× 1 system at an average SNRη = 20 dB.(Prediction/Estimation horizonN = 40, training pilotsL = 2, post-selectionpilots L′ = 2, andTp = 5Ts).

symbols for AE1, and (iv) there are upward transitions in theestimation and prediction MSE curves which occur in the2−4and 10 − 12 dB ranges, respectively, which are the result ofan increase of the subspace dimensionD in (15). In addition,they indicate thatD is suboptimal in these intervals.

Fig. 7 compares the simulated and analytically obtainedvariances of the estimation and prediction errors in Sec. V-A.It can be observed that: (i) these variances are close to eachother, and (ii) not surprisingly, the MSE per sample of thepredictedMSESP[m], in contrast to the MSE per sample of theestimatedMSESE [m], increases with the prediction horizon,which is consistent with the behavior of typical predictionalgorithms.

Fig. 8 shows the SEP of the 20-th 4PSK symbol as afunction of average SNR for1 × (1, 2) systems employingthe proposed receive AS algorithm and the symbol-by-symbolinstantaneous receive AS scheme, which is analyzed inThe-orem 1. It can be observed that the curves are close to eachother. Since the SEP behaviour might be slightly different forthe N = 40 different symbols of the data packet, we plotthe SEP for the first4PSK symbol in Fig. 9. A gap can beobserved between the curves at moderate to high SNRs sincechannel prediction for the first symbol is much better thanchannel prediction for the 20-th symbol, which clearly affectsthe selection decision and, thus, the SEP. Similarly, thereis aslight upward shift of the proposed AS scheme’s SEP curve inFig. 9, due to the fact that the first symbol is located far fromthe post-selection pilotsP = {11, 31}. We also observe fromFigs. 8 and 9 and from other simulations (not included) thatthe SEP of the first few symbols in a packet for a system whichuses symbol-by-symbol instantaneous receive AS is lower thanthat of the AS algorithm proposed in Sec. IV, while the SEPsof remaining symbols are close to one another.

VII. C ONCLUSIONS

The downlink of a cellular radio system consisting ofa single-antenna base station transmitting to aK-antenna

0 5 10 15 20 2510

−4

10−3

10−2

10−1

100

SNR (dB)

Sym

bol e

rror

pro

babi

lity

(SE

P)

1 × (1,2) symbol−by−symbol AS (sim.)1 × (1,2) symbol−by−symbol AS (Theorem 1)1 × (1,2) proposed AS algorithm (sim.)

Fig. 8. SEP for the20-th 4PSK data symbol as a function of the averageSNR for a1 × (1, 2) system. (Data packet lengthN = 40, training pilotsL = 2, post-selection pilotsL′ = 2, andTp = 5Ts).

0 5 10 15 20 2510

−5

10−4

10−3

10−2

10−1

100

SNR (dB)

Sym

bol e

rror

pro

babi

lity

(SE

P)

1 × (1,2) symbol−by−symbol AS (sim.)1 × (1,2) symbol−by−symbol AS (Theorem 1)1 × (1,2) proposed AS algorithm (sim.)

Fig. 9. SEP for the first4PSK data symbol as a function of the averageSNR for a1 × (1, 2) system. (Data packet lengthN = 40, training pilotsL = 2, post-selection pilotsL′ = 2, andTp = 5Ts).

mobile station is considered, where only one receive antennais selected. By explicitly accounting for practical constraintsimposed by next-generation wireless standards such as trainingand packet reception for antenna selection (AS), a singlereceive AS method is proposed for time-varying channelsusing the low-complexity Slepian basis expansion channelpredictor and estimator. Closed-form expressions are derivedfor the channel prediction and estimation error as well as theSEP ofMPSK with receive AS. It is shown that, in spite of theaforementioned realistic limitations, the proposed AS schemeoutperforms ideal conventional SISO systems with perfectchannel knowledge and no AS at the receiver and conventionalcomplex basis based estimation. Although the focus was onsingle carrier communication over time-varying frequency-flat channels, the proposed AS scheme may be extendible toOFDM systems. The extension to the case where subsets ofmore than one receive antenna are selected in time-varying


frequency-selective channels remains as an important topic forfuture research.

APPENDIX

A. Derivation of the Conditional Mean and Variance

If A and B are zero-mean jointly complex Gaussian,then [20], [21]

E

{

A∣

∣B}

= E {AB∗} (E {BB∗})−1B (41)

var{

A∣

∣B}

= var {A} − E {AB∗} (E {BB∗})−1E {BA∗} .

(42)From (41), it follows that E

{

eSEι [m] | hSE

ι [m]}

=

σ2

eSEι

[m]

1+σ2

eSEι

[m]hSEι [m] and E

{

nι [m] | hSEι [m]

}

= 0.

Substituting and simplifying yields the desiredconditional mean result in (33). Similarly, from (42)

we get that var{

eSEι [m] | hSE

ι [m]}

=σ2

eSEι

[m]

1+σ2

eSEι

[m]and

var{

nι [m] | hSEι [m]

}

= N0. Substituting and simplifyingyields the conditional variance result in (34).

B. Proof of Theorem 1

From (32), the ML soft estimate for the symbol receivedby AE ιm at timem can be modified to

rιm [m] =∣

∣

∣hSEιm

[m]∣

∣

∣

2

d [m]−(

hSEιm

[m])∗

d [m] eSEιm

[m]

+(

hSEιm

[m])∗

nιm [m] . (43)

Conditioned onhSEιm

[m] and d [m], rιm [m] in (43) is acomplex Gaussian RV whose conditional meanµrιm

[m] andvarianceσ2

rιm[m] are given by

µrιm[m] =

∣

∣

∣hSEιm

[m]∣

∣

∣

2

d [m] ζSEιm

[m] (44)

σ2rιm

[m] =∣

∣

∣hSEιm

[m]∣

∣

∣

2

|d [m]|2(

1− ζSEιm

[m])

+N0

∣

∣

∣hSEιm

[m]∣

∣

∣

2

(45)

whereζSEιm

[m]△= 1

1+σ2

eSEιm

[m]= 1

1+MSESEιm

.

Conditioned on{

hSPk [m]

}K

k=1, ιm, and hSE

ιm[m],

the SEP of an MPSK symbol received at timem

SEP′m

(

{

hSPk [m]

}K

k=1, ιm, h

SEιm

[m]

)

, which is denoted

by SEP′m (κ), is [20]

SEP′m (κ) =1

π

∫M−1

M π

0

exp

(

−∣

∣µrιm[m]∣

∣

2sin2

(

πM

)

σ2rιm

[m] sin2 (θ)

)

dθ

=1

π

∫M−1

M π

0

exp

−∣

∣

∣hSEιm

[m]∣

∣

∣

2

bSEιm

[m]

sin2 (θ)

dθ

(46)

where bSEk [m]

△=

(ζSEk [m])2 sin2( π

M )(1−ζSE

k[m])+ 1

η

, and the last equality

follows from substituting (44) and (45). Note that the SEP

expression above depends only onιm andhSEιm

[m]. Therefore,

we shall denote it by SEP′m(

ιm, hSEιm

[m])

henceforth.Now averaging over the index ιm to get

SEP′m

(

{

hSPk [m]

}K

k=1,{

hSEk [m]

}K

k=1

)

, denoted for brevity

by SEP′m (Ξ), yields

SEP′m (Ξ) =

K∑

k=1

Pr

(

ιm = k∣

∣

{

hSPk [m]

}K

k=1

)

×SEP′m(

ιm = k, hSEιm

[m])

=1

π

K∑

k=1

K∏

l=1l 6=k

Pr

(

∣

∣

∣hSPl [m]

∣

∣

∣

2

<∣

∣

∣hSPk [m]

∣

∣

∣

2

∣

∣

∣

∣

∣

{

hSPk [m]

}K

k=1

))

×∫

M−1

M π

0

exp

−∣

∣

∣hSEk [m]

∣

∣

∣

2

bSEk [m]

sin2 (θ)

dθ.

(47)

The expression for the SEP, when averaging over fading(i.e., Ξ), becomes

SEP′m (η) =1

π

K∑

k=1

∫M−1

M π

0

∫ ∞

0

∫ ∞

0

exp

(−x bSEk [m]

sin2 (θ)

)

×fXk,Yk(x, y)

K∏

l=1l 6=k

FYl(y) dxdydθ (48)

where fXk, Yk(x, y) is the joint PDF of the two correlated

exponentially distributed RVsXk△=∣

∣

∣hSEk [m]

∣

∣

∣

2

= Xk,c1 [m]+

jXk,s1 [m] and Yk△=∣

∣

∣hSPk [m]

∣

∣

∣

2

= Xk,c2 [m] + jXk,s2 [m]

given by [27]

fXk,Yk(x, y) =

1

4 σ2k,c1

[m] σ2k,c2

[m]

× 1(

1−[

ρ2k,c1c2 [m] + ρ2k,c1s2 [m]])

× exp

([

x

σ2k,c1

[m]+

y

σ2k,c2

[m]

]

× −1

2(

1−[

ρ2k,c1c2 [m] + ρ2k,c1s2 [m]])

×I0

√

ρ2k,c1c2 [m] + ρ2k,c1s2 [m](

1−[

ρ2k,c1c2 [m] + ρ2k,c1s2 [m]])

×√xy


)

(49)

where x, y ≥ 0, I0 (·) is the zeroth-order modifiedBessel function of the first kind, (Xk,c1 [m], Xk,s2 [m])and (Xk,c2 [m] , Xk,s2 [m]) are i.i.d. zero-mean Gaus-sian RVs with variancesσ2

k,c1[m] = σ2

k,s1[m] and


σ2k,c2

[m] = σ2k,s2

[m], respectively.ρk,c1c2 [m] andρk,c1s2 [m]are the correlation coefficients of(Xk,c1 [m] , Xk,c2 [m]) and(Xk,c1 [m] , Xk,s2 [m]), respectively, and lie in(−1, 1).

In (48),FYl(y) is the CDF of the exponentially distributed

RV Yl△=∣

∣

∣hSPl [m]

∣

∣

∣

2

, and is given by

FYl(y) =

{

1− exp(

−ζSPl [m] y

)

, y ≥ 00, y < 0

(50)

where the rate parameter isζSPl [m]

△= 1

1+σ2

eSPl

[m]=

11+MSESP

l[m]

.Substituting (50) and (49) into (48) yields

SEP′m (η) =1

π

K∑

k=1

∫M−1

M π

0

∫ ∞

0

∫ ∞

0

exp

(−x bSEk [m]

sin2 (θ)

)

×fXk,Yk(x, y)

×K∏

l=1l 6=k

(

1− exp(

−ζSPl [m] y

))

dxdy dθ

=1

π

K∑

k=1

K−1∑

r=0

K∑

l0,...,lr=1l0=1, l1 6=...6= lr 6=k

(−1)r

r!(

4σ2k,c1

[m])

× 1

σ2k,c2

[m](

1−[

ρ2k,c1c2 [m] + ρ2k,c1s2 [m]])

∫M−1

M π

0

∫ ∞

0

∫ ∞

0

exp

(−x bSEk [m]

sin2 (θ)

−yr∑

j=1

ζSPlj

[m]−[

x

σ2k,c1

[m]+

y

σ2k,c2

[m]

]

× 1

2(

1−[

ρ2k,c1c2 [m] + ρ2k,c1s2 [m]])

×I0

√

ρ2k,c1c2 [m] + ρ2k,c1s2 [m](

1−[

ρ2k,c1c2 [m] + ρ2k,c1s2 [m]])

×√xy


)

dxdy dθ (51)

where the identity∏K

l=1l 6=k

(

1− exp(

−ζSPl [m] y

))

=

K−1∑

r=0

(−1)r

r!

K∑

l0,...,lr=1l0=1, l1 6=...6= lr 6=k

exp

(

−yr∑

j=1

ζSPlj

[m]

)

is used in

the last equality [20].

REFERENCES

[1] “Draft amendment to wireless LAN media access control (MAC) andphysical layer (PHY) specifications: enhancements for higher through-put,” Tech. Rep. P802.11n/D0.04, IEEE, Mar. 2006.

[2] “Technical specification group radio access network; evolved universalterrestrial radio access (E-UTRA); physical layer procedures (release8),” Tech. Rep. 36.211 (v8.3.0), 3rd Generation Partnership Project(3GPP), 2008.

[3] N. B. Mehta, A. F. Molisch, J. Zhang, and E. Bala, “Antennaselectiontraining in MIMO-OFDM/OFDMA cellular systems,” inProc. 2007IEEE CAMSAP.

[4] A. F. Molisch and M. Z. Win, “MIMO systems with antenna selection,”IEEE Microw. Mag., vol. 5, pp. 46–56, Mar. 2004.

[5] S. Sanayei and A. Nosratinia, “Antenna selection in MIMOsystems,”IEEE Commun. Mag., vol. 42, pp. 68–73, Oct. 2004.

[6] D. A. Gore and A. Paulraj, “MIMO antenna subset selectionwith space-time coding,”IEEE Trans. Signal Process., vol. 50, pp. 2580–2588, Oct.2002.

[7] H. Mehrpouyan, S. D. Blostein, and E. C. Y. Tam, “Random antennaselection & antenna swapping combined with OSTBCs,” inProc. 2007IEEE ISSSE.

[8] M. Z. Win and J. H. Winters, “Virtual branch analysis of symbol errorprobability for hybrid selection/maximal-ratio combining in Rayleighfading,” IEEE Trans. Commun., vol. 49, pp. 1926–1934, Nov. 2001.

[9] A. Ghrayeb and T. M. Duman, “Performance analysis of MIMOsystemswith antenna selection over quasi-static fading channels,” IEEE Trans.Veh. Technol., vol. 52, pp. 281–288, Mar. 2003.

[10] A. F. Molisch, M. Z. Win, Y.-S. Choi, and J. H. Winters, “Capacity ofMIMO systems with antenna selection,”IEEE Trans. Wireless Commun.,vol. 4, pp. 1759–1772, July 2005.

[11] Z. Chen, J. Yuan, and B. Vucetic, “Analysis of transmit antennaselection/maximal-ratio combining in Rayleigh fading channels,” IEEETrans. Veh. Technol., vol. 54, pp. 1312–1321, July 2005.

[12] Z. Xu, S. Sfar, and R. S. Blum, “Analysis of MIMO systems with receiveantenna selection in spatially correlated Rayleigh fadingchannels,”IEEETrans. Veh. Technol., vol. 58, pp. 251–262, Jan. 2009.

[13] Y. Jiang and M. K. Varanasi, “The RF-chain limited MIMO system–part I: optimum diversity-multiplexing tradeoff,”IEEE Trans. WirelessCommun., vol. 8, pp. 5238–5247, Oct. 2009.

[14] H. Zhang, A. F. Molisch, and J. Zhang, “Applying antennaselection inWLANs for achieving broadband multimedia communications,” IEEETrans. Broadcast., vol. 52, pp. 475–482, Dec. 2006.

[15] W. Xie, S. Liu, D. Yoon, and J.-W. Chong, “Impacts of Gaussian errorand Doppler spread on the performance of MIMO systems with antennaselection,” inProc. 2006 WiCOM.

[16] S. Han and C. Yang, “Performance analysis of MRT and transmitantenna selection with feedback delay and channel estimation error,”in Proc. 2007 IEEE WCNC, pp. 1135–1139.

[17] W. M. Gifford, M. Z. Win, and M. Chiani, “Antenna subset diversitywith non-ideal channel estimation,”IEEE Trans. Wireless Commun.,vol. 7, pp. 1527–1539, May 2008.

[18] A. B. Narasimhamurthy and C. Tepedelenlioglu, “Antenna selection forMIMO-OFDM systems with channel estimation error,”IEEE Trans. Veh.Technol., vol. 58, pp. 2269–2278, June 2009.

[19] T. R. Ramya and S. Bhashyam, “Using delayed feedback forantennaselection in MIMO systems,”IEEE Trans. Wireless Commun., vol. 8,pp. 6059–6067, Dec. 2009.

[20] V. Kristem, N. B. Mehta, and A. F. Molisch, “Optimal receive antennaselection in time-varying fading channels with practical training con-straints,” IEEE Trans. Commun., vol. 58, pp. 2023–2034, July 2010.

[21] ——, “Training and voids in receive antenna subset selection in time-varying channels,”IEEE Trans. Wireless Commun., vol. 10, pp. 1992–2003, June 2011.

[22] T. Zemen, C. F. Mecklenbrauker, F. Kaltenberger, and B. H. Fleury,“Minimum-energy band-limited predictor with dynamic subspace selec-tion for time-variant flat-fading channels,”IEEE Trans. Signal Process.,vol. 55, pp. 4534–4548, Sep. 2007.

[23] T. Zemen and C. F. Mecklenbrauker, “Time-variant channel estimationusing discrete prolate spheroidal sequences,”IEEE Trans. Signal Pro-cess., vol. 53, pp. 3597–3607, Sep. 2005.

[24] M.-S. Alouini and A. Goldsmith, “A unified approach for calculatingerror rates of linearly modulated signals over generalizedfading chan-nels,” IEEE Trans. Commun., vol. 47, pp. 1324–1334, Sep. 1999.

[25] G. S. Fishman,Monte Carlo: Concepts, Algorithms, and Applications,1st edition. Springer, 1996.

[26] R. H. Clarke, “A statistical theory of mobile-radio reception,” Bell Syst.Tech. J., vol. 47, pp. 957–1000, July-Aug. 1968.

[27] R. K. Mallik, “On multivariate Rayleigh and exponential distributions,”IEEE Trans. Inf. Theory, vol. 49, pp. 1499–1515, June 2003.

Hassan A. Abou Salehis currently pursuing hisdoctoral studies in electrical engineering at the Infor-mation Processing& Communications Laboratory(IPCL) at Queen’s University, Kingston, Canada.He has been awarded a Natural Sciences and En-gineering Research Council of Canada (NSERC)Postgraduate Scholarship (2009–2012). His areas ofconcentration are in wireless cutting-edge technolo-gies and multiple antenna systems.


Andreas F. Molisch (S’89-M’95-SM’00-F’05) re-ceived the Dipl. Ing., Ph.D., and habilitation degreesfrom the Technical University of Vienna, Vienna,Austria, in 1990, 1994, and 1999, respectively. Hesubsequently was with AT&T (Bell) LaboratoriesResearch (USA); Lund University, Lund, Sweden,and Mitsubishi Electric Research Labs (USA). Heis now a Professor of electrical engineering withthe University of Southern California, Los Ange-les.

His current research interests are the measurementand modeling of mobile radio channels, ultra-wideband communicationsand localization, cooperative communications, multiple-input multiple-outputsystems, and wireless systems for healthcare. He has authored, coauthored,or edited four books (among them the textbookWireless Communications,Wiley-IEEE Press), 14 book chapters, some 140 journal papers, and numerousconference contributions, as well as more than 70 patents and 60 standardscontributions.

Dr. Molisch has been an Editor of a number of journals and specialissues, General Chair, Technical Program Committee Chair,or SymposiumChair of multiple international conferences, as well as Chairman of variousinternational standardization groups. He is a Fellow of theIET, an IEEEDistinguished Lecturer, and a member of the Austrian Academy of Sciences.He has received numerous awards, most recently the 2011 James Evans Avant-Garde award of the IEEE Vehicular Technology Society, the Donald Fink Prizeof the IEEE, and the Eric Sumner Award of the IEEE.

Thomas Zemen (S’03-M’05-SM’10) was born inMdling, Austria. He received the Dipl.-Ing. degree(with distinction) in electrical engineering from Vi-enna University of Technology in 1998 and the doc-toral degree (with distinction) in 2004. From 1998to 2003 he worked as hardware engineer and projectmanager for the radio communication devices de-partment at Siemens Austria. Since October 2003Thomas Zemen has been with FTW Forschungszen-trum Telekommunikation Wien, he leads the de-partment “Signal and Information Processing” since

2008. He is the speaker of the national research network for “Signal andInformation Processing in Science and Engineering” fundedby the Aus-trian Science Fund (FWF). His research interests include vehicular channelmeasurements and modelling, time-variant channel estimation, orthogonalfrequency division multiplexing (OFDM), iterative multiple-input multiple-output (MIMO) receiver structures, cooperative communication systems andinterference management. Dr. Zemen teaches as external lecturer at ViennaUniversity of Technology and serves as editor for the IEEE TRANSACTIONSON WIRELESSCOMMUNICATIONS. He is the author or co-author of threebooks chapters and more than 80 journal papers and conference communica-tions.

Steven D. Blostein (SM’83, M’88, SM’96) re-ceived his B.S. degree in Electrical Engineeringfrom Cornell University, Ithaca, NY, in 1983, and theM.S. and Ph.D. degrees in Electrical and ComputerEngineering from the University of Illinois, Urbana-Champaign, in 1985 and 1988, respectively. He hasbeen on the faculty in the Department of Electricaland Computer Engineering Queen’s University since1988 and currently holds the position of Professor.From 2004-2009 he was Department Head. He hasalso been a consultant to industry and government

in the areas of image compression, target tracking, radar imaging and wirelesscommunications. He spent sabbatical leaves at Lockheed Martin ElectronicSystems, McGill University and at Communications ResearchCentre inOttawa. His current interests lie in the application of signal processing toproblems in wireless communications systems, including synchronization,cooperative and network MIMO, and cross-layer optimization for multimediatransmission. He has been a member of the Samsung 4G WirelessForum aswell as an invited distinguished speaker. He served as Chairof IEEE KingstonSection (1994), Chair of the Biennial Symposium on Communications(2000,2006,2008), Associate Editor for IEEE TRANSACTIONS ON IMAGEPROCESSING(1996-2000), and Publications Chair for IEEE ICASSP 2004,and an Editor of IEEE TRANSACTIONS ONWIRELESSCOMMUNICATIONS(2007-present). He has also served on Technical Program Committees forIEEE Communications Society conferences for many years. Heis a registeredProfessional Engineer in Ontario and a Senior Member of IEEE.

Neelesh B. Mehta (S’98-M’01-SM’06) receivedhis Bachelor of Technology degree in electronicsand communications engineering from the IndianInstitute of Technology (IIT), Madras in 1996, andhis M.S. and Ph.D. degrees in electrical engineer-ing from the California Institute of Technology,Pasadena, CA, USA in 1997 and 2001, respectively.He is now an Associate Professor in the Dept. ofElectrical Communication Eng., Indian Institute ofScience (IISc), Bangalore, India. Prior to joiningIISc in 2007, he was a research scientist from in

the Wireless Systems Research Group in AT&T Laboratories, Middletown,NJ, USA from 2001 to 2002, Broadcom Corp., Matawan, NJ, USA from 2002to 2003, and Mitsubishi Electric Research Laboratories (MERL), Cambridge,MA, USA from 2003 to 2007.

His research includes work on link adaptation, multiple access protocols,WCDMA downlinks, cellular systems, MIMO and antenna selection, energyharvesting networks, and cooperative communications. He was also activelyinvolved in the Radio Access Network (RAN1) standardization activities in3GPP from 2003 to 2007. He has served on several TPCs. He was a TPC co-chair for the WISARD 2010 and 2011 workshops and tracks in NCC2011,SPCOM 2010, VTC 2009 (Fall), and Chinacom 2008. He will serveas aTPC co-chair of the Wireless Communications Symposium of ICC 2013. Hehas co-authored 30 IEEE journal papers, 55 conference papers, and 3 bookchapters, and is a co-inventor in 16 issued US patents. He wasan Editor ofthe IEEE TRANSACTIONS ONWIRELESSCOMMUNICATIONS from 2008 to2011. He is now an Editor of IEEE WIRELESSCOMMUNICATIONS LETTERS.He is currently serving as Director of Conference Publications in the Boardof Governors of the IEEE Communications Society. He is also an executivecommittee member of the IEEE Bangalore Section and the Bangalore Chapterof the IEEE Signal Processing Society.

Documents

IEEE TRANSACTIONS ON WIRELESS …thomaszemen.org/papers/Saleh12-IEEETrWirelessCom-paper.pdfIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, ACCEPTED FOR PUBLICATION 1 Receive Antenna