SlideShare a Scribd company logo
1 of 58
Download to read offline
Chapter 6
Bandwidth Utilization:
Multiplexing and
Spreading
Spreading
6.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Note
Bandwidth utilization is the wise use of
Note
available bandwidth to achieve
specific goals
specific goals.
Efficiency can be achieved by
Efficiency can be achieved by
multiplexing; privacy and anti-jamming
can be achieved by spreading.
6.2
6
6-
-1
1 MULTIPLEXING
MULTIPLEXING
Whenever
Whenever the
the bandwidth
bandwidth of
of a
a medium
medium linking
linking two
two
d i
d i i
i t
t th
th th
th b d idth
b d idth d
d f
f th
th
devices
devices is
is greater
greater than
than the
the bandwidth
bandwidth needs
needs of
of the
the
devices,
devices, the
the link
link can
can be
be shared
shared.
. Multiplexing
Multiplexing is
is the
the set
set
f
f t h i
t h i th t
th t ll
ll th
th i lt
i lt
of
of techniques
techniques that
that allows
allows the
the simultaneous
simultaneous
transmission
transmission of
of multiple
multiple signals
signals across
across a
a single
single data
data
li k
li k A
A d t
d t d
d t l i ti
t l i ti i
i
link
link.
. As
As data
data and
and telecommunications
telecommunications use
use increases,
increases, so
so
does
does traffic
traffic.
.
Frequency-Division Multiplexing
Topics discussed in this section:
Topics discussed in this section:
q y p g
Wavelength-Division Multiplexing
Synchronous Time-Division Multiplexing
6.3
Statistical Time-Division Multiplexing
Figure 6.1 Dividing a link into channels
6.4
Figure 6.2 Categories of multiplexing
6.5
Figure 6.3 Frequency-division multiplexing
6.6
Note
FDM is an analog multiplexing technique
Note
FDM is an analog multiplexing technique
that combines analog signals.
6.7
Figure 6.4 FDM process
6.8
Figure 6.5 FDM demultiplexing example
6.9
Example 6.1
Assume that a voice channel occupies a bandwidth of 4
kHz. We need to combine three voice channels into a link
kHz. We need to combine three voice channels into a link
with a bandwidth of 12 kHz, from 20 to 32 kHz. Show the
configuration, using the frequency domain. Assume there
configuration, using the frequency domain. Assume there
are no guard bands.
Solution
Solution
We shift (modulate) each of the three voice channels to a
different bandwidth as shown in Figure 6 6 We use the
different bandwidth, as shown in Figure 6.6. We use the
20- to 24-kHz bandwidth for the first channel, the 24- to
28 kHz bandwidth for the second channel and the 28 to
28-kHz bandwidth for the second channel, and the 28- to
32-kHz bandwidth for the third one. Then we combine
them as shown in Figure 6 6
6.10
them as shown in Figure 6.6.
Figure 6.6 Example 6.1
6.11
Example 6.2
Five channels each with a 100 kHz bandwidth are to be
Five channels, each with a 100-kHz bandwidth, are to be
multiplexed together. What is the minimum bandwidth of
the link if there is a need for a guard band of 10 kHz
the link if there is a need for a guard band of 10 kHz
between the channels to prevent interference?
Solution
For five channels, we need at least four guard bands.
This means that the required bandwidth is at least
q
5 × 100 + 4 × 10 = 540 kHz,
as shown in Figure 6.7.
6.12
g
Figure 6.7 Example 6.2
6.13
Example 6.3
Four data channels (digital) each transmitting at 1
Four data channels (digital), each transmitting at 1
Mbps, use a satellite channel of 1 MHz. Design an
appropriate configuration using FDM
appropriate configuration, using FDM.
Solution
The satellite channel is analog. We divide it into four
g f
channels, each channel having a 250-kHz bandwidth.
Each digital channel of 1 Mbps is modulated such that
g f p
each 4 bits is modulated to 1 Hz. One solution is 16-QAM
modulation. Figure 6.8 shows one possible configuration.
6.14
g p f g
Figure 6.8 Example 6.3
6.15
Figure 6.9 Analog hierarchy
6.16
Example 6.4
The Advanced Mobile Phone System (AMPS) uses two
bands The first band of 824 to 849 MHz is used for
bands. The first band of 824 to 849 MHz is used for
sending, and 869 to 894 MHz is used for receiving.
Each user has a bandwidth of 30 kHz in each direction
Each user has a bandwidth of 30 kHz in each direction.
How many people can use their cellular phones
simultaneously?
simultaneously?
Solution
Each band is 25 MHz. If we divide 25 MHz by 30 kHz, we
get 833.33. In reality, the band is divided into 832
channels. Of these, 42 channels are used for control,
which means only 790 channels are available for cellular
6.17
phone users.
Figure 6.10 Wavelength-division multiplexing
6.18
Note
WDM is an analog multiplexing
Note
WDM is an analog multiplexing
technique to combine optical signals.
6.19
Figure 6.11 Prisms in wavelength-division multiplexing and demultiplexing
6.20
Figure 6.12 TDM
6.21
Note
TDM is a digital multiplexing technique
TDM is a digital multiplexing technique
for combining several low-rate
h l i t hi h t
channels into one high-rate one.
6.22
Figure 6.13 Synchronous time-division multiplexing
6.23
Note
In synchronous TDM, the data rate
of the link is n times faster, and the unit
duration is n times shorter.
6.24
Example 6.5
In Figure 6.13, the data rate for each input connection is
3 kbps. If 1 bit at a time is multiplexed (a unit is 1 bit),
what is the duration of (a) each input slot, (b) each output
l d ( ) h f ?
slot, and (c) each frame?
Solution
We can answer the questions as follows:
a. The data rate of each input connection is 1 kbps. This
means that the bit duration is 1/1000 s or 1 ms. The
duration of the input time slot is 1 ms (same as bit
duration).
6.25
Example 6.5 (continued)
b. The duration of each output time slot is one-third of
the input time slot. This means that the duration of the
output time slot is 1/3 ms.
c. Each frame carries three output time slots. So the
duration of a frame is 3 × 1/3 ms, or 1 ms. The
duration of a frame is the same as the duration of an
input unit.
6.26
Example 6.6
Figure 6.14 shows synchronous TDM with a data stream
f h i t d d t t f th t t Th
for each input and one data stream for the output. The
unit of data is 1 bit. Find (a) the input bit duration, (b)
th t t bit d ti ( ) th t t bit t d (d) th
the output bit duration, (c) the output bit rate, and (d) the
output frame rate.
Solution
We can answer the questions as follows:
a. The input bit duration is the inverse of the bit rate:
1/1 Mbps = 1 μs.
b. The output bit duration is one-fourth of the input bit
d i ¼
6.27
duration, or ¼ μs.
Example 6.6 (continued)
c. The output bit rate is the inverse of the output bit
p f p
duration or 1/(4μs) or 4 Mbps. This can also be
deduced from the fact that the output rate is 4 times as
f f p
fast as any input rate; so the output rate = 4 × 1 Mbps
= 4 Mbps.
p
d. The frame rate is always the same as any input rate. So
f y y p
the frame rate is 1,000,000 frames per second.
Because we are sending 4 bits in each frame, we can
g f ,
verify the result of the previous question by
multiplying the frame rate by the number of bits per
6.28
p y g f y f p
frame.
Figure 6.14 Example 6.6
6.29
Example 6.7
Four 1-kbps connections are multiplexed together. A unit
is 1 bit. Find (a) the duration of 1 bit before multiplexing,
(b) the transmission rate of the link, (c) the duration of a
time slot, and (d) the duration of a frame.
S l ti
Solution
We can answer the questions as follows:
Th d ti f 1 bit b f lti l i i 1 / 1 kb
a. The duration of 1 bit before multiplexing is 1 / 1 kbps,
or 0.001 s (1 ms).
b. The rate of the link is 4 times the rate of a connection,
4 kb
6.30
or 4 kbps.
Example 6.7 (continued)
Th d ti f h ti l t i f th f th
c. The duration of each time slot is one-fourth of the
duration of each bit before multiplexing, or 1/4 ms or
250 N t th t l l l t thi f th
250 μs. Note that we can also calculate this from the
data rate of the link, 4 kbps. The bit duration is the
i f th d t t 1/4 kb 250
inverse of the data rate, or 1/4 kbps or 250 μs.
d Th d ti f f i l th th
d. The duration of a frame is always the same as the
duration of a unit before multiplexing, or 1 ms. We
l l l t thi i th E h f i
can also calculate this in another way. Each frame in
this case has four time slots. So the duration of a
f i 4 ti 250 1
6.31
frame is 4 times 250 μs, or 1 ms.
Figure 6.15 Interleaving
6.32
Example 6.8
Four channels are multiplexed using TDM. If each
channel sends 100 bytes /s and we multiplex 1 byte per
channel sends 100 bytes /s and we multiplex 1 byte per
channel, show the frame traveling on the link, the size of
the frame, the duration of a frame, the frame rate, and
the frame, the duration of a frame, the frame rate, and
the bit rate for the link.
S l i
Solution
The multiplexer is shown in Figure 6.16. Each frame
i 1 b f h h l h i f h f
carries 1 byte from each channel; the size of each frame,
therefore, is 4 bytes, or 32 bits. Because each channel is
di 100 b / d f i 1 b f h
sending 100 bytes/s and a frame carries 1 byte from each
channel, the frame rate must be 100 frames per second.
Th bi i 100 32 3200 b
6.33
The bit rate is 100 × 32, or 3200 bps.
Figure 6.16 Example 6.8
6.34
Example 6.9
A multiplexer combines four 100-kbps channels using a
time slot of 2 bits. Show the output with four arbitrary
inputs. What is the frame rate? What is the frame
duration? What is the bit rate? What is the bit duration?
Solution
Figure 6.17 shows the output for four arbitrary inputs.
g p f f y p
The link carries 50,000 frames per second. The frame
duration is therefore 1/50,000 s or 20 μs. The frame rate
f μ f
is 50,000 frames per second, and each frame carries 8
bits; the bit rate is 50,000 × 8 = 400,000 bits or 400 kbps.
6.35
p
The bit duration is 1/400,000 s, or 2.5 μs.
Figure 6.17 Example 6.9
6.36
Figure 6.18 Empty slots
6.37
Figure 6.19 Multilevel multiplexing
6.38
Figure 6.20 Multiple-slot multiplexing
6.39
Figure 6.21 Pulse stuffing
6.40
Figure 6.22 Framing bits
6.41
Example 6.10
We have four sources, each creating 250 characters per
second If the interleaved unit is a character and 1
second. If the interleaved unit is a character and 1
synchronizing bit is added to each frame, find (a) the data
rate of each source (b) the duration of each character in
rate of each source, (b) the duration of each character in
each source, (c) the frame rate, (d) the duration of each
frame (e) the number of bits in each frame and (f) the
frame, (e) the number of bits in each frame, and (f) the
data rate of the link.
Solution
We can answer the questions as follows:
q f
a. The data rate of each source is 250 × 8 = 2000 bps = 2
kbps.
6.42
p
Example 6.10 (continued)
b. Each source sends 250 characters per second;
therefore, the duration of a character is 1/250 s, or
4 ms.
c. Each frame has one character from each source,
which means the link needs to send 250 frames per
second to keep the transmission rate of each source.
d. The duration of each frame is 1/250 s, or 4 ms. Note
that the duration of each frame is the same as the
duration of each character coming from each source.
e. Each frame carries 4 characters and 1 extra
synchronizing bit. This means that each frame is
6.43
4 × 8 + 1 = 33 bits.
Example 6.11
Two channels, one with a bit rate of 100 kbps and
another with a bit rate of 200 kbps are to be multiplexed
another with a bit rate of 200 kbps, are to be multiplexed.
How this can be achieved? What is the frame rate? What
is the frame duration? What is the bit rate of the link?
is the frame duration? What is the bit rate of the link?
S l i
Solution
We can allocate one slot to the first channel and two slots
h d h l h f i 3 bi h
to the second channel. Each frame carries 3 bits. The
frame rate is 100,000 frames per second because it carries
1 bi f h fi h l Th bi i 100 000
1 bit from the first channel. The bit rate is 100,000
frames/s × 3 bits per frame, or 300 kbps.
6.44
Figure 6.23 Digital hierarchy
6.45
Table 6.1 DS and T line rates
6.46
Figure 6.24 T-1 line for multiplexing telephone lines
6.47
Figure 6.25 T-1 frame structure
6.48
Table 6.2 E line rates
6.49
Figure 6.26 TDM slot comparison
6.50
6
6-
-1
1 SPREAD SPECTRUM
SPREAD SPECTRUM
In
In spread
spread spectrum
spectrum (SS),
(SS), we
we combine
combine signals
signals from
from
different
different sources
sources to
to fit
fit into
into a
a larger
larger bandwidth
bandwidth but
but our
our
different
different sources
sources to
to fit
fit into
into a
a larger
larger bandwidth,
bandwidth, but
but our
our
goals
goals are
are to
to prevent
prevent eavesdropping
eavesdropping and
and jamming
jamming.
. To
To
achieve
achieve these
these goals
goals spread
spread spectrum
spectrum techniques
techniques add
add
achieve
achieve these
these goals,
goals, spread
spread spectrum
spectrum techniques
techniques add
add
redundancy
redundancy.
.
Frequency Hopping Spread Spectrum (FHSS)
Topics discussed in this section:
Topics discussed in this section:
q y pp g p p ( )
Direct Sequence Spread Spectrum Synchronous (DSSS)
6.51
Figure 6.27 Spread spectrum
6.52
Figure 6.28 Frequency hopping spread spectrum (FHSS)
6.53
Figure 6.29 Frequency selection in FHSS
6.54
Figure 6.30 FHSS cycles
6.55
Figure 6.31 Bandwidth sharing
6.56
Figure 6.32 DSSS
6.57
Figure 6.33 DSSS example
6.58

