0% found this document useful (0 votes)
27 views24 pages

ch3 Digital Modulation Schemes

This document discusses digital modulation schemes used to transmit digital data over communication channels. It introduces memoryless modulation where the current signal only depends on the current input bits, and modulation with memory where the signal depends on current and past input bits. It describes several common modulation techniques including: - Pulse amplitude modulation (PAM) which varies the amplitude of a pulse to represent data. - Phase-shift keying (PSK) which encodes data in the phase of a carrier signal. - Quadrature amplitude modulation (QAM) which combines PAM and PSK to represent data by changing the amplitude and phase of two carrier signals. The document explains how to represent these modulation schemes mathematically and visually

Uploaded by

Hoàng Zio
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
0% found this document useful (0 votes)
27 views24 pages

ch3 Digital Modulation Schemes

This document discusses digital modulation schemes used to transmit digital data over communication channels. It introduces memoryless modulation where the current signal only depends on the current input bits, and modulation with memory where the signal depends on current and past input bits. It describes several common modulation techniques including: - Pulse amplitude modulation (PAM) which varies the amplitude of a pulse to represent data. - Phase-shift keying (PSK) which encodes data in the phase of a carrier signal. - Quadrature amplitude modulation (QAM) which combines PAM and PSK to represent data by changing the amplitude and phase of two carrier signals. The document explains how to represent these modulation schemes mathematically and visually

Uploaded by

Hoàng Zio
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/ 24

Communications Engineering

Chapter 3
Digital Modulation Schemes
Thái Truyển Đại Chấn
Introduction
• Generate a signal that
• Represents the binary data stream
• Matches the characteristics of the channel
• Bandwidth should match the bandwidth of the channel
• Be able to resist the impairments caused by the channel
• Noise, attenuation, distortion, fading, and interference
• Digital modulation/digital signaling
• The process of mapping a digital sequence to signals for transmission over a
communication channel
• Usually, the transmitted signals are bandpass signals
3.1 Representation of Digitally Modulated Signals
• Memoryless modulation
• Modulation schemes with memory
3.1 Representation of Digitally Modulated Signals
• Memoryless modulation
• Regardless of the previously transmitted signals

• Mapping from M = 2k messages to M possible signals


• In every Ts seconds, where Ts is called the signaling interval
Finite-state machine (FSM)
• Finite-state automaton/finite automaton/state machine,
• A mathematical model of computation.
• Can be in exactly one of a finite number of states at any given time.
• Can change from one state to another in response to some inputs (transition)
• Defined by

• a list of its states,


• its initial state,
• the inputs that trigger each transition.
A turnstile
3.1 Representation of Digitally Modulated Signals
• Modulation scheme with memory
• Mapping is from the set of the current k bits and the past (L − 1)k bits to the set of possible
M = 2k messages

Finite-state machine with 2(L−1)k states Current state

Output Current input

New state

• Parameter L is called the constraint length of modulation


• L = 1  memoryless modulation scheme
3.2 Memoryless Modulation Methods
• Every signaling interval (Ts seconds), transmit signal sm(t)
• The signaling rate (symbol rate) is

• The bit interval

• The bit rate

• The energy content of sm(t) is denoted by Em


• The average signal energy
3.2–1 Pulse Amplitude Modulation (PAM)
• Waveforms:

where p(t) is a pulse of duration T and

• Constellation for PAM signaling


2.2–2 Signal Space Concepts (Review)
• Inner product:
• Orthogonal if their inner product is zero.
• Norm (Ex is the energy in x(t))
• Other properties as in a vector space:
(orthonormal, linearly independent, triangle inequality, and Cauchy–Schwarz inequality)
3.2–1 Pulse Amplitude Modulation (PAM)
• The energy in signal sm(t)
3.2–1 Pulse Amplitude Modulation (PAM)
• With carrier modulation
3.2–1 Pulse Amplitude Modulation (PAM)
cos2𝑥 + 1
• PAM signals are one-dimensional (N = 1) cos 2 𝑥 =
2
• The unit-energy signal φ(t)
• General PAM signal of the form sm(t) = Am p(t)

• Bandpass PAM signal of the form


3.2–1 Pulse Amplitude Modulation (PAM)
• One-dimensional vector representations

• The Euclidean distance between any pair of signal points

For adjacent signal points |Am − An| = 2

The minimum distance of the constellation


3.2–1 Pulse Amplitude Modulation (PAM)
• Example of baseband and carrier-
modulated PAM signals
3.2–1 Pulse Amplitude Modulation (PAM)
• M = 2, s1(t) = −s2(t)
• Same energy and ρ = −1  antipodal
• This case: binary antipodal signaling
3.2–2 Phase Modulation
• Signal space diagrams for BPSK, QPSK, and 8-PSK.
3.2–3 Quadrature Amplitude Modulation
3.2–3 Quadrature Amplitude Modulation
• Orthonormal basis for expansion of QAM
signals (similar to the PSK case)
• The dimensionality of the signal space for QAM
is N = 2
• Vector representations
3.2–3 Quadrature Amplitude Modulation
• Examples of combined PAM-PSK constellations
3.2–3 Quadrature Amplitude Modulation

• The Euclidean distance between any pair of


signal vectors in QAM is
3.2–3 Quadrature Amplitude Modulation
• In the special case where the signal amplitudes
take the set of discrete values {(2m − 1 − M), m =
1, 2, . . . , M}
3.2–3 Quadrature Amplitude Modulation
• The amplitudes are ±1, ±3, . . . , ±(M−1) and the QAM signaling has a rectangular
constellation
Exercises
• 3.1-3.7
• 3.10
π/4-QPSK (Exercise 3.3)

You might also like