Scribd
Upload
16 views13 pages

Lecture 4.4 of DC

Uploaded by

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

Lecture 4.4 of DC

Uploaded by

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

Faculty Name: Preeti sohni

Year/Branch: III Year/ EC


Subject Code: EC-502
Subject Name: Digital Communication
LECTURE 4.4
Content

 Bit Error Rate Of QPSK


Bit Error Rate ( BER ) Calculation of QPSK

 It has Four decision zones.

 All the four signal points are


equidistance from origin.

 The dotted line divide the


signal space into four segments.
BER of QPSK

The input of a QPSK receiver is r(t) = si(t) + w(t), 0 ≤ t ≤ T,

w(t) = Noise Sample function


T = Duration of one symbol duration
Received vector r, at the output of a bank
of I-path and Q-path correlators
has two components:
if r1>0, the received vector is
either in decision zone Z1 or
in decision zone Z4.
if r2 > 0, it implies that the
received vector is either in
decision zone Z3 or in
decision zone Z4

w1 and w2 are independent, identically distributed Gaussian random variables


with zero mean and variance = N0/2
BER of QPSK

r1 and r2 are also sample values of independent Gaussian random variables with

means and respectively and with same

variance N0/2.

We assumed that s4(t) is transmitted . And we have received r .


First we compute probability of correct decision.

Let Probability of correct decision when s4(t) is transmitted

Joint probability of the event that, r1 > 0 and r2 >0

When S4 is transmitted
BER of QPSK
BER of QPSK

Probability of decision error for this case :

Similar argument, we can assume


BER of QPSK

Assume all symbols


are equally likely, the
average probability of
symbol error is

By neglecting second term, we can obtain even shorter expression

one decision error about a QPSK symbol may cause an error in one bit or
errors in both the bits that constitute a symbol
BER of QPSK

 if s4(t) is transmitted and it is wrongly detected as s1(t), information


symbol (1,1) will be misinterpreted as (1,0) and this actually means that
one bit is in error. On the contrary, if s4(t) is misinterpreted as s2(t), this
will result in two erroneous bits.
 However, the probability of s4(t) being wrongly interpreted as s2(t) is
much less compared to the probability that s4(t) is misinterpreted as s1(t)
or s3(t)
 Two adjacent symbols differ in one bit position only .
 This scheme, which does not increase the complexity of the modem,
is known as gray encoding. It ensures that one wrong decision on a
symbol mostly results in a single erroneous bit.
 This observation is good especially at moderate or high Eb/N0
 The total number of message bits transmitted over an observation
duration is twice the number of transmitted symbols.
BER of QPSK

The total number of message bits transmitted over an observation duration is


twice the number of transmitted symbols.

The BER for QPSK modulation is almost the same as the BER that can be
achieved using BPSK modulation. So, to summarize, for a given data rate
and a given channel condition (obNE), QPSK as as good as BPSK in terms
of error performance while it requires half the transmission bandwidth
needed for BPSK modulation.
This is very important in wireless communications and is a major reason
why QPSK is widely favoured in digital satellite communications and other
terrestrial systems.
Thank You

You might also like