Chapter 6

Bandwidth Utilization:
Multiplexing and
Spreading

6.1
 Bandwidth utilization is the wise use of
available bandwidth to achieve
specific goals.

Efficiency can be achieved by

multiplexing; privacy and anti-jamming
can be achieved by spreading.

6.2
 MULTIPLEXING

Whenever the bandwidth of a medium linking two

devices is greater than the bandwidth needs of the
devices, the link can be shared. Multiplexing is the set
of techniques that allows the simultaneous
transmission of multiple signals across a single data
link. As data and telecommunications use increases, so
does traffic.

6.3
 Dividing a link into channels

link refers to the physical path.

channel refers to the portion of a link that carries a transmission between a
given pair of lines

Combine many transmission separates the stream back into its

streams into a single stream component transmissions

6.4
 Categories of multiplexing

6.5
 Frequency-division multiplexing

6.6
 Note

FDM is an analog multiplexing technique

that combines analog signals.

6.7
 FDM process
Each source generates Inside the multiplexer, these similar signals
a signal of a similar
modulates different carrier frequencies
frequency range.

6.8
 FDM demultiplexing example

uses a series of filters to decompose the multiplexed signal into its constituent
component signals

6.9
 Assume that a voice channel occupies a bandwidth of 4
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
are no guard bands.

6.10
6.11
 Assume that a voice channel occupies a
bandwidth of 4kHz. We need to multiplex 10
voice channels with guard bands of 500Hz
using FDM. Calculate the required bandwidth.

6.12
 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
between the channels to prevent interference?

6.13
6.14
 Four data channels (digital), each transmitting at 1
Mbps, use a satellite channel of 1 MHz. Design an
appropriate configuration, using FDM.

6.15
 B = S = N*1/r [baud]; d = 0

6.16
 We need to transmit 100 digitized voice
channels (64 kbps) using a pass-band
channel of 200 kHz. What should be the
ratio of bits/Hz (r) if we use no guard band?

6.17
 Analog hierarchy

6.18
 Wavelength-division multiplexing

Very narrow bands of light from different sources are combined

to make a wider band of light. At the receiver, the signals are
separated by the demultiplexer.

6.19
 Note

WDM is an analog multiplexing

technique to combine optical signals.

6.20
 Prisms in wavelength-division multiplexing and demultiplexing

A prism bends a beam of light based on the angle of incidence and the frequency

A multiplexer combine several input beams

of light, each containing a narrow band of A demultiplexer can also be
frequencies, into one output beam of a wider made to reverse the process
band of frequencies.

6.21
 TDM

6.22
 Note

TDM is a digital multiplexing technique

for combining several low-rate
channels into one high-rate one.

6.23
 Synchronous time-division multiplexing

Time slots are grouped into frames. A frame consists of

one complete cycle of time slots, with one slot dedicated
to each sending device.

6.24
 Note

In synchronous TDM, the data rate

of the link is n times faster, and the unit
duration is n times shorter.
A unit can be 1 bit, one character, or one block of data.

6.25
6.26
 Given that the data rate for each input connection is 1
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 slot,
and (c) each frame?

6.27
6.28
 A synchronous TDM with a data stream for each input
and one data stream for the output. The unit of data is 8
bits. Find (a) the input slot duration, (b) the output slot
duration, (c) the output bit rate, and (d) the output frame
rate.

6.29
 Interleaving

Two fast-rotating switches rotate at the same speed,

opposite direction

6.30
 Four channels are multiplexed using TDM. If each
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 bit rate for the link.

6.31
6.32
 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 duration? What is the frame
rate? What is the output bit rate? What is the output bit
duration?

6.33
6.34
 Empty slots

one of the input lines has no data to send and one slot in another
input line has discontinuous data

6.35
 Multilevel multiplexing

6.36
 Multiple-slot multiplexing

A serial-to-parallel converter in the

line to make two inputs out of one

6.37
 Pulse stuffing

Pulse stuffing, bit padding, or bit stuffing.

6.38
 Frame Synchronizing

In most cases, this synchronization information consists of 1 bit per frame,

alternating between 0 and 1

6.39
 We have four sources, each creating 250 characters per
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
each source, (d) the frame rate, (c) the duration of each
frame, (e) the number of bits in each frame, (f) the output
bit rate

6.40
 Digital Signal Service
Digital hierarchy
136 kbps of
overhead.

192 kbps of
overhead.

7.92 Mbps of
overhead.

8 kbps of
overhead.

6.41
 To implement those services, the telephone companies use T lines
(T-1 to T-4). These are lines with capacities precisely matched to
the data rates of the DS-1 to DS-4 services

DS and T line rates

6.42
 Europeans use a version of T lines called E lines. The two systems
are conceptually identical, but their capacities differ.

E line rates

6.43
 TDM slot comparison

6.44
 Statistical Time-Division Multiplexing

Slots are dynamically allocated to improve bandwidth efficiency.

Only when an input line has a slot's worth of data to send is it

given a slot in the output frame.

The multiplexer checks each input line in round-robin fashion

• It allocates a slot for an input line if the line has data to send
• Otherwise, it skips the line and checks the next line.

Addressing: We need to include the address of the receiver

inside each slot to show where it is to be delivered.
•n bits to define N different output lines with n =log2N.

6.45
 SPREAD SPECTRUM

In spread spectrum (SS), we combine signals from

different sources to fit into a larger bandwidth, but our
goals are to prevent eavesdropping and jamming. To
achieve these goals, spread spectrum techniques add
redundancy.

6.46
 Spread spectrum

The spreading code is a series of numbers that look random, but are
actually a pattern.

6.47
 Frequency hopping spread spectrum (FHSS)

A pseudorandom
code generator,
called
pseudorandom
noise (PN), creates
a k-bit pattern for
every hopping
period Th

6.48
The frequency
table uses the
pattern to find the
frequency to be
used for this
hopping period and
passes it to the
frequency
synthesizer.

6.49
The frequency
synthesizer
creates a carrier
signal of that
frequency, and the
source signal
modulates the
carrier signal.

6.50
 Frequency selection in FHSS

6.51
 FHSS cycles with eight hopping frequencies.

6.52
 Bandwidth sharing

6.53
 1. What is the minimum number of bits in a PN
sequence if we use FHSS with a signal with bandwidth
of B= 4kHz and Bss = 100kHz?

2. An FHSS system uses a 4-bit PN sequence. If the bit

rate of the PN is 64 bits per second, answer the
following questions:
a. What is the total number of possible hops?
b. What is the time needed to finish a complete cycle
of PN

6.54
 DSSS

we replace each data bit with n bits using a spreading code. In other
words, each bit is assigned a code of n bits, called chips, where the
chip rate is n times that of the data bit.

6.55
 DSSS example

Barker sequence: n=11

6.56
 We have a digital medium with a data rate of
10Mbps. How many 64-kbps voice channels
can be carried by this medium if we use DSSS
with the Barker sequence

6.57