04 Basic Parameter Planning Rules_v1_1

8/19/2019 04 Basic Parameter Planning Rules_v1_1

http://slidepdf.com/reader/full/04-basic-parameter-planning-rulesv11 1/32

1 © Nokia Siemens Networks Presentation / Author / Date

Company Confidential

PRACH Planning

PCI Planning

UL DM RS Planning

Key Planning Areas parameters – TD-LTE





PRACH PlanningPrinciple

PRACH conig!ration t"o cells m!st #e $ierent "it%in t%e PRACH re-!se $istance toincrease t%e RACH $eco$ing s!ccess rate

PRACH transmission an !e separated !y"

# Time &prac%ConIn$e'(

$ PRACH%P&SCH interferene" 'f PRACH resoures are separated in time within eN(

$ PRACH%PRACH interferene" 'f same PRACH resoures are used for the ells of aneNode()

$ PRACH%PRACH interferene is preferred to PRACH%P&SCH interferene soprac%ConIn$e' o t%e cells on one site s%o!l$ #e t%e same

# )re*!ency &prac%)re*+(

$ Alloation of PRACH area should !e ne*t to P&CCH area either at upper or lower!order of fre+ueny !and, howe-er should not o-erlap with P&CCH area

$ A-oid separation of P&SCH in two areas !y PRACH .sheduler an only handle oneP&SCH area

$ )or simplicity !se same conig!ration or all cells

# Se*!ence &PRACH CS an$ RootSe*In$e'(

$ &se different se+uenes for all nei0h!our ells



© Nokia Siemens Networks Presentation / Author / Date


Pream#le )ormats, )DDTDD common

# PP .3S4)211 speifies 5 random aess formats ommon for !oth 6DD/3DD

# Differene in formats is !ased in the different durations for the yli prefi*,se+uene and 0uard time whih ha-e an effet on the ma*imum ell radius

# +nly )ormats . an$ / are s!pporte$ in initial releases &!p to RL0.(

Reommendation" Selet 6ormat7 for ell

ran0es 815)9 km

Selet 6ormat1 for ellran0es 8::)5 km





Pream#le )ormat 1, TDD-only# PP .3S4)211 speifies a speial random aess format 5 for 3DD

# 's alloated in &pP3S when it is two sym!ols lon0

# ;a*imum ell radius with pream!le format 5 is a!out 1)5km

# N<3=" when usin0 pream!le format 5, only root se+uenes 7%1: are allowed)

# N<3=" when usin0 pream!le format 5, allowed -alue of prahCS is 5)))4) Settin0

prahCS >4 0i-es the ma*imum ell ran0e 81)5km# N<3=" prah6re+<ff must !e set to 7 with pream!le format 5

# N<3=" prahHs6la0 must !e set to false with pream!le format 5





PRACH Conig!ration In$e', prac%ConIn$e' TDDRL/2

prahConf'nde* is

restrited to -alues

))): or 91))9 if

tddSpeSu!fConf is

set to ?:? .ssp:)

prahConf'nde* is

restrited to -alues

))):, 2))29, ))9

or 91)))9 if

tddSpeSu!fConf is

set to ?9? .ssp9

Pream!le

format 5

also

supported





RACH Density

# (ased on the e*peted RACH proce$!res per secon$ and the ma'im!m

collision pro#a#ility of the RACH pream!les it is possi!le to estimate theRACH density as follows"

# Recommen$ation3 !se PRACH $ensity / orstart

# Sine PRACH performane measurementounters are a-aila!le .R@19 $ ;771% Cell @oadit will !e possi!le to e-aluate the amount ofPRACH / RACH proedures in time and adapt/optimiBe the settin0s

# )!t!re eat!res3 PRACH ;ana0ement .auto%onfi0uration, future S<N feature alled PRACHoptimiBation .an aspet of this feature is to adustthe PRACH density to the traffi in the ell


