MOD 3: REVIEW NOTES

Lesson Mod(s):
Mod 3.1: Radio Interface (Abrv: Rad Int’fc)
Mod 3.2: Resource Blocks & Sub – Frames (Abrv: RB & Sub-Fr or S-Fr)
Mod 3.3: Packet Allocation (Abrv: Pckt Alloc.)
Mod 3.4: Transmission Reliability (Abrv: Trns. Rely or Trn’msn)
Mod 3.5: QoS Lvl(s) & RLC Protocol (Abrv: Prtcl)
Mod 3.6: RAND Access (Abrv: Acss.)
Mod 3.7: PDCP & Global Vis

3.1 Headings:
 Phys. Layer (Lyr)
 Modulation
 Mod. BPSK
 Mod. QPSK
 Charts – Mod’ed Sgnl
 Coding Rate
 MCS

Mod 3.2: Resource Blocks & Sub – Frames

 RB & RE
 Sub-Fr
 Resrv’d RE
 Trns-prt Blk
 Trn-msn Chain (Simple)

Mod 3.3: Packet Allocation

 Pckt-Alloc
 Addressing @ Rad.
 RTNI (R. Net. Temp. ID)
 Alloc.
 DL & UL
 Alloc-Table(s)
 DL & UL
 Data vs Ctrl CH(s)
 ACK’mnt
Mod 3.4: Transmission Reliability
 MAC (Media Acss. Ctrl)  Parl’l ACK
 Optimize: Parl’l “Snd & Wait”
 ARQ (Auto Rpt Rqst)
 De-Sqnc’ng
 CRC (Cycl. Redund. Check) & Err Dtct Code
 De-Sqnc’ng NOT handl’d @ MAC
 ARQ: 3 Outcomes
 H-ARQ (Hybrid)
1. ACK:
 ×-Plxng (N-othr MAC func.)
2. Cor’pt → NACK:
 MAC-SDU
3. Loss:
 MAC-PDU
 Snd & Wait ARQ
MOD 3: REVIEW NOTES

Mod 3.5: QoS Lvl(s) & RLC Protocol

 RLC Modes
 TM (Transparent)
 UM (Un - ACK)
 AM (ACK)
 Parl’l Op. @ Srvl Inst’nc(s)
 RLC & MAC
 UM
 Segmnt’n & Concat’n
 Header
 How Un-ACK?
 RLC ⇋ MAC
 AM (UM + Re-Trns @ Lost Data)

Mod 3.6: RAND Access

 Acc’ss Methods
 Contention (Bs’d Apps)
 Res’rvion (Bs’d Apps)
 Lte Issues
 PRACH: PHYS RAND AC’SS CH
 Conten Bs’d Ac’ss
 New UE enter cell
 New UE Arrv’l – Compet. @ RND AC’SS

Mod 3.7: PDCP & Global Vis

 PDCP
 Instnc(s) per → 1 PDCP / 1 RLC
 ROHC → Hdr Compress
 Handover Mitigate
 Security
 RLC vs PDCP (NTS)
 RRC (@ TM*) → Sign. msg(s)
 IP (@ UM*) → User data
 PDCP → Intr’fc w/t core
 PDCP Func
 Global
 PDCP
 RLC
 MAC
 PHYS
 MAC ⇋ RLC ⇋ PDCP (NTS)
MOD 3.1: Rad Interface
Q?: Hw info Trn-mt via Rad (Air)?  eNB & UE
 @ Cell ( 1 B.Stn)  UE(s) share bandwidth
 Intrfc w/t: Core Net (UPC)
PHYS Layer
 Trns-mt [Binary Msg]: @ UE ↹ eNB
 via Modlt’n & Err Crct’n
 Waves subjct/t Disturb:
 Modf’d Amp; Delay; Noise.

Modultn
 Use ↑Freq. Bearer → Trn-mt msg

 Modify/Modulate Bear:
 Accord/t: info contain’d @ Msg Trn-
mt’d.
 Symbol: Δt @ Info Trn-mt’d remain const.

BPSK (Modltn)
Modltd Signl
 Modulus  Amplitude (Amp)
 Argument  Phase (ϕ)

Modltn @ ϕ (of Bear)

 Trns-mt:
 0: No Modlt’n
 1: Modlt ϕ → by fact’r π
 Phase (Mod or Const):
 ϕ Mod @ chng. (info)
 ϕ Const @ no chng.