More Related Content

What's hot

Dcn a03-analog transmission
Dcn a03-analog transmissionDcn a03-analog transmission
Dcn a03-analog transmissionSaurabh Daga
 
M ary psk and m ary qam ppt
M ary psk and m ary qam pptM ary psk and m ary qam ppt
M ary psk and m ary qam pptDANISHAMIN950
 
2.2 frequency division multiple access
2.2   frequency division multiple access2.2   frequency division multiple access
2.2 frequency division multiple accessJAIGANESH SEKAR
 
Channel planning
Channel planningChannel planning
Channel planningAJAL A J
 
Digital t carriers and multiplexing power point (laurens)
Digital t carriers and multiplexing power point (laurens)Digital t carriers and multiplexing power point (laurens)
Digital t carriers and multiplexing power point (laurens)Laurens Luis Bugayong
 
Orthogonal Frequency Division Multiplexing (OFDM)
Orthogonal Frequency Division Multiplexing (OFDM)Orthogonal Frequency Division Multiplexing (OFDM)
Orthogonal Frequency Division Multiplexing (OFDM)Ahmad Gomaa
 
Multiplexing
MultiplexingMultiplexing
Multiplexingnimay1
 
Multiplexing and Frequency Division Multiplexing
Multiplexing and Frequency Division MultiplexingMultiplexing and Frequency Division Multiplexing
Multiplexing and Frequency Division MultiplexingKath Mataac
 