http://slidepdf.com/reader/full/04-basic-parameter-planning-rulesv11 7/32: © Nokia Siemens Networks Presentation / Author / Date


PRACH )re*!ency +setprac%)re*+

# 'ndiates the first PR( a-aila!le for PRACH in the &@ fre+ueny !and

# PRACH area .4 PR(s should !e ne*t to P&CCH area either at upper or lower!order of fre+ueny !and to ma'imi4e t%e PUSCH area !ut not o5erlap "it%PUCCH area

# Parameter is onfi0ured !ased on the P&CCH re0ion .see P&CCH dimensionin0i)e) its -alue depends on how many P&CCH resoures are a-aila!le)

# 'f PRACH area is plaed at the lower !order of &@ fre+ueny !and then"

PRACH%6re+ueny <ffset> roundup P&CCH resoures/2E

# 'f PRACH area is plaed at the upper !order of the &@ fre+ueny !and then"

PRACH%6re+ueny <ffset> NR( %4% roundup P&CCH resoures/2E

NR(" Num!er of Resoure (loks

N<3=" prah6re+<ff must !e set to 7 if prahConf'nde* is set to 91)))9 .pream!le

5


http://slidepdf.com/reader/full/04-basic-parameter-planning-rulesv11 8/32 © Nokia Siemens Networks Presentation / Author / Date


PRACH Cyclic S%it or pream#les .-0Prac%CS

# PrahCS $eines t%e conig!ration used for the pream!le 0eneration) i)e) how

many yli shifts are needed to 0enerate the pream!le# Prac%CS $epen$s on t%e cell si4e

$ Different ell ran0es orrespond to different PrahCS

# Simplifiation" 3o assume all ells ha-e same siBe .limited !y the prachConfIndex

Reommendation"

Selet PrahCS !ased on the ellran0e =)0) if estimated ell ran0e is19km then PrahCS" 12

'f all ells in the network are assumedto ha-e same ell ran0e themPrahCS is the same for the wholenetwork

NN


http://slidepdf.com/reader/full/04-basic-parameter-planning-rulesv11 9/32F © Nokia Siemens Networks Presentation / Author / Date


PRACH Cyclic S%it or pream#le 1Prac%CS

# 6or pream!le 5, prahCs onfi0uration maps to speial ta!le of yli shifts

# 3he hi0hli0hted onfi0uration indies 5G4 are supported in R@19

CS N CS N




Prac%CS an$ rootSe*In$e'

# PrahCS defines the n!m#er o cyclic s%its.in terms of num!er of samples used to

generate m!ltiple pream#le se*!encesrom a single root se*!ence

# =*ample !ased on PrahCS>12 % num!er ofyli shifts" 11F

$ Root se+uene len0th is F so a yli shift of11F samples allows R+U6DD+76 &809://9(;< yli shifts !efore makin0 a ompleterotation .si0natures per root se+uene

# 45 pream!les are transmitted in the PRACHframe) 'f one root is not enou0h to 0enerateall 45 pream!les then more root se+uenesare neessary

$ 3o ensure ha-in0 45 pream!le se+uenes

within the ell it is neessary to ha-eR+U6DUP &=1:<(; 17 root se+uenes per ell

# 6or pream!le format 5, root se+uene len0this 1:)




PRACH Cyclic S%itrootSe*In$e'

# RootSe+'nde* points to the first root

se+uene to !e used when 0eneratin0the set of 45 pream!le se+uenes)

# =ah lo0ial rootSe+'nde* is assoiatedwith a sin0le physial root se+uenenum!er)

# 'n ase more than one root se+uene is

neessary the consec!ti5e num!er isseleted until the full set is 0enerated

# N<3=" parameter rootSe+'nde*speifies the lo0ial root se+uene inde*

Logicalroot

se*!encen!m#er

P%ysical root se*!ence in$e' &in increasing or$er ot%e correspon$ing logical se*!ence n!m#er(