MOD 3.1: Rad Interface

QPSK
MOD 3.1: Rad Interface

MCS: (Coding Rate + Modltn)

Summary
 Compromise (Throughput vs Immunity):
 Efficient Mod.  ↑Throughput
 LTE Const adapt MCS :
MOD 3.2: RB & Sub-Fr
Q?: How share spectrum res. between UE(s)?
 Alloc-Dynam.  d/t Spectr. sparse
 Mills UE(S)  ÷ion @ Freq. & Δt

Rad-Res Share

 (to/ea) Sub-car:
 Alloc’td Δ Freq.
 Re-alloc’td. to Sub-car:
 d/t: Chng. @ UE(s) needs
→
 @ Δ Freq & Δt

RE & RB
 1 RE = 1 Symbl
 1 Sub-Car: Δ Freq = 15
kHz

 1 RB = 84 RE
 Δt = 0.5 ms = 7 Symbl
 12 Sub-Car: Δ f = 180kHz

Sub-Fr
 1 Sub-Fr = 2 RB
 Δt = 1ms
 Alloc. pulse.

RB Alloct’n

 LTE Re-Alloc’t: RB(s) ⇥ UEs

 Re-Alloc ea 1ms.
 RB(s) Alloct’d in pairs.
MOD 3.2: RB & Sub-Fr

Summary: RB, RE & S-Fr

 Avail Spectr:
 ÷ed into RB(s)
 Alloc. ea 1ms

Resrvd RE
 LTE intrnl ctrl
 Phys CH → Grp. res’rvd res’rc

Diagram
 White → Msg trn’msn
 Red & Purple → Res’rvd RE

Transport Block
 @ ea S-Fr:
 eNB alloc. ⇥ UE(s) : [1+ RBs]

 Trn-Blk:
 Data Size (to) Trn-mt @ Alloc’td
RB
 Δ Data UE can snd @ given S-Fr.

 Size dpnd/on:
 # RB  avail./alloc. 4’ UE
 Modlt’n & MCS in use
MOD 3.2: RB & Sub-Fr

Summary: Resrvd & Trn-Blk

 Res’rc Share:
 @ Δt & ΔFreq.
 1 RE = 1 Symb.
 1RB = 84 RE

 Trn-Blk Alloc’tn:
 Alloc’td/by: eNB
 @ ea Sub-Fr.  @ Δt 1 ms

Trn-msn Chain (Simple)

1. Fill Blk:  Of alloc. size.
2. + CRC: (Cycl. Redund. Check)
3. Pckt coding:  + Redund.
4. Digital Modlt’n:  Produce symb.

5. Symbl Insrt:
 in/t: Alloct’d RB
 @ current S-Fr.

6. Procs (Rep’t ea ms).

 Trns-mt @ 1 Sub-Fr Lvl:
 @ 1/+ RB pairs
MOD 3.3: Pckt Alloc.
Q?: How eNB inform’s UE(s)?
NB:
 How UE infrm’d @ data reciept?
 How UE ask eNB 4’ res’rc 2’ snd data?

Pckt-Alloc

 eNB Publish ⇥ [Alloc. Table]

 @ ea S-Fr. (@ ea 1 ms):
 to: infrm UE of Res-Alloc’tn
 (both) @ UL & DL

Addressing @ Rad
RTNI (Rad Net Temp ID)
 Addrs’ng:
 ID UE(s) @ 1 eNB (1 cell)
 RTNI:
 eNB Alloc’t @: UENEW (arriv’l) ↦ CellNEW
 16 Bits:
 65k UE(s)/1 eNB
MOD 3.3: Pckt Alloc.

Alloc. DL
 eNB use 1(+) RB
 fr: comm. w/t UE.
 @ start S-Fr:
 eNB pblsh Sub-Fr Map
 to: Infrm ⇥ UE
 RB & Data intnd’d (fr: UE)

Alloc. UL
Same as DL +
1. (1st) UE mk ⇥ [Rqst].
2. eNB Alloc’t ⇥ [Resrc]
 Pblsh @ alloc. table.
3. Anticip. Δt  4ms
 React. Δt @ UE

Alloc. Table(s) Data vs Ctrl CH(s)

MOD 3.3: Pckt Alloc.
@ DL @ DL
 @ S-Fr. start  Ctrl CH
 Indic. RB recip.  use: 1st RE @ ea S-Fr. &
 Trn-prt: Alloc-table(s)
 fr: (both) UL & DL
