Introduction - M

Unit 1: INTRODUCTION to ANALOG AND DIGITAL
DIGITAL
Same distance
Good Better audio quality
Ar
au ea o
dio f im
pe
rfo prov
ANALOG rm ed Same audio quality
AUDIO an
ce Better distance
QUALITY
Minimal
acceptable
audio quality
DIGITAL
Poor • Clearer signals
• Increased coverage
• Secure transmissions
SIGNAL • Robust equipment
Strong Weak
STRENGTH • Enhanced functionality
• Lots of choice
• Easy migration from
analog
Khoa Điện tử - Viễn thông Digital Communications and Coding

Trường Đại học Công nghệ, ĐHQGHN Truyền thông số và mã 1hóa
5G

Trường Đại học Công nghệ, ĐHQGHN 2 Truyền thông số và mã hóa
Introduction
1. The difference between analog and digital
transmission:
◼ Source
◼ Signal waveform
◼ System structure
2. The complete diagram of the digital transmission system
3. The contrast between time-domain and frequency-
domain of signal
4. Basic limits in digital communications

A communication system
➢Transmitter send signal through channel to Receiver.
Systems respond to signals and produce new signals
A communication system has an information signal plus noise signals
❖ The communication system exists to convey a message.
❖ Message comes from information source.
❖ Information forms: audio, video, text or data.
❖ Signal can be light, sound, or we focus on electrical signal.
Information
Information signal
signal
Analog
How? vs
Digital

2. Analog Transmission vs. Digital Transmission
Analog Digital
Source Any form: Natural voice, picture, Number, 1,0

video Alphabet: A,B
Waveform Infinite number of waveforms Finite number of waveforms
Duration of waveform is not Duration of waveform is limited
limited
Reliability Not very well against noise Well against noise (channel code)
Uncontrollable Controllable
Processing Easy Quite complex
Rate Slow Fast
Application Not able programming Flexible (can use both signal

types) and able programming
Techniques Frequency Synchronize Frequency Synchronize
support Time Synchronize

Source
Analog

Source
Digital

Source

Source
Information Information
signal signal
Analog vs Digital
…110100011101101010110…
…c269e8cd0971b8e445b5…

How to send digital signals?
• Digital bits -> analog waveforms (digital modulation)

– Used in telephone modems, cell phones, digital TV, etc.
• Digital bits -> digital pulse sequences (line coding)

– Used in computer networks
• How do we deal with channel noise?

– Error detection (e.g. parity check)
– Error correction coding
• How fast can we send bits ?

– Channel capacity depends on bandwidth, modulation, and SNR
Shannon channel capacity formula

Waveform
 Analog : Continuously
 Digital : Limited in digit period
Analog vs Digital
Information Information
signal signal
Analog
vs
Digital

Waveform

Waveform

Digital Communication System structure
Channel
Source Destination
Sender Encoder Decoder Receiver
Shannon–Weaver model


Digital Transmission System: A Complete Diagram
CODEC MODEM
Error
ADC Source control Line coding/ Multiple
….
Multiplexing
Sampling coder coder pulse shaping Modulation accessing
PCM B
encoder
Anti- Encryption
aliasing
B0
filter
B0 =
…110100… B1
B2
...
Error
DAC Source control Decision Matched Multiple
Demultiplexing
--- decoding decoding circuit filtering Demodulation accessing
PCM
decoder
Audio- Deciphering Equalisation
frequency
amplifier
Detection

Digital Transmission System: Sampling
CODEC MODEM
Error
ADC Source control Line coding/
….
…110100…
Multiplexing
Sampling coder coder pulse shaping Modulation
PCM
encoder
What happen if fs<2f0
Anti- Encryption
aliasing
filter
Khoa Điện tử - Viễn thông Error Digital Communications and Coding

Trường Đại học Công nghệ,
DAC ĐHQGHN Source 17 control Decision Matched
Truyền thông số và mã hóa
xing
--- decoding decoding circuit filtering Demodulation

Sampling
 Sampling by Nyquist’s theorem
The Nyquist rate is twice the bandwidth of a Vs (f)
fs > 2fA(max)
bandlimited function or a bandlimited channel:
- As a lower bound for the sample rate for
alias-free signal sampling (not to be confused with f
0 fs 2fs
the Nyquist frequency, which is half the sampling fA(max)
rate of a discrete-time system) (referrered as
Nyquist–Shannon sampling theorem) Vs (f)
“Aliasing” distortion
- As an upper bound for the symbol rate occurs
across a bandwidth-limited baseband channel

such as a telegraph line or passband channel such f
as a limited RF band or a frequency division
0 fs < 2fA(max)
multiplex channel. (Referred as Nyquist rate)