7$2 12F, :17, 157, 4FF, 127, :1F, 217, 42F, 14, 4:1, 5,:99, 179, :5, F, :54, :7, :4F, 47, ::F

2, :, 1,

25$2F 94, :, 112, :2:, 15, 4F1

7$9 7, :9F, 52, :F:, 57, :FF

4$51 9, 75, :, :44, 154, 4F

52$91 1, 7, 2, 11, 7, 7F, 2:, 12, 2F, 17

92$4 25, 19, 5, :F1, 4, ::1, :5, :49, 1:, 441, 14, :7

G) G))

45$:9 4, :9, :, :41, 5, :F4, F, 77, 27, 1F, 21, 1

17$19 7F, 97, 249, 9:5, 2, 474

14$1F 4:, 5:2, 2F4, 95

27$: 4, 97, 79, 95, :, 544, 27, 99F, 2:F, 947, 51F,527, 257, 9FF, 29, 91, 22F, 417

=*trat from PP 3S 4)211 3a!le 9):)2)%5. Pream!le 6ormats 7%) ;appin0 !etween lo0ialand physial root se+uenes)

Reommendation"

&se different rootSe+'nde* arossnei0h!ourin0 ells means to ensurenei0h!our ells will use differentpream!le se+uenes




PRACH Planning7rap Up

Steps3

% Define the prac%ConIn$e'

# Depends on pream!le format .ell ran0e

# 't should !e the same for eah ell of a site

% Define the prac%)re*+

# Depends on the P&CCH re0ion

# 't an !e assumed to !e the same for all ells of a network .simplifiation% Define the Prac%CS

# Depends on the ell ran0e

# 'f for simpliity same ell ran0e is assumed for all network then prahCS is thesame for all ells

% Define the rootSe*In$e'

# 't points to the first root se+uene

# 't needs to !e different for nei0h!our ells

# rootSe+'nde* separation !etween ells depends on how many are neessaryper ell .depends on PrahCS





PRACH Planning e'ampleAss!mptions3

% prac%ConIn$e';0 for all ells

# pream!le format >7

# <ne PRACH opportunity per 17ms% prac%)re*+;= for all ells

# PRACH starts at si*th PR( in fre+ueny domain

% Define the prac%CS;8 for all ells

# ;a* ell ran0e > 9)9km

# =ah ell onsumes 5 root se+uenes





E'ercise

# Plan the PRACH Parameters forthe sites attahed in the e*el

# Assumptions"

$ P&CCH resoures >4

$ Cell ran0e > 12km .all ellsha-e same ran0e

$ (I"17;HB

PRACH ConfgExercise





PCI PlanningIntro$!ction

# 3here are 975 uni+ue Physial Cell 'Ds .PC'

P%ysical Layer Cell I$entity ; &0 > 6ID/( 6ID?

6ID/3 Physial @ayer Cell 'dentity 0roup) Ran0e 7 to 14:

$ Defines SSS se+uene

6ID?3 'dentity within the 0roup) Ran0e 7 to 2

$ Defines PSS se+uene

Resoure elementalloation to theReferene Si0nal

# PC' impats the alloation ofresoure elements to thereferene si0nal and the setof physial hannels

# Alloation pattern repeats e-ery 4th Physial @ayer Cell 'dentity





PCI Planning

# Analo0ous to sram!lin0 ode plannin0 in &;3S

$ ;a*imum isolation !etween ells with the same PC'J 3o ensure that &= ne-er simultaneously reei-e the same identity from more than a

sin0le ell

# Physial Cell 'dentity is defined !y the parameter phyCell'D"

Parameter +#@ect Range Dea!lt

phyCell'd @NC=@ 7 to 97 Not Applia!le

# 3here should !e some le-el of o%ordination aross international !orders whenalloatin0 PC's)

$ 3his will help to a-oid operators alloatin0 the same identity to ells on the same R6arrier and in nei0h!ourin0 0eo0raphi areas



1: © Nokia Siemens Networks Presentation / Author / Date


PCI PlanningRecommen$ations or ?T'

'n priority or$er, num!er 1 most important in

6DD .all four should !e fulfilled, ideally)Num!er 2 important in 3DDK

1) A-oid assi0nin0 the same PC' tonei0h!our ells

? A5oi$ assigning t%e same mo$0 &PCI(to Bneig%#o!r cells

) A-oid assi0nin0 the same mod4.PC' toLnei0h!ourM ells

5) A-oid assi0nin0 the same mod7 .PC' toLnei0h!ourM ells

'd > 9

'd > 5

'd >

'd >

11

'd >

17

'd > F

'd >

'd > :

'd > 4

'd > 2

'd > 1

'd > 7

E'ample / PCI I$entity Plan

E'ample ? PCI I$entity Plan





PCI Planning e'ample

uiB" how to alloate PC' for a sin0le%ell 3D%@3= omni site to !e plaed at thered irleO



1F © Nokia Siemens Networks Presentation / Author / Date


% &lse+Hop

% &lrpHop

% 0rpAssi0P&SCH

% ulRsCs

% Se+uene roup Num!er .u

UL Reerence Signal Planning





UL Reerence Signal+5er5ie"

Types of &@ Referene Si0nals

# Demodulation Referene Si0nals .D; RS $ P&SCH/P&CCH $ata estimation

# Soundin0 Referene Si0nals .SRS

$ ;ainly &@ c%annel estimation &@ .R@57/R@19

D; RS is c%aracterise$ !y"

# Se+uene .adoff Chu odes

# Se+uene len0th" e+ual to the Q of su!arriersused for P&SCH transmission

# Se+uene 0roup"

J 7 options

J Cell speifi parameter

# Cyli Shift" &= and ell speifi parameter

&@ D; RS alloation per slot for

Normal Cyli Prefi*





UL DM Reerence Signal6ee$ or Planning

Iss!e3

# D; RS oupy always the same slot in timedomain

# 'n fre+ueny domain D; RS of a 0i-en &=oupies the same PR(s as itsP&SCH/P&CCH data transmission

# Possi!le inter ell interferene for RS due tosimultaneous &@ alloations on nei0h!ourells

$ No intra ell interferene !eause usersare separated in fre+ueny

$ Possi!le inter ell interferene

Scope o planning3

# DM RS in co-site$ cells nee$s to #e$ierent

&@ D; RS alloation per slot for

Normal Cyli Prefi*





# RS se+uenes for P&SCH ha-e different len0ths dependin0 the &@

!andwidth alloated for a &=# 7 possi!le se+uenes for eah PR( alloation len0th of 1%177 PR(s

# Se+uenes are 0rouped into 7 0roups so they an !e assi0ned to ells

# Se+uene 0roup num!er L!M"

RS Se*!ences an$ RS Se*!ence ro!psSe*!ence ro!p I$, B!

( ) 30modSCHgrpAssigPU+= PCI u

0rpAssi0P&SCH" 0roupassi0nment for P&SCH Ran0e7G2FE, step 1





Cyclic S%it

# Additional se+uenes an !e deri-ed from a !asi se+uene !yapplyin0 a yli shift

# Cyli shifts of an e*tended C se+uene are not fully ortho0onal, !utha-e low ross%orrelation

# 3he atual &@ referene si0nal yli shift ncs used !y &= is differentfor e-ery 7)9ms time slot

