Scribd
Upload
11 views2 pages

Extracted Pages From WirelessComm - Chp1-16 - March32020 - Part2

The document discusses the bit error probability (Pb) and symbol error probability (Ps) for QPSK and MPSK modulation schemes, providing mathematical formulations and approximations for these probabilities. It includes examples with calculations for Pb and Ps based on specific values of signal-to-noise ratios (γb). Additionally, it highlights the differences in error probabilities for various modulation schemes and the methods for estimating these probabilities.

Uploaded by

yogeti9322
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views2 pages

Extracted Pages From WirelessComm - Chp1-16 - March32020 - Part2

The document discusses the bit error probability (Pb) and symbol error probability (Ps) for QPSK and MPSK modulation schemes, providing mathematical formulations and approximations for these probabilities. It includes examples with calculations for Pb and Ps based on specific values of signal-to-noise ratios (γb). Additionally, it highlights the differences in error probabilities for various modulation schemes and the methods for estimating these probabilities.

Uploaded by

yogeti9322
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

√

√ of energy per bit is given by s0 =


by√(5.57). Thus, the signal constellation for BPSK in terms Eb and s1 =
− Eb . This yields the minimum distance dmin = 2A = 2 Eb . Substituting this into (6.4) yields
 √  r !
p 
2 Eb 2Eb
Pb = Q √ =Q =Q 2γb . (6.6)
2N0 N0
QPSK modulation consists of BPSK modulation on both the in-phase and quadrature components of the
signal. With perfect phase and carrier recovery, the received signal components corresponding to each of these
branches are orthogonal. Therefore, the bit error probability on each branch is the same as for BPSK: Pb =
√
Q( 2γb ). The symbol error probability equals the probability that either branch has a bit error:
p
Ps = 1 − [1 − Q( 2γb )]2 . (6.7)
Since the symbol energy is split between the in-phase and quadrature branches, we have γs = 2γb. Substituting
this into (6.7) yields Ps is terms of γs as
√
Ps = 1 − [1 − Q( γs )]2 . (6.8)
From Section 5.1.5, the union bound (5.40) on Ps for QPSK is
p √ p
Ps ≤ 2Q(A/ N0 ) + Q( 2A/ N0 ). (6.9)
Writing this in terms of γs = 2γb = A2 /N0 yields
√ p √
Ps ≤ 2Q( γs ) + Q( 2γs) ≤ 3Q( γs ). (6.10)
The closed-form bound (5.45) becomes
3
Ps ≤ √ exp[−.5γs ]. (6.11)
2πγs
√
Using the fact that the minimum distance between constellation points is dmin = 2A2 in (5.46), we obtain the
nearest neighbor approximation
p √
Ps ≈ 2Q( A2 /N0 ) = 2Q( γs ). (6.12)
Note that with Gray encoding we can approximate Pb from Ps by Pb ≈ Ps /2, since QPSK has two bits per symbol.

Example 6.1: Find the bit error probability Pb and symbol error probability Ps of QPSK assuming γb = 7 dB.
Compare the exact Pb with the approximation Pb ≈ Ps /2 based on the assumption of Gray coding. Finally, com-
pute Ps based on the nearest neighbor bound using γs = 2γb and then compare with the exact Ps .

Solution: We have γb = 107/10 = 5.012, so


p √
Pb = Q( 2γb ) = Q( 10.024) = 7.726 · 10−4 .
The exact symbol error probability Ps is
p √
Ps = 1 − [1 − Q( 2γb)]2 = 1 − [1 − Q( 10.02)]2 = 1.545 · 10−3 .

187
The bit error probability approximation assuming Gray coding yields Pb ≈ Ps /2 = 7.723 · 10−4 , which is quite
close to the exact Pb . The nearest neighbor approximation to Ps yields
√ √
Ps ≈ 2Q( γs ) = 2Q( 10.024) = 1.545 · 10−3 ,
which matches well with the exact Ps .

6.1.3 Error Probability for MPSK


The signal constellation for MPSK has si1 = A cos[2π(i − 1)/M ] and si2 = A sin[2π(i − 1)/M ] for A > 0 and
i = 1, . . . , M . The symbol energy is Es = A2 , so γs = A2 /N0 . From (5.58) it follows that, for the received vector
r = rejθ represented in polar coordinates, an error occurs if the ith signal constellation point is transmitted and
θ 6∈ (2π(i − 1 − .5)/M, 2π(i − 1 + .5)/M ). The joint distribution of r and θ can be obtained through a bivariate
transformation of the noise n1 and n2 on the in-phase and quadrature branches [1, Chap. 5.2.7], which yields
 
r 1 2 p
p(r, θ) = exp − (r − 2 Es r cos(θ) + Es ) . (6.13)
πN0 N0
Since the error probability depends only on the distribution of θ, we can integrate out the dependence on r to obtain
Z ∞ Z  √ 
1 −γs sin2 (θ) ∞ (z − 2γs cos(θ))2
p(θ) = p(r, θ) dr = e z exp − dz. (6.14)
0 2π 0 2
By symmetry, the probability of error is the same for each constellation point. Thus, we can derive Ps from the
probability of error assuming the constellation point s1 = (A, 0) is transmitted, which is

Z π/M
Ps = 1 − p(θ)dθ
−π/M
Z π/M Z ∞  √ 
1 −γs sin2 (θ) (z − 2γs cos(θ))2
= 1− e z exp − dz. (6.15)
−π/M 2π 0 2

A closed-form solution to this integral does not exist for M > 4 and so the exact value of Ps must be computed
numerically.
Each point in the MPSK constellation has two nearest neighbors at distance dmin = 2A sin(π/M ). Thus, the
nearest neighbor approximation (5.46) to Ps is given by
√ p p
Ps ≈ 2Q( 2A sin(π/M )/ N0 ) = 2Q( 2γs sin(π/M )). (6.16)
This nearest neighbor approximation can differ significantly from the exact value of Ps . However, it is much
simpler to compute than the numerical integration of (6.15) that is required to obtain the exact Ps . This formula
can also be obtained by approximating p(θ) as
p 2
p(θ) ≈ γs /π cos(θ)e−γs sin (θ) . (6.17)
Using this in the first line of (6.15) yields (6.16).

Example 6.2: Compare the probability of bit error for 8-PSK and 16-PSK assuming γb = 15 dB and using the Ps
approximation given in (6.16) along with the approximations (6.3) and (6.2).

188

You might also like