Introduction To Wireless Fading Channels
Introduction To Wireless Fading ChannelsIntroduction To Wireless Fading Channels
Introduction To Wireless Fading ChannelsNitin Jain
 
Small scale fading
Small scale fadingSmall scale fading
Small scale fadingAJAL A J
 
Unit 1 Introduction to wireless telecommunication system and networks
Unit  1 Introduction to wireless telecommunication system and networksUnit  1 Introduction to wireless telecommunication system and networks
Unit 1 Introduction to wireless telecommunication system and networksAshutha K
 
Spread spectrum
Spread spectrumSpread spectrum
Spread spectrummpsrekha83
 
Multiple access techniques
Multiple access techniquesMultiple access techniques
Multiple access techniquesBibhu Prasad
 

What's hot (20)

Dcn a03-analog transmission
Dcn a03-analog transmissionDcn a03-analog transmission
Dcn a03-analog transmission
 
M ary psk and m ary qam ppt
M ary psk and m ary qam pptM ary psk and m ary qam ppt
M ary psk and m ary qam ppt
 
2.2 frequency division multiple access
2.2   frequency division multiple access2.2   frequency division multiple access
2.2 frequency division multiple access
 
Ch 05
Ch 05Ch 05
Ch 05
 
Channel planning
Channel planningChannel planning
Channel planning
 