@ UL
1. UE ⇥ [Rqst]
2. eNB Alloc’t ⇥ UE: [Res] @ UL
 @ nxt Alloc-Table  Ctrl CH:
 use: RBs @ (both) Ends/f Band
3. @ UE ⇤ [Res]
 UE:  to: Rqst RB
 prep: Trn-prt blk;  UE ⇥ [Rqst]: (via) UL Ctrl-CH
 Code & Modl’t

Alloc
 Mgmt by eNB → 2th 4’ UL & DL
 Only @ need 4’ Trn-msn
 Ctrl CH:
 Resrvd/fr : XGs (r/t :
Alloc’tn).
 ex: UL/DL Alloc-Table(s);
 ex: Rqst/fr : Trn-msn

@ UL
1. UE ⇥ [Rqst] : (via) Ctrl-CH:
2. eNB Alloc ⇥ [Res].
3. Anticip Delay:
 Δt: 4 ms
 aka: Active 4 Sub-Fr l8r
MOD 3.4: Trn-msn Rely.
Q?: How ↑ rely. @ Rad.
Q?: How share connect w/t serval serv’c(s)
 Rad. prone/to Disturb
 10-6  Accptbl. “bit Err-Rate” MAC (Media Acss. Ctrl)
 @ 70 Megabits/sec = 70 Err/sec  Crct Err(s) not dtct’d @ PHYS
 Coding @ PHYS  Crct @ some Err(s)  Multi-Plexing
 (but) Hw Crct @ those not Crct’d  Allow serval serv’c(es) comm. w/t UE @ same
 (one/of) MAC func. ∆t
 ARQ → Part/f: MAC Lyr

ARQ (Auto Rept Rqst)

CRC (Cycl. Redund. Check)

Err Dtct Code
 Snd’r: Calc. code & → Attch. end msg.
 Rec’vr: Same calc.
 RES =/≠ XRES

Snd & Wait ARQ Mech:

1. Snd ⇥ [Data Msg]
2. Wait/fr: [ACK/NACK]
3. Re-Trns
 (if) Trn-msn prblm
4. Dis-Cont’d → tk/to: ↑Lvl(s)
 (if) Too many Re-Trns

ARQ (3 Outcomes)
1. ACK:
 Msg. ✓ → Cnfrm w/t ACK
 ACK snt. via ctrl CH

2. Corupt → NACK:
 Data corupt @ Trn-msn
 Rec’vr:
 Inf’rm Snd’r w/t → NACK
 Snd’r:
 Re-snd msg → Cont’d until ACK

3. Loss:
 Snd’r ⇥ [ACK] or [NACK]
 @ Rec’vd (or Not).
 @ [NACK]
 Either [Msg] or [ACK/NACK] lost.
 (if) Snd’r → NOT rec’v: [ACK/NACK]
 Re-Trn
 (if/still) No answr → MAC give
MOD 3.4: Trn-msn Rely.

up

ACK
Mech:
1. Rec’vr ⇥ [ACK]
 4 Sub-Fr aftr rec’v msg.
2. Aftr [ACK/NACK]:
 Snd’r: wait 4 Sub-Fr(s)
 (b4) Re-Trns; or
 (b4) Snd: [⇥ MsgNEW]

 (total) Cycle → 8 Sub-Fr (8ms)

 @ ∆t 8 ms: Snd’r NOT Trn-mt

Parll ACK
Optimize: Parll “Snd & Wait”
 (while) 1 Proc’s wait  N-othr snd.
 Cont’d until 8 proc’s parl’l.

De-Sqnc
 Losses @ ea proc’s
 In-Dpnd’nt/f ea-othr

De-Sqnc NOT handl’d @ MAC

 Handl’d/by: ↑ lvl @ RLC
MOD 3.4: Trn-msn Rely.

H-ARQ
 Rec’vr store all “Erroneous Msg(s)”:
 ↑% @ get Crct Msg.
 Accuml’tn  ↑ Redund

 H-ARQ → d/t: MAC (collab) ⇋ PHYS

 H-ARQ infrm ⇥ PHYS
 Data it proc’s →
 (are) Rep’tn of same Trn-Blk

×-Plxng (N-othr MAC func.) NTS:

 SDU  ↑ Lyr.
ex:  PDU  ↓ Lyr.
 Email; Txt; Call; Video → All @ same ∆t
 But 1’ comm. CH between UE & B.Stn →  MAC :
 Traffic mixed @ 1 pipe.  Rec’v SDU → Prod’c PDU
 Data:
×-Plxng b/c Hndl’d by MAC;
Provd’d by/frm RLC (↑ Lyr).
 Serval incoming streams; Only 1 out;
Provd’d via msg que(s) → aka Logic’l CH(s)
 2’ Help → @ Rec’vr De-×-Plex;  CH(s) 4’: Sign; Voice; Gen. data.
 De-×-Plex (break↓):  MAC PDU(s):
 MAC lyr + HDR(s)  Trn-Blk(s) →
 HDR(s)  Trn-mt’d via PHYS lyr.
 Incid: Start of ea msg; Logic CH ea msg belong  2’ form Trn-Blk(s):
2’.  MAC lyr assmbl SDU(s) →
 From logcl CH(s).
MOD 3.4: Trn-msn Rely.

MAC-SDU
 Data from ↑Lyr
 Logic’l CH(s) → Serval sources (QoS lvls)

MAC-PDU
 MAC output → Trn-Blk

Summary (MAC lyr func) ×-Plxng

Func → Res-Alloc  Mgmt pri(s) of serv’l Logcl CH(s)
H-ARQ (Trns Rely)  Assmbl CH(s)
 Re-Trns crrpt Trn-Blk(s)  In/to:: Trn-Blk(s)
 Serv’l proc’s @ parl’l
MOD 3.5: QoS (Qual. Servc Lvls) & RLC (Rad. Lnk. Ctrl.) Prtcl
Q?: QoS lvl(s) provd’d by Rad Intr’fc
NB?:
 MAC enable: ×ple app(s) share same Rad. link.
 But apps: NOT @ same Lat/Rely reqr’mnt(s)
 aka Dffrnt QoS rqrmnt(s).

RLC Protcl NTS (RLC – Rad. Lnk Ctrl):

 RLC → QOS
 RLC above MAC.
 App(s) → Varied Needs @
 Lat NTS (QoS)
 Rely
 QoS:
 (De)–Sqnc’ng
 Capab. of net. @ give app(s) lvl of serv’c co’rspnd 2’ need(s).
 QoS → Compromise  Criteria ex: Delay; Throughput; Err rate.
 Lat vs Rely  ex:
 ×ple Comp’rms  ↑Rely via Re-Trns  ↑Delay
 Depend @ app(s) need(s)  Voice  Pre’fr ↓Delay @ ↑Loss.
 Bank  0 Err Tolr’nc; Pre’fr ↑Delay

 RLC NTS (MAC & H-ARQ)

 ↑Rely @ exchng(s);  @ #n fails → Give up Re-Trns.
 Re-ordr msg(s) & Sgmnt’n mgmt;
 @ expns of Lat;  H-ARQ
 (result) De-Sqnc
 RLC’s +al Serv’c(s) over MAC  MAC:
 Re-Sqnc (Re-ordr)  NOT care 4’ msg segmnt’n →
 NOT ÷ msg(s) in/to: small’r Blk(s) → (2’ ins’rt in/to: Trns-
 Sgmnt’n
Blks)
 ÷ msg(s) in/to: small’r Blk(s)
 2’ insrt in/to: Trn-Blk(s)
 +al Re-Trns stage

 Optn’l Serv’c(s) → 3 Classes

RLC Modes
MOD 3.5: QoS (Qual. Servc Lvls) & RLC (Rad. Lnk. Ctrl.) Prtcl

UM (Un - ACK) AM (ACK) TM (Trn-par’nt) Parl’l Op. @ Srvl Inst’nc(s)

UM + Re-Trns lost pckt(s)
 Re-Sqnc & Sgmnt  No +al serv’c(s)  @ Same Δt & Link:
 ↓Lat but ↓Rely:  Rely ↑ @:  Only RRC (Short sign. msg)  Parl’l run
 ex:  Web; Email;  RLC-inst’s from UM &
 VoIP;  File trns’fr. AM
 Real Δt vid.

NTS (UM): NTS (AM): NTS (TM):

 Re-Sqnc recv’d blk(s);  Re-Trns  ↑Rely  RLC → Stop’d. NTS (Parl’l Op):
 Sgmnt/Concat msg  @ cost ↑Lat.  @ 0 Sgmnt’n  Parl’l 4’ giv’n link
 Dpnd on MAC needs.  Mode resrv’d 4’ short msg.  ex (@ Same Δt):
 Adpt’d 4’:
 Adpt’d 4’:  Web brows  Main use:  VoIP @ UM;
 Real Δt apps  File Trns-fr  Trn-prt sign. msg(s).  File trns’fr @ AM
MOD 3.5: QoS (Qual. Servc Lvls) & RLC (Rad. Lnk. Ctrl.) Prtcl

UM How Un-ACK?
Segment’n & Concat’n 1. @ Recv’d pckt from ↑Lyr:
 Fit in/to: MAC-SDU size  RLC save pckt @ Buffer.
2. (@ Δt Wait 4’) MAC Lyr rqst MAC-SDU:
Header  @ MAC-SDU rqst → Spec’fy size
 ID msg(s) bnd’ry(s)
 Sqnc # → 4’ Re-Sqnc’ing 3. RLC asmbl stor’d pckt(s):
 In/to: RLC-PDU of rqst’d size → via:
 Concat (+) or Sgmnt (÷/split) → Untill:
 Reach spec’fd size
4. + Head’r:
 Spec’fy frag’mnt loc:
 Which RLC inst’nc (Contain Sqnc #) →
 En’bl arrng’mnt @ Corct ord’r → If:
 De-Sqnc @ H-ARQ
MOD 3.5: QoS (Qual. Servc Lvls) & RLC (Rad. Lnk. Ctrl.) Prtcl

AM NTS (AM):
UM + Re-Trns @ Lost Data  UM + Mgmt lost msg(s)
 Memr’z: Trn-mt’d msg(s)  RLC memo MAC-SDU(s) it delvr’d 2’ MAC lyr.
 Prtcl:  Memo 2’ Re-Snd l8r i/n.
 Trn-mt’r:  Reg’lr ask rec’vr → 2’
 Rqst’s recipnt’s stat.  Snd stat of msg. recv’d.
 Resp’ns  via:  Recv’r ansr rqst → via:
 RLC msg (Data CH)  Snd RLC sign. msg →
 List: Rec’vd/Expct’d PDU(s)  Trns-mt via Data CH.
 @ Trn-mt’r: NB:
 Msg ok → Erase memo;  This is 1st case of Trn-msn a Ctrl msg. via Data CH.
 Other exchng(s) b4 done via Ctrl CH.
 Msg not ok → Re-Trns lost msg
 Now recip’nt’s ansr
 Seprt’d from data flow → &
 Delvr’d 2’ RLC Ctrl
MOD 3.5: QoS (Qual. Servc Lvls) & RLC (Rad. Lnk. Ctrl.) Prtcl

AM vs UM: Trn-msn & Recep (NTS) RLC ⇋ MAC (NTS)

 @ AM → Same body mgmt Trn-msn & Recep MAC:
 @UM → Trn & Pecep in-dpnd’nt from e/othr.  (Can) Re-Grp:
 SDU(s) from dffr’nt RLC-Instnc(s)  In/to::
RLC & MAC (Wrk 2Gthr)  Same Trns-Blk
 MAC:
 Pick up pckt(s) → From: RLC (@ UM):
 2th RLC instnc’s →  @ Try retrv crct sqnc(s) of msg(s)
 Dpnd on:  RLC @ UM can remain block’d  if:
 Par’mtr’zd pri;  Intr’med sgmnt nev’r arrv’d
 Throughput targets  2’ Avoid:
 RLC evnt’ly consdr this pckt lost →
 Go 2’ ↑Lvl.

Summary
RLC → Above MAC

RCL Func:
 Re-Sqnc blk(s) (De-Sqnc’d by H-ARQ).
 Concat & Segmnt → 2’ Fit size rqst’d by MAC.
 Re-Trns lost blk(s).

QoS → Cmp’rms (Rely vs Delay)

 Re-Sqnc & Repeat  ↑Delays
 3 RLC Modes:
 TM (Trns-parnt)
MOD 3.5: QoS (Qual. Servc Lvls) & RLC (Rad. Lnk. Ctrl.) Prtcl
 UM (Un-ACK)
 AM (ACK)
MOD 3.6 : RAND AC’SS
Q?: How UE rgstr’d @ new cell
NB?:
 2’ emit Trn-msn rqst.  UE 1st reg’str w/t eNB

NTS – AP(s) (Ac’ss Prtcl)

 Set rules → Def’n:
 How ×ple UE(s) share same CH;
 Pre’vnt intr’fr
 Who/When/How talk

Ac’ss Methods
Contention (Bs’d AP) NTS:
 Comp’t 4’ res’rc(s)  RB ÷ (in/to: small’r REs):
 Alloc/t snd’r(s).
 Collision(s)
 Re-Trn @ Err  Res-Alloc:
 Static @ start;
Resrv’n (Bs’d AP)  Dynam @ modf’d needs.
 Break↓ in/to: elmnt’l res’rc(s)  Dynam Res-Alloc:
 Stat/Dynam alloc.  ÷ion @: Δt & ΔFreq.

Lte Issues  @ DL
 Newcommers  no prblm. b/c Trn-msn by eNB
 Solution → Contention  @ UL
 UE 1st snd rqst  b4 Res’rc alloc.
 Rqst(s) via UL ctrl CH  (if) UE Regstr’d w/t B.Stn
 Solution  Conten. @ UL

PRACH: PHYS RAND AC’SS CH NTS:

 @ UL → Grp. aka PRACH:
Conten Bs’d Ac’ss
 Grp. of Resrv’d Res’rc(s) → 4’:
 6 RB; Δt  1ms  New UE 2’ indic. pres’nc
 Config’bl  Δt: 1-20 ms
 @ CDMA:
 CDMA (Ac’ss)  Code ÷ion & ×ple Ac’ss
 Trn-mt’r encode Trn-msn w/t Sqnc(s)
 @ 2 UEs Trn-mt @ same Δt (w/t dffr’nt sqnc *)
 Recv’r still disting. b’twn 2th Trn-msn(s).
 Only 1 Symb / 6 Blk(s):
 B.Stn d’tct → UE want conct
 Evn/Th UE not Trn-mt data:
 eNB ID sqnc
 Assoc. sqnc w/t UE
 64 Sqnc(s) avail:
 ↑2’ 64 Rqst(s) Simltn.
MOD 3.6 : RAND AC’SS

New UE enter cell

1. 2’ Alloc-Res → eNB give ea UE a RTNI:
 (Arrv’ng) UE listn. 2’ eNB
 2’: ID RA-CH sched’l.
 Then @-RND:
 Chose 1/64 sqnc(s)
 Then Trns-mt via:
 RA-CH &:
 use Sqnc. @ right Δt.

2. eNB d’tct Trn-msn & Sqnc:

 eNB nt/yt know UE ID → but:
 Use Sqnc 2’ temp ID UE
 Then assign RTNI 4’ UE
 RNTI:
 Known 2’ eNB; nt/yt 4’ UE
 eNB nt/yt use RNTI as addr’s
(2’ snd msg 2’ UE)
 Use RA-RNTI*
 RA-RNTI:
 UE & eNB → use Sqnc 2’ calc RA-RNTI.

3. eNB snd Par’mtr (2’ UE):

 via: RA-RNTI
 Par’mtr incl: RNTI
 eNB Alloc-Res.
 4’ UE → 2’ snd Con-Rqst
MOD 3.6 : RAND AC’SS

New UE Arrv’l:
Compet. @ RND AC’SS
@ 2 UEs join w/t same sqnc.

 eNB proc’dr as if 1 UE;

 Snd RA-RNTI 2’ 2th UEs
 2th UEs snd Con-Rqst
 Intr’fr occur
 2 outcomes

1. eNB un’bl 2’ decode either msg

 No resp
 Rept. l8r.
2. eNB decode ½ msg(s)
 Prcdr cont’d
 eNB snd Echo:
 Contain TMSI 1;
 2th UEs compar:
 @ UE1: Prcdr cont’d;
 @ UE2 → Stop

Summary
LTE → Resrv’n Bs’d
 Alloc-Dynam; Mgmt @ eNB
 @ UL → UE 1st rqst

RND AC’SS CH @ UL (PRACH)

 New UE announce
 CDMA → Conten. Bs’d

Rgstr’d UEs
 Right 2’ use Ctrl-CH → 2’ Snd. Trn-msn rqst.
MOD 3.7 : PDCP (Pckt Data Converg. Protcl) & Global
Q?: How Intr’fc w/t LTE Core
NB?:
 How Rad Intr’fc conct’d 2’ Core Net via IP protcl?

PDCP NTS:

Instnc(s) per → 1 PDCP / 1 RLC  PDCP @ top ea Instnc RLC:

 Expt 4’ TM  X’pt TM (Trn-parnt)
 Intr’fc w/t core: IP (User data); RRC (Sign)
ROHC → Hdr Compress  Hrd Cmprs:
 Robust Hdr Compress (IEFT Prtcl)  App(s) rely on prtcl stacks;
 P2P  Little vary @ Hdr  Cmprss possible  ea Prtcl + it’s own Hdr
 Trns-mt 2x Prtcl data vs Useful data
Handover Mitigate  ex: VoIP → 30 bytes; Encapcul. in :
 Old & new eNB  RTP → + 12 bytes Hdr.
 Ordr pckt; Wait 4’ ACK; Duplicate etc  UDP → + 8 bytes Hdr.
 Ipv6 → + 40 bytes Hdr.
Security  Total Hdr. → 60 bytes
 Cyph  Cmprss possible d/t
 Err detct  Prtcl data chng. little from 1’ pckt to n-othr

RLC vs PDCP (NTS) RRC (@ TM*) → Sign. msg(s)

 2’ Cmprss, LTE use ROHC (stndrd www prtcl) IP (@ UM*) → User data
 LTE re-use www prtcl(s) PDCP → Intr’fc w/t core
 PDCP avoid:
 Pckt loss & De-Sqnc @ Hnd-ovr
 RLC mgmt:
 Re-Trns & Re-Sqnc →
 Only @ cell

 @ Chng cell w/t PDCP

 Old eNB infrm new eNB of:
 Stat. curnt Trn-msn
 Fwd data (wait 2b’ Trn-mt’d)

 PDCP
 Enbl. data Cyph → while:
 Integ. ctrl (Err detct)
 Verify sign msg (not modlt’d)
MOD 3.7 : PDCP (Pckt Data Converg. Protcl) & Global

PDCP Func

 Hdr Cmprss
 Only 4’ data encapsl. @ IP
 Can impl’mnt 4’ RRC (Ctrl msg)
 Hnd-ovr (Loss pr’vnt)
 Only 4’ RLC instnc @ AM
 Cyph
 Always pssbl & recmnd’d
 Int
 Only 4’ ctrl msg(s)

Summary
PDCP
 ROHC → Hdr Cmprss
 Hndovr Mitigate
 Cyph
RLC
 Re-Sqnc
 Re-Trns @ AM
 Segmnt (Accord. 2’ MAC rqrmnt’s)
MAC
 Logic CH ×-Plex (Pri mgmt)
 HARQ
 Rad-res alloc.
 Ctrl(s):
 RLC-PDU size
 Adapt. MOD (MCS)
PHYS
 Coding (Err crct)
 Modlt’n

MAC ⇋ RLC ⇋ PDCP (NTS)

MOD 3.7 : PDCP (Pckt Data Converg. Protcl) & Global

MAC PDCP
 MAC Ctrl  Intr-fc w/t Core-Net
 Indpndnt’ly 4’ ea UE;  IP  Use’fl data;
 Choice of modlt’n used @ PHYS  RRC  Sign msg
 Ctrl  Trn-msn capacity
 Serv’c:
 @ eNB → MAC ensur.  Cmprss;
 Res-Alloc @ 2th UL & DL  Hnd-Ovr;
 Secur
 H-ARQ:
 Take care of low-lvl Trns-Rely
 Rept’n mech
 Build Trns-Blk(s)
 Data ×-Plex from dffrnt Logic-CH
RLC
 Optn’l*: Re-Sqnc; Sgmnt; Re-Trns
 Serval RLC instnc(s) parl’l

Chart NTS:
PDCP:
 Hdr-Cmprss (only 4’ IP; NOT
RRC)
RLC:
 Concat. RLC-SDUs (of same
instnc)
 Ex: 2x Data → in/to: 1 RLC-PDU
MAC:
 Merge dffrnt RLC-Inctnc(s)
 In/to: 1 MAC-SDU
 + Hdr(s) 2’ create Trn-Blk(s)
 Delvr’d 2’ PHYS
PHYS:
 RNTI:
 Not Trn-mt’d w/t data
 Supl’d implicit via Alloc-
Tabl.