Semester: 1st (M.

Tech)
Module: Digital Communication

Faculty: Dr. Sourav Kundu

Dept. of Electronics and Telecommunication Engineering
IIEST Shibpur
Howrah, West Bengal
• In baseband digital data transmission, the incoming data stream is represented in the form of a
discrete pulse modulated wave that can be transmitted over a low-pass channel (e.g., a coaxial
cable).

• What if the requirement is to transmit the data stream over a band-pass channel, i.e. by wireless
and satellite channels?

• In applications of this kind, we use a modulation strategy configured around a sinusoidal carrier
whose amplitude, phase, or frequency is varied in accordance with the information-bearing digital
data stream.

• In digital modulation the amplitude, phase, frequency of the sinusoidal carrier is changed according
to the digital data stream.

• Due to discrete steps in digital data stream, the modulation of carrier is also done in discrete steps, its
also called switching or signalling.
 Coherent Digital Modulation Technique:

• For detection, the local carrier is generated at receiver end must phase locked with carrier of the transmitter.
• Also called synchronous detection.
• Error probability is less.

 Non-coherent Digital Modulation Technique:

• The receiver does not need the local carrier to phase locked with carrier of the transmitter.
• Major advantage is it simplicity.
• But the error probability is high compared to synchronous detection.
Given a binary source that emits symbols 0 and 1, the modulation process involves switching or keying the
amplitude, phase, or frequency of a sinusoidal carrier wave between a pair of possible values in accordance with
symbols 0 and 1.

𝐴𝑐 is the carrier amplitude, 𝑓𝑐 is the carrier frequency, and 𝜑𝑐 is the carrier phase. Given these three
parameters of the carrier 𝑐 𝑡 .

1. Binary amplitude shift-keying (BASK): in which the carrier frequency and carrier phase are both
maintained constant, while the carrier amplitude is keyed between the two possible values used to represent
symbols 0 and 1.

2. Binary phase-shift keying (BPSK): in which the carrier amplitude and carrier frequency are both
maintained constant, while the carrier phase is keyed between the two possible values (e.g., 0° and 180°)
used to represent symbols 0 and 1.

3. Binary frequency-shift keying (BFSK): in which the carrier amplitude and carrier phase are both
maintained constant, while the carrier frequency is keyed between the two possible values used to represent
symbols 0 and 1
In digital communications, the usual practice is to assume that the carrier 𝑐(𝑡) has unit energy measured over
one symbol (bit) duration

Consider a linear modulation scheme for which the modulated wave is defined by
 The transmitted signal
energy per bit as

The transmitted signal energy (on a per bit basis) is a scaled version of the energy in the incoming binary wave
responsible for modulating the sinusoidal carrier.
When a bit duration is occupied by symbol 1, the transmitted signal energy is 𝐸𝑏 . When the bit duration is
occupied by symbol 0, the transmitted signal energy is zero.
On this basis, we may express the average transmitted signal energy as:
Signal Space Diagram (Constellation Diagram) of ASK:

2
𝑠 𝑡 = 𝐸𝑏 cos 2π𝑓𝑐 𝑡
𝑇𝑏
𝑠 𝑡 = 𝐸𝑏 𝜑1 (𝑡)

The distance (decision margin) between two symbols: 𝑑 = 𝐸𝑏

Decision Boundary: 𝐸𝑏 /2
PSD of ASK Signal:
𝑆 𝑡 = 𝑏 𝑡 𝐶𝑜𝑠 2𝜋𝑓𝑐 𝑡 + 𝜃
1
𝑆𝑠 𝑓 = 𝑆𝐵 𝑓 − 𝑓𝑐 + 𝑆𝐵 𝑓 + 𝑓𝑐
4

PSD of Unipolar NRZ binary data lebel (0, 𝐸𝑏 )

𝑎2 2
𝑇𝑏 2𝐸𝑏
𝑆𝐵 𝑓 = 𝛿 𝑓 + 𝑎 𝑆𝑖𝑛𝑐 2 𝑓𝑇𝑏 𝑎=
4 4 𝑇𝑏
PSD of ASK Signal:

• The proper spectrum of ASK signal shows an infinite amount of BW. However, 95% of the total
power consists on the first lobe, cantered at fc.

2
• In practical application, the practical ASK signal is considered with BW 𝐻𝑧.
𝑇𝑏
Generation of ASK Signal:
Detection of ASK Signal:

• Coherent detection: Synchronous detection

• Non-coherent detection: Envelope Detection

Signal Space Diagram (Constellation Diagram) of BPSK:

2
𝑠 𝑡 = ± 𝐸𝑏 cos 2π𝑓𝑐 𝑡
𝑇𝑏

𝑠 𝑡 = ± 𝐸𝑏 𝜑1 (𝑡)

The distance (decision margin) between two symbols: 𝑑 = 2 𝐸𝑏

Decision Boundary: 0
Generation of BPSK Signal:
Coherent Detection of BPSK Signal:
PSD of BPSK Signal:
 1
• For baseband signal 𝑓𝑏 = , then the maximum frequency of the baseband signal is 𝑓𝑏 .
𝑇𝑏

• In BPSK signal the main lobe is centred at 𝑓𝑐 , spread up-to the frequency 𝑓𝑐 − 𝑓𝑏 𝑡𝑜 𝑓𝑐 + 𝑓𝑏 .

