Beruflich Dokumente
Kultur Dokumente
TCS 455
Lecture 14 (Review)
Office Hours:
BKD 3601-7
Tuesday 14:00-16:00
Thursday 9:30-11:30
1
Announcements
Read
Chapter 3: 3.1 3.2, 3.5.1, 3.6, 3.7.2
Posted on the web
Appendix A.1 (Erlang B)
Chapter 9: 9.1 9.5
Course Organization
Course Web Site:
http://www.siit.tu.ac.th/prapun/ecs455/
Lectures:
Tuesday 10:40-12:00 BKD 2601
Thursday 13:00-14:20 BKD 3215
Textbook:
www.siit.tu.ac.th/prapun/ecs455/
4
Grading System
Coursework will be weighted as follows:
Assignments
Class Participation and Quizzes
Midterm Examination
5%
15%
40%
40%
Midterm Exam
Not to torture you!
Study
HW questions / quiz
Only small parts of HWs are graded.
Please take a careful look at the solution.
Lecture notes
Textbook chapters
Midterm Exam
9 pages
9 problems
Start at 9:00 AM
You may start at 9:09 AM if you want to.
Topics
Chapter 1 > 10%
Fourier transform, modulation
Provided Formula
Am
ErlangB m, A mm! k
A
k 0 k !
2cos 2 x 1 cos 2 x
2sin 2 x 1 cos 2 x
G f
g t e j 2 ft dt
1
1
j
f f c e f f c e j
2
2
cos 2 f ct
g t t0
e j 2 ft 0 G f
e j 2 f0t g t
9
m t cos 2 f ct
G f f0
1
1
M f fc M f fc
2
2
Chapter 1
Review & Introduction
Office Hours:
BKD 3601-7
Tuesday 14:00-16:00
Thursday 9:30-11:30
10
Handout #1
Fourier Transform
Modulation
More on HW1
11
Frequency-Domain Analysis
Shifting Properties: g t t0
e j 2 ft0 G f
Modulation: m t cos 2 f ct
12
e j 2 f0t g t
G f f0
1
1
M f fc M f fc
2
2
13
Mobile?
The term mobile has historically been used to classify all
14
Semaphore
16
17
18
19
20
21
Chapter 2
Cellular System
Office Hours:
BKD 3601-7
Tuesday 14:00-16:00
Thursday 9:30-11:30
22
Handout #2
23
Radio-frequency spectrum
Commercially exploited bands
24
25
26
Frequency Reuse (N = 4, N = 7)
Cluster: a group of N cells use the complete set of available
frequencies
A
B
A
C
B
A
D
A
B
A
D
B
C
A
D
B
C
27
B
C
Activity 1
You have seen N = 3, 4, 7
28
Hexagon
R
3R
R
3
R
2
3R
R
3R
2
R
2
2R
29
3
R
2
1
3
1 3 3 2
Area 6 2
R R
R 2.598R 2
2
2
2 2
Frequency Reuse
Cluster: a group of N cells using the complete set of
available frequencies
4-cell reuse
7-cell reuse
Atotal S
C
Acell N
30
12-cell reuse
19-cell reuse
Method of locating co-channel cells in a cellular system. In this example, N = 19 (i.e., I = 3, j = 2). (Adapted from [Oet83]
IEEE.)
j
2
3R
3R
2 i 3R
3R cos 120
R 3 i 2 j 2 ij R 3N
i 3R
j 3R
This distance, D,
is called reuse
distance.
120
32
Q and N
Co-channel reuse ratio
D
Q 3N .
R
33
SIR
Frequency reuse co-channel interference
I
i 1
34
SIR
The SIR should be greater than a specified threshold for proper
signal operation.
Approximation:
35
S
kR
1 D
1
I K kD K R
K
3N
SIR: N = 7
More accurate calculation
36
SIR: N = 3
D3
2R
D2
7R
13R
D1
7R D4
4R
3
2
D1 D5 R 1 4
R 13
2
3R
2
13R
D5
D6
5 3
D2 D4 R
R 4
2 2
D3 2 R
2
D6 4 R
R
2
37
Pt R
SIR
Pt Di 2
i
13
2 4
38
Atotal S
Acell N
Sectoring (N = 7)
39
Sectoring (N = 7)
40
Sectoring (N = 3, 120)
S 1
I K
K=2
41
3N
Sectoring (N = 3 , 60)
S 1
I K
3N
K=1
42
60 Degree Sectoring
43
Sectoring
S 1
I K
3N
Atotal S
Acell N
Advantages
Assuming seven-cell reuse, for the case of 120 sectors, the number
The increase in SIT can be traded with reducing the cluster size which
Disadvantages
Increase number of antennas at each base station.
Decrease trunking efficiency due to channel sectoring at the base
station.
specific antenna.
44
45
Common Terms
Traffic Intensity: Measure of channel time utilization, which is the average
This is a dimensionless quantity and may be used to measure the time utilization
that the channel allocations for cell sites are designed so that 2 out of 100 calls
will be blocked due to channel occupancy during the busiest hour.
Request Rate: The average number of call requests per unit time. Denoted by
46
M/M/m/m Assumption
Blocked calls cleared
Offers no queuing for call requests.
For every user who requests service, it is assumed there is no setup time and the
The finite user results always predict a smaller likelihood of blocking. So,
AC
Pb CC ! k .
A
k 0 k !
Erlang B
A
48
Example
How many users can be supported for 0.5% blocking
49
AC
Pb CC ! k .
A
k 0 k !
Erlang B
A
50
Example
Consider a cellular system in which
an average call lasts two minutes
the probability of blocking is to be no more than 1%.
51
AC
Pb CC ! k .
A
k 0 k !
Erlang B
A
52
Example
Now employing 120 sectoring, there are only 19 channels
53
AC
Pb CC ! k .
A
k 0 k !
Erlang B
A
54
55
Big Picture
S = total # available duplex radio channels for the system
Frequency reuse with cluster size N
A
S
Capacity C total
Acell N
Trunking
S
kR
1 D
1
K
Tradeoff I
K kD K R
m = # channels allocated to
each cell.
3N
Omni-directional: K = 6
120 Sectoring: K = 2
60 Sectoring: K = 1
Call blocking
m
!
A
tra
ffic
i
ntens
i
ty
or
l
oad
[Erla
ngs]
=
P m i.
probability b
A
1
Chapter 3
Poisson process and Markov chain
Office Hours:
BKD 3601-7
Tuesday 14:00-16:00
Thursday 9:30-11:30
57
M/M/m/m Assumption
Blocked calls cleared
Offers no queuing for call requests.
For every user who requests service, it is assumed there is no setup time and the
The finite user results always predict a smaller likelihood of blocking. So,
Assumption (cont)
The call request process is Poisson with rate
If m = 3, this call will be blocked
t
K(t)
m=3
2
1
t
K(t) = state of the system
= the number of used channel at time t
We want to find out what proportion of time the system has K = m.
59
Poisson Process?
One of these is a realization of a two-dimensional Poisson point
process and the other contains correlations between the points.
One therefore has a real pattern to it, and one is a realization of
a completely unstructured random process.
60
Poisson Process
All the structure that is
visually apparent is
imposed by our own
sensory apparatus, which
has evolved to be so
good at discerning
patterns that it finds
them when theyre not
even there!
61
Example
Examples that are well-modeled as Poisson processes include
radioactive decay of atoms,
telephone calls arriving at a switchboard,
page view requests to a website,
rainfall.
62
63
Poisson Process
The number of arrivals N1, N2 and N3 during non-overlapping time intervals
are independent Poisson random variables with mean = the length of the
corresponding interval.
1
N1 = 1
W1
3
N3 = 1
N2 = 2
W2 W3
W4
The lengths of time between adjacent arrivals W1, W2, W3 are i.i.d.
exponential random variables with mean 1/.
64
Time
N3 = 1
N2 = 2
W2 W 3
Time
W4
In the limit, there is at most one arrival in any slot. The numbers of arrivals on the slots are
i.i.d. Bernoulli random variables with probability p1 of exactly one arrivals = where is the
width of individual slot.
Time
D1
exponential
Poisson
You have seen that Poisson process connects many concepts that
66
67
68
k 1
1 k k
k-1
1 k
k+1
1 1 k k 1 k
The labels on the arrows are
probabilities.
69
1
2
70
1 2
Markov Chain
Markov chains model many phenomena of interest.
We will see one important property: Memoryless
It retains no memory of where it has been in the past.
Only the current state of the process can influence where it goes
next.
signal.
Here, the labels on the arrows indicate transition probabilities. (If the
system is currently at a particular state, where would it go next on
the next time slot? )
We will focus on discrete time Markov chain.
71
weather.
They never have two nice days in a row.
If they have a nice day, they are just as likely to have snow as rain
1/2
1/2
1/2
1/4
1/2
1/4
73
R = Rain
N = Nice
S = Snow
K0 = S
Then,
74
1
p 0 0 0 1 and p 1
4
1
4
1
2
p i 1 p i P
1/4
R N S
1
R
2
1
P N
2
1
S
4
1
4
0
1
4
p n p 0 Pn
p 2 0.3750 0.1875 0.4375
1
4
1
2
1
1/2
1/2
1/2
1/4
1/2
1/4
P K i 1 R K i N
p 365
1
P
2
1
1
4
0
1
4
1
4
1
2
1
0.4375
P 2 0.3750
0.3750
0.4063
P 3 0.4063
0.3906
0.1875 0.3750
0.2500 0.3750
0.1875 0.4375
0.2031 0.3906
0.1875 0.4063
0.2031 0.4063
76
p n p 0 Pn
P[K365 = N]
77
2/5
2 / 5 3 / 5
P
1
/
2
1
/
2
3/5
A
1/2
78
3
1
p A pB
5
2
1/2
1 2
p0 p1
p0 p1 p2 1
p0
79
1
A2
1 A
2
p1 2 p2
, p1 Ap0 , p2
1 2
A p0
2
pb pm
80
Chapter 4
Multiple Access
Office Hours:
BKD 3601-7
Tuesday 14:00-16:00
Thursday 9:30-11:30
81
82
Duplexing
Allow the subscriber to send simultaneously information to the
83
84
85
reverse link.
Each duplex channel has both a forward time slot and a
reverse time slot.
The UL and DL data are transmitted on the same carrier
frequency at different times.
If the time separation between the forward and reverse lime slot is
small, then the transmission and reception of data appears
simultaneous to the users at both the subscriber unit and on the
base station side.
Used in Bluetooth and Mobile WiMAX
Each transceiver operates as either a transmitter or receiver on the
same frequency
Problems of FDD
Because each transceiver simultaneously transmits and
86
Advantages of FDD
TDD frames need to incorporate guard periods equal to the
of individual users.
87
Advantages of TDD
Enable adjustment of the downlink/uplink ratio to efficiently
DL and UL bandwidths.
88