4 INTRODUCTION TO
MULTIPLEXING AND
DEMULTIPLEXING
4.1 Definition
Multiplexing is a process that allows multiple signals to travel
simultaneously over a single communication channel or path.
Multiplexing in computer networks increases the amount of data that
can be transmitted in a given time-span over a given bandwidth.
Multiplexing divides a given path logically into several short paths and
then uses each path to transmit the data of an individual node.
Demultiplexing refers to the separation of a combination back into
separate information streams
two devices are mainly used; a multiplexer and a demultiplexer. Both
devices work on both ends of the path. A multiplexer works on the
transmitting side and a demultiplexer works on the receiving side.
4.2 The Basic Types of Multiplexing
There are four basic approaches to multiplexing and each has a
set of variations and implementations
• Frequency Division Multiplexing (FDM)
• Wavelength Division Multiplexing (WDM)
• Time Division Multiplexing (TDM)
• Code Division Multiplexing (CDM)
TDM and FDM are widely used
WDM is a form of FDM used for optical fiber
CDM is a mathematical approach used in cell phone mechanisms
4.4 FDM –Basic Operation
Multiple signals can be modulated using different frequencies
Signals with different frequencies can be Multiplexed together
The multiplexed signal has a center frequency and bandwidth larger
than total BW of all multiplexed signals
Signals generated by each sending device modulate different carrier
frequencies
These modulated signals are then combined into a single composite
signal that can be transported by the unique link
The Multiplexing process starts by applying amplitude modulation into
each signal by using different carrier frequencies
The signals are then combined into a composite signal (see figure blow
with 2 input signals)
In Demultiplexing process, we use filter to decompose the multiplexed
signal into its constituent components
Each signal is then passed into amplitude demodulator to separate the
carrier signal from the message signal
The message is then sent to the receiver(see figure below with 2 output
signals)
Analog
Signal
4.5 Time-Division-Multiplexing (TDM)
In TDM, multiple transmissions can occupy a single link by subdividing
the messages in units and interleaving the units; the TDM is a round
robin use of the frequency. TDM can be implemented in two ways:
Synchronous TDM and Asynchronous or Statistical TDM
4.5.1 Synchronous TDM
The multiplexor allocates exactly the same time slot to each device at
all the time, whether or not the device has anything to transmit
The multiplexor accepts input from attached devices in a round-robin
fashion and transmit the data in a never ending pattern.
Why is synchronization needed?
Observe that a synchronous TDM sends one slot
after another without any indication of the
output to which a given slot occurs
A demultiplexer cannot tell where a slot begins
A slight difference in the clocks used to time bits
can cause a demultiplexer to misinterpret the bit
stream
Slots are organized in Frames for synchronization
Example: Framing Used in the Telephone System
Version of TDM
• To prevent misinterpretation, the version of TDM used in the phone system
includes an extra framing channel as input
• Instead of taking a complete slot, framing inserts a single bit in the stream on
each round
• A demultiplexer extracts data from the framing channel and checks for
alternating 0 and 1 bits
• A frame is one complete cycle of time slots.
• The number of slots in a frame is equal to the number of sending devices or
inputs
Framing in the telephone system version of TDM
Example of only 1 station transmitting
Example of 2 devices
The Frame Check Sequence(FCS) field in a frame is used to detect any
errors in the transmission and receipt of a frame. This is done by
comparing the CRC value within the frame against a computed CRC
value of the frame. If the two values do not match, then the frame is
discarded. (see figure below)
Framing
An example with 4 devices transmitting a string of characters (Figures A
and B below)
The Problem with Synchronous TDM:
Unfilled Slots
• Synchronous TDM works well if each source produces data at a
uniform, fixed rate equal to 1/N of the capacity of the shared
medium
• Many sources generate data in bursts, with idle time between
bursts
• In practice, a slot cannot be empty because the underlying
system must continue to transmit data
the slot is assigned a value (such as zero)
and an extra bit is set to indicate that the value is invalid
4.5.2 Asynchronous or Statistical TDM
• In Asynchronous or Statistical TDM, each slot in a frame is not
dedicated to a fix device.
• In Asynchronous or Statistical TDM each frame has a fix number
of slots. Each slot contains an index of the device to be sent to
and a message
• Thus the number of slots in a frame is not necessary equal to
the number of input devices.
• More than one slot in a frame can be allocated to an input
device
• Asynchronous or Statistical TDM maximizes the usage of the link
Figures A & B below are examples (frames have 3 slots instead of 4)
4.6 Key Differences Between TDM and FDM
[Link] time-division multiplexing (TDM) includes sharing of the time through utilizing time slots for the
signals. On the other hand, frequency-division multiplexing (FDM) involves the distribution of the
frequencies, where the channel is divided into various bandwidth ranges (channels).
[Link] signal or Digital signal any could be utilized for the TDM while FDM works with Analog
signals only.
[Link] bits (Sync Pulses) are used in TDM at the start of a frame in order to enable synchronization.
As against, FDM uses Guard bands to separate the signals and prevent its overlapping.
[Link] system generates different carriers for the different channels, and also each occupies a distinct
frequency band. In addition, different bandpass filters are required. Conversely, the TDM system
requires identical circuits. As a result, the circuitry needed in FDM is more complex than needed in
TDM.
[Link] non–linear character of the various amplifier in the FDM system produces harmonic distortion,
and this introduces the interference. In contrast, in TDM system time slots are allotted to various
signals; as the multiple signals are not inserted simultaneously in a link. Although, the non-linear
requirements of both the systems are same, but TDM is immune to interference (crosstalk).
[Link] utilization of physical link in case of TDM is more efficient than in FDM. The reason behind this is
that the FDM system divides the link in multiple channels which does not make use of full channel
capacity.
4.5 Code Division Multiplexing (CDM)
CDM used in parts of the cellular telephone system and for
some satellite communication
• The specific version of CDM used in cell phones is known
as Code Division Multi-Access (CDMA)
• Frequency hopping: Each user regularly hops between
different frequencies (hoping pattern)
CDM does not rely on physical property such as frequency or
time
CDM relies on an interesting mathematical idea
• values from orthogonal vector spaces can be
combined and separated without interference
Each sender is assigned a unique binary code Ci
• that is known as a chip sequence
• chip sequences are selected to be orthogonal
vectors (i.e., the dot product of any two chip
sequences is zero)
Some Useful Definitions
In what follows we will make use of the following definitions
1) Let R=(r1, r2, r3, ……, rm); V=(v1 v2 v3 ……,vn);
Def1: RxV=((v1*r1, v1*r2,v1*r3,…., v1*rm) (v2* r1,v2* r2,v2* c3,…., v2*rn) (v3*r1,v3* r2,v3*r3,…., v3*rm),
……., (vn*r1,vn* r2,vn*r3,…., vn*rm) )
=(v1*r1, v1*r2,v1*r3,…., v1*rm ,v2* c1,v2* r2,v2* r3,…., v2*rn , v3*r1,v3* r2,v3*r3,…., v3*rm, …….,
vn*r1,vn* r2,vn*r3,…., vn*rm ) a row vector of m*n elements
Example: Let R=(1 -1 1); V=(1 -1 1 -1 -1); then
RxV=((1 -1 1) (-1 1 -1)(1 -1 1)(-1 1 -1)(-1 1 -1))
=(1 -1 1 -1 1 -1 1 -1 1 -1 1 -1-1 1 -1) Note: 15 elements =3(of C) x 5 (of V)
2) Let W=((a1,a2,a3,….)(b1,b2,b3,…..)(c1,c2,c3,…..),…………)
Def2: R.W=(r1*a1+r2*a2+r3*a3+……, r1*b1+r2*b2+r3*b3+……., r1*c1+r2*c2+r3*c3+.., …)
Example: Let W=((1 0 1) (-1 1 1) (1 1 -1) (0 0 1)); then
R.W=(1*1+0*-1+1*1, 1*-1+1*-1+1*1,1*1+-1*1+1*-1,1*0+-1*0+1*1)
=(2,-1,-1,1) Note: 4 elements = 12 (of W)/3 (of C)
Notes
In what follows
• we will convert a string of binary digits into a vector of integer as follow: bit 1 will
be replaced by 1 and bit 0 by -1
Example
if the binary string is A=100111, it is converted into V=(1,-1,-1,1,1,1)
• Vice Versa we will convert a vector of integer values into a string of binary digits as
follow: a positive integer value will be replaced by bit 1 and a negative integer value
by bit 0
Example
if the integer vector is V=(2,-3,5,6,-1), it is converted into the binary string
A=10110
• Equally V=(1,-1,-1,1,1,1) is converted into A=100111
Each Sender Computes Its Message to be Send
Code Division Multiplexing
• The first step consists of converting Chip Sequence and the Data
Value into vectors where 1 is represented by 1 and 0 by -1
• Then generate the signal to be sent: Chip Sequence x Value
Signals to be Sent
Sequences of signals strengths to be added
Sender 1: 1 -1 -1 1 1 -1 -1 1
Sender 2: -1 -1 1 1 1 1 -1 -1
The Different Messages Are Added and
Sent
• If we think of the resulting values as a sequence of
signal strengths to be transmitted at the same time
the resulting signal will be the digit by digit sum of the
two signals
Subdivide the Resulting Sum in groups of size
Chip Sequence
0 -2 0 2 2 0 -2 0 ((0, -2) (0, 2) (2, 0) (-2, 0)) called composite signal
Each Receiver Computes Its Own Message
• A receiver treats the sequence as a vector, then
computes the product of the vector and the chip
sequence: C.V
• treats the result as a sequence, and converts the
result to binary by interpreting positive values as
binary 1 and negative values as 0
Thus, receiver 1 computes: [Link] signal
(1,-1).((0, -2) (0, 2) (2, 0) (-2, 0))
to get: (0+2 , 0-2 , 2+0, -2+0)=(2, -2, 2, -2)
Each Receiver Computes Its Own
Message
Interpreting the result as a sequence of bits gives:
(2 -2 2 -2) which becomes the binary value: (1 0 1 0)
which is the correct value sent by A
Receiver 2 will compute: (1,1).((0, -2) (0, 2) (2, 0) (-2, 0))
to get: (0-2 0+2 2+0 -2+0)
Interpreting the result as a sequence produces:
(-2 2 2 -2) which becomes the binary (0 1 1 0)
which is the correct value sent by B
CDM General Operation –Power Level
Exercise
Sender Chip string Data
Sender 1 1011 11001
Sender 2 1110 10101
Sender 3 0010 11011
Generate the signal sent for each sender
Generate the composite signal
Compute the received signals
C1 =(1 -1 1 1), v1=(1 1 -1 -1 1)
Message sent by Sender 1: C1xv1=((1 -1 1 1) (1 -1 1 1) (-1 1 -1 -1) (-1 1 -1 -1) (1 -1 1 1))
=(1 -1 1 1 1 -1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 1)
C2 = (1 1 1 -1), V2 =(1 -1 1 -1 1)
Message sent by Sender 2: C2xV2 =((1 1 1 -1) (-1 -1 -1 1) (1 1 1 -1) (-1 -1 -1 1) (1 1 1 -1))
=( 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1)
C3 =(-1 -1 1 -1), V3=(1 1 -1 1 1)
Message sent by Sender 3: C3xV3 =((-1-1 1 -1) (-1 -1 1 -1) (1 1 -1 1) (-1 -1 1 -1)(-1 -1 1 -1))
=(-1 -1 1 -1 -1-1 1-1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1)
CS=Composite signal = (1 -1 1 1 1 -1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 1)+( 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1)+
(-1 -1 1 -1 -1-1 1-1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1)=((1 -1 3 -1) (-1 -3 1 1) (1 3 -1 -1) (-3 -1 -1 -1) (1 1 3 -1))
Receiver 1: [Link]=(5 5 -4 -4 4 )
corresponding binary value: 11001
Receiver 2: [Link]= (1 1 1 -1).((1 -1 3 -1) (-1 -3 1 1) (1 3 -1 -1) (-3 -1 -1 -
1) (1 1 3 -1))=(4,-4,4,-4,4); converted to 10101
Receiver 3: [Link]=(-1 -1 1 -1).((1 -1 3 -1) (-1 -3 1 1) (1 3 -1 -1) (-3 -1 -1
-1) (1 1 3 -1))=(4,4,-4,4,2); converted to 11011