DPCM
DPCMDPCM
DPCM
 
Digital t carriers and multiplexing power point (laurens)
Digital t carriers and multiplexing power point (laurens)Digital t carriers and multiplexing power point (laurens)
Digital t carriers and multiplexing power point (laurens)
 
Orthogonal Frequency Division Multiplexing (OFDM)
Orthogonal Frequency Division Multiplexing (OFDM)Orthogonal Frequency Division Multiplexing (OFDM)
Orthogonal Frequency Division Multiplexing (OFDM)
 
Multiplexing
MultiplexingMultiplexing
Multiplexing
 
Multiplexing and Frequency Division Multiplexing
Multiplexing and Frequency Division MultiplexingMultiplexing and Frequency Division Multiplexing
Multiplexing and Frequency Division Multiplexing
 
Introduction To Wireless Fading Channels
Introduction To Wireless Fading ChannelsIntroduction To Wireless Fading Channels
Introduction To Wireless Fading Channels
 
Small scale fading
Small scale fadingSmall scale fading
Small scale fading
 
Unit 1 Introduction to wireless telecommunication system and networks
Unit  1 Introduction to wireless telecommunication system and networksUnit  1 Introduction to wireless telecommunication system and networks
Unit 1 Introduction to wireless telecommunication system and networks
 
Mimo
MimoMimo
Mimo
 
Multiplexing : FDM
Multiplexing : FDMMultiplexing : FDM
Multiplexing : FDM
 
Chapter 6
Chapter 6Chapter 6
Chapter 6
 
Gmsk
GmskGmsk
Gmsk
 
Spread spectrum
Spread spectrumSpread spectrum
Spread spectrum
 
Lecture 11
Lecture 11Lecture 11
Lecture 11
 
Multiple access techniques
Multiple access techniquesMultiple access techniques
Multiple access techniques
 

Similar to Multiplexing and Spreading-1.pdf

06 Bandwidth Utilization_Multiplexing_and_Spreading
06 Bandwidth Utilization_Multiplexing_and_Spreading06 Bandwidth Utilization_Multiplexing_and_Spreading
06 Bandwidth Utilization_Multiplexing_and_SpreadingAhmar Hashmi
 
Chapter 6 bandwidth utilization -multiplexing and spreading_computer_network
Chapter 6   bandwidth utilization -multiplexing and spreading_computer_networkChapter 6   bandwidth utilization -multiplexing and spreading_computer_network
Chapter 6 bandwidth utilization -multiplexing and spreading_computer_networkDhairya Joshi
 
Ch6 1 Data communication and networking by neha g. kurale
Ch6 1 Data communication and networking by neha g. kuraleCh6 1 Data communication and networking by neha g. kurale
Ch6 1 Data communication and networking by neha g. kuraleNeha Kurale
 
BANDWIDTH UTILIZATION
BANDWIDTH UTILIZATIONBANDWIDTH UTILIZATION
BANDWIDTH UTILIZATIONAvijeet Negel
 
multiplexing and spreading bandwidth utilization
multiplexing and spreading  bandwidth utilizationmultiplexing and spreading  bandwidth utilization
multiplexing and spreading bandwidth utilizationalobaidimki
 
ch6_1_v1.ppt
ch6_1_v1.pptch6_1_v1.ppt
ch6_1_v1.pptEidTahir
 
ch6_1_v1.ppt
ch6_1_v1.pptch6_1_v1.ppt
ch6_1_v1.pptsietnilk
 
Ch06 multiplexing and ss
Ch06 multiplexing and ssCh06 multiplexing and ss
Ch06 multiplexing and ssAshok kumar
 
CHAPTER 6_BANDWIDTH UTILIZATION.pdf
CHAPTER 6_BANDWIDTH UTILIZATION.pdfCHAPTER 6_BANDWIDTH UTILIZATION.pdf
CHAPTER 6_BANDWIDTH UTILIZATION.pdfAngelamoniquebuhat
 
Multiplexing ppt15 sep
Multiplexing ppt15 sepMultiplexing ppt15 sep
Multiplexing ppt15 sepSrashti Vyas
 

Similar to Multiplexing and Spreading-1.pdf (20)

Lecture-6 Data Communication ~www.fida.com.bd
Lecture-6 Data Communication ~www.fida.com.bdLecture-6 Data Communication ~www.fida.com.bd
Lecture-6 Data Communication ~www.fida.com.bd
 
5291667.ppt
5291667.ppt5291667.ppt
5291667.ppt
 
Ch06
Ch06Ch06
Ch06
 
