Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
2 t
φ1 (t ) = cos(2πf c t )rect
T T
However, we could just as well have used the orthogonal basis function
2 t
φ 2 (t ) = sin( 2πf c t )rect
T T
Essentially QPSK can be construed as two superimposed BPSK channels, one operating
with φ1(t) and the other with φ2(t). Consequently we have an alphabet of 4 possible
signals given by
The table below gives a possible Grey coding of the QPSK signals
i Input bit Phase of QPSK signal (deg) si1 si2
1 10 45 c c
2 00 135 -c c
3 01 -135 -c -c
4 11 -45 c -c
E
where c = . The constellation points are as shown below:
2
s2 s1
c
s1(t)
c
-c
s3 -c s4
integrate
X bit1
x1
x(t) φ 1 (t)
integrate
X bit2
x2
φ 2 (t)
T T
x1 = ∫ x(t )φ1 (t )dt and x 2 = ∫ x(t )φ 2 (t )dt
0 0
To calculate the BER the QPSK scheme is construed as two BPSK channels
superimposed. Since these channels are orthogonal to each other and do not mutually
interfere, the BER is simply the same as that of the BPSK scheme as
2 Eb
Pe = Q
N0
As QPSK consists of two BPSK channels a symbol error occurs if either BPSK channel
has a bit error. Hence
2 Eb
Pe = 2Q = 2Q E
N
N0 0
This is accurate provided that the BER is small. However, we have double accounted for
the probability that both BPSK channels are in error. Hence we have to subtract
to account for the probability of such an event. Hence the exact Pe is given by
2
2 Eb 2 Eb
Pe = 2Q − Q
N N
0 0
The initial estimate of twice the probability of bit error is known to larger than the actual
probability of error. Hence it is an upper bound to the probability of error. As the
probability of error is determined by the union of two independent probability events this
type of bound is called a union bound.
We could also have calculated the probability of symbol error directly by saying that:
Pe = 1 – Pc
Where Pc is the probability that the symbol is correctly decoded. Pc implies that both bits
are decoded correctly as
Pc = (probability that channel 1 bit is correct) & (probability that channel 2 bit is correct)
Since the noise on the two channels is independent
Pc = (probability that channel 1 bit is correct) x (probability that channel 2 bit is correct)
Hence
2 2
2 Eb 2 Eb 2 Eb
Pe = 1 − 1 − Q = 2Q − Q
N N N
0 0 0
PSD of QPSK
Gx ( f ) =
1
2
(
sin c(( f − f c )T ) 2 + sin c(( f + f c )T ) 2 )
Offset QPSK
transitions
through
envelope origin
of QPSK
signal
0 T 2T 3T t
If the transmitter power amplifier was perfectly linear then such a fluctuating evelope
modulus would not be an issue. However, practical amplifiers are not that linear at their
most efficient operating levels and hence intermodulation distortion will occur. The
consequences of 3rd order intermodulation distortion is a spreading of the PSD which
causes interference in the adjacent bands.
To minimize the effects of the transmitter nonlinearities, an attempt is made to make the
modulation as constant modulus as possible. One possibility is to insist that the state only
shift 90 degrees every bit period as illustrated below. However, this defeats the main
purpose of QPSK which achieves 2 bits per symbol instead of just one.
s1(t)
A better alternative is to use Offset QPSK or OQPSK. In OQPSK we delay the BPSK
modulation of the quadrature channel by T/2. Hence we have two basis functions
2 t 2 t 1
φ1 (t ) = cos(2πf c t )rect and φ 2 (t ) = sin(2πf c t )rect −
T T T T 2
Note that the OQPSK can still be considered as two independent BPSK channels as
before. The only difference is that now the second BPSK channel is delayed by half a
I channel
Q channel
envelope
of
OQPSK
0 T 2T t
To ensure that the two basis functions remain orthogonal, it is necessary that T/2
represent an integer number of half cycles of the carrier frequency fc. Hence
Tf c ∈ int
Note that because both BPSK channels of the OQPSK modulation are independent and
use the same pulse shaping function, the PSD of the transmitted signal is the same as with
QPSK which as discussed is the same as BPSK.
Find the PSD of an offset QPSK signal produced by a random binary sequence in which
symbols 1 and –1 are equally likely and the adjacent symbols are statistically
independent.
S v ( f ) = T sin c 2 ( fT )
Hence as the I and Q channels are independent we have the total PSD of
S v ( f ) = 2T sin c 2 ( fT )
S ( f ) = 12 S v ( f − f c ) + 12 S v ( f + f c )
S ( f ) = T2 sin c 2 (T ( f − f c )) + T2 sin c 2 (T ( f + f c ))
S ( f ) = Eb sin c 2 (T ( f − f c )) + Eb sin c 2 (T ( f + f c ))
Next with OQPSK we can consider this as two NRZ BPSK channels as in QPSK except
that the I channel is delayed with respect to the Q channel by T/2. As I and Q are still
orthogonal, S(f) remains the same as for QPSK.
Example
Suppose we have a quadrature modulation scheme where the I and Q channels can be
construed as being modulated independently by an arbitrary 1D modulation scheme.
Assume that
The probability of overall correct symbol detection is the probability that the I channel is
correctly decoded and that the q channel is decoded correctly. As the I and Q
modulation schemes are independent we have
Normally we can assume that PeI PeQ is very small such that
Ps ≈ PeI + PeQ