UNIT – 4

Pass Band Data Transmission

All the contents are taken from “Communication systems”, 4th edition,
Simon Haykin.
Pass Band Data Transmission:
Base band Vs Pass Band

• Communication channels in case of pass band transmissions can be microwave radio link, satellite channel etc.

• In pass band, the incoming data stream is modulated on to carrier with fixed frequency limits imposed by a band
pass channel of interest.

• The modulation process involves switching or keying of amplitude, frequency or phase of a sinusoidal carrier in
some fashion in accordance with the incoming data.

Three signalling schemes are possible, ASK, PSK and FSK.

Note:

• Although in continuous-wave modulation it is usually difficult to distinguish between phase-modulated and

frequency-modulated signals by merely looking at their waveforms, this is not true for PSK and FSK signals.

• Unlike ASK signals, both PSK and FSK signals have a constant envelope.
Pass Band Data Transmission:
Pass band transmission model:
Description of Passband data transmission system:
In an M-ary Signalling scheme we may send any one of M possible signals during each signalling interval of
duration T.
Transmitter:
The M-ary output of the message source is presented to a signal transmission encoder, producing a corresponding
vector si made up of N real elements. with the vector si as input, the modulator then constructs a distinct signal
si(t) of duration T seconds as the representation of the symbol mi generated by the message source. The signal si(t)
is necessarily an energy signal.
Channel:
The channel assumptions are same as that of Unit –III,
• It is linear, with a bandwidth that is wide enough to accommodate the transmission of the modulated
signal with negligible or no distortion.
• The channel noise is the sample function of a white Gaussian noise process of zero mean and power
spectral density N0/2.
Receiver:
The receiver, which consists of a detector followed by a signal transmission decoder, performs two functions:
• It reverses the operations performed in the transmitter.
• It minimizes the effect of channel noise on the estimate 𝒎 computed for the transmitted symbol mi.
Binary PSK:
In a coherent binary PSK system, the pair of signals s1(t) and s2(t) used to represent
binary symbols 1 and 0, respectively, is defined by

Where, 0 <= t < Tb, Eb is the transmitted

signal energy per bit.

To ensure that each transmitted bit contains an integral number of cycles of the carrier wave, the carrier
frequency fc is taken as n/Tb. n = integer

From the above equations it is clear that only one orthonormal basis function exist and is given as
We may express the transmitted signals in terms of orthonormal basis function as ,

Signal-space diagram:
The coordinates of the message points is given as

The BPSK shown in previous signal space diagram has minimum average energy.
Error probability of Binary PSK:

Two types of erroneous decisions may be made. One, s2(t) is transmitted but decided in favour of s1(t). Similarly, s1(t) is
transmitted but decided in favour of s2(t).

To calculate Pe for first kind, the decision region associated with s1(t) is taken as

Where the observable element x1 is related to the received signal x(t) by

Error probability of Binary PSK:

Let us consider

then

Where, erfc() is the

complementary error function
Error probability of Binary PSK:
Similarly, P01 is also obtained and it is same as p10

So the final average probability of symbol error/ BER is given as

Generation and Detection of Binary PSK:
The signal transmission encoding is performed by a Polar NRZ level encoder. fc=n/Tb
QPSK:

QPSK is a bandwidth conserving modulation scheme known as coherent quadriphase shift keying. Here also
information carried by the transmitted signal is contained in the phase, with four equally spaced values.

Each possible phase value corresponds to a unique dibit. We may choose the phase based on gray encoded set
of dibits where only a single bit is changed from one dibit to the next.

Signal space diagram of QPSK:

Signal space diagram of
QPSK - Cartesian
QPSK:

The message points and the associated signal vectors are defined by
QPSK Example:
The sequence 01101000 can
be divided in to even and
odd sequences.

Finally, the QPSK can be

obtained by adding the
respective BPSKs of these
even and odd bits as shown

Error probability of QPSK:
In Coherent QPSK, the received signal is defined by
Error probability of QPSK:

Since, QPSK can be thought as two BPSK working in parallel then the channel output x1 and x2 can be
thought as two coherent binary psk systems.

Considering, The signal energy per bit is E/2

The noise spectral density is No /2

So, the average probability of bit error in each channel is

Error probability of QPSK:
Accordingly, the average probability of a correct decision resulting from the combined action of the two channels is

The average probability of symbol error for coherent QPSK is

If the E/2N0 >> 1 then we get the Pe as

Error probability of QPSK:
Since, the QPSK is having two bits per symbol the transmitted signal energy per symbol is twice the signal
energy

Thus expressing the average probability of symbol error in terms of the ratio Eb/N0 is given as

Finally, the bit error rate of QPSK is given as