06 Bandwidth Utilization_Multiplexing_and_Spreading
06 Bandwidth Utilization_Multiplexing_and_Spreading06 Bandwidth Utilization_Multiplexing_and_Spreading
06 Bandwidth Utilization_Multiplexing_and_Spreading
 
Chapter 6 bandwidth utilization -multiplexing and spreading_computer_network
Chapter 6   bandwidth utilization -multiplexing and spreading_computer_networkChapter 6   bandwidth utilization -multiplexing and spreading_computer_network
Chapter 6 bandwidth utilization -multiplexing and spreading_computer_network
 
Ch06
Ch06Ch06
Ch06
 
Ch6 1 Data communication and networking by neha g. kurale
Ch6 1 Data communication and networking by neha g. kuraleCh6 1 Data communication and networking by neha g. kurale
Ch6 1 Data communication and networking by neha g. kurale
 
Ch06
Ch06Ch06
Ch06
 
Ch6 1 v1
Ch6 1 v1Ch6 1 v1
Ch6 1 v1
 
BANDWIDTH UTILIZATION
BANDWIDTH UTILIZATIONBANDWIDTH UTILIZATION
BANDWIDTH UTILIZATION
 
COMPUTER NETWORK - Chapter - 3
COMPUTER NETWORK - Chapter - 3COMPUTER NETWORK - Chapter - 3
COMPUTER NETWORK - Chapter - 3
 
ch6_1_v1.ppt
ch6_1_v1.pptch6_1_v1.ppt
ch6_1_v1.ppt
 
ch6_1_v1.ppt
ch6_1_v1.pptch6_1_v1.ppt
ch6_1_v1.ppt
 
multiplexing and spreading bandwidth utilization
multiplexing and spreading  bandwidth utilizationmultiplexing and spreading  bandwidth utilization
multiplexing and spreading bandwidth utilization
 
ch6_1_v1.ppt
ch6_1_v1.pptch6_1_v1.ppt
ch6_1_v1.ppt
 
ch6_1_v1.ppt
ch6_1_v1.pptch6_1_v1.ppt
ch6_1_v1.ppt
 
Ch06 multiplexing and ss
Ch06 multiplexing and ssCh06 multiplexing and ss
Ch06 multiplexing and ss
 
CHAPTER 6_BANDWIDTH UTILIZATION.pdf
CHAPTER 6_BANDWIDTH UTILIZATION.pdfCHAPTER 6_BANDWIDTH UTILIZATION.pdf
CHAPTER 6_BANDWIDTH UTILIZATION.pdf
 
Ch 06
Ch 06Ch 06
Ch 06
 
Multiplexing ppt15 sep
Multiplexing ppt15 sepMultiplexing ppt15 sep
Multiplexing ppt15 sep
 

Recently uploaded

Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry InnovationBeyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry InnovationSafe Software
 
WhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure service
WhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure serviceWhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure service
WhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure servicePooja Nehwal
 
GenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day PresentationGenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day PresentationMichael W. Hawkins
 
Swan(sea) Song – personal research during my six years at Swansea ... and bey...
Swan(sea) Song – personal research during my six years at Swansea ... and bey...Swan(sea) Song – personal research during my six years at Swansea ... and bey...
Swan(sea) Song – personal research during my six years at Swansea ... and bey...Alan Dix
 
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...Neo4j
 
A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)Gabriella Davis
 
Injustice - Developers Among Us (SciFiDevCon 2024)
Injustice - Developers Among Us (SciFiDevCon 2024)Injustice - Developers Among Us (SciFiDevCon 2024)
Injustice - Developers Among Us (SciFiDevCon 2024)Allon Mureinik
 
Salesforce Community Group Quito, Salesforce 101
Salesforce Community Group Quito, Salesforce 101Salesforce Community Group Quito, Salesforce 101
Salesforce Community Group Quito, Salesforce 101Paola De la Torre
 
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...HostedbyConfluent
 
Enhancing Worker Digital Experience: A Hands-on Workshop for Partners
Enhancing Worker Digital Experience: A Hands-on Workshop for PartnersEnhancing Worker Digital Experience: A Hands-on Workshop for Partners
Enhancing Worker Digital Experience: A Hands-on Workshop for PartnersThousandEyes
 
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhi
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | DelhiFULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhi
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhisoniya singh
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerThousandEyes
 
Pigging Solutions Piggable Sweeping Elbows
Pigging Solutions Piggable Sweeping ElbowsPigging Solutions Piggable Sweeping Elbows
Pigging Solutions Piggable Sweeping ElbowsPigging Solutions
 
Key Features Of Token Development (1).pptx
Key  Features Of Token  Development (1).pptxKey  Features Of Token  Development (1).pptx
Key Features Of Token Development (1).pptxLBM Solutions
 
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationFrom Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationSafe Software
 
SIEMENS: RAPUNZEL – A Tale About Knowledge Graph
SIEMENS: RAPUNZEL – A Tale About Knowledge GraphSIEMENS: RAPUNZEL – A Tale About Knowledge Graph
SIEMENS: RAPUNZEL – A Tale About Knowledge GraphNeo4j
 
Slack Application Development 101 Slides
Slack Application Development 101 SlidesSlack Application Development 101 Slides
Slack Application Development 101 Slidespraypatel2
 
Breaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path MountBreaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path MountPuma Security, LLC
 
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking MenDelhi Call girls
 
The Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptxThe Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptxMalak Abu Hammad
 

Recently uploaded (20)

Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry InnovationBeyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
 
WhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure service
WhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure serviceWhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure service
WhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure service
 
GenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day PresentationGenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day Presentation
 
Swan(sea) Song – personal research during my six years at Swansea ... and bey...
Swan(sea) Song – personal research during my six years at Swansea ... and bey...Swan(sea) Song – personal research during my six years at Swansea ... and bey...
Swan(sea) Song – personal research during my six years at Swansea ... and bey...
 
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...
 
A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)
 
Injustice - Developers Among Us (SciFiDevCon 2024)
Injustice - Developers Among Us (SciFiDevCon 2024)Injustice - Developers Among Us (SciFiDevCon 2024)
Injustice - Developers Among Us (SciFiDevCon 2024)
 
Salesforce Community Group Quito, Salesforce 101
Salesforce Community Group Quito, Salesforce 101Salesforce Community Group Quito, Salesforce 101
Salesforce Community Group Quito, Salesforce 101
 
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...
 
Enhancing Worker Digital Experience: A Hands-on Workshop for Partners
Enhancing Worker Digital Experience: A Hands-on Workshop for PartnersEnhancing Worker Digital Experience: A Hands-on Workshop for Partners
Enhancing Worker Digital Experience: A Hands-on Workshop for Partners
 
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhi
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | DelhiFULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhi
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhi
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected Worker
 
Pigging Solutions Piggable Sweeping Elbows
Pigging Solutions Piggable Sweeping ElbowsPigging Solutions Piggable Sweeping Elbows
Pigging Solutions Piggable Sweeping Elbows
 
Key Features Of Token Development (1).pptx
Key  Features Of Token  Development (1).pptxKey  Features Of Token  Development (1).pptx
Key Features Of Token Development (1).pptx
 
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationFrom Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
 
SIEMENS: RAPUNZEL – A Tale About Knowledge Graph
SIEMENS: RAPUNZEL – A Tale About Knowledge GraphSIEMENS: RAPUNZEL – A Tale About Knowledge Graph
SIEMENS: RAPUNZEL – A Tale About Knowledge Graph
 
Slack Application Development 101 Slides
Slack Application Development 101 SlidesSlack Application Development 101 Slides
Slack Application Development 101 Slides
 
Breaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path MountBreaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path Mount
 
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
 
The Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptxThe Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptx
 

