1/14

Physical Random Access Channel

PRACH
Sebastian Wagner
EURECOM
18-02-2013
2/14
Outline
Introduction
PRACH
PRACH Sequence Design
PRACH Transmitter
PRACH Receiver
Numerical Results
Summary and Future Work
Introduction 3/14
Timing for Uplink Transmission
eNB
UE2
UE1

2
eNB
t [ms] 0 1 2 3 4 5 6 7 8 9
UE1
t [ms]
UE2
t [ms]

Transmission from eNB

Signal received from eNB (e.g. frame synchronization, PBCH,...)

Assume eNB allocates UL in SF 6 and 7 to UEs 2 and 1, respectively

Propagation delay causes interference at eNB

timing adjustment of 2
1,2
Introduction 3/14
Timing for Uplink Transmission
eNB
UE2
UE1

2
eNB
t [ms] 0 1 2 3 4 5 6 7 8 9
UE1
t [ms]
UE2
t [ms]

Transmission from eNB

Signal received from eNB (e.g. frame synchronization, PBCH,...)

Assume eNB allocates UL in SF 6 and 7 to UEs 2 and 1, respectively

Propagation delay causes interference at eNB

timing adjustment of 2
1,2
Introduction 3/14
Timing for Uplink Transmission
eNB
UE2
UE1

2
eNB
t [ms] 0 1 2 3 4 5 6 7 8 9
UE1
t [ms] 0 1 2 3 4 5 6 7 8 9
UE2
t [ms] 0 1 2 3 4 5 6 7 8 9

Transmission from eNB

Signal received from eNB (e.g. frame synchronization, PBCH,...)

Assume eNB allocates UL in SF 6 and 7 to UEs 2 and 1, respectively

Propagation delay causes interference at eNB

timing adjustment of 2
1,2
Introduction 3/14
Timing for Uplink Transmission
eNB
UE2
UE1

2
eNB
t [ms] 0 1 2 3 4 5 6 7 8 9
UE1
t [ms] 0 1 2 3 4 5 6 7 8 9
UE2
t [ms] 0 1 2 3 4 5 6 7 8 9

Transmission from eNB

Signal received from eNB (e.g. frame synchronization, PBCH,...)

Assume eNB allocates UL in SF 6 and 7 to UEs 2 and 1, respectively

Propagation delay causes interference at eNB

timing adjustment of 2
1,2
Introduction 3/14
Timing for Uplink Transmission
eNB
UE2
UE1

2
eNB
t [ms] 0 1 2 3 4 5 6 7 8 9
UE1
t [ms] 0 1 2 3 4 5 6 7 8 9
UE2
t [ms] 0 1 2 3 4 5 6 7 8 9
2
2

Transmission from eNB

Signal received from eNB (e.g. frame synchronization, PBCH,...)

Assume eNB allocates UL in SF 6 and 7 to UEs 2 and 1, respectively

Propagation delay causes interference at eNB

