0% found this document useful (0 votes)
8 views

communication theory

The document covers the fundamentals of digital communication, including analog-to-digital conversion, digital modulation techniques, and communication link analysis. It discusses the importance of digital communication systems, their classification into baseband and passband systems, and the principles of sampling theory. Additionally, it addresses multiplexing and multiple access methods such as FDMA, TDMA, and CDMA.

Uploaded by

magicnft8
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)
8 views

communication theory

The document covers the fundamentals of digital communication, including analog-to-digital conversion, digital modulation techniques, and communication link analysis. It discusses the importance of digital communication systems, their classification into baseband and passband systems, and the principles of sampling theory. Additionally, it addresses multiplexing and multiple access methods such as FDMA, TDMA, and CDMA.

Uploaded by

magicnft8
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/ 33

Digital Communication Theory

COEC 324

Chapter 1
Introduction to digital communication
1 Analog-to-Digital Conversion
a. sampling theorem
b. Ideal sampling
c. Practical Sampling
d. Quantization
e. Pulse Code Modulation
f. Differential Pulse code Modulation (DPCM)
g. Adaptive Differential PCM (ADPCM)
h. Delta Modulation
i. PCM Waveform Types

Baseband Digital Transmission


Content 2
a.
b.
c.
The Matched Filter
Baseband Communications System
Signals and Noise
d. Simple detectors
e. Matched Filter
f. Signal Space Representation
g. Optimal Receiver

3 Digital Modulation
a. Amplitude Shift Keying (ASK)
b. Phase Shift Keying (PSK)
c. Quadrature Amplitude Modulation (QAM)
d. Binary Frequency-Shift Keying (BFSK)

4 COMMUNICATIONS LINK ANALYSIS


a. The Channel
b. Link Budget Analysis
c. Noise Figure, Noise Temperature, and System Temperature

5 MULTIPLEXING AND MULTIPLE ACCESS


a. FDMA, TDMA
b. CDMA
c. OFDMA
Introduction to
Digital Communication
Introduction to digital communication

5
Introduction to Digital Communication
• Communications is the Process of Transmitting Information from a Source to a Destination

Source Destination

▪ Example of typical communication systems


1. Wire-line telephone
2. Cellular phone
3. TV broadcasting system
4. Wireless computer network
5. Satellite communications.

6
Introduction to Digital Communication
➢ Why Digital Communication?

▪ Easy to regenerate the distorted signal (repeaters)

▪ Digital hardware is more flexible

▪ Digital multiplexing techniques

▪ Encryption and privacy techniques are easier to implement

7
Introduction to Digital Communication
Input signal output signal Message
Message
Transducer Transducer

8
Baseband vs. Passband Communication Systems
▪ Communication systems can be classified into two groups depending on the range of frequencies they use to
transmit information. These communication systems are classified into BASEBAND or PASSBAND system.
Baseband transmission sends the information signal as it is without modulation (without frequency shifting) while
passband transmission shifts the signal to be transmitted in frequency to a higher frequency and then transmits
it, where at the receiver the signal is shifted back to its original frequency.

▪ Almost all sources of information generate baseband signals. Baseband signals are those that have frequencies
relatively close to zero such as the human voice (20 Hz – 5 kHz) and the video signal from a TV camera (0 Hz –
5.5 MHz). A plot of an audio signal and its frequency spectrum are shown below, where it is seen that the most of
the power of the audio signal is concentrated in the frequency range from (0 – 4 kHz)
Digital Modulation

How to choose proper digital waveforms to “carry” the digits?


Introduction to Digital Communication
Digital
Source Destination
Transformation
(Analog Signal) (Analog Signal)
system

13
Sampling Theory
Analog-to-Digital Conversion
➢ The digital signal is discrete in time (Sampling) and limited number of values (Quantization)

15
Analog-to-Digital Conversion
Sampling Theory
the band-limited 𝑓0 Hz lowpass analog signal
𝐺 𝑓 = 0, 𝑖𝑛 𝑐𝑎𝑠𝑒 𝑜𝑓 𝑓 > 𝑓0
that has been sampling can be reconstructed exactly (without any error) from infinite
sequence of samples. If the sampling rate (at least) 2𝑓0 samples per seconds