Vs (f)
Ideal low-pass filter
f
f
0 fs 2fs
fs > 2fA(max)

Sampling
Nyquist sampling theorem states that the sampling signal frequency should be
double the input signal’s highest frequency component to get distortion less
output signal.

Time-domain and Frequency-domain of Signal

Sum of Sine waves
https://bilimneguzellan.net/fuyye-serisi/

 Too small period, too high frequency
 Too large period, too low frequency
 Limit in time domain, un-limit in frequency domain
 Limit in frequency domain, un-limit in time domain V(f)
v(t) 1.0
𝑡−𝑇 𝐹𝑇
1.0 Π 𝑠𝑖𝑛𝑐 𝜏𝑓 𝑒 −𝑗2𝜋𝑓𝑡
𝜏
-1/2 0 1/2 t
-3 -2 -1 0 1 2 3 f
(a) Unit rectangular pulse, Π(t) (b) Fourier transform centred on t=0
ISI problem?
CODEC MODEM
Error
….
Multiplexing
coder coder pulse shaping Modulation accessing

PCM
encoder
Encryption

Band-unlimited
v(t) channel
1.0
Band-unlimited
channel
-1/2 0 1/2 t
V(f)
Band-limited channel Band-limited channel
1.0
-3 -2 -1 0 1 2 3 f
❖ Design systems impulse response is short enough.

❖ Consecutive raised-cosine impulses.
❖ Guard periods.
❖ Apply an equalizer at the receiver.
❖ Apply a sequence detector at the receiver.

Side lope
Sinc pulse Raised cosine pulse

Baseband Transmission and Passband Transmission
Mixer: Converts the frequency of an input signal to another frequency.
Wireless channel

Baseband Transmission and Passband Transmission
Why is passband?
The transmission technique can be selected based on the channel (AM, FM…)
M(f)
M(0)
(a)Spectrum of
baseband
signal 𝑓𝑐 ≫ 𝑊
f
-W 0 W
𝐴𝑐 S(f)
(b) Spectrum of
AF/2 * δ (f + fC) AM wave AF/2 * δ (f - fC)
2
½* M(0)
Upper
sideband
Lower
sideband
𝑀/2 Lower
sideband
Upper
sideband
𝐵𝑇 = 2𝑊
f
-fC - W -fC -fC + W 0 fC - W fC fC + W
𝐴𝑐 1
𝑆 𝑓 = 𝛿 𝑓 − 𝑓𝑐 + 𝛿 𝑓 + 𝑓𝑐 + 𝑀 𝑓 − 𝑓𝑐 + 𝑀 𝑓 + 𝑓𝑐
2 2

Review
1. Out of the following, which is not an essential element of a communication
system?
a) Transmitter b) Transducer
c) Receiver d) Communication channel
2. A device which provides output in electrical form or it has input in electrical form
is called a?
a) Transmitter b) Receiver
c) Repeater d) Transducer
3. Decrease in signal strength due to energy losses is called?
a) Distortion b) Interference
c) Attenuation d) Noise
4. The disturbance or distortion in the transmission and processing of message
signals is called?
a) Noise b) Attenuation
c) Interference d) None of these
5. A repeater is a combination of?
a) Receiver and modulator b) receiver and transducer
c) receiver and transmitter d) receiver and amplifier e) amplifier and transmitter


Shannon’s Fundamental Limits
 Source coding theorem: Below limit of data compression
for a lossless (not lossy) source coding (what is this? Similar
data compression):
Entropy = Average Information of source
𝑝𝑘 : probability of 𝑠𝑘 ∈ 𝒢
𝐾−1
1
𝐻 𝒢 = ෍ 𝑝𝑘 log 2
𝑝𝑘 Conveying the
𝑘=0 source data using
the lowest bit
Entropy rate possible
while maintaining
a specified
Trade-off: Bit …110100… reproduction
rate vs signal fidelity
fidelity
…1011… (shorter)
 Source coding theorem: Huffman Code Example
Huffman coding assigns shorter codes to symbols that
occur more frequently and longer codes to those that
occur less frequently. For example, imagine we have a text
file that uses only five characters (A, B, C, D, E). Before we
can assign bit patterns to each character, we assign each
character a weight based on its frequency of use. In this
example, assume that the frequency of the characters is as
shown in Table:
Character A B C D E
Frequency 17 12 12 27 32

Character A B C D E
Code 00 010 011 10 11
Original 000 001 010 011 100

 Source coding theorem: Lower limit of data compression
