Multiple Access Techniques
Multiple Access Techniques
Techniques
D R . K A L PA N A D H A K A
A S S I S TA N T P R O F E S S O R
I N D I A N I N S T I T U T E O F T E C H N O L O G Y G U WA H AT I
Contents
Frequency Division Multiple Access (FDMA)
Time Division Multiple Access (TDMA)
Code Division Multiple Access (CDMA)
Space Division Multiple Access (SDMA)
Frequency hopped multiple access (FHMA)
Code division multiple access (CDMA)
... f
forward channel
user n
reverse channel
t
FDMA/TDD
user 1
forward channel reverse channel
... f
user n
forward channel reverse channel
t
TDMA/FDD
forward forward
channel channel
user 1 ... user n f
reverse reverse
channel channel
t
TDMA/TDD
user 1 user n
...
forward reverse forward reverse f
channel channel channel channel
t
Wideband systems
Wideband TDMA
CDMA
TDMA/FDD
TDMA/TDD
CDMA/FDD
CDMA/TDD
CDMA/FDD
user 1
forward channel reverse channel
... code
user n
forward channel reverse channel
f
CDMA/TDD
user 1
forward channel reverse channel
... code
user n
forward channel reverse channel
t
Frequency division multiple
access (FDMA)
One phone circuit per channel
Idle time causes wasting of resources
Simultaneous and continuous transmission after channel
assignment
Bandwidth of FDMA channels are narrow (30 kHz in
AMPS)
Usually implemented in narrowband systems
Symbol time is large compared to the average delay
spread: Low ISI (Little or no equalization required)
FDMA compared to TDMA
FDMA systems are less complex
Fewer bits for synchronization
Fewer bits for framing
Higher cell site system costs
Duplexer used at base station and subscriber units
RF filtering in FDMA to minimize adjacent channel
interference
Nonlinear Effects in FDMA
Many channels - same antenna
For maximum power efficiency operate near
saturation
Near saturation power amplifiers are nonlinear
Nonlinearities causes signal spreading, ACI
Intermodulation (IM) frequencies which are
undesired harmonics
Nonlinear Effects in FDMA
(cont.)
Interference with other channels in the FDMA
system
Decreases user C/I (Carrier to Interference
protection ratio) - decreases performance
Interference outside the mobile radio band:
adjacent-channel interference
RF filters needed - higher costs
Number of channels in a
FDMA system
Example: Advanced Mobile
Phone System
Time Division Multiple
Access
Time slots
One user per slot
Buffer and burst method
Noncontinuous transmission
Digital data
Digital modulation
Features of TDMA
a single carrier frequency for several users
transmission in bursts
low battery consumption
handoff process much simpler
FDD : switch instead of duplexer
very high transmission rate
high synchronization overhead
guard slots necessary
Number of channels in a
TDMA system
Example: Global System for
Mobile (GSM)
Efficiency of TDMA
TDMA Frame Structure
TDMA requires a centralized
control node, whose primary
function is to transmit a
periodic reference burst that
defines a frame and forces a
measure of synchronization of
all the users.
• In future adaptive
antennas simultaneously
steer energy in the
direction of many users at
once
Reverse link problems
• Different propagation path between user and
base station
• Dynamic control of transmitting power from
each user to the base station required
• Limits by battery consumption of subscriber
units
• Possible solution is a filter for each user
Solution by SDMA systems
• INTELSAT IVA
• SDMA dual-beam
receive antenna
• simultaneously access
from two different
regions of the earth
SDMA and PDMA in satellites
• COMSTAR 1
• PDMA
• separate antennas
• simultaneously
access from same
region
SDMA and PDMA in satellites
• INTELSAT V
• PDMA and SDMA
• two hemispheric
coverages by SDMA
• two smaller beam
zones by PDMA
• orthogonal polarization
Example of practical cellular
radio systems
Cellular System Multiple Access Technique
AMPS FDMA/FDD
GSM TDMA/FDD
USDC (IS-54 and IS-136) TDMA/FDD
PDC TDMA/FDD
CT2 Cordless Phone FDMA/TDD
DECT Cordless Phone FDMA/TDD
US IS-95 CDMA/FDD
W-CDMA CDMA/FDD
CDMA/TDD
cdma2000 CDMA/FDD
CDMA/TDD
Packet Radio
• In Packet Radio (PR) access techniques, many
subscribers attempt to access a single channel in an
uncoordinated manner
• Collisions from simultaneous transmissions from
multiple transmitters are detected at the base station
receiver, in which case an ACK or NACK signal is
broadcasted by the base station to alert the user
• PR subscribers use a contention technique to transmit
on a common channel
Packet Radio Protocols
• Contention protocols:
• Random Access: there is no coordination among the
users and the messages are transmitted from the users as
they arrive at the transmitter.
• Scheduled Access: based on a coordinated access of
users on the channel and the users transmit messages
within allotted slots or time intervals.
• Hybird Access: a combination of random access and
scheduled access.
• ALOHA protocols: pure and slotted
Pure ALOHA
• The pure ALOHA protocol is random access protocol
used for data transfer and a user accesses a channel as
soon as a message is ready to be transmitted.
• After a transmission, the user waits for an
acknowledgment on either the same channel or a
separate feedback channel.
• In case of collisions, the terminal waits for a random
period of time and retransmits the message.
Slotted ALOHA
• In slotted ALOHA, time is divided into equal time
slots of length greater than the packet duration .
• The subscribers each have synchronized clocks and
transmit a message only at the beginning of a new
time slot.
• The vulnerable period of slotted ALOHA is only one
packet duration, since partial collisions are prevented
through synchronization.
Carrier Sense Multiple Access Protocols
(CSMA)
• In CSMA protocols, each terminal on the
network is able to monitor the status of the
channel before transmitting information
• Variations:
– 1-persistent CSMA
– non-persistent CSMA
– p-persistent CSMA
– CSMA/CD
1-persistent CSMA
• The protocol:
– Listens before transmits
– If channel busy, waits until channel idle
– If channel idle, transmits
– If collision occurs, waits a random amount of time and
starts all over again
• It is called 1-persistent because the station transmits
with a probability of 1 whenever it finds the channel
idle.
non-persistent CSMA
• Sense channel when want to transmit a packet,
– If channel is idle, then transmit the packet immediately.
– If busy, run back-off algorithm immediately to wait a
random time and then re-sense the channel again.
• Problem with non-persistent CSMA is that when the
channel becomes idle from busy, there may be no one
of waiting stations beginning the transmission, thus
waste channel bandwidth
p-persistent CSMA
• Sense channel when want to transmit a packet,
– if channel is busy, then persist sensing the channel until the
channel becomes idle.
– If the channel is idle, transmit the packet with probability
of p, and wait, with probability of 1-p, additional
propagation delay tprop and then re-sense again
CSMA-CD
• When the transmitting station detects a collision, it
stops its transmission immediately, Not transmit the
entire frame which is already in collision.
• When a station wants to transmit a packet, it senses
channel
– if it is busy, use one of above three algorithms (i.e., 1-
persistent, non-persistent, and p-persistent schemes).
– The transmitter senses the channel during transmission.
– If a collision occurred and was sensed, transmitter stops its
left transmission of the current frame; moreover, a short
jamming signal is transmitted to ensure other stations that a
collision has occurred and backoff algorithm is used to
schedule a future re-sensing time.
65
Capacity of Cellular Systems
Q=D/R
• cluster size of 4
• D0 … distance
serving station
to user
• DK … distance
co-channel base
station to user
Carrier-to-interference ratio C/I
• M closest co-channels cells cause first order
interference
-n0
C D0
= M -nk
I DK
k=1
• Assumption:
• just the 6 closest stations interfere
• all these stations have the same distance D
• all have similar path loss exponents to n0
-n0
C D0
= -n0
I 6×D
Worst Case Performance
• maximum interference at D0 = R
• (C/I)min for acceptable signal quality
• following equation must hold:
-n0
1/6 × (R/D) >
= (C/I)min
Co-Channel reuse ratio Q
1/n0
Q = D/R = (6×(C/I)min)
Bt
m= radio channels/cell
Bc × N
Bt Bt
m= = 6 C 2/n0
Bc (Q²/3) Bc ( 3 n0/2
( )min)
I
Radio Capacity, m for n0 = 4
Bt
m=
Bc 2/3 (C/I)min
C Bc 2
( )eq = ( )min ( )
I
C
I Bc’
• Bc … bandwidth of a particular system
• (C/I)min … tolerable value for the same system
• Bc’ … channel bandwidth for a different system
• (C/I)eq … minimum C/I value for the different system
C/I in digital cellular systems
C Eb Rb Ec Rc
= =
I I I
Ec = ( Bc’ )³
Ec’ Bc
Compare C/I between FDMA and TDMA