16
Sampling Theory

𝑥(𝑡)
𝑥(𝑡) 𝑥𝑠 (𝑡)
1
𝑓𝑠 =
𝑠(𝑡) 𝑇𝑠
Sampling frequency 𝑓𝑠
𝑇𝑠

𝑥𝑠 𝑡

17
Sampling Theory
𝑥(𝑡) 𝑥𝑠 𝑡 = 𝑥 𝑡 𝑠(𝑡)

𝑠(𝑡)
𝑇𝑠
𝑠(𝑡) = ෍ 𝛿(𝑡 − 𝑛𝑇𝑠 )
𝑛=−∞

𝑥𝑠 𝑡
We want to get the Fourier transform of 𝑥𝑠 𝑡

𝑋𝑠 𝑓 = 𝑋 𝑓 ∗ 𝑆(𝑓)
this method more complex

18
Sampling Theory
𝑥𝑠 𝑡 = 𝑥 𝑡 𝑠(𝑡)
𝑥(𝑡)

𝑠(𝑡) 𝑠(𝑡) = ෍ 𝛿(𝑡 − 𝑛𝑇𝑠 )
𝑇𝑠 𝑛=−∞

Because the impulse train 𝑠 𝑡 is a periodic signal of perio 𝑇𝑠 , so


𝑥𝑠 𝑡 it can be expressed as as expontially Fourier seires

1
𝐷𝑛 = න 𝑠(𝑡)𝑒 −𝑗𝑛𝜔𝑠 𝑡 𝑑𝑡
𝑇𝑠
𝑇𝑠
19
Sampling Theory
𝑥𝑠 𝑡 = 𝑥 𝑡 𝑠(𝑡)
𝑥(𝑡) ∞

𝑠(𝑡) 𝑠(𝑡) = ෍ 𝛿(𝑡 − 𝑛𝑇𝑠 )


𝑇𝑠 𝑛=−∞

𝑥𝑠 𝑡 𝑇𝑠 𝑇𝑠
2 2
1 −𝑗𝑛𝜔 𝑡
1
𝐷𝑛 = න𝑠 𝑡 𝑒 𝑠 𝑑𝑡 = න 𝛿(𝑡)𝑒 −𝑗𝑛𝜔𝑠 𝑡 𝑑𝑡
𝑇𝑠 𝑇𝑠
𝑇 𝑇
− 2𝑠 − 2𝑠
𝛿 𝑡 𝑥 𝑡 =𝛿 0 𝑥 𝑡
1
න𝛿 𝑡 𝑥 𝑡 = 𝑥 0 𝐷𝑛 = = 𝑓𝑠
20
𝑇𝑠
Sampling Theory
𝑥𝑠 𝑡 = 𝑥 𝑡 𝑠(𝑡)
𝑥(𝑡) ∞

𝑠(𝑡) 𝑠(𝑡) = ෍ 𝛿(𝑡 − 𝑛𝑇𝑠 )


𝑇𝑠 𝑛=−∞

𝑥𝑠 𝑡
∞ ∞ ∞

𝑠 𝑡 = ෍ 𝛿 𝑡 − 𝑛𝑇𝑠 = ෍ 𝐷𝑛 𝑒 𝑗𝑛𝜔𝑠𝑡 = ෍ 𝑓𝑠 𝑒 𝑗𝑛𝜔𝑠𝑡


𝑛=−∞ 𝑛=−∞ 𝑛=−∞

∞ ∞

𝑥𝑠 𝑡 = 𝑥 𝑡 ෍ 𝛿 𝑡 − 𝑛𝑇𝑠 = ෍ 𝑥(𝑛𝑇𝑠 )𝛿(𝑡 − 𝑛𝑇𝑠 )


𝑛=−∞ 𝑛=−∞
21
Sampling Theory
𝑥𝑠 𝑡 = 𝑥 𝑡 𝑠(𝑡)
∞ ∞