Multiplexing and Spreading-1.pdf

  • 1. Chapter 6 Bandwidth Utilization: Multiplexing and Spreading Spreading 6.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
  • 2. Note Bandwidth utilization is the wise use of Note available bandwidth to achieve specific goals specific goals. Efficiency can be achieved by Efficiency can be achieved by multiplexing; privacy and anti-jamming can be achieved by spreading. 6.2
  • 3. 6 6- -1 1 MULTIPLEXING MULTIPLEXING Whenever Whenever the the bandwidth bandwidth of of a a medium medium linking linking two two d i d i i i t t th th th th b d idth b d idth d d f f th th devices devices is is greater greater than than the the bandwidth bandwidth needs needs of of the the devices, devices, the the link link can can be be shared shared. . Multiplexing Multiplexing is is the the set set f f t h i t h i th t th t ll ll th th i lt i lt of of techniques techniques that that allows allows the the simultaneous simultaneous transmission transmission of of multiple multiple signals signals across across a a single single data data li k li k A A d t d t d d t l i ti t l i ti i i link link. . As As data data and and telecommunications telecommunications use use increases, increases, so so does does traffic traffic. . Frequency-Division Multiplexing Topics discussed in this section: Topics discussed in this section: q y p g Wavelength-Division Multiplexing Synchronous Time-Division Multiplexing 6.3 Statistical Time-Division Multiplexing
  • 4. Figure 6.1 Dividing a link into channels 6.4
  • 5. Figure 6.2 Categories of multiplexing 6.5
  • 6. Figure 6.3 Frequency-division multiplexing 6.6
  • 7. Note FDM is an analog multiplexing technique Note FDM is an analog multiplexing technique that combines analog signals. 6.7
  • 8. Figure 6.4 FDM process 6.8
  • 9. Figure 6.5 FDM demultiplexing example 6.9
  • 10. Example 6.1 Assume that a voice channel occupies a bandwidth of 4 kHz. We need to combine three voice channels into a link kHz. We need to combine three voice channels into a link with a bandwidth of 12 kHz, from 20 to 32 kHz. Show the configuration, using the frequency domain. Assume there configuration, using the frequency domain. Assume there are no guard bands. Solution Solution We shift (modulate) each of the three voice channels to a different bandwidth as shown in Figure 6 6 We use the different bandwidth, as shown in Figure 6.6. We use the 20- to 24-kHz bandwidth for the first channel, the 24- to 28 kHz bandwidth for the second channel and the 28 to 28-kHz bandwidth for the second channel, and the 28- to 32-kHz bandwidth for the third one. Then we combine them as shown in Figure 6 6 6.10 them as shown in Figure 6.6.
  • 11. Figure 6.6 Example 6.1 6.11
  • 12. Example 6.2 Five channels each with a 100 kHz bandwidth are to be Five channels, each with a 100-kHz bandwidth, are to be multiplexed together. What is the minimum bandwidth of the link if there is a need for a guard band of 10 kHz the link if there is a need for a guard band of 10 kHz between the channels to prevent interference? Solution For five channels, we need at least four guard bands. This means that the required bandwidth is at least q 5 × 100 + 4 × 10 = 540 kHz, as shown in Figure 6.7. 6.12 g
  • 13. Figure 6.7 Example 6.2 6.13
  • 14. Example 6.3 Four data channels (digital) each transmitting at 1 Four data channels (digital), each transmitting at 1 Mbps, use a satellite channel of 1 MHz. Design an appropriate configuration using FDM appropriate configuration, using FDM. Solution The satellite channel is analog. We divide it into four g f channels, each channel having a 250-kHz bandwidth. Each digital channel of 1 Mbps is modulated such that g f p each 4 bits is modulated to 1 Hz. One solution is 16-QAM modulation. Figure 6.8 shows one possible configuration. 6.14 g p f g
  • 15. Figure 6.8 Example 6.3 6.15
  • 16. Figure 6.9 Analog hierarchy 6.16
  • 17. Example 6.4 The Advanced Mobile Phone System (AMPS) uses two bands The first band of 824 to 849 MHz is used for bands. The first band of 824 to 849 MHz is used for sending, and 869 to 894 MHz is used for receiving. Each user has a bandwidth of 30 kHz in each direction Each user has a bandwidth of 30 kHz in each direction. How many people can use their cellular phones simultaneously? simultaneously? Solution Each band is 25 MHz. If we divide 25 MHz by 30 kHz, we get 833.33. In reality, the band is divided into 832 channels. Of these, 42 channels are used for control, which means only 790 channels are available for cellular 6.17 phone users.
  • 18. Figure 6.10 Wavelength-division multiplexing 6.18
  • 19. Note WDM is an analog multiplexing Note WDM is an analog multiplexing technique to combine optical signals. 6.19
  • 20. Figure 6.11 Prisms in wavelength-division multiplexing and demultiplexing 6.20
  • 22. Note TDM is a digital multiplexing technique TDM is a digital multiplexing technique for combining several low-rate h l i t hi h t channels into one high-rate one. 6.22
  • 23. Figure 6.13 Synchronous time-division multiplexing 6.23
  • 24. Note In synchronous TDM, the data rate of the link is n times faster, and the unit duration is n times shorter. 6.24
  • 25. Example 6.5 In Figure 6.13, the data rate for each input connection is 3 kbps. If 1 bit at a time is multiplexed (a unit is 1 bit), what is the duration of (a) each input slot, (b) each output l d ( ) h f ? slot, and (c) each frame? Solution We can answer the questions as follows: a. The data rate of each input connection is 1 kbps. This means that the bit duration is 1/1000 s or 1 ms. The duration of the input time slot is 1 ms (same as bit duration). 6.25
  • 26. Example 6.5 (continued) b. The duration of each output time slot is one-third of the input time slot. This means that the duration of the output time slot is 1/3 ms. c. Each frame carries three output time slots. So the duration of a frame is 3 × 1/3 ms, or 1 ms. The duration of a frame is the same as the duration of an input unit. 6.26
  • 27. Example 6.6 Figure 6.14 shows synchronous TDM with a data stream f h i t d d t t f th t t Th for each input and one data stream for the output. The unit of data is 1 bit. Find (a) the input bit duration, (b) th t t bit d ti ( ) th t t bit t d (d) th the output bit duration, (c) the output bit rate, and (d) the output frame rate. Solution We can answer the questions as follows: a. The input bit duration is the inverse of the bit rate: 1/1 Mbps = 1 μs. b. The output bit duration is one-fourth of the input bit d i ¼ 6.27 duration, or ¼ μs.
  • 28. Example 6.6 (continued) c. The output bit rate is the inverse of the output bit p f p duration or 1/(4μs) or 4 Mbps. This can also be deduced from the fact that the output rate is 4 times as f f p fast as any input rate; so the output rate = 4 × 1 Mbps = 4 Mbps. p d. The frame rate is always the same as any input rate. So f y y p the frame rate is 1,000,000 frames per second. Because we are sending 4 bits in each frame, we can g f , verify the result of the previous question by multiplying the frame rate by the number of bits per 6.28 p y g f y f p frame.
  • 30. Example 6.7 Four 1-kbps connections are multiplexed together. A unit is 1 bit. Find (a) the duration of 1 bit before multiplexing, (b) the transmission rate of the link, (c) the duration of a time slot, and (d) the duration of a frame. S l ti Solution We can answer the questions as follows: Th d ti f 1 bit b f lti l i i 1 / 1 kb a. The duration of 1 bit before multiplexing is 1 / 1 kbps, or 0.001 s (1 ms). b. The rate of the link is 4 times the rate of a connection, 4 kb 6.30 or 4 kbps.
  • 31. Example 6.7 (continued) Th d ti f h ti l t i f th f th c. The duration of each time slot is one-fourth of the duration of each bit before multiplexing, or 1/4 ms or 250 N t th t l l l t thi f th 250 μs. Note that we can also calculate this from the data rate of the link, 4 kbps. The bit duration is the i f th d t t 1/4 kb 250 inverse of the data rate, or 1/4 kbps or 250 μs. d Th d ti f f i l th th d. The duration of a frame is always the same as the duration of a unit before multiplexing, or 1 ms. We l l l t thi i th E h f i can also calculate this in another way. Each frame in this case has four time slots. So the duration of a f i 4 ti 250 1 6.31 frame is 4 times 250 μs, or 1 ms.
  • 33. Example 6.8 Four channels are multiplexed using TDM. If each channel sends 100 bytes /s and we multiplex 1 byte per channel sends 100 bytes /s and we multiplex 1 byte per channel, show the frame traveling on the link, the size of the frame, the duration of a frame, the frame rate, and the frame, the duration of a frame, the frame rate, and the bit rate for the link. S l i Solution The multiplexer is shown in Figure 6.16. Each frame i 1 b f h h l h i f h f carries 1 byte from each channel; the size of each frame, therefore, is 4 bytes, or 32 bits. Because each channel is di 100 b / d f i 1 b f h sending 100 bytes/s and a frame carries 1 byte from each channel, the frame rate must be 100 frames per second. Th bi i 100 32 3200 b 6.33 The bit rate is 100 × 32, or 3200 bps.
  • 35. Example 6.9 A multiplexer combines four 100-kbps channels using a time slot of 2 bits. Show the output with four arbitrary inputs. What is the frame rate? What is the frame duration? What is the bit rate? What is the bit duration? Solution Figure 6.17 shows the output for four arbitrary inputs. g p f f y p The link carries 50,000 frames per second. The frame duration is therefore 1/50,000 s or 20 μs. The frame rate f μ f is 50,000 frames per second, and each frame carries 8 bits; the bit rate is 50,000 × 8 = 400,000 bits or 400 kbps. 6.35 p The bit duration is 1/400,000 s, or 2.5 μs.
  • 37. Figure 6.18 Empty slots 6.37
  • 38. Figure 6.19 Multilevel multiplexing 6.38
  • 39. Figure 6.20 Multiple-slot multiplexing 6.39
  • 40. Figure 6.21 Pulse stuffing 6.40
  • 41. Figure 6.22 Framing bits 6.41
  • 42. Example 6.10 We have four sources, each creating 250 characters per second If the interleaved unit is a character and 1 second. If the interleaved unit is a character and 1 synchronizing bit is added to each frame, find (a) the data rate of each source (b) the duration of each character in rate of each source, (b) the duration of each character in each source, (c) the frame rate, (d) the duration of each frame (e) the number of bits in each frame and (f) the frame, (e) the number of bits in each frame, and (f) the data rate of the link. Solution We can answer the questions as follows: q f a. The data rate of each source is 250 × 8 = 2000 bps = 2 kbps. 6.42 p
  • 43. Example 6.10 (continued) b. Each source sends 250 characters per second; therefore, the duration of a character is 1/250 s, or 4 ms. c. Each frame has one character from each source, which means the link needs to send 250 frames per second to keep the transmission rate of each source. d. The duration of each frame is 1/250 s, or 4 ms. Note that the duration of each frame is the same as the duration of each character coming from each source. e. Each frame carries 4 characters and 1 extra synchronizing bit. This means that each frame is 6.43 4 × 8 + 1 = 33 bits.
  • 44. Example 6.11 Two channels, one with a bit rate of 100 kbps and another with a bit rate of 200 kbps are to be multiplexed another with a bit rate of 200 kbps, are to be multiplexed. How this can be achieved? What is the frame rate? What is the frame duration? What is the bit rate of the link? is the frame duration? What is the bit rate of the link? S l i Solution We can allocate one slot to the first channel and two slots h d h l h f i 3 bi h to the second channel. Each frame carries 3 bits. The frame rate is 100,000 frames per second because it carries 1 bi f h fi h l Th bi i 100 000 1 bit from the first channel. The bit rate is 100,000 frames/s × 3 bits per frame, or 300 kbps. 6.44
  • 45. Figure 6.23 Digital hierarchy 6.45
  • 46. Table 6.1 DS and T line rates 6.46
  • 47. Figure 6.24 T-1 line for multiplexing telephone lines 6.47
  • 48. Figure 6.25 T-1 frame structure 6.48
  • 49. Table 6.2 E line rates 6.49
  • 50. Figure 6.26 TDM slot comparison 6.50
  • 51. 6 6- -1 1 SPREAD SPECTRUM SPREAD SPECTRUM In In spread spread spectrum spectrum (SS), (SS), we we combine combine signals signals from from different different sources sources to to fit fit into into a a larger larger bandwidth bandwidth but but our our different different sources sources to to fit fit into into a a larger larger bandwidth, bandwidth, but but our our goals goals are are to to prevent prevent eavesdropping eavesdropping and and jamming jamming. . To To achieve achieve these these goals goals spread spread spectrum spectrum techniques techniques add add achieve achieve these these goals, goals, spread spread spectrum spectrum techniques techniques add add redundancy redundancy. . Frequency Hopping Spread Spectrum (FHSS) Topics discussed in this section: Topics discussed in this section: q y pp g p p ( ) Direct Sequence Spread Spectrum Synchronous (DSSS) 6.51
  • 52. Figure 6.27 Spread spectrum 6.52
  • 53. Figure 6.28 Frequency hopping spread spectrum (FHSS) 6.53
  • 54. Figure 6.29 Frequency selection in FHSS 6.54
  • 55. Figure 6.30 FHSS cycles 6.55
  • 56. Figure 6.31 Bandwidth sharing 6.56
  • 58. Figure 6.33 DSSS example 6.58