approximating the probability distribution

6
2005 International Conference on Wireless Networks, Communications and Mobile Computing Approximating the Probability Distribution of OFDM Symbol Errors Alan Clark, Peter Smith & Desmond Taylor Department of Electrical and Computer Engineering University of Canterbury Christchurch, New Zealand Email: [email protected] Abstract- Given an N subearrier orthogonal frequency di- vision multiplexing (OFDM) system transmitting over a slow fading Rayleigh channel, the distribution of b, the number of received symbol errors, is Poisson binomial. Hence, (Nj) terms are required to calculate each probability for b = 0, 1, .. . , N. When N is large, as in most OFDM systems, the Poisson binomial distribution is often approximated by the Poisson distribution. We show that, for large N, the total variation distance between the approximation and the true distribution is lower and upper bounded by random variables with fully known probability density functions. The bounds on the total variation distance indicate that the distribution of OFDM symbol errors is well approximated by a Poisson distribution. I. INTRODUCTION Given an orthogonal frequency division multiplexingr (OFDM) system transmitting N subcarriers over a Rayleigh fading channel, a block of N subcarrier symbols is sent simultaneously. The probability of b E {0, 1 ... , N} of the N symbols being incorrectly estimated at the receiver is of interest. Knowledge of the probability distribution of the number of errors affords better error correction code design and analysis, since any code of minimum distance dmin corrects b < 2 errors. This knowledge is applicable in adapting OFDM to achieve a desired error rate [1]. For a slowly fading Rayleigh channel we show that the probability of b OFDM symbol errors is well approximated by the Poisson distribution. Since each subchannel has a different time varying gain, the probability of error for each OFDM symbol is time varying. Thus, for fixed time t, the distribution of the number of errors is equivalent to the dis- tribution of the sum B of a number of independent Bernoulli random variables, X1, X2, ... , XN, with respective success probabilities P1, P2,.. . , PN, known commonly as the Poisson binomial distribution. The Poisson binomial distribution is well approximated by the Poisson distribution, with a known upper bound [2] on the total variation distance. The total variation distance upper bound is a random variable, for which we derive an asymptotic probability density function (pdf) for a large number of subcarriers N. Knowledge of this pdf allows us to construct confidence intervals on the accuracy of the approximation. In the next section we introduce necessary notation, as- sumptions and preliminary results concerning OFDM systems, multipath channels and error rates. Section III outlines the derivation of the pdf of the upper bound on the total variation distance. Section IV shows simulated probability distributions for an OFDM system, as well as the distribution of the upper bound on total variation distance from the Poisson approximation. Finally, Section V provides some conclusions. II. PRELIMINARIES A. OFDM System Notation We assume readers are familiar with OFDM systems [3], and merely summarise notation. During the nth discrete time interval an N subcarrier OFDM system transmits data symbol S,,k on the kth subcarrier. We refer to the superposition of N subcarrier symbols as the nth OFDM block. We assume here that Sn,k C {- KTj, \/Eo}, that is a binary phase shift keying (BPSK) symbol with energy Eo. We assume perfect receiver synchronisation in time and frequency, ideal channel state information, and sufficient guard interval for inter block interference to be negligible. Then, during the nth time interval the received signal can be written Rnk - Hn,kSn,k + Nn,k, (1) for the kth subcarrier, where Nn,k is a zero mean complex Gaussian random variable with variance N" per dimension, and H0,k is the kth complex subchannel gain for time interval n. The receiver then estimates the transmitted symbol as the closest point to Rnnk - R = Sn-k+ H k . The instantaneous SNR for the kth subcarrier, in the nt time interval is denoted '_yn, - Hn, k 12 Et, B. Multipath Channel Notation We denote the time-varying channel frequency response over the entire OFDM bandwidth as H(t, f), and make the usual wide sense stationary and uncorrelated scattering assumptions [4]. Furthermore, we assume a constant, time independent channel ensemble mean of zero, and an expo- nential delay power profile with mean delay TD. We denote the expectation of some function Xk = g(H(t, fk)) at fixed frequency fk as Xk = E [g(H(t, fk))]. 0-7803-9305-8/05/$20.00 ©2005 IEEE 1412 Authorized licensed use limited to: University of Canterbury. Downloaded on November 17, 2008 at 17:21 from IEEE Xplore. Restrictions apply.

Upload: others

Post on 20-Mar-2022

8 views

Category:

Documents


0 download