𝑥𝑠 𝑡 = 𝑥 𝑡 ෍ 𝛿 𝑡 − 𝑛𝑇𝑠 = ෍ 𝑥(𝑛𝑇𝑠 )𝛿(𝑡 − 𝑛𝑇𝑠 )


𝑛=−∞ 𝑛=−∞

𝑠 𝑡 = ෍ 𝑓𝑠 𝑒 𝑗𝑛𝜔𝑠𝑡
𝑛=−∞
∞ ∞ ∞

𝑥𝑠 𝑡 = 𝑥 𝑡 ෍ 𝛿 𝑡 − 𝑛𝑇𝑠 = ෍ 𝑥(𝑛𝑇𝑠 )𝛿(𝑡 − 𝑛𝑇𝑠 ) = 𝑥(𝑡) ෍ 𝑓𝑠 𝑒 𝑗𝑛𝜔𝑠𝑡


𝑛=−∞ 𝑛=−∞ 𝑛=−∞

𝑥𝑠 𝑡 = 𝑓𝑠 ෍ 𝑥(𝑡) 𝑒 𝑗𝑛𝜔𝑠𝑡 Fourier Transformer of 𝑥𝑠 𝑡 ?


22 𝑛=−∞
Sampling Theory
𝑥(𝑡) Fourier Transformer of 𝑏𝑦 𝑓𝑟𝑒𝑞𝑢𝑒𝑛𝑐𝑦 𝑠ℎ𝑖𝑓𝑡𝑖𝑛𝑔

𝑠(𝑡) 𝑥𝑠 𝑡 = 𝑓𝑠 ෍ 𝑥(𝑡) 𝑒 𝑗𝑛𝜔𝑠𝑡
𝑇𝑠 𝑛=−∞

𝑥𝑠 𝑡 ∞

𝑋𝑠 𝑓 = 𝑓𝑠 ෍ 𝑋(𝑓 − 𝑛𝑓𝑠 )
𝑛=−∞

1
𝑇𝑠

23 −𝐵 𝐵 𝑓𝑠 − 𝐵 𝑓𝑠 𝑓𝑠 + 𝐵
Sampling Theory
𝑥(𝑡)
1
𝑠(𝑡) 𝑇𝑠
𝑇𝑠

𝑥𝑠 𝑡 −𝐵 𝐵 𝑓𝑠 − 𝐵 𝑓𝑠 𝑓𝑠 + 𝐵

𝐵 ≤ 𝑓𝑠 − B

2𝐵 ≤ 𝑓𝑠

Sampling Condition 𝑓𝑠 ≥ 2𝐵
24
Sampling Theory
Sampling Condition

If 𝑓𝑠 < 2𝐵

If 𝑓𝑠 = 2𝐵
Nyquist rate aliasing

25
Signal Reconstruction
𝑥(𝑡) 𝑓𝑠 ≥ 2𝐵
𝑠(𝑡)
𝑇𝑠
−𝐵 𝐵
𝑥𝑠 𝑡 𝑓𝑠 = 2𝐵

26
Signal Reconstruction

𝑋𝑠 𝑓 𝐻 𝑓 𝑋𝑟 𝑓
𝑥𝑠 𝑡 ℎ(𝑡) 𝑥𝑟 𝑡
𝑇𝑠 𝑓 <𝐵
𝐻 𝑓 =ቐ
0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
𝑓𝑖𝑛𝑑 𝑋𝑟 𝑓 ?
𝐻 𝑓 ∶ 𝑡ℎ𝑒 𝑡𝑟𝑎𝑛𝑠𝑓𝑒𝑟 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑓𝑜𝑟 𝑙𝑜𝑤 𝑝𝑎𝑠𝑠 𝑓𝑖𝑙𝑡𝑒𝑟
ℎ 𝑡 : 𝑡ℎ𝑒 𝑖𝑚𝑝𝑢𝑙𝑠𝑒 𝑟𝑒𝑠𝑝𝑜𝑛𝑐𝑒 𝑓𝑖𝑛𝑑 𝑥𝑟 𝑡 ?