for a lossless (not lossy) source coding (what is this? Similar
data compression):
Entropy = Average Information of source
𝐾−1 𝑝𝑘 : probability of events 𝑠𝑘 ∈ 𝒢
1
𝐻 𝒢 = ෍ 𝑝𝑘 log 2
𝑝𝑘
𝑘=0 H(G) = 2.55
Lowest number of bits for lossless
representation of all symbols is 2.55
0 bits
1
Average length of codewords is 2.62
2 (Lower limit) 2.55 < 2.62 < 3 (original
3 3 bits codebook, 0-6 need 2^3=8 words to
4 represented) .
5
6
❑ Channel capacity theorem: What it channel capacity?
Difference:
Channel Capacity vs
Bandwidth?

❑ Channel capacity theorem:
Upper limit of data rate for reliable
transmission
bit/s

❑ Channel capacity theorem:
Upper limit of data rate for reliable transmission

What is Channel Code ?

❑ Channel coding theorem: Upper limit of communication rate
for reliable transmission
CODEC MODEM
Error
….
Multiplexing
Sampling coder coder pulse shaping Modulation accessing
PCM
encoder
Anti- Encryption
aliasing
filter
• Using this redundancy, the

decoder can estimate the Block Code
Error
original data. Channel
DAC coding,decoding
Source control Decision Matched Multiple
Demultiplexing
--- decoding circuit filtering Demodulation accessing
also known as forward PCMerror
control
Audio-
coding (FECC), is a
decoder
Deciphering Equalisation
process
frequency
amplifier
of detecting and
correcting bit errors in digital Detection
communication systems.
• Reed-Solomon, BCH, LDPC…

For every channel, exists a

number Cr ∈ (0, 1) that
measures the reliability of the
channel.
Given channel with Cr.

Given channel with Cr.
Using the channel n times, we
We are able to transmit n bits with
can communicate k bits of
k information bits (k<n) for
information with probability of
probability of error as small as we
error as small as we like as
like.
long as n is large enough.
n-k bits for what?


Major contributions in source & channel coding
1948 Shannon, C. The foundations of information theory.

1952 Huffman, D.A. Huffman source code.
1960 Reed. I.S.; Solomon. G. Reed-Solomon channel code.
1962 Gallager, R. The original paper on LDPC channel code.
1967 Viterbi, A.J. The Viterbi decoding algorithm.
1975 Elias, P. Elias Gamma code, Elias Omega code.
1977 Massey, J.L. Non-iterative Joint Source and Channel Coding (JSCC)
1978 Ziv, J.; Lempel, A. Lempel-Ziv variable rate source code.
1979 Rissanen. J. et al. Arithmetic near-entropy source coding.
1980 Stout. Q.E The Stout source code.
1988 Bernard. M.A. et al. The VLEC JSCC.
1993 Bcrrou. C. et al. The Turbo code.
1996 Fraenkel, A.S. et al. The Fibonacci code.
2000 Bauer, R.; Hagenauer, J. Introduces iterative decoding of VLECs.
2001 Gortz, N. The introduction of iterative JSCC decoding.
2013 Maunder. R.G. et al. The Unary Error Correction (UEC) JSCC.
2014 Wang, T. et al. The Elias Gamma Error Correction (EGEC) JSCC.

Brief History - Communication

Brief History - Communication

Brief History - Telecom

Brief History - Telecom

Brief History - Progress

Brief History - Progress

Brief History – 6G

Revision
 What are the differences between the analog waveform

and digital waveform?
 Show the difference between the analog and digital

systematic diagram
 Compare the advantage and the disadvantage of

analog and digital transmission techniques


Introduction - M

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Introduction - M

Uploaded by

Copyright:

Available Formats

Unit 1: INTRODUCTION to ANALOG AND DIGITAL

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Source Any form: Natural voice, picture, Number, 1,0

Application Not able programming Flexible (can use both signal

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

• Digital bits -> analog waveforms (digital modulation)

• Digital bits -> digital pulse sequences (line coding)

• How do we deal with channel noise?

• How fast can we send bits ?

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Error Digital Communications and Coding

--- decoding decoding circuit filtering Demodulation

across a bandwidth-limited baseband channel

multiplex channel. (Referred as Nyquist rate)

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

coder coder pulse shaping Modulation accessing

Khoa Điện tử - Viễn thông Digital Communications and Coding

❖ Design systems impulse response is short enough.

Khoa Điện tử - Viễn thông Digital Communications and Coding

Sinc pulse Raised cosine pulse

Khoa Điện tử - Viễn thông Digital Communications and Coding

Mixer: Converts the frequency of an input signal to another frequency.

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

• Using this redundancy, the

Khoa Điện tử - Viễn thông Digital Communications and Coding

For every channel, exists a

Given channel with Cr.

n-k bits for what?

Khoa Điện tử - Viễn thông Digital Communications and Coding

1948 Shannon, C. The foundations of information theory.

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding

Khoa Điện tử - Viễn thông Digital Communications and Coding