TRANSCRIPT

2005 International Conference on Wireless Networks, Communications and Mobile Computing

Approximating the Probability Distribution of

OFDM Symbol Errors

Alan Clark, Peter Smith & Desmond Taylor

Department of Electrical and Computer EngineeringUniversity of Canterbury

Christchurch, New ZealandEmail: [email protected]

Abstract- Given an N subearrier orthogonal frequency di-vision multiplexing (OFDM) system transmitting over a slowfading Rayleigh channel, the distribution of b, the number ofreceived symbol errors, is Poisson binomial. Hence, (Nj) terms arerequired to calculate each probability for b = 0, 1, . . . , N. WhenN is large, as in most OFDM systems, the Poisson binomialdistribution is often approximated by the Poisson distribution.We show that, for large N, the total variation distance betweenthe approximation and the true distribution is lower and upperbounded by random variables with fully known probabilitydensity functions. The bounds on the total variation distanceindicate that the distribution of OFDM symbol errors is wellapproximated by a Poisson distribution.

I. INTRODUCTION

Given an orthogonal frequency division multiplexingr(OFDM) system transmitting N subcarriers over a Rayleighfading channel, a block of N subcarrier symbols is sentsimultaneously. The probability of b E {0, 1 ... , N} of theN symbols being incorrectly estimated at the receiver isof interest. Knowledge of the probability distribution of thenumber of errors affords better error correction code designand analysis, since any code of minimum distance dmincorrects b < 2 errors. This knowledge is applicable inadapting OFDM to achieve a desired error rate [1].

For a slowly fading Rayleigh channel we show that theprobability of b OFDM symbol errors is well approximatedby the Poisson distribution. Since each subchannel has adifferent time varying gain, the probability of error for eachOFDM symbol is time varying. Thus, for fixed time t, thedistribution of the number of errors is equivalent to the dis-tribution of the sum B of a number of independent Bernoullirandom variables, X1,X2, ... , XN, with respective successprobabilities P1, P2,.. . ,PN, known commonly as the Poissonbinomial distribution. The Poisson binomial distribution iswell approximated by the Poisson distribution, with a knownupper bound [2] on the total variation distance. The totalvariation distance upper bound is a random variable, for whichwe derive an asymptotic probability density function (pdf) fora large number of subcarriers N. Knowledge of this pdf allowsus to construct confidence intervals on the accuracy of theapproximation.

In the next section we introduce necessary notation, as-sumptions and preliminary results concerning OFDM systems,multipath channels and error rates. Section III outlines thederivation of the pdf of the upper bound on the total variationdistance. Section IV shows simulated probability distributionsfor an OFDM system, as well as the distribution of theupper bound on total variation distance from the Poissonapproximation. Finally, Section V provides some conclusions.

II. PRELIMINARIESA. OFDM System NotationWe assume readers are familiar with OFDM systems [3],

and merely summarise notation. During the nth discrete timeinterval an N subcarrier OFDM system transmits data symbolS,,k on the kth subcarrier. We refer to the superposition ofN subcarrier symbols as the nth OFDM block. We assumehere that Sn,k C {- KTj, \/Eo}, that is a binary phase shiftkeying (BPSK) symbol with energy Eo.We assume perfect receiver synchronisation in time and

frequency, ideal channel state information, and sufficient guardinterval for inter block interference to be negligible. Then,during the nth time interval the received signal can be written

Rnk - Hn,kSn,k + Nn,k, (1)for the kth subcarrier, where Nn,k is a zero mean complexGaussian random variable with variance N" per dimension,and H0,k is the kth complex subchannel gain for time intervaln. The receiver then estimates the transmitted symbol as theclosest point to Rnnk- R =Sn-k+ H k

. The instantaneousSNR for the kth subcarrier, in the nt time interval is denoted'_yn, - Hn, k 12 Et,B. Multipath Channel NotationWe denote the time-varying channel frequency response

over the entire OFDM bandwidth as H(t, f), and makethe usual wide sense stationary and uncorrelated scatteringassumptions [4]. Furthermore, we assume a constant, timeindependent channel ensemble mean of zero, and an expo-nential delay power profile with mean delay TD. We denotethe expectation of some function Xk = g(H(t, fk)) at fixedfrequency fk as Xk = E [g(H(t, fk))].

0-7803-9305-8/05/$20.00 ©2005 IEEE 1412

Authorized licensed use limited to: University of Canterbury. Downloaded on November 17, 2008 at 17:21 from IEEE Xplore. Restrictions apply.

The OFDM subchannel gains are the channel response atfrequencies {fk = fc + (k NN) Af}, for k = 1, 2, ... I N,where Af is the OFDM subcarrier separation and fc is thecarrier frequency. The OFDM block then has period T =N . Assuming a slowly fading channel, the gain on the kthsubchannel during the ntli time interval nT < t < (n +1)T isapproximately constant, and denoted H k. Furthermore, wemay write [4]

(1) (9)~ H 1) (2Hnjkj Y kY1,k1 =Ynk1+,k n2 = Yk, +± n(,2 (2)

where Y(1kl) Yn2ki yn(,k, and y(,)k, are identically dis-tributed, zero mean Gaussian random variables. These havethe correlation properties

E[(Yl,1 ) ]2 ' 1[ (2, ),E [yk)1 E y

E [Y Yn;>,k] -E[Yi2 . Yn,k],1 Jo(27rfdnrl - nl2) (3)2 1 + (2WrAfAkTD)2'

E [(2

k Ys)k E ynl),k 2s )]-(2W,AfAk TD)E [Y<kl.Yn ]

where Ak -Ik2 -k, fd is Doppler frequency and Jo(.) isthe zero order Bessel function of the first kind. We observefrom (3) that the marginal distribution of each channel gainenvelope IHn,kl follows a Rayleigh distribution. Finally, wedenote the arithmetic mean over all subchannels of somefunction Xn = g(H(nT, f)), at time interval n, as Xn,av =

iNEk1 g(Hf(nT, fk)).C. OFDM Symbol Error RatesThe probability Pn,k of the kth subcarrier symbol received

during the nth time interval being incorrectly estimated, andthe squared probability of error may be written as

Pn .. Q2 ( 2Eo1 [Y ] 2+± [Y ]2) q (1) v(2 )

(4)where Q(.) is the well known Gaussian Q-function. TheHermite ranks [5] (p) and (q) of p (y(1) ) and

q (Yn,k y(2)k) respectively, are greater than or equal to two(Appendix I).

For time interval n, we denote the arithmetic mean prob-ability of symbol error across all N subcarriers as PnaV =H emk=i Pnrk, and the mean squared probability of error as

av +iNevlP2n For any subcarrier k we denote theexpected probability of error as

Pk = E [Pn,k] j Q (V n,) fyY(_n,k) d'Yn,k, (5)

where f(Qy,k) is the pdf of the instantaneous SNR, Yn,k. Fora Rayleigh distributed channel envelope, it is well known [6]that -Yn,k follows an exponential probability density function,f- jx) - Tk exp () Assuming that all subchannel gainshave equal time averaged subcarrier SNR Tk- = To E', itmay be shown [6] that

1Pk, = PO = -2 l- (6)

III. ACCURACY OF POISSON APPROXIMATION

A. Distribution of Subcarrier Average Error Rate

We apply the following theorem from [5] to show that theaverage subcarrier error rate Pn,av and average squared errorrate p2av are asymptotically Gaussian distributed in time.

Theorem 1 (Arcones) Let {X-I}'1 be a stationary mean-zero Gaussian sequence of vectors in Rd. Set Xi(X(l),...,X4d)). Let f be a function on Rd with Hermiterank, [5], p such that 1 < (o < oc. Define

r(Pq)(k) = E[X(P)Xjqk], (7)

for k E Z, where m is any number large enough that m > 1and m + k > 1. Suppose that

00

, |r( q)(k) < oc,k=-oo

(8)

for all 1 < p < d and 1 < q < d. Then

(9)jn

; ,(f(Xj) -E[f(X )]) d ()f

where ' d ), denotes, 'convergence in distribution', and

CJ = E[(f (XI) - E[f(Xi)])2]