timing adjustment of 2
1,2
Introduction 4/14
Random Access Procedure
UE
eNB
t
t
1
1. Transmit PRACH preamble (64 possible preambles, randomly chosen
by UE or assigned by eNB)
2a. Receive PRACH preamble and estimate delay
2b. Random access response (detected preamble, timing adjustment,
C-RNTI, UL grant for L2/L3 message...)
3. L2/L3 message (RACH procedure message)
4. Contention resolution message (if any contention)
Introduction 4/14
Random Access Procedure
UE
eNB
t
t
1
2a
1. Transmit PRACH preamble (64 possible preambles, randomly chosen
by UE or assigned by eNB)
2a. Receive PRACH preamble and estimate delay
2b. Random access response (detected preamble, timing adjustment,
C-RNTI, UL grant for L2/L3 message...)
3. L2/L3 message (RACH procedure message)
4. Contention resolution message (if any contention)
Introduction 4/14
Random Access Procedure
UE
eNB
t
t
1
2a
2b
1. Transmit PRACH preamble (64 possible preambles, randomly chosen
by UE or assigned by eNB)
2a. Receive PRACH preamble and estimate delay
2b. Random access response (detected preamble, timing adjustment,
C-RNTI, UL grant for L2/L3 message...)
3. L2/L3 message (RACH procedure message)
4. Contention resolution message (if any contention)
Introduction 4/14
Random Access Procedure
UE
eNB
t
t
1
2a
2b 3
1. Transmit PRACH preamble (64 possible preambles, randomly chosen
by UE or assigned by eNB)
2a. Receive PRACH preamble and estimate delay
2b. Random access response (detected preamble, timing adjustment,
C-RNTI, UL grant for L2/L3 message...)
3. L2/L3 message (RACH procedure message)
4. Contention resolution message (if any contention)
Introduction 4/14
Random Access Procedure
UE
eNB
t
t
1
2a
2b 3 4
1. Transmit PRACH preamble (64 possible preambles, randomly chosen
by UE or assigned by eNB)
2a. Receive PRACH preamble and estimate delay
2b. Random access response (detected preamble, timing adjustment,
C-RNTI, UL grant for L2/L3 message...)
3. L2/L3 message (RACH procedure message)
4. Contention resolution message (if any contention)
PRACH 5/14
PRACH Formats
Sequence length T
SEQ
criteria:

Fit into one subframe (1ms) but be as long as possible

Account for maximum round-trip delay (RTD)

max

Compatibility with PUSCH sub-carrier spacing is 1.25 kHz

Coverage performance
T
SEQ
= 800s
max

max
d= max. delay spread CP GT
PRACH Formats (broadcasted in SI)
0 CP=103.13s, T
SEQ
= 800s, d 5.2s
max
= 97.4s
r
max
=

max
c
2
14km max. cell radius
1 CP=684.38s, T
SEQ
= 800s, 2ms burst
max
= 515.62s
r
max
=

max
c
2
77km
2,3,4 ...
PRACH 5/14
PRACH Formats
Sequence length T
SEQ
criteria:

Fit into one subframe (1ms) but be as long as possible

Account for maximum round-trip delay (RTD)

max

Compatibility with PUSCH sub-carrier spacing is 1.25 kHz

Coverage performance
T
SEQ
= 800s
max

max
d= max. delay spread CP GT
PRACH Formats (broadcasted in SI)
0 CP=103.13s, T
SEQ
= 800s, d 5.2s
max
= 97.4s
r
max
=

max
c
2
14km max. cell radius
1 CP=684.38s, T
SEQ
= 800s, 2ms burst
max
= 515.62s
r
max
=

max
c
2
77km
2,3,4 ...
PRACH 5/14
PRACH Formats
Sequence length T
SEQ
criteria:

Fit into one subframe (1ms) but be as long as possible

Account for maximum round-trip delay (RTD)

max

Compatibility with PUSCH sub-carrier spacing is 1.25 kHz

Coverage performance
T
SEQ
= 800s
max

max
d= max. delay spread CP GT
PRACH Formats (broadcasted in SI)
0 CP=103.13s, T
SEQ
= 800s, d 5.2s
max
= 97.4s
r
max
=

max
c
2
14km max. cell radius
1 CP=684.38s, T
SEQ
= 800s, 2ms burst
max
= 515.62s
r
max
=

max
c
2
77km
2,3,4 ...
PRACH 6/14
Preamble Sequence Design
Prime-length N
ZC
Zado-Chu (ZC) sequences x
u
(n) of root u:
x
u
(n) = exp

j
un(n+1)
N
ZC

, 0 n N
ZC
1, N
ZC
= 839

Constant amplitude: limits PAPR, at bounded interference,...

Ideal cyclic auto-correlation:

N
ZC
1
n=0
x
u
(n)x