• Therefore, the BW of BPSK signal is = (𝑓𝑐 +𝑓𝑏 ) − 𝑓𝑐 − 𝑓𝑏

= 2𝑓𝑏

• The minimum BW of BPSK signal is equals to twice of the maximum frequency of the baseband signal.
Signal Space Diagram (Constellation Diagram) of BFSK:
PSD of BFSK Signal:

The above expression is similar like two BPSK signals ( 2𝑃𝑠 𝑏 𝑡 𝑐𝑜𝑠𝑤0 𝑡) with only difference for BPSK 𝑏 𝑡
is bipolar changes from -1 to +1, but here 𝑝𝐻 and 𝑝𝐿 are unipolar changes with 1 and 0.

𝑝𝐻 and 𝑝𝐿 can be expressed in term of 𝑝𝐻′ 𝑎𝑛𝑑𝑝𝐿′ which are bipolar alternating between -1 to +1
PSD of BFSK Signal:
Generation of BFSK Signal:
Detection of BFSK Signal:

• Non-coherent detection
• Coherent detection
• Major concern in digital communication:
• Transmission power
• Channel bandwidth

• Channel BW depends on bit rate or signalling rate.

• Thus if two or more bits are combined in some symbol so signalling rate will be reduced, which results in
reduction of required bandwidth.

• In QPSK two successive bits in the sequence are grouped together, this reduces bit rate and reduced the
bandwidth requirement.

• In QPSK as with BPSK, information carried by the transmitted signal is contained in the phase of a sinusoidal
𝜋
carrier. In particular, the phase of the sinusoidal carrier takes on one of four equally spaced values, such as ,
4
3𝜋 5𝜋 7𝜋
, , .
4 4 4
GENERATION OF QPSK SIGNALS

• To generate the QPSK signal, the incoming binary

data stream is first converted into polar form by a
non-return-to-zero level encoder. The encoder
output is denoted by b(t).

• The resulting binary wave is next divided by means

of a demultiplexer (consisting of a serial-to-parallel
converter) into two separate binary waves
consisting of the odd- and even numbered input bits
of b(t). These two binary waves, referred to as the
demultiplexed components of the input binary
wave.

• The demultiplexed binary waves a1(t) and a2(t) are

used to modulate the pair of quadrature carriers.

• Finally, the two BPSK signals are summed to

produce the desired QPSK signals.
Detection of QPSK Signal
Signal Space Diagram (Constellation Diagram) of QPSK:

• The distance (decision margin) between two

symbols: 𝑑 = 2 𝐸𝑏

• Distance for QPSK is same like as BPSK, So QPSK

as same noise immune capability like BPSK.
•
Bandwidth of QPSK Signal

• PSD of QPSK can be derived according to PSD of PSK modulation.

• Bandwidth requirement = Width of the main lobe

1
=2∗ 𝑇𝑠 𝑖𝑠 𝑡ℎ𝑒 𝑆𝑦𝑚𝑏𝑜𝑙 𝑑𝑢𝑟𝑎𝑡𝑖𝑜𝑛
𝑇𝑠
1
= 2∗ 𝑇𝑏 𝑖𝑠 𝑡ℎ𝑒 𝑏𝑖𝑡 𝑑𝑢𝑟𝑎𝑡𝑖𝑜𝑛
2∗𝑇𝑏
1
= 𝑇𝑠 = 2𝑇𝑏 , 2 𝑏𝑖𝑡𝑠 𝑎𝑟𝑒 𝑔𝑟𝑜𝑢𝑝𝑒𝑑 𝑖𝑛𝑡𝑜 1 𝑠𝑦𝑚𝑏𝑜𝑙
𝑇𝑏
= 𝑓𝑏

2𝑓𝑏
• For general M-PSK (𝑀 = 2𝑁 ) the BW =
𝑁

• For increment of the M value the BW requirement of M-PSK signal is reduced but the distance of the
symbols are also decreases which increases the probability of error.
• Spread data over wide bandwidth
• Makes jamming and interception harder for unwanted users

1. Direct Sequence Spread Spectrum (DSSS)

• Each bit is represented by multiple bits in transmitted signal
• Chipping code (PN sequence)

2. Frequency hoping Spread Spectrum (FHSS)

• Signal broadcast over seemingly random series of frequencies

36
 Direct Sequence Spread Spectrum (DSSS)
• Each bit represented by multiple bits using spreading code

• Spreading code spreads signal across wider frequency band

37
Transmitter Receiver
38
 Pseudorandom Numbers

• Generated by algorithm using initial seed

• Deterministic algorithm
• Not actually random
• If algorithm good, results pass reasonable tests of
randomness
LFSR to generate PN sequence
• Need to know algorithm and seed to predict sequence
 Frequency hoping Spread Spectrum (FHSS)

• Signal broadcast over seemingly random

series of frequencies

• Receiver hops between frequencies in sync

with transmitter

• Jamming on one frequency affects only a

few bits

• Eavesdroppers can’t jam the entire

information

• Typically 2k carriers frequencies forming 2k

channels

Data Communication and Computer Networks 1303330 40

FHSS Reception

Transmitter Receiver

Data Communication and Computer Networks 1303330 41

Slow and Fast FHSS
• Frequency shifted every Tc seconds
• Duration of signal element (symbol duration) is Ts seconds
• Slow FHSS has Tc  Ts
• Fast FHSS has Tc < Ts
• Generally fast FHSS gives improved performance in noise (or jamming)