Professional Documents
Culture Documents
j=1
f
ij
= d
i
,
which d
i
is cell is PCI demand, n is number of cell, m is the number of usable frequency [4].
1576 PIERS Proceedings, Moscow, Russia, August 1923, 2012
generate the initial
population
(generate several
individuals randomly)
Evaluate fitness
functions
Meet
optimization
criteria
select
No
cross
mutation
G
e
n
e
t
i
c
o
p
e
r
a
t
e
o
r
Find the best
individual and
finish
Yes
Figure 1: Follow of genetic algorithm. Figure 2: Mapping of downlink reference signals.
2.2. Initial Population
There are two ways to initial population generally, one is random generation, which is used for the
situation of solution to the problem without any prior knowledge, and another one is to transfer
some prior knowledge to a group of essential requirements, then choose the population randomly
from the results which meet the requirement. In order to get the optimal solution faster, the second
way is used to initial population in this paper [5].
3. SYSTEM REALIZATIONS
Genetic algorithm is packaged in this paper to realize the function of automatic plan for each cells
PCI in LTE.
3.1. Theory of Automatic PCI Plan
There are several factors needed to consider during PCI code plan, such as PBCH, PDCCH and
so on. In this system, user could choose one or multiple channels as the considerations during PCI
plan. As known, the dierent channel has dierent parameter. For example, PBCH uses initial
parameter
C
Init
= N
Cell
ID
, (1)
which N
Cell
ID
is PCI of this cell. PDCCH uses initial parameter
C
Init
= n
s
/2 2
9
+ N
Cell
ID
, (2)
which n
s
is number of timeslot in frame, N
Cell
ID
is PCI of this cell. PCFICH uses initial parameter
C
Init
= (n
s
/2 + 1)
2 N
Cell
ID
+ 1
2
9
+ N
Cell
ID
, (3)
which n
s
is number of timeslot in frame, N
Cell
ID
is PCI of this cell.
Correlation of scrambling code in LTE is calculated by R
ab
=
1
N
N
i=1
a
i
b
i
. Considering the delay
of LTE system, an improved method is used as follows:
R
ab
=
1
N
N
i=1
a
M
b
i
, M =
N, (i + m) mod N = 0
(i + m) mod N, (i + m) mod N = 0
(4)
Progress In Electromagnetics Research Symposium Proceedings, Moscow, Russia, August 1923, 2012 1577
input
PCI plan requirement
Interference matrix
PCI plan (genetic
algorithm)
solution
Database
output
P
C
I
p
l
a
n
s
y
s
t
e
m
Figure 3: Construction of PCI plan system.
start
1. select cells
2. generate PCI plan
requirement list
3. select usable PCI
4. generate cell
interference matrix
5. initial populate
6. evaluation
Is get the best
approximate
solution
7. Save the best
individual, or
replace the worst
individual
No
8. selection
9.cross
10. mutation
11. adjustment Yes
12. output
finish
Figure 4: Flow of PCI plan algorithm.
3.2. PCI Automatic Plan
PCI plan module is used for assisting LTE network plan and optimizes and gets best solution of
PCI plan. System would obtain cell information, such as frequency, and measurement report, etc.
before PCI planning. Then system would assign PCI for cells in order to reduce the interference of
the whole LTE network as far as possible. At last, the system would output the solution for users.
PCI plan module is shown in Figure 3, which, the ow of PCI plan algorithm is shown in Figure 4.
4. SIMULATION RESULT OF PCI PLAN
All the algorithm and method introduced above are coded with C# and used in LTE plan tool
ANPOP. This PCI plan system also needs Geographic Information System (GIS) as an addition
condition. In this section, we use RS and PBCHs SINR to evaluate the eect of PCI plan method
based on genetic algorithm by compare with the simulation result of manual and automatic PCI
plan.
At the same time, Monte Carlo (MC) simulation is also launched in this paper. Assuming there
are 5 UEs every cell, service type is Full Buer FTP. The result of MC shows as follows:
Manual PCI plan, average cell throughput is 16.3 Mbps, average cell edge throughput is
0.43 Mbps;
Automatic PCI plan using genetic algorithm, average cell throughput is 20.1 Mbps, average
cell edge throughput is 0.65 Mbps.
To compare the two results, we could know that, using the second method could increase cell
throughput 23.3%, and cell edge throughput 51.2%.
According to the results above, the algorithm mentioned in this paper could reduce same fre-
quency disturbance and improve SINR coverage of the network, and also could increase the through-
put of the LTE network.
1578 PIERS Proceedings, Moscow, Russia, August 1923, 2012
RS simulation result by PCI plan manually RS simulation result by PCI plan of genetic algorithm
RS SINR Area (km ) Persentage (%) RS SINR Area (km ) Persentage (%)
15.0 =< X < 10.0 0.025 0.1 15.0 =< X < 10.0 0.000 0.0
10.0 =< X < 3.0 4.988 13.6 10.0 =< X < 3.0 0.025 0.1
3.0 =< X < 5.0 4.187 11.4 3.0 =< X < 5.0 4.988 13.6
5.0 =< X < 10.0 8.137 22.2 5.0 =< X < 10.0 4.187 11.4
10.0 =< X < 20.0 15.330 41.8 10.0 =< X < 20.0 8.137 22.2
20.0 =< X < 40.0 4.016 10.9 20.0 =< X < 40.0 15.330 41.8
40.0 =< X 0.000 0.0 40.0 =< X 4.016 10.9
2
2
Figure 5: Simulation results of RSs SINR.
5. CONCLUSIONS
From the simulation result above, we could get the conclusion that assigning PCI reasonably is able
to eectively reduce the interference in LTE system, especially in the case of constructing network
using the same frequency, and to improve coverage and QoS of the network. As a result, PCI plan
algorithm presented in this paper is suitable for multi-antenna LTE system.
ACKNOWLEDGMENT
Especially thanks to my lovely wife; I cannot nish this paper without her support.
REFERENCES
1. 3GPP, Evolved universal terrestrial radio access (E-UTRA); Physical channels and modula-
tion (release 8), 3GPP TS 36.211, 7274, Dec. 2009.
2. Shen, J. and S. Suo, 3GPP Long Term Evolution (LTE) Technical Principle and System Design,
Posts & Telecom Press, Beijing, 2010.
3. Ngo, C. Y. and V. O. K. Li, Fixed channel assignment in cellular radio networks using a
modied genetic algorithm, IEEE Transactions on Vehicular Technology, Vol. 47, No. 1, 163
172, 1998.
4. 3GPP, Evolved universal terrestrial radio access (E-UTRA); Radio resource control (release
8), 3GPP TS 36.331, 7576, Dec. 2010.
5. Wang, X. P. and L. M. Cao, Genetic Algorithm Theory, Application and Software Imple-
mentation, Xian Jiaotong University Press, Xian, 2003.