11/10/2010

3. Signals, Coding and Modulation

Contents

a Digital signals
a.
b. Digital-to-digital conversion
c. Analog-to-digital conversion
d. Digital-to-analog conversion
e. Analog-to-analog conversion

1
 11/10/2010

a. Digital signals

To be transmitted, data must be

transformed to electromagnetic signals.

2
 11/10/2010

Data can be analog or digital.

Analog data are continuous and take
continuous values.
Digital
g data have discrete states and
take discrete values.

Signals can be analog or digital.

Analog signals can have an infinite
number of values in a range; digital
g
signals can have onlyy a limited
number of values.

3
 11/10/2010

Comparison of analog and digital signals

Two digital signals: one with two signal levels

and the other with four signal levels

4
 11/10/2010

Example

A digital signal has eight levels. How many bits are needed
per level? We calculate the number of bits from the formula

Each signal
g level is represented
p byy 3 bits.

Example

A digitized voice channel, is made by digitizing a 4 KHz

bandwidth analog voice signal. We need to sample the signal
at twice the highest frequency (two samples per hertz).
hertz)
We assume that each sample requires 8 bits. What is the
required bit rate?

Solution
The bit rate can be calculated as

5
 11/10/2010

Example

What is the bit rate for high-definition TV (HDTV)?

Solution
HDTV uses digital signals to broadcast high quality video
signals. The HDTV screen is normally a ratio of 16 : 9. There
are 1920 by 1080 pixels per screen, and the screen is
renewed 30 times per second. Twenty-four bits represents
one color pixel.

The TV stations reduce this rate to 20 to 40 Mbps through

compression.

The time and frequency domains of periodic and

nonperiodic digital signals

6
 11/10/2010

Baseband transmission

Increasing the levels of a signal may

reduce the reliability of the system.

7
 11/10/2010

Relationship between transmission speed,

bandwidth and number of levels

Vtx = 2 BW × log 2 L

Donde:
Vtx = bit rate
BW = Bandwidth
B d idth
L = number of signal levels used to represent data

Example

Consider a noiseless channel with a bandwidth of 3000 Hz

transmitting a signal with two signal levels.
The maximum bit rate can be calculated as

8
 11/10/2010

Example

Consider the same noiseless channel transmitting a signal

with four signal levels (for each level, we send 2 bits). The
ma im m bit rate can be calculated
maximum calc lated as

Example

We need to send 265 kbps over a noiseless channel with a

bandwidth of 20 kHz. How many signal levels do we need?
Solution
We can use the Nyquist formula as shown:

Since this result is not a power of 2, we need to either

increase the number of levels or reduce the bit rate. If we
have 128 levels, the bit rate is 280 kbps. If we have 64 levels,
the bit rate is 240 kbps.

9
 11/10/2010

Shannon capacity

⎡S ⎤
C = BW × log 2 ⎢ + 1⎥
⎣N ⎦

Where:
C = capacity
p y of channel in bits/second
BW = Bandwidth
S/N = signal-to-noise ratio

Example

We can calculate the theoretical highest bit rate of a regular

telephone channel (not a metalic line). A telephone line
normally has a bandwidth of 3000. The signal
signal-to-noise
to noise ratio is
usually 3162. For this channel the capacity is calculated as

This means that the highest bit rate for a telephone line is
34.860 kbps. If we want to send data faster than this, we can
either increase the bandwidth of the line or improve the
signal-to-noise ratio.

10
 11/10/2010

Example

The signal-to-noise ratio is often given in decibels.

Assume that SNR (dB) = 36 and channel bandwidth is 2 MHz.
The theoretical channel capacity can be calculated as

The Shannon capacity gives us the

upper limit; the Nyquist formula tells us
how many signal levels we need.

11
 11/10/2010

b. Digital-to-digital conversion

Line coding and decoding

12
 11/10/2010

Signal element versus data element

Line coding schemes

13
 11/10/2010

Unipolar NRZ scheme

Polar NRZ-L and NRZ-I schemes

14
 11/10/2010

NRZ-L and NRZ-I both have a DC

component problem.

Polar RZ scheme

15
 11/10/2010

Polar biphase: Manchester and differential Manchester

In Manchester and differential

Manchester encoding, the transition
at the middle of the bit is used for
synchronization.
synchronization

16
 11/10/2010

Bipolar schemes: AMI and pseudoternary

In mBnL schemes, a pattern of m data

elements is encoded as a pattern of n
signal elements in which 2m ≤ Ln.

17
 11/10/2010

Multilevel: 2B1Q scheme

Summary of line coding schemes

18
 11/10/2010

Two cases of B8ZS scrambling technique

B8ZS substitutes eight consecutive

zeros with 000VB0VB.

19
 11/10/2010

Different situations in HDB3 scrambling technique

HDB3 substitutes four consecutive

zeros with 000V or B00V depending
on the number of nonzero pulses after
the last substitution.
substitution

20
 11/10/2010

c. Analog-to-digital conversion

Components of PCM encoder

21
 11/10/2010

Quantization and encoding of a sampled signal

Components of a PCM decoder

22
 11/10/2010

The process of delta modulation

Delta modulation components

23
 11/10/2010

Delta demodulation components

d. Digital-to-analog conversion

24
 11/10/2010

Digital-to-analog conversion

Types of digital-to-analog conversion

25
 11/10/2010

Bit rate
t iis th
the number
b off bit
bits per second.
d
Baud rate or Symbol rate is the number
of signal elements per second.

In the analog transmission of digital

data, the baud rate is less than
or equal to the bit rate.

Relationship between Vtx and Vm

The relationship between data rate (N) and baud (symbol)

rate (S) is the following:

S=
1 N = S log 2 L r = log 2 L
T
Where:
T = period
i d off the
th transmitted
t itt d digital
di it l signal
i l
S = Baud (symbol) rate in symbols/seg
N = bit rate in bps
r = number of data elements carried in one signal element
L = number of significative changes in the line

26
 11/10/2010

Example

An analog signal has a bit rate of 8000 bps and a baud

rate (Vm) of 1000 baud. How many data elements are
carried by each signal element? How many signal
elements do we need?

Solution
In this example, Vm = 1000, Vtx = 8000, and r and L are
unknown. We find first the value of r and then the value of L.

Binary amplitude shift keying

27
 11/10/2010

Implementation of binary ASK

Bandwidth of full-duplex ASK

28
 11/10/2010

Binary frequency shift keying

Binary phase shift keying

29
 11/10/2010

Implementation of BPSK

QPSK and its implementation

30
 11/10/2010

Concept of a constellation diagram

Three constellation diagrams: ASK, BPSK, QPSK

31
 11/10/2010

Constellation diagrams for some QAMs

e. Analog-to-analog conversion

32
 11/10/2010

Types of analog-to-analog modulation

Amplitude modulation

33
 11/10/2010

The total bandwidth required for AM

can be determined
from the bandwidth of the audio
signal: BAM = 2B.

AM band allocation

34
 11/10/2010

The total bandwidth required for FM can

be determined from the bandwidth
of the audio signal: BFM = 2(1 + β)B.

Frequency modulation

35
 11/10/2010

FM band allocation

Phase modulation

36