+ 2 Z E [(f(X1) - E[f(X1)]) (f(Xl+k) - E[f(Xl+k)])J

(10)

We show that the theorem applies to an OFDM system witha large number of subcarriers, transmitting over Rayleigh fad-ing channels, since the subchannel gain at time n is a Gaussianrandom variable in R2, (2). Furthermore, the subcarrier errorprobability Pn,k and the subcarrier squared error probabilityp 2 are defined as functions of JR2 valued Gaussian randomn,kvariables, as seen in (4). It is then shown that the distribution ofboth the average subcarrier error Pn,av and squared subcarriererror pn ,av approach Gaussian distributions.At time interval n consider two OFDM subchannel gains

Hn,kl=-2Yn +±yn and Hn,k, = Y( +±y4 withproperties given in (3). Letting kl, k2 c {1, 2,... , N} and

1413

I k 11 2'... 1 N.

Authorized licensed use limited to: University of Canterbury. Downloaded on November 17, 2008 at 17:21 from IEEE Xplore. Restrictions apply.

Ak = lk2- ki we may write

L0kO-00 |E y87(1)y1)1Ak=-oo

0 += O (2FAfAkTD)2 I'I ClD I v ( +

which is finite since (p) 2, as shown in Appendix I.

Furthermore, the summation

: nk[Y,kl Yn,k]Ak=-oo

E y1) (12)Ak=-oo

1 27rAfAkTD2 (P)k_k=-oo.Ak#O 1 + (2IrAfAkTrD)2

is also convergent, since o(p) > 2. Thus requirement (8) ofTheorem 1 is satisfied, and the distribution of mean subcarrier

error rates P,,,0, approaches a Gaussian distribution, so that

(2) (2)

Ar Y71n,k n,k)nk P Yn,kI Yn,k} (13)

d) Kr(O, Nvar (Pn,av)).

Therefore, for large N we may state

d~~~~Pna `, A( (PO, ?var (Pnl,av)) , ( 14)

where '-' denotes approximated in distribution, and in (13)and (14)

Nvar (Pn,av)

-E ((y(1) K(2))-E p(2[1)(1((2)2]]CXD

+ 2 1: Et( (Y,1) (2n,1) E [P(Y71 (2nl1) )(1)k=2L '/(15)

( Yn,kl Yk)-E [P ,( 7T Yn,k)

-P - o ]+[2E{E[Pn lPnk] [ 2}.k-2

The quantities 4, and E[Pn7l, Pn,k] are calculableusing the results of Appendix II.

Since p(q) > 2 (Appendix I), similar evaluations of cross

correlations sums to (11) and (12) hold for the squaredsubcarrier error rate, and we may use Theorem 1 to show

that the average subcarrier squared error rate also approachesa Gaussian distribution. That is,

NV

p'2f(1) (2)_\ irF2(1) (2) ]

/NEL{P Y(k' Ynk} -E L ,kY, Ynk)] (16)k N r' (0, Nvar (Pn,.,)) -

Therefore, for large N we may state9rd K 2

".2,a (n) d o:vr(Pna)rwhere in (16) and (17)

Nvar (Pn,,av)- [( 2 (yt) 7

2) )- P (' 1) (2t) 2]='E kYn,1 YU,1) -1 Yn, 1,Yn,) ,I

(p2 E (i 2 E2(1 )(2)E 2 ]) 1

'~~~~n(I(nn,nt I[P(n Yn,11) |

k=2 ~

_2 0 25

_0_ + 2 : tE [Pnjl -Pt]k n

The quantities PO' and 1E [ l nPk] are readily calculable,as outlined in Appendix II.

B. Accuracy ofApproximations to Poisson Binomial

Our concern is the approximation of the distribution of the

number of errors in an OFDM system with a large numberof subcarriers, say N > 128, transmitting over a Rayleighfading channel. Such systems have already been proposedand commissioned, [71. For a given OFDM block n theprobability of there being b symbol errors follows a Poissonbinomial distribution, with density function denoted 4n(b),and probabilities P,1, Pn,2, .. . , Pn,N defined by (4).

Calculation of the Poisson binomial distribution requiresthe summation of (N) terms, for b = 0, ... N. Thishas motivated work on approximating the Poisson binomialdistribution with the Poisson distribution [2], [8]-[l1]. Thetotal variation distance between an approximating distribution,Fn(b), and the Poisson binomial distribution, is defined [2] as

00

d{ Ln(b), F(b)} = EZI2n(a) -Fn(a) | (19)a=O

For the nth block, we use the Poisson distribution P>, (b)as an approximation, where An = NP71 ,av

= EN Pn7,k Itis proven in [2] that this approximation has total variationdistance bounded by

N

d{4Ln(b),-PA (b)} > 3min {+ 1}Z P

drz N (20)d{4Ln(b),'PA\.(b)}I IkN

k= 1

1414

(17)

Authorized licensed use limited to: University of Canterbury. Downloaded on November 17, 2008 at 17:21 from IEEE Xplore. Restrictions apply.

For each block we approximate the probability of therebeing b errors with a Poisson distribution. We then considerthe limit, as N -) oc, of the total variation distance bounds.It is readily shown from (20) that

lin d{I2n(b),PA,()} > - n=1y-n= L32Pn,-v N p

Z.~~~~~k=1Pn2,k a

lim d{Ln(b),'PA,(b)} __,Nv- k n UavN-+xo Pnk Pnay

(21)

The total variation distance between the Poisson and thePoisson binomial distribution is a random variable in time,that is along OFDM blocks, due to the fading nature of theRayleigh channel. Therefore, the bounds (20) and (21) ontotal variational distance are also random variables. Recall thatthe limiting distributions of Pn,av and Pn2av are Gaussian.Then the distributions of the limits in (21) are given by thedistributions of the ratios of two correlated Gaussian randomvariables. The distribution of such ratios is derived in [12] andwe then have Un fu(x), where

fu(x c2exp(1 [a2 b2]) [1 erDfD_____22)

Variables D, C1, C2, a and b are defined as

a-E[P1[E,av] p(P, P2)E [Pnav]

D= bc2+a(x-c)2 ci1=p(P,P2)/ var(Pg,,0,)/val a ) L 4var(Pn,av)

(23)

where p(P, P2) is the correlation coefficient betweenP,,a V

and P2,av which is easily calculable from the correlation

between them (Appendix II). A similar result may be shown

for the limiting distribution of Ln. It is observed from (14)-(18) and (21) that as the number of subcarriers N increases,the variance in the limiting distributions of the bounds on totalvariation distance does not increase. Furthermore, for fixedmean SNR, the mean of these limiting distributions remainsconstant.

IV. SIMULATIONS

We consider a 1024 subcarrier OFDM system transmittingover a Rayleigh fading channel with an exponential powerdelay profile and maximum excess delay of 50ns. We assumethe OFDM system occupies a 320MHz bandwidth with carrierfrequency 5.1GHz and receiver velocity of l5m/s. Due tothe large number of subcarriers, calculation of the exactprobability of b errors for 3 < b < 1022 is infeasible.

.a:2-

Ca

30 40Number of Errors, b

50 60 70

Fig. 1. Simulated Error Rate Distribution (bars) and Poisson Approximation(solid line) for one Channel Realization.

la

Y-

8C.)

-0E

z

0.05Total Variation Distance

Fig. 2. Simulated Total Variation Distance Between Poisson and PoissonBinomial Distributions

We consider transmission over 5000 consecutive simulatedfading channel realizations. For each channel realization wesimulate transmission of 107 blocks, and thus estimate thedistribution of errors for that channel realization. We thencalculate the total variation distance between the estimateddistribution and the Poisson approximation, as well as boundson total variation distance (21) for each realization.

In Figure we plot the simulated distribution of errors andthe Poisson approximation for a single channel realization. It isobserved that the Poisson distribution is a good approximationto the simulated distribution of errors, with total variationdistance of 0.0458. We display the distribution of the totalvariation distance between the simulated distribution of errorsand the Poisson approximation, for all 5000 realizations, inFigure 2, and plot the expected distribution of the upper boundon the total variation distance in Figure 3.

It is observed from Figure 3 that the pdf of (22) closely

1415

0.1'

0.09 _

0.08 _

0.07

0.06

0.05 .

0.04-

0.02

0.0

lo 20

Authorized licensed use limited to: University of Canterbury. Downloaded on November 17, 2008 at 17:21 from IEEE Xplore. Restrictions apply.

2000

z

50

0.05 0.1 0.15 0.2 0.25 0.3Total Variation Distance Upper Bound

Fig. 3. Upper Bound on the Total Variation Distance, Simulated (histogram)and Approximating Density Function (solid line, scaled for 5000 trials)

approximates the density of the simulated upper bound ontotal variation distance. Similar results are readily obtained forthe lower bound. As N increases, the approximation becomestighter.

V. CONCLUDING REMARKSFor an OFDM system transmitting BPSK over a Rayleigh

fading channel we have considered Poisson distribution ap-proximation of the distribution of the number of symbol errorsper received block. The total variation distance is a randomvariable in time due to the fading nature of the channel,and is bounded above and below by random variables whoseprobability distribution has been derived. The upper bound ontotal variation distance between the true distribution and thePoisson approximation does not increase as the number ofsubcarriers increases.The Poisson distribution appears to be a good approximation

to the distribution of the number of OFDM symbol errors perblock, for fading, frequency selective channel realizations. Theresults obtained enable us to construct confidence intervalson the approximation error when estimating the probabilityof a given number of OFDM errors per received block for aRayleigh fading channel. The analysis may be readily extendedto other symbol constellations, such as quadrature amplitudemodulation.

APPENDIX IHERMITE RANK OF ERROR FUNCTIONS

Given the gain for the kth subcarrier over the nth timeinterval, H , y(1) +jy4, where y( 1) and y(2) are Gaussianrandom variables with properties given in (3), we may expressthe probability of incorrectly estimating the transmitted BPSKsymbol as (4) for given symbol energy Eo and noise powerspectral density No.

The Hermite rank tp(f) of a measurable function f: X -R for the mean zero, independent, identically distributed (iid)

Gaussian vector X {Xi,. . E Rd, where f has finitesecond moment, may be defined [5] as

inf{ o(f) : polynomial P of degree yc(f) with,

E [( f(X) -E [f (X)] ) P(X(1), .. .,X(d))] 0}

(24)

We show that the Hermite rank, o(p), of p y(1), y(2)) isgreater than two, by showing that it is neither zero nor unity.Firstly consider a polynomial on {yk, y(2) } of degree zero,that is fo y(1) (2))= Ao, for some constant Ao E R. Wec t n,k Yn,kJcan then write

E [ { Pn.k-E [Pn,k] } fo (Ynk (y))]=E [ {Pn,k -E [Pnkk]}Ao ] (25)=0, VAo,

since E [ E [P0,k] E1K [Pn,,k], and thus ~o(p) :& 0. Secondlyconsider a first degree polynomial on {y(, y( }, denoted

fi (II2k 2 ) A1,y1y +A+ A1,2Y 2) ± Ao. Then

E [{ Pn,k -E [Pn,k] } fl (Ynk, Yn,kJ)]

=IE [ A,lyn,kPn,k ± A1,2yn,Pkn,k + AOPn,k

-E [Pn,k] A1,1y(l) - E [Pn,k] Al,2Y) E-E [Pn,k] AOl

=E [Al,lyn(,) Pn.k ] + E [ Al,2y(2Pk ],(26)

since y(n) and y(2) are zero mean, iid Gaussian randomvariables. We denote the bivariate Gaussian probability densityfunction of y() and y(2) as f (y(1) y(2)). Considering the firstterm of the final line of (26) and using the Gaussian Q-functionrepresentation of [13] we may write

1K [ Al.1ykPln,k ]

-Alj y(1, )Q 2(2y(1)

fAle (2r2Eo [y(2)]2T _00 P No sin2b /o

{JY) P ( o[y2j )fy( 21 d(2)) dY(d)}edy(2)d

=0, VA1,1.(27)

1416

Authorized licensed use limited to: University of Canterbury. Downloaded on November 17, 2008 at 17:21 from IEEE Xplore. Restrictions apply.

This follows because the integrand within the parentheses{...} on the penultimate line of (27) is the product of anodd function and two even functions of y(1), We can similarlyshow that E [ A1,ly(1) P,k 0=, for all A1,2. Substitutingthese results into (26) we deduce that (p(p) is neither zero norone, and therefore at least 2.

Using a similar approach it is readily shown that the Hermiterank o(q) of the average squared probability of error pn2 av isat least 2.

APPENDIX IISUBCARRIER ERROR FUNCTION CORRELATIONS

At time n the correlation between the squared values of thechannel envelopes, jHn,k1 2 and Hn,k 12, is [4]

PH(Ak) =1

The corresponding channel SNR's -/n,k, and / have abivariate exponential distribution which may be written [14]as

f-y,,y (-Yn,ki , -Yn,k2 )

In the special case of k1 = k2 a finite range integralrepresentation of E [P4kl] is readily obtained [15] using theQ-function representation of [13]. This is easily evaluated.

Finally, the correlation between the subcarrier average errorrate and subcarrier average squared error rate is given by

1N N

IE [Pn,avPn,av]= N2N NE [PkPk-2]k1=1 k2=1

(36)

An expression for E [P o2klPk2] is given in [ 15] and can beused to compute (36), specifically

ooI92iE [P;% IPk-2 = E i riC1/D2-

i=O(37)

In the special case of k1 = k2 a finite range integralrepresentation of E [P3k1] is readily obtained [15] using theQ-function representation of [13]. This is easily evaluated.

REFERENCES=riexp (-a [kn,ki + -Yn,k]) Io (0 k-1n,k n,k2)

with1 1

h- - -2a _

tZo (1 - pH(Z\k)2) a o(T1 -pH (A k)2) (30)2pH(Ak)

=o(l-pH(Ak)2)-The correlation between the error probabilities on channels k,and k2 may then be written as a rapidly convergent series,allowing simple calculation [15]. That is,

00 o2iS 4 2(i+l Cii=O

where

l-,) i+l n (i + n

, for k1 54 k2 ,

(1 +± nk2 J

and,=lj--Furthermore, in the special case of k1 k2, we use a result

from [16] to write

arctan( ITU±+i)7r

Similarly the correlation between the squared error rates ontwo channels k1 and k2 may also be written as the rapidlyconvergent series [15],

IE [Pn,k1Pn,k9l = 5 4, D. for k, 54 k2, (34)i=o

where Di is the readily calculable finite range integral1 [ [ s2 i+172 Jo Jo La siin2 s Sin2 X + Sin2 19 + sin2 q$J a,pav .

(35)

[1] T. Keller and L. Hanzo, "Adaptive multicarrier modulation: A convenientframework for time-frequency processing in wireless communications,"Proc. IEEE, no. 5, pp. 611-640, May 2000.

[2] A. Barbour and P. Hall, "On the rate of Poisson convergence," Math-ematical Proceedings of the Cambridge Philosophical Society, vol. 95,no. 3, pp. 473-480, 1984.

[3] A. R. S. Bahai and B. R. Saltzberg, Multi-Carrier Digital Contmmunica-tions. New York, NY: Kluwer Academic, 1999.

[4] W. C. Jakes, Microwave Mobile Conmnlunications. New York, NY:IEEE Press, 1994.

[5] M. A. Arcones, "Limit theorems for nonlinear functionals of a stationaryGaussian sequence of vectors," The Annials of Probability, vol. 22, no. 4,pp. 2242-2274, 1994.

[6] J. G. Proakis, Digital Comtmn711lications, 4th ed. New York, NY:McGraw-Hill, 2001.

[7] Digital Video Broadcasting (DVB-T); Framinzg structutre, channel coding,anid mnodulationfir digital terrestrial television, ETSI Std. ETS 300 744,Dec. 2001.

[8] 1. Borisov and P. Ruzankin, "Poisson approximation for expectations ofunbounded functions of independent random variables," The Annals ofProbability, vol. 30, no. 4, pp. 1657-1680, 2002.

[9] K. Choi and A. Xia, "Approximating the number of successes inindependent trials: Binomial versus Poisson," The Anntzals of Probability,vol. 12, no. 4, pp. 1139-1148, 2002.

[10] J. Hodges and L. Le Cam, "The Poisson approximation to the Poissonbinomial distribution," The Aninals of Mathemnatical Statistics, vol. 31,no. 3, pp. 737-740, 1960.

[ 11] L. H. Chen, "On the convergence of Poisson binomial to Poissondistributions," The Annals of Probability, vol. 2, no. 1, pp. 178-180,1974.

[12] G. Marsaglia, "Ratios of normal variables and ratios of sums of uniformvariables," J. Am. Stat. Assoc., vol. 60, no. 309, pp. 193-204, Mar. 1965.

[13] J. Craig, "A new, simple and exact result for calculating the probabilityof error for two-dimensional signal constellations," in Proc. IEEEMILCOM'91 Conf. Rec., Boston, 1991, pp. 25.5.1-25.5.5.

[14] R. K. Mallik, "On multivariate Rayleigh and exponential distributions,"IEEE Trans. Informn. Theory, vol. 49, no. 6, pp. 1499-1515, June 2003.

[15] A. Clark, "Approximating the probability distribution of OFDMsymbol errors," Technical Report, University of Canterbury,Christchurch, New Zealand, Mar. 2005. [Online]. Available:www.elec.canterbury.ac.nz/research/communications

[16] 1. S. Gradshteyn and 1. M. Ryzhik, Table of Initegrals. Series, andProdutcts. New York, NY: Academic Press, 1965.

1417

f?Q)8

E [Pn,k. Pn,k, I K

.7;:.q 12 =Pk p -4

Authorized licensed use limited to: University of Canterbury. Downloaded on November 17, 2008 at 17:21 from IEEE Xplore. Restrictions apply.