[ ] 12mod)(

sPRS

)2(

DMRS

)1(

DMRScs nnnnn ++=

Cell%speifi stati yli shiftdefined !y LNCEL/ ulRsCs and !roadast on (CCH

33'%speifi yli shiftsi0nalled to &= on PDCCH

DC'7 in eah uplink shedulin0 0rant .defined !y

sheduler

Pseudorandom yli shift offset thathan0es e5ery time slot Depends

on the PC', slot num!er ns and u -ia@NC=@/grpAssigPUSCH

u N

c +⋅

= 3230

cellID

init





UL DM Reerence SignalHopping Tec%ni*!es

# Se*!ence Hopping

$ 'ntra%Su!frame hoppin0 !etween two se+uenes within a se+uene 0roup foralloations lar0er than 9PR(s

$ <nly ena!led is Se+uene roup hoppin0 in disa!led

$ Not ena!led in R@17/R@27/R@7" ulSeqHop= false

# Se*!ence ro!p Hopping $ 'n eah slot, the &@ RS se+uenes to use within a ell are taken from one

speifi 0roup

$ 'f 0roup -aries !etween slots" roup hoppin0

$ roup Hoppin0 not ena!led in R@17/R@27/R@7" UlGrpHop = false

J roup is the same for all slots

# Cyclic S%it Hopping

$ Always used

$ Cell speifi yli shift added on top of &= speifi yli shift





Planning)rom T%eory to Practice &/:?(

T%eory3

# 't should !e possi!le to assi0n to the cells o one site the same se*!encegro!p B! and LdifferentiateM the se+uenes usin0 different ell speifi yli shiftsi)e) alloatin0 $ierent !lRsCs

Remem!erK" Cyli shifts of an e*tended Cse+uene are not fully ortho0onal, !ut ha-elow ross%orrelation



2: © Nokia Siemens Networks Presentation / Author / Date


Planning)rom T%eory to Practice &?:?(

Practice3

# 't doesnMt seem to work# &@ 3hrou0hput 0ets onsidera!ly affeted if &@ traffi in nei0h!our ell

$ 6rom 57 ;!ps to 22 ;!ps in the e*ample





Planning6e" r!le# Alloate $ierent se*!ence gro!p u or e5ery cell, incl!$ing cells o t%e

same site

$ Cross%orrelation properties !etween se+uenes from two different 0roups are 0ood!eause of se+uene 0roupin0 in the PP spe

# ulRsCs does not matter .it is only rele-ant for se+uenes within one se+ 0roup u



2F © Nokia Siemens Networks Presentation / Author / Date


PlanningRes!lts

# &@ 3hrou0hput still suffers from &@ interferene in nei0h!our ell !ut the effet is

lower





Pros an cons o t%e ne" planning r!le

# FG3 Results seem to !e !etter

# FG3 @ess parameters to plan, only PC' plannin0 needed

$ UlRsCs only rele-ant when usin0 se+uenes of the same 0roup

$ LuM will !e different if PC' module rule is followed) 'n that aseLgrpAssigPUSCHM -alue is not rele-ant

# F -G3 Redued 0roup reuse distane ompared to the ase of assi0nin0 the same

0roup per eah site






UL DM RS Planning7rap !p

$ 'f ells of the site follow the PC'mod rule, the se+uene 0roup num!er LuM will !e different

$ 'f PC'mod rule is not followed, hek PC'mod7 rule

J 'f pro!lems use grpAssigPUSCH to differentiate the LuM % se+uene 0roup num!er%

$ 'f same LuM has to !e used in nei0h!ourin0 ells and annot !e han0ed usin00rpAssi0P&SCH then assi0n different ulRsCs to the ells of a site) Ran0e 7G:E

# Principle3 DM RS nee$s to #e $ierent in cells o t%e same e6o$e

# Current plannin0 approah"

$ Assign $ierent se*!ence gro!p n!m#er B! to t%e cells o t%e samesite) Ran0e" 7G2FE) grpAssigPUSCH an !e onstant >no need forplannin0






UL DM RS Planning e'ample, PCI-#ase$




UL DM RS Planning e'ample, %o" to !segrpAssigP!sc% to t!ne PCI-#ase$ se*!enceallocation in case o PCImo$0. collision

Documents

04 Basic Parameter Planning Rules_v1_1