QPSK Generation and Detection:
M-ary PSK:
In M-ary PSK the phase of the carrier takes on one of M possible values,

Below is one such possible signal,

So, each signal can be extended in terms of two basis functions ф1 (t) and ф2 (t). The signal constellation is therefore two
dimensional.

Now, we will understand the signal constellation, calculation of Pe and PSD with the help of 8 PSK or Octa phase shift
keying (M=8).
Signal space diagram
Probability of error:
In calculating the probability of error for M-ary PSK we will use results from union bound concept. If the signal –space
diagram is circularly symmetric the the Pe is given as below,

Suppose that the ratio of E/N0 is large enough then the two neighbour hood points for each message point are the potential
candidates for being mistaken as required message point due to channel noise.

Let us consider m1 is the message point transmitted then at the receiver the nearest message points are m2 and m8. So,
to further simplify the probability of error we consider only these points and the distance value is given as

By substituting the distance value in

Above equation we get the Pe as,
Power Spectral Density:
The symbol duration of M-ary PSK is defined as

T = Tb log2 M

Since we are considering the base band power spectral density the PSD is given as,
Power Spectral Density:
Bandwidth efficiency:
Let us consider the following terms

The bandwidth efficiency is given as

BFSK – Coherent frequency shift keying:
Both PSK and QAM are the examples of linear modulation. FSK is the example of nonlinear modulation.

In BFSK, the symbols 0 and 1 are distinguished from each other by transmitting one of two sinusoidal waves that differ in
frequency by a fixed amount.

The transmitted frequency is given as 6.87

This FSK is also called as sunde's FSK and it is an example of continuous phase frequency shift keying.
BFSK – Coherent frequency shift keying:
Since the signals in BFSK are orthogonal we can write the orthonormal basis functions as given below,

unlike BPSK, BFSK system is having two dimensional signal space and the two message points are given as
BFSK – Signal space diagram:
Error Probability of BFSK:

The observation vector x has two elements x1 and x2.

where x(t) is the combination of signal transmitted and noise

The observation space as given in fig shown in previous slide is partitioned into two decision regions. The
receiver decides in favor of symbol 1 if the received signal point represented by the observation vector x falls
inside region Z1. This occurs when x1 > x2. similarly it is true for symbol 0.

Now define a new Gaussian random variable whose sample value is equal to the difference between x1 and x2
Error Probability of BFSK:

y = x1 - x2

The mean of the random variable y depends on which symbol is getting transmitted. Given that symbol-1 was
transmitted then the mean values of random variables X1 and X2 is given as and zero.

correspondingly the conditional mean of the random variable Y, given as

similarly, when symbol-0 is transmitted the mean values are equal to zero and
correspondingly the conditional mean is given as
Error Probability of BFSK:

Since the random variables are statistically independent the variance is of each random variable is equal to
N0/2.

suppose that symbol 0 is transmitted the conditional probability density function of the random variable Y is
then given by

as we know that x1>x2 is equivalent to y>0 which corresponds to the receiver making decision in favor of
symbol 1, we deduce that the conditional probability or error given that symbol 0 was transmitted is
Error Probability of BFSK:

now the above equation can be represented using erfc as shown below,

Similarly, we also achieve p10. and the average probability of bit error is given as
Generation and Detection of BFSK signals:

Transmitter (Tx)
Generation and Detection of BFSK signals:

Receiver (Rx)
Comparison of Digital modulation schemes using a single carrier:

• The comparison is done with respect to two points

• Probability of error / BER
• Bandwidth efficiency of M-ary Digital Modulation Techniques

Probability of error:
Important takeaways from the above graph:

• The curves have similar shape in the form of a waterfall.

• For any value of Eb /N0 BPSK, QPSK and MSK produce a smaller bit error rate than any of
the other modulation schemes.

• To realize same BER, coherent BPSK require 3dB less when compared with coherent
BFSK.

• In QPSK, two orthogonal carriers are used where the carrier frequency fc is an integer
multiple of the symbol rate 1/T, with this two independent bit streams can be transmitted
simultaneously and subsequently detected in the receiver.
Bandwidth efficiency of M-ary digital modulation techniques:

• The table 6.9 shows the power – bandwidth requirements of M-ary PSK schemes with
respect to binary PSK. Here, we assumed an average probability of symbol error equal
to 10-4 .

• One can see that the QPSK is showing best trade – off between power and bandwidth
requirements.

• The power required is excessive for M>8 schemes and also the receiver requires
complex equipment than BPSK.

• For a fixed probability of error, as M increases, M ary FSK schemes require reduced power
requirements. However, the bandwidth required will increase. This behaviour is opposite to
that of M-ary PSK.