27 𝑓𝑖𝑛𝑑 ℎ 𝑡 ?
Signal Reconstruction
𝑋𝑠 𝑓 𝐻 𝑓 𝑋𝑟 𝑓
𝑥𝑠 𝑡 ℎ(𝑡) 𝑥𝑟 𝑡 𝑋𝑟 𝑓 = 𝑋𝑠 𝑓 . 𝐻 𝑓

𝑗2𝜋𝑓𝑡
𝑥𝑟 𝑡 = 𝑥𝑠 𝑡 ∗ ℎ(𝑡)
ℎ 𝑡 = න𝐻 𝑓 𝑒 𝑑𝑓
−∞
𝑓𝑔

ℎ 𝑡 = න 𝑇𝑠 𝑒 𝑗2𝜋𝑓𝑡 𝑑𝑓
−𝑓𝑔

𝑒 𝑗2𝜋𝐵𝑡 − 𝑒 −𝑗2𝜋𝐵𝑡 2j sin 2𝜋𝐵𝑡 sin 2𝜋𝐵𝑡 sin 2𝜋𝐵𝑡


ℎ 𝑡 = 𝑇𝑠 = 𝑇𝑠 = 2𝑇𝑠 = 2𝑇𝑠 𝑓𝑔 = 2𝑇𝑠 𝐵 𝑠𝑖𝑛𝑐 2𝜋𝐵𝑡
𝑗2𝜋𝑡 𝑗2𝜋𝑡 2𝜋𝑡 2𝜋𝐵𝑡

28
Signal Reconstruction
ℎ 𝑡 =0
ℎ 𝑡 = 2𝑇𝑠 𝐵 𝑠𝑖𝑛𝑐 ( 2𝜋𝐵𝑡)
𝑠𝑖𝑛𝑐 (2𝜋𝐵𝑡) = 0
𝐴𝑠𝑠𝑢𝑚𝑖𝑛𝑔 𝑛𝑦𝑞𝑢𝑖𝑠𝑡 𝑠𝑚𝑎𝑝𝑙𝑖𝑛𝑔 𝑟𝑎𝑡𝑒, 2𝑇𝑠 𝐵 = 1 2𝜋𝐵𝑡 = ∓ 𝑛𝜋

2𝐵𝑡 = ∓ 𝑛

𝑛
𝑡= ∓
2𝐵

29
ℎ 𝑡 = 𝑠𝑖𝑛𝑐 ( 2𝜋𝐵𝑡)
Signal Reconstruction

𝑥𝑠 𝑡 = ෍ 𝑥(𝑛𝑇𝑠 )𝛿(𝑡 − 𝑛𝑇𝑠 ) ℎ 𝑡 = 2𝑇𝑠 𝐵 𝑠𝑖𝑛𝑐(2𝜋𝐵𝑡)


𝑛=−∞

𝑥𝑟 𝑡 = 𝑥𝑠 𝑡 ∗ ℎ(𝑡)

𝑥𝑟 𝑡 = ෍ 𝑥 𝑛𝑇𝑠 𝛿 𝑡 − 𝑛𝑇𝑠 ∗ ℎ(𝑡)


𝑛=−∞

𝑥𝑟 𝑡 = ෍ 𝑥 𝑛𝑇𝑠 ℎ 𝑡 − 𝑛𝑇𝑠
𝑛=−∞

𝑥𝑟 𝑡 = ෍ 𝑥 𝑛𝑇𝑠 𝑠𝑖𝑛𝑐 (2𝜋𝐵 (𝑡 − 𝑛𝑇𝑠 )


𝑛=−∞

30
Signal Reconstruction

𝑥𝑟 𝑡 = ෍ 𝑥 𝑛𝑇𝑠 𝑠𝑖𝑛𝑐 (2𝜋𝐵 (𝑡 − 𝑛𝑇𝑠 )


𝑛=−∞

31
Practical Sampling
Practical Signal Sampling

33

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy