0
Symbol Error Probability and Bit Error Probability for Optimum Combining with MPSK Modulation
Debang Lao and Alexander M. Haimovich Corresponding Address: Alexander M. Haimovich Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark, New Jersey 07102, USA Tel: (973) 596-3534
Fax: (973) 596-8473
E-mail:
[email protected] This work was supported by AFOSR Grant F49620-00-1-0107 and New Jersey Center for Wireless Telecommunications. January 28, 2004
FINAL
1
Abstract New expressions are derived for the exact symbol error probability and bit error probability for OC with multiple phase-shift keying. The expressions are for any numbers of equal power co-channel interferers and receive branches. It is assumed that the aggregate interference and noise is Gaussian and that both the desired signal and interference are subject to flat Rayleigh fading. The new expressions have low computational complexity as they contain only a single integral form with finite limits and finite integrand. Index Terms Receive diversity, optimum combining, interference suppression, fading channels, error probability performance.
I. I NTRODUCTION Optimum combining (OC) is a well-known method to combat fading and suppress co-channel interference in wireless communication systems with receive diversity. It combines the outputs of the receive branches in an optimum way and achieves the maximum output signal-tointerference plus noise ratio (SINR). Performance analysis of OC has been an active research area. Analysis for the case of a single interference source with binary phase-shift keying (BPSK) modulation can be found in [1], [2] and [3]. The performance of systems with more than one interferer has been studied extensively through the use of Monte Carlo simulations [1], upper bounds [4], approximate expressions [5], and exact expressions with integral forms [6], [7]. Closed-form expressions of BEP for the number of interferers no less than the number of receive branches and negligible thermal noise with BPSK modulation were developed in [8]. For arbitrary numbers of interferers and receive branches, closed-form expressions of BEP were derived in [9] and [10] for BPSK modulation. An expression for symbol error probability (SEP) for multiple phase-shift keying (M -PSK) was derived in [7]. The expression was exact and it applied to any number of interferers and receive branches. It involved multiple-fold integration. A simpler and elegant SEP expression was derived in recent work [11] for the same case. The expression contained integration over an integrand, which included the incomplete Gamma function, itself an integral form. In this paper, we derive expressions for both SEP and BEP for M -PSK, with any number of receive branches and interferers. The expressions involve only a single integration over elemenJanuary 28, 2004
FINAL
2
tary functions. With these expressions, it takes much less time to evaluate the SEP and BEP than it would take to carry out Monte Carlo simulations or to evaluate multiple-fold integrals. The paper is organized as follows. Following the system model in Section II, we develop the expressions for SEP and BEP in Section III. Numerical results are shown in Section IV and finally, conclusions are drawn in Section V. II. S YSTEM M ODEL Consider a wireless communication system with N independent receive branches and L + 1 users. Of the users, one is the desired user and it transmits signals with power P s . The other L sources are considered interference sources. Assuming perfect carrier demodulation and synchronization, the sampled output of the matched filter for the j-th branch is rj =
p
L p X P s cj s + PI ci,j si + nj , j = 1, 2, · · · , N,
(1)
i=1
where cj and s are respectively, the channel gain and M -PSK symbol of the desired user; c i,j and si are respectively, the i-th interferer’s channel gain and symbol; P I is the interference power (assumed equal for all interference sources). The term nj represents additive white Gaussian noise (AWGN). The channel gains cj and ci,j are assumed to be independently and identically distributed (i.i.d.), zero-mean, circularly symmetric, complex Gaussian random variables (Rayleigh fading), with variance 1/2 per dimension. The signal model in vector notation is L p X p ci si + n, r = Ps cs + PI
(2)
i=1
where r = [r1 , r2 , · · · , rN ]T , c, ci and n are defined similarly, and the superscript T denotes
vector transposition.
Define the interference plus noise vector as z =
√
PI
PL
i=1
ci si + n. Assume the interference
signal si is Gaussian distributed with zero-mean and unit variance. Then conditioned on the vectors ci ’s, z has a multivariate complex-Gaussian distribution with zero-mean and covariance matrix
L X 2 R = E zzH = PI ci cH i + σ IN ,
(3)
i=1
where the superscript H denotes the Hermitian transposition, σ 2 is the power of the additive white Gaussian noise, and IN is an identity matrix of rank N. January 28, 2004
FINAL
3
Define Nmax = max(N, L) and Nmin = min(N, L) . We sort the N eigenvalues of the interference plus noise covariance matrix R in descending order as λ 1 ≥ λ2 ≥ · · · ≥ λN ≥ σ 2 . It
is well known that λi = σ 2 for i = Nmin + 1, Nmin + 2, · · · , N. For notational convenience, we
denote the other Nmin non-trivial eigenvalues as λ= [λ1 , λ2 , · · · , λNmin ]T . The joint probability density function of the Nmin random eigenvalues is [7] # #" "N min 2 2 Nmax −Nmin Y Y λi − σ λi − σ (λi − λj )2 exp − pλ (λ) = K0 PI PI i=1 1≤i<j≤N
(4)
min
for ∞ > λ1 ≥ λ2 ≥ · · · ≥ λNmin ≥ σ 2 , where K0 = QNmin i=1
1 1 QNmin 2 . Nmin (Nmax − i)! i=1 (Nmin − i)! PI
(5)
With the OC detector, the received signal vector r is weighted and combined to obtain the output signal. The weight vector that yields the maximum SINR is ([1], [12]) w = R −1 c. The output of the combiner is wH r = The first term
p Ps cH R−1 cs + cH R−1 z.
(6)
√ Ps cH R−1 cs corresponds to the desired signal, while the second term cH R−1 z
corresponds to interference plus noise. The latter is Gaussian distributed conditioned on the channel vectors c and ci . The signal model of (6) is similar to that of an AWGN channel with h 2 i noise variance Es ,n cH R−1 z , with the expectation taken over the interfering signal si and i
AWGN n. The instantaneous output SINR γt is
(7)
γt = Ps cH R−1 c. III. E XPRESSIONS
FOR
SEP
AND
BEP
In this and the next section, we carry out the theoretical analysis of the SEP and BEP for OC with M -PSK modulation in the presence of any number of interference sources and receive branches when both the desired signal and interference are subject to Rayleigh fading. A. Expression for SEP For M -PSK, the SEP conditioned on the output SINR γt can be written as [12, Eq. (8.22)] Z 1 (M −1)π/M sin2 (π/M ) Psym (E|γt ) = exp −γt dθ, (8) π 0 sin2 θ January 28, 2004
FINAL
4
where M is the number of symbols of the M -PSK modulation. The SEP is conditioned on channel realizations through γt . In order to get the ensemble average SEP Psym (E) for OC, we need to average Psym (E|γt ) over the distribution of γt , Z ∞ Psym (E) = Psym (E|γt ) pγt (γt ) dγt ,
(9)
0
where pγt (γt ) is the probability density function (PDF) of the SINR γt . Let pγt |λ (γt |λ) repre-
sent the PDF of γt conditioned on the non-trivial eigenvalues λ= [λ1 , λ2 , · · · , λNmin ]. The PDF
pγt (γt ) can be obtained by averaging pγt |λ (γt |λ) over λ: Z Z pγt (γt ) = · · · pγt |λ (γt |λ) pλ (λ)dλ.
(10)
Since λ is a vector, the above integration is multiple-fold.
Substituting (8) and (10) in (9), after some manipulations similar to those in [12], we have # Z Z "Z (M −1)π/M sin2 (π/M ) 1 Mγt |λ − ··· dθ pλ (λ)dλ, (11) Psym (E) = π sin2 θ 0 where Mγt |λ (·) is the moment generating function (MGF) of the SINR γt conditioned on eigenvalues λ. For the Rayleigh fading channel, the MGF given by [12, Eq. 10.52] for L < N can be generalized easily to any numbers of L and N as !N −Nmin N min Y 1 1 Mγt |λ (s) = . Ps 1 − σ2 s 1 − Pλsi s i=1
(12)
B. Expression for BEP The expressions of BEP for M -PSK modulation with Gray code bit mapping over AWGN channel can be found in ([13], [12, Eq. (8.30)]). From these expression for AWGN, and similarly to the derivations from (8) to (11), we can obtain the BEP for OC as P0 M =2 1 (P1 + 2P2 + P3 ) M =4 2 Pbit (E) = , 1 (P + 2P + P + 2P + 3P + 2P + P ) M = 8 1 2 3 4 5 6 7 3 P5 1 P8 M = 16 k=1 Pk + k=2 Pk + P5 + 2P6 + P7 2
(13)
where
Pk = January 28, 2004
1 C π [1 − (2k − 1)/M ] , sin2 [(2k − 1) π/M ] 2
FINAL
5
1 − C π [1 − (2k + 1)/M ] , sin2 [(2k + 1) π/M ] , 2
and
Z Z Z φ ξ 1 Mγt |λ − 2 C (φ, ξ) = ··· dθ pλ (λ) dλ. π sin θ 0 Note that the SEP in (11) can be expressed as Psym (E) = C (M − 1) π/M, sin2 (π/M ) .
(14)
(15)
(16)
In Appendix A we show that C (φ, ξ) can be evaluated as C (φ, ξ) =
1 ξβ
p NX Nmin −1 NX min −1 min −1 β (−1)Nmin −1+q Hp,q Υq , γ p=0 q=0
(17)
where γ = Ps /σ 2 is the symbol signal-to-noise ratio (SNR), and β = Ps /PI is the signal-tointerference ratio (SIR); Hp,q and Υq are defined below: •
Hp,q is a sequence indexed by p and q. For 0 ≤ p, q ≤ Nmin − 1, Hp,q = hQ Nmin i=1
×
(Nmax − i)! X
1 i hQ
Nmin i=1
(Nmin − i)! X
i
det W,
(18)
m1 +···+mNmin −1 =Nmin −1−p n1 +···+nNmin −1 =Nmin −1−q ni ∈{0,1} mi ∈{0,1}
where for Nmin = 1, det W =1; for Nmin > 1, det W is the determinant of an (Nmin − 1) × (Nmin − 1) matrix whose i-th row and j-th column element is
Wi,j = (Nmax − Nmin + mj + nj + i + j − 2)!. •
Υq is a sequence given by # "N −k Nmin min X X N (−ξ1 )k Υq = FNmin −k−i Xq,i−1 + Yq,Nmin−k k i=1 k=0 # " k−N −1 N min X X N (−ξ1 )k − Gk−Nmin −i Xq,−(i+1) + Yq,Nmin −k , (19) + k i=0 k=Nmin +1 where ξ1 = ξγ. Other terms (F, X, Y and G) in (19) are defined as (m is an integer) m 1 X m m−l ξ1 Fm = π l l=0
January 28, 2004
FINAL
6
Yq,m
l−1 l X
2l 1 2l (−1) sin (2l − 2k) φ (−1)k φ + 2l−1 2l 2 2 2l − 2k l k k=0 l NminX −1−m Nmin − 1 − m m β (Nmax + q − l − 1)! = ξ1 γ l l=0 ×
Xq,m
1 m ξ = π 1
r
1 ξβ
Z
π 2
0
β γ
Nmin −m
tgϕ + q tgϕ + ξβ +
β γ
arctg
s
1 ξβ
(20)
(21)
! β tgϕ + ξβ + tgφ γ
×exp (−tgϕ) (tgϕ)Nmax −Nmin +q+m sec2 ϕdϕ Gm
m−1 X
m−1
(22)
2l
1 1 1 = m π ξ1 1 + ξ −1 m− 12 l=0 l l 1 q q tgφ × tg−1 1 + ξ1−1 tgφ + 1 + ξ1−1 2 ×
l X j=1
ξ1−1 4
l
4 . 2 j 2j −1 j 1 + 1 + ξ1 tg φ j j
(23)
By inspection of the terms that make up C (φ, ξ) in (17), it follows that the integration in (22) is the only one required to evaluate C (φ, ξ). With (16) and (17), we can calculate the SEP. With (13), (14) and (17), we can calculate the BEP. Although (17) and the related expressions appear involved, they consist of elementary functions and a single integral form, which can be readily computed numerically using Matlab or similar software. These expressions are exact. But since the calculation of Yq,m in (22) involves integration, the actual accuracy of the final result will depend on the accuracy of the numerical integration. IV. N UMERICAL R ESULTS In this section, we use numerical results to demonstrate the new exact SEP and BEP expressions. To facilitate the comparison, in all figures we represent both simulation results and analysis results. Analytical results were calculated using (16) (for SEP) and (13) (for BEP) and related expressions such as (14) and (17). January 28, 2004
FINAL
7
Fig. 1 shows the SEP versus symbol SNR = Ps /σ 2 for N = 6 branches, L = 4 interferers, and SIR = Ps /PI = 10 dB. Fig. 2 shows the BEP versus the number of receive branches N for L = 4 interferers, bit SNR = 10 dB, and SIR = 15 dB. We can see log 10 (BEP) decreases linearly as the number of receive branches increases. In both figures, the interference signal s i is generated as Gaussian distributed as assumed in Section II. It can be observed that analysis results match simulation results. Fig. 3 shows BEP versus SIR for N = 4 branches, various numbers of interferers, and SNR = 10 dB. Both the desired signal and the interference signal are quadrature phase-shift keying (QPSK) symbols. It shows that though the interference signal is not Gaussian distributed, the analysis results are still very close to simulation results regardless of the number of interferers and the SIR levels. Similar conclusion was drawn in [10]. V. C ONCLUSIONS In this paper, we derived expressions of the exact SEP and BEP for OC with M -PSK modulation over a diversity channel with Rayleigh fading, with any number of diversity branches and interference sources. The interference sources were assumed to have equal power and the Gaussian assumption was invoked for the aggregate of interference plus noise. The computational complexity of the new expressions is relatively low as they contain only a single integration form. The theoretical results in the paper are amply demonstrated by simulations. A PPENDIX A E VALUATION
OF
C (φ, ξ)
In this appendix, we evaluate C (φ, ξ) defined in (15) to prove the relation in (17). We will present the procedure of the derivation but omit some details. We start by substituting (12) in (15), N −Nmin "N Z Z (Z φ min Y 1 sin2 θ C (φ, ξ) = ··· π sin2 θ + ξγ 0 i=1
sin2 θ sin2 θ + ξ Pλis
!#
dθ
)
pλ (λ) dλ, (24)
where γ = Ps /σ 2 is the symbol SNR. The direct evaluation of (24) is computationally intensive even for small Nmin since it involves a (Nmin + 1)-fold integration. We will show that an expression for C (φ, ξ) can be obtained which involves only a single integration form. January 28, 2004
FINAL
8
Converting the product in (24) into a summation, we have ) N N −Nmin Z Z (Z φ Nmin X sin2 θ min sin2 θ 1 dθ pλ (λ) dλ An (λ) C (φ, ξ) = ··· 2 2 Ps π sin θ + ξγ sin θ + ξ 0 λ n=1 n (25) where min −2 λN n
An (λ) =
QNmin
(ξPs )
i=1 λi Nmin −1
n−1 Y i=1
1 λn − λ i
N min Y i=n+1
1 λn − λ i
.
(26)
Starting with (25) and following similar procedure detailed in [10] and [9], we can express C (φ, ξ) as C (φ, ξ) =
1 ξβ
p NX Nmin −1 NX min −1 min −1 β (−1)Nmin −1+q Hp,q Υq , γ p=0 q=0
(27)
where β = Ps /PI is the signal-to-interference ratio (SIR), Hp,q is defined by (18). And Υq is a sequence defined by Υq = where D (zNmin ) = ξ1 = ξ2 = fq (zNmin ) =
Z
∞
D (zNmin ) fq (zNmin ) dzNmin ,
(28)
0
N N −Nmin Z sin2 θ min 1 φ sin2 θ dθ π 0 sin2 θ + ξ1 sin2 θ + ξ2 ξγ Ps ξ PI zNmin + σ 2 N −1 σ 2 min Nmax −Nmin +q e−zNmin . zNmin zNmin + PI
(29) (30) (31) (32)
A. Evaluation of D (zNmin ) We first evaluate D (zNmin ), which involves the integration over variable θ. We want to express D (zNmin ) without integration. From (29), 1 D (zNmin ) = π
Z
φ 0
N sin2 θ + ξ1 − ξ1 1 dθ. 2 N −N min sin θ + ξ2 sin2 θ + ξ1
Using the binomial expansion, we get Z φ N X N N −k 1 1 k (−ξ1 ) D (zNmin ) = sin2 θ + ξ1 min dθ. 2 π 0 sin θ + ξ2 k k=0 January 28, 2004
(33)
(34)
FINAL
9
Separate the summation into two parts according to whether Nmin −k is non-negative or negative.
Then
D (zNmin ) =
Nmin X k=0
N k
(−ξ1 )k ENmin −k (ξ1 , ξ2 ) +
N X
k=Nmin +1
N k
(−ξ1 )k Uk−Nmin (ξ1 , ξ2 ) ,
(35)
where Z m 1 φ 1 Em (ξ1 , ξ2 ) = sin2 θ + ξ1 dθ 2 π 0 sin θ + ξ2 Z 1 1 1 φ m dθ. Um (ξ1 , ξ2 ) = 2 2 π 0 sin θ + ξ2 sin θ + ξ1
1) Evaluation of Em (ξ1 , ξ2 ): For m = 0, Z 1 1 φ dθ E0 (ξ2 ) = 2 π 0 sin θ + ξ2
1 1 p = arctg π ξ2 (ξ2 + 1)
s
! ξ2 + 1 tgφ , ξ2
(36) (37)
(38)
where we use the result from [14, Eq. 2.562]. For m ≥ 1, it can be shown that Em (ξ1 , ξ2 ) = Fm−1 (ξ1 ) + (ξ1 − ξ2 ) Em−1 (ξ1 , ξ2 ) ,
(39)
where
Z m 1 φ sin2 θ + ξ1 dθ. (40) Fm (ξ1 ) = π 0 Using the binomial expansion and [14, Eq. 2.513.1], we obtain the expression for F m (ξ1 ) shown in (20). Expanding (39) further, we have Em (ξ1 , ξ2 ) =
m X i=1
(ξ1 − ξ2 )i−1 Fm−i (ξ1 ) + (ξ1 − ξ2 )m E0 (ξ2 ) ,
(41)
which shows Em (ξ1 , ξ2 ) can be evaluated from Fm−i (ξ1 ) and E0 (ξ2 ) . 2) Evaluation of Um (ξ1 , ξ2 ): Similarly to the evaluation of Em (ξ1 , ξ2 ) , we have m m−1 X 1 i+1 1 Gm−i (ξ1 ) + E0 (ξ2 ) , Um (ξ1 , ξ2 ) = − ξ1 − ξ 2 ξ1 − ξ 2 i=0
where
1 Gm (ξ1 ) = π
Z
φ 0
1 m dθ. sin θ + ξ1 2
(42)
(43)
Using Eq. (29) and (40) in [15], we get the expression for Gm (ξ1 ) shown in (23). January 28, 2004
FINAL
10
3) Summary for D (zNmin ): Substituting (41) and (42) in (35), we obtain the expression for D (zNmin ) as D (zNmin ) =
Nmin X k=0
N k
N X
+
k=Nmin +1
+
(−ξ1 )
1 ξ1 − ξ 2
N k
"N −k min X k i=1
k
(−ξ1 )
k−Nmin
(ξ1 − ξ2 )i−1 FNmin −k−i (ξ1 ) + (ξ1 − ξ2 )Nmin −k E0 (ξ2 )
"
−
#
k−N min −1 X i=0
1 ξ1 − ξ 2
E0 (ξ2 ) ,
i+1
#
Gk−Nmin −i (ξ1 ) (44)
which does not contain any integral forms. B. Evaluation of Υq Substitute (44) into (28), then "N −k Z ∞ Nmin min X X N k (−ξ1 ) Υq = FNmin −k−i (ξ1 ) (ξ1 − ξ2 )i−1 fq (zNmin ) dzNmin 0 k i=1 k=0 Z ∞ N X N (−ξ1 )k + (ξ1 − ξ2 )Nmin −k E0 (ξ2 ) fq (zNmin ) dzNmin + 0 k k=Nmin +1 " k−N −1 i+1 Z ∞ min X 1 fq (zNmin ) dzNmin × − Gk−Nmin −i (ξ1 ) ξ − ξ 1 2 0 i=0 # k−Nmin Z ∞ 1 + E0 (ξ2 ) fq (zNmin ) dzNmin . (45) ξ1 − ξ 2 0 Substituting fq (zNmin ) (from (32)), E0 (ξ2 ) (from (38)) and ξ2 (from (31)) into (45), after some straightforward manipulations, we obtain Υq as shown in (19). R EFERENCES [1] J. H. Winters, “Optimum combining in digital mobile radio with cochannel interference,” IEEE Transactions on Vehicular Technology, vol. 33, pp. 144–155, August 1984. [2] A. Shah, A. M. Haimovich, M. K. Simon, and M.-S. Alouini, “Exact bit-error probability for optimum combining with a Rayleigh fading Gaussian cochannel interference,” IEEE Transactions on Communications, vol. 48, pp. 908–912, June 2000. [3] V. A. Aalo and J. Zhang, “Performance of antenna array systems with optimum combining in a Rayleigh fading environment,” IEEE Communications Letters, vol. 4, pp. 125–127, April 2000. January 28, 2004
FINAL
11
[4] J. H. Winters and J. Salz, “Upper bounds on the bit-error rate of optimum combining in wireless systems,” IEEE Transactions on Communications, vol. 46, pp. 1619–1624, December 1998. [5] E. Villier, “Performance analysis of optimum combining with multiple interferes in flat Rayleigh fading,” IEEE Transactions on Communications, vol. 47, pp. 1503–1510, October 1999. [6] J. Cui, D. D. Falconer, and A. U. Sheikh, “Analysis of BER for optimum combining with two co-channel interferers and maximal ratio combining with arbitrary number of interferers,” Proc. IEEE Int. Symp. Personal indoor Mobil Commun. (PIMRC96), pp. 53–57, October 1996. [7] M. Chiani, M. Z. Win, A. Zanella, and J. H. Winters, “Exact symbol error probability for optimum combining in the presence of multiple co-channel interferers and thermal noise,” Global Telecommunications Conference, vol. 2, pp. 1182– 1186, 2001. [8] A. Shah and A. M. Haimovich, “Performance analysis of optimum combining in wireless communications with Rayleigh fading and cochannel interference,” IEEE Transactions on Communications, vol. 46, pp. 473–479, April 1998. [9] R.K. Mallik, M. Z. Win, and M. Chiani, “Exact analysis of optimum combining in interference and noise over a Rayleigh fading channel,” IEEE International Conference on Communications (ICC ’02), vol. 3, pp. 1954–1958, April 2002. [10] D. Lao and A. Haimovich, “Exact closed-form performance analysis of optimum combining with multiple co-channel interferers and Rayleigh fading,” IEEE Transactions on Communications, vol. 51, pp. 995–1003, June 2003. [11] M. Z. Win, M. Chiani, and A. Zanella, “An analytical frame work for the performance evaluation of optimum combining for M-ary signals,” Proceedings of the 2002 Conference on Information Sciences and Systems, Princeton University, NJ, 2002. [12] M. K. Simon and M.-S. Alouini, Digital Communication over Fading Channel: A Unified Approach to Performance Analysis. New York, NY: John Wiley & Sons, 2000. [13] P. J. Lee, “Computation of the bit error rate for coherent M-ary PSK with Gray code bit mapping,” IEEE Transactions on Communications, pp. 488–491, May 1986. [14] I. S. Gradshteyn and I. M. Ryzhik, Table of Integrals, Series, and Products. San Diego, CA: Academic Press, 1994. [15] M. Z. Win, R. K. Mallik, G. Chrisikos, and J. H. Winters, “Canonical expressions for the error probability performance of M-ary modulation with hybrid selection/maximal-ratio combining in Rayleigh fading,” IEEE Wireless Communications and Networking Conference, vol. 1, pp. 266–270, 1999.
January 28, 2004
FINAL
12
0
10
−1
10
−2
SEP
10
−3
10
16−PSK (Analysis) 16−PSK (Simulation) 8−PSK (Analysis) 8−PSK (Simulation) QPSK (Analysis) QPSK (Simulation) BPSK (Analysis) BPSK (Simulation)
−4
10
−5
10
−6
10
0
2
4
6 Symbol SNR (dB)
8
10
12
Fig. 1. SEP versus symbol SNR for N = 6 branches, L = 4 interferers, and SIR = 10 dB.
0
10
−1
10
−2
BEP
10
16PSK (Analysis) 16PSK (Simulation) 8PSK (Analysis) 8PSK (Simulation) QPSK (Analysis) QPSK (Simulation) BPSK (Analysis) BPSK (Simulation)
−3
10
−4
10
−5
10
1
1.5
2
2.5
3
3.5
N (Number of branches)
4
4.5
5
Fig. 2. BEP versus the number of receive branches N , L = 4 interferers, bit SNR = 10 dB, and SIR = 15 dB.
January 28, 2004
FINAL
13
0
10
L=4 (Analysis) L=4 (Simulation) L=3 (Analysis) L=3 (Simulation) L=2 (Analysis) L=2 (Simulation) L=1 (Analysis) L=1 (Simulation)
−1
10
−2
BEP
10
−3
10
−4
10
−5
10 −10
−5
0
5
10 SIR (dB)
15
20
25
30
Fig. 3. BEP versus SIR for QPSK modulation, N = 4 branches, and SNR = 10 dB.
January 28, 2004
FINAL