u
(n +C

) = (C

Ideal cyclic cross-correlation:

N
ZC
1
n=0
x
u
(n)x

(n) =
1

N
ZC

Ecient DFT
1
:
X
u
(k)=x

u
(u
1
k)X
u
(0)=X
u
(0) exp

j u(u
1
k)(u
1
k+1)
N
ZC

64 Preamble sequences x
u,
(n) are cyclic shifts of ZC
x
u,
(n) = x
u
((n +C

)%N
ZC
)
1
S. Beyme and C. Leung, Ecient computation of DFT of Zado-Chu sequences
PRACH 6/14
Preamble Sequence Design
Prime-length N
ZC
Zado-Chu (ZC) sequences x
u
(n) of root u:
x
u
(n) = exp

j
un(n+1)
N
ZC

, 0 n N
ZC
1, N
ZC
= 839

Constant amplitude: limits PAPR, at bounded interference,...

Ideal cyclic auto-correlation:

N
ZC
1
n=0
x
u
(n)x

u
(n +C

) = (C

Ideal cyclic cross-correlation:

N
ZC
1
n=0
x
u
(n)x

(n) =
1

N
ZC

Ecient DFT
1
:
X
u
(k)=x

u
(u
1
k)X
u
(0)=X
u
(0) exp

j u(u
1
k)(u
1
k+1)
N
ZC

64 Preamble sequences x
u,
(n) are cyclic shifts of ZC
x
u,
(n) = x
u
((n +C

)%N
ZC
)
1
S. Beyme and C. Leung, Ecient computation of DFT of Zado-Chu sequences
PRACH 7/14
Zero-Correlation Zone

x
u,
(n) and x
u

,
(n) are not orthogonal if u = u

shift a ZC sequence as often as possible from single root u

But C

determines max. RTD estimation

max
and hence cell size
Shifts for unrestricted set (low-speed cells)
C

N
CS
= 0, 1, . . . ,
N
ZC
N
CS
1, N
CS
= 0
0 N
CS
= 0

N
CS
quantized to 4 bit, N
CS
= 0, 13, 15, 18, . . . , 279, 419
Example:
1. N
CS
= 13 C

= 0, 13, 26, . . . , 806, 819, = 0, 1, . . . , 63

all preambles orthogonal but

max
11s, r
max
1.6 km
2. N
CS
= 0 C

= 0,
all preambles non-orthogonal, computational expensive,

max
5ms, r
max
> 100 km (preamble format 3)
PRACH 7/14
Zero-Correlation Zone

x
u,
(n) and x
u

,
(n) are not orthogonal if u = u

shift a ZC sequence as often as possible from single root u

But C

determines max. RTD estimation

max
and hence cell size
Shifts for unrestricted set (low-speed cells)
C

N
CS
= 0, 1, . . . ,
N
ZC
N
CS
1, N
CS
= 0
0 N
CS
= 0

N
CS
quantized to 4 bit, N
CS
= 0, 13, 15, 18, . . . , 279, 419
Example:
1. N
CS
= 13 C

= 0, 13, 26, . . . , 806, 819, = 0, 1, . . . , 63

all preambles orthogonal but

max
11s, r
max
1.6 km
2. N
CS
= 0 C

= 0,
all preambles non-orthogonal, computational expensive,

max
5ms, r
max
> 100 km (preamble format 3)
PRACH 7/14
Zero-Correlation Zone

x
u,
(n) and x
u

,
(n) are not orthogonal if u = u

shift a ZC sequence as often as possible from single root u

But C

determines max. RTD estimation

max
and hence cell size
Shifts for unrestricted set (low-speed cells)
C

N
CS
= 0, 1, . . . ,
N
ZC
N
CS
1, N
CS
= 0
0 N
CS
= 0

N
CS
quantized to 4 bit, N
CS
= 0, 13, 15, 18, . . . , 279, 419
Example:
1. N
CS
= 13 C

= 0, 13, 26, . . . , 806, 819, = 0, 1, . . . , 63

all preambles orthogonal but

max
11s, r
max
1.6 km
2. N
CS
= 0 C

= 0,
all preambles non-orthogonal, computational expensive,

max
5ms, r
max
> 100 km (preamble format 3)
PRACH 8/14
High-Speed Cells

For cells with high Doppler shifts

Creates correlation peaks in dierent search windows (depending on

root u) false detection

Solution: restrict the set of possible search windows, i.e., dont use
windows (shifts of root sequence) that would contain false peaks

Drawback: requires computation of numerous dierent roots to

obtain 64 preambles increased complexity in PRACH
transmitter/receiver
PRACH 9/14
PRACH Transmitter
compute prach seq generate prach
x
u
(n)
FFT IFFT
Repeat
CP RF
exp

j
2kC

N
ZC

X
u
(k) X
u,
(k)
Mapping

X
u
(k) = x

u
(u
1
k)X
u
(0) with
x
u
(n) = exp

j
un(n+1)
N
ZC

, 0 n N
ZC
1,
where u
1
is the multiplicative inverse of u modulo N
ZC
, i.e.,
u
1
u = 1 mod N
ZC
(e.g. u = 129 u
1
= 826, N
ZC
= 839)

Phase shift for preamble cyclic shift C

in time domain, i.e.,

x
u,
(n) = x
u
((n +C

) mod N
ZC
)

Sub-carrier mapping and N-IFFT (e.g. N = 6144 for 5MHz BW)

Sequence repetition for PRACH formats > 1

CP insertion
PRACH 10/14
PRACH Receiver
CP/FFT
IFFT Detection
X

u
(k)
rxdata
y
u,
(t, ) Y
u,
(k, )
u
y
u,
(t, )
u,

Received signal y
u,
(t, ) = x
u,
(t) h(t ) +w(t)

CP removal and N-FFT (e.g. N = 6144 for 25 RBs)

Dot-product with sequence X

u
(k) (for all congured roots u)
Y
u,
(k, )X

u
(k) = H(k, )X
u,
(k)X

u
(k) +W(k)
= H(k, )e
j
2kC

N
ZC
+

W(k)

N-IFFT (e.g. N = 1024 for N

ZC
= 839)
y
u,
(t, ) = F
1
{Y
u,
(k, )X

u
(k)} = h (t ( C

)) + w(t)

Detection of peak of | y
u,
(t, )|
2
at C

corresponding to
preamble u, and channel delay
PRACH 11/14
Timing-Advance estimation

Accuracy of
6144
1024
= 6 samples ( 0.78s)

Resolvable delay-spread depends on zero-correlation zone N

CS

Example: N
CS
= 13 with upsampling factor
1024
839
N

CS
= 15

max
= 6(N

CS
1) = 84 samples ( 10.94s)
Numerical Results 12/14
False Detection Rate vs. UE Speed
0 100 200 300 400 500 600 700 800 9001,000
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
UE Speed [km/h]
f
a
l
s
e
d
e
t
e
c
t
i
o
n
r
a
t
e
SNR=10dB, preamble=60, N
CS
= 15, root seq. num. = 0, 2Rx eNB
Low-Speed Cells
High-Speed Cells
Summary and Future Work 13/14
Summary

PRACH allows for ecient UL timing estimation in a wide-range of

environments (ZC properties, exible ZCZ, formats)

PRACH transmitter/receiver can be complex (large FFT-sizes,

multiple FFTs for large cells or high mobility)

Good performance up to 700 km/h

Summary and Future Work 14/14
Future Work

Only PRACH conguration indexes 0-11 in 36.211 Table 5.7.1-4 are

implemented

Possible algorithm optimization in PRACH sequence transmitter and

PRACH receiver (e.g. computation of multiplicative inverse,...)

PRACH receiver computation seems to take too long on hardware

leading to missed slots

More testing required with signal generator and channel emulator