Efficient PBCH DMRS Sequence Detection for Fast

Synchronization Process of 5G NR Systems

Dahae Chong, Gunyoung Ko, Beom-Kon Kim, Joo-Hyun Do, and Jungwon Lee
System LSI Business, Samsung Electronics, Korea
Email: {dahae.chong, guny.ko, bk44.kim, jhyun.do, jungwon2.lee}@samsung.com

Abstract—In this paper, an efficient physical broadcast
channel (PBCH) demodulation reference signal (DMRS)
sequence detection scheme for new radio (NR) systems is
proposed. Unlike conventional communication systems, to
complete synchronization process, PBCH DMRS sequence
detection, which has one-to-one mapping with 3 least significant
bits (LSBs) of synchronization signal block (SSB) index, is
essential procedure. In order to detect PBCH DMRS sequence
efficiently, we propose the maximum-likelihood based detection
2021 IEEE 94th Vehicular Technology Conference (VTC2021-Fall) | 978-1-6654-1368-8/21/$31.00 ©2021 IEEE | DOI: 10.1109/VTC2021-FALL52928.2021.9625187
detection, performance degradation occurs in frequency
selective channels.
In this paper, we propose an efficient PBCH DMRS
sequence detection scheme based on maximum likelihood
(ML) principle. First, the received SSB is divided into some
parts and the detection metrics are derived in each part, and
then, their combining form is provided as a final detector
form. The rest of this paper is as follows. In next section, the

scheme. We also provide the mean synchronization time (MST)
based on Markov chain model analysis. Simulation results show
that the proposed scheme is outstanding for the conventional
scheme in terms of detection probability and MST.
Keywords—5G, new radio (NR), synchronization signal block
(SSB), detection, maximum likelihood, PBCH DMRS sequence
I. INTRODUCTION
Synchronization is one of the most important process for
communication systems since data transmission and reception
can be available after completing synchronization. In the fifth
generation (5G) new radio (NR), the mobile communication
standard presented by the 3rd generation partnership project
(3GPP) [1], [2], synchronization signal block (SSB) is
introduced for cell synchronization and acquiring master
information block (MIB). SSB is composed of primary
synchronization signal (PSS), secondary synchronization
signal (SSS), and physical broadcast channel (PBCH). To
support beam search, multiple SSBs can be used and each SSB
can be corresponding to a specific beam and distinguished by
SSB index (0, 1, 2,…, or − 1, where is the number of
SSBs).
In the conventional synchronization process such as that
of long term evolution (LTE) systems, timing of the strongest
signal and cell ID can be firstly found in PSS and SSS
detection stages, respectively, and then, the system frame
signal model and detailed structure of SSB are introduced. In
Section III, ML based detector is proposed. Section IV
provides an analysis of mean synchronization time (MST). In
Section V, the detection probability and MST of the proposed
scheme are compared with those of the conventional scheme
via simulation results. This paper is concluded with a brief
summary in Section VI.
II. SIGNAL MODEL
In 3GPP standard, SSB consists of 4 contiguous
orthogonal frequency division multiplexing (OFDM) symbols
and 240 subcarriers as shown in Fig. 1. In NR synchronization,
a user equipment (UE) first finds PSS position and sector ID
( )
of cell ( ∈ 0,1,2 ) by detecting PSS signal, and then,
( )
identifies the group ID of cell ( ∈ 0,1, … ,335 ) by SSS
( ) ( )
detection, where 3 + =
is the cell ID. Over 3
symbols, PBCH is allocated, and DMRS is allocated in every
4 subcarriers. The starting position of DMRS is associated
with cell ID, i.e., = mod 4 , where mod is a
remainder of divided by . In this paper, we focus on
DMRS sequence detection. It is assumed that PSS and SSS
have been perfectly detected and frequency offset is also well
estimated by the conventional way such as the schemes
introduced in [5]. The th DMRS of the th symbol !," can
be expressed as

#!," = $!," %!,",& + '!,"

number is obtained from MIB message decoded by PBCH
decoding procedure. However, use of multiple SSBs requires (1)
an additional step in synchronization process, which should
identify the SSB index belonging to the strongest signal
position [3]. This is the main difference in synchronization 239
between NR and conventional systems.
PBCH

SSB index consists of 2 parts, 3 least significant bits

…
Subcarrier index in SSB

192
(LSBs) and 3 most significant bits (MSBs). 3 LSBs have one- 182
Subcarrier index in SSB

to-one mapping with the demodulation reference signal

PBCH

PBCH

(DMRS) sequence index of PBCH, thus this can be found by v+8

PSS

SSS

figuring out PBCH DMRS sequence index. 3 MSBs are used

DMRS
only in frequency range 2 and can be obtained from PBCH v+4

data. Since the PBCH DMRS sequence index is used for 56

47
v
demodulation of PBCH as well as indicating 3 LSBs of SSB
PBCH

index, finding PBCH DMRS sequence index is essential for

0
fast synchronization process. However, there has been no 0 1 2 3
significant studies for PBCH DMRS sequence detection yet. Symbol index in SSB
Although the detection scheme based on differential
correlation in [4] can be used for PBCH DMRS sequence Fig. 1. Structure of SSB

978-1-6654-1368-8/21/$31.00 ©2021 IEEE

Authorized licensed use limited to: INDIAN INSTITUTE OF TECHNOLOGY DELHI. Downloaded on October 28,2022 at 05:28:27 UTC from IEEE Xplore. Restrictions apply.
 are denoted by ;/ (=32), ;5 (=12), and ;6 (=12) for Part A,
239
B, and C, respectively.
Denote <"/ = =#>," , # ," , … , #?@A ," B , where = 0,1,2,3

…
…

Part C
and the first subscript is RS index of part A ( / ). We assume
192 that the channel coefficients are almost identical between
…

…
182
consecutive symbols. From this assumption, Gaussian
distributed samples with the variance of 2) can be obtained
Subcarrier index k

?@ A
by </|> = D#!@ , %!∗@ , ,& − #F!@ ,> G , </| = D#!@ , %!∗@, ,& −
!@ H>
…

…
Part A
?@ A ?@ A
#F!@, G and <I|
/
= D#!@ ,I %!∗@ ,I,& − #F!@ , G when ( is
!@ H> !@ H>
correct index, where #F!@ ,> is the PSS recovered signal and
#F!@, is the SSS recovered signal. From </|> and <I| /
56
…

…
47 PSS , the joint
probability density function (PDF) of < |> and <I| / /
…

…
…

Part B SSS

DMRS conditioned on ( can be expressed as

0
?@ A
1 T!@,&
0 1 2 3

JK</|> , <I|
/
|(L = M exp S− U,
4)
Symbol index l
√4O)
(2)
Fig. 2. RS structure for DMRS detection !@ H>

T!@ ,& = ,#!@ , %!∗@ , ,& − #F!@ ,> , + ,#!@ ,I %!∗@ ,I,& −
where $!," is the th channel frequency response of the th
where

symbol, %!,",& is the th sample for the (th DMRS sequence #F!@, , . Then ML based detection for ( can be obtained from
sample of the th symbol, and '!," is the th additive white the maximum conditional PDF shown as
Gaussian noise (AWGN) sample of the th symbol with mean (
V = arg max JK</|> , <I|
/
|(L.
zero and variance of ) . Averaged power of $!," and %!," is 1, & (3)
i.e., * +,$!," , - = 1 and ,%!," , = 1. Here, ( ∈ 0,1, … ,7 is Using log-likelihood function of conditional PDF and
removing some terms not affecting detection result, the
corresponding to 3 LSBs of SSB index what we need to
detector can be re-written as
identify and DMRS sequence is based on Gold sequence with
polynomial length of 31 [1]. (
V = arg max [/\ ,& ,
& (4)
%!∗@ , _` ,& #F!∗@ , _ G.
? A
where [/\ ,& = ReD∑_H> ∑!@@H> #!@ , _`
III. PBCH DMRS SEQUENCE DETECTION
Conventionally, the detection scheme based on differential
correlation was presented in [4]. This was presented for SSS For </| , a separate detector can be obtained, since </| is
detection, which is based on differential correlation of correlated with </|> and <I|
/
, which can be expressed as
adjacent RSs, but is also available for PBCH DMRS sequence
detection. The differential correlation is based on equality (
V = arg max [/a ,& ,
between adjacent subcarrier channels, however, this equality & (5)
%!∗@ , ,& #F!∗@ ,
? A
cannot be guaranteed in severe frequency selective channel. where [/a ,& = ReD∑!@@H> #!@ , G.
As a result, detection performance becomes worse as the
frequency selectivity becomes higher. Also, noncoherent Next, we denote <"5 = =#>," , # ," , … , #?bA ," B, where =
detection such as differential correlation shows poor 1,2,3 and the first subscript is RS index of part B ( 5 ). From
?b A
performance in low signal-to-noise ratio (SNR) region. <5| = D#!b , %!∗b, ,& − #!b, %!∗b, ,& G and <5|I =
!b H>
?b A
D#!b, %!∗b , ,& − #!b ,I %!∗b,I,& G when ( is correct index,
For efficient detection, we propose ML based detection
scheme. In order to explain the detection scheme, we first ! H>
b
clarify RS samples used for detection, shown in Fig. 2. We Gaussian distributed samples with the variance of 2) can be
consider 4 symbols including PSS and SSS symbols where ∈ obtained. Since <5| is correlated with <5|I , detectors are
0,1,2,3 indicates the symbol index. Here, use of PSS and derived from each PDF. First, the PDF of <5| conditioned on
SSS information makes the proposed scheme as coherent ( can be expressed as
detection.
?b A
1 T!b ,&
JK<5| |(L = M exp S− U,
Since RS allocation in resource grid is different for each
√4O) 4)
symbol and subcarrier index, it is difficult to derive a (6)
consistent ML scheme. Thus, we first divide SSB into 3 parts !b H>

where T!b,& = ,#!b, %!∗b , − #!b , %!∗b, ,& ,

as shown in Fig. 2 and derive ML based detectors from each
part, and then, propose their combining form as the final ,& . Then the
detector. For a convenience, RS indices of each part are detector can be written as
!
defined as / = 0 2 − 14 with ∈ + 56, + 60, … , + (
V = arg max JK<5| |(L
1
! &
180 for Part A, = 0 2 with ∈ , + 4, … , + 44 for
5 = arg max [5\,& ,
(7)
1
! &
Part B, and 6 = 01 2 − 48 with ∈ + 192, + ? A
196, … , + 236 for Part C, respectively, where ⌊9⌋ is the where [5\,& = ReD∑!bbH> #!b , %!∗b, ,& #!∗b , %!b, ,& G, and the
largest value out of integers smaller than 9. There cardinalities detector can be similarly obtained from <5|I written as

Authorized licensed use limited to: INDIAN INSTITUTE OF TECHNOLOGY DELHI. Downloaded on October 28,2022 at 05:28:27 UTC from IEEE Xplore. Restrictions apply.
 PBCH PBCH PBCH PBCH PBCH have better detection performance than the conventional
DMRS decoding decoding DMRS decoding
sequence with 1st
…
with ith sequence with 1st
… scheme in low SNR region. Also, the another difference of
detection result result detection result two schemes is which of the adjacent symbol or the adjacent
RS is used as a channel estimate. We expect that the adjacent
Fig. 3. Synchronization procedure symbol based channel compensation would work better than
(1-PDi) z PBCH z the adjacent RS based channel compensation for NR systems,
DMRS
sequence since wide frequency spacing between RSs and short symbol
detection
duration are used in NR systems. Therefore, it is expected that
PBCH PBCH
decoding decoding the proposed scheme has better detection performance than
with ith
result
with 1st
result
the conventional scheme in frequency selective channels.
(1-PD(i-1)) z
PD1 z (1-PD1) z
PDi z IV. ANALYSIS FOR SYNCHRONIZATION TIME
After detecting PBCH DMRS sequence, decoding process
PBCH PD2 z PBCH
of PBCH is conducted with the detected sequence index. In
decoding Synchronization decoding
with (i-1)th
result PD(i-1) z
success with 2nd
result
low SNR region, the detected index may be incorrect
sometimes. If PBCH is decoded with wrong DMRS sequence,
PD3 z the synchronization fails and waste of time is increased. In this
(1-PD(i-2)) z
(1-PD2) z
section, we provide the analysis of synchronization time for
PD4 z PBCH
decoding
the synchronization procedure model shown as Fig. 3. From
with 3rd the PBCH DMRS sequence detection result, the priority of
result

PBCH
sequence index is determined based on descending order of
the metric values. With the sequence index from the 1st to the
hth result, where h ∈ 1,2, … ,8 , decoding process of PBCH is
decoding
with 4th
(1-PD4) z (1-PD3) z
conducted. If the correct index is met before reaching the hth
result

Fig. 4. Markov chain model for synchronization procedure

index, the synchronization process is successfully finished,
otherwise, PBCH DMRS sequence is re-detected and
(
V = arg max [5a,& , decoding process is also re-conducted with newly obtained
& (8)
?b A
detection results, until successful decoding.
where [5a,& = ReD∑!bH> #!b ,
%!∗b, ,& #!∗b ,I %!b,I,& G . As in
We define the MST _ , the number of decoding trials for
synchronization, according to h as a decision criterion and
Part B, following detectors can be obtained for Part C.

(
V = arg max [6\ ,& and (
V = arg max [6a ,& , analyze _ using the Markov chain model shown as Fig. 4 [6],
& & (9) [7]. We assume that 1 trial is required for the PBCH DMRS
? A
where [6\ ,& = Red∑!eeH> #!e , %!∗e , ,& #!∗e , %!e, ,& f and sequence detection, since 1 SSB duration is consumed for
? A
PBCH DMRS sequence detection in case of online hardware
[6a ,& = Red∑!eeH> #!e , %!∗e, ,& #!∗e,I %!e,I,& f.
Then, the final processing. To focus on the impact of PBCH DMRS sequence
detector can be obtained by combining detection metrics of detection on synchronization time, we assume that when the
each part as follows correct sequence is used, decoding is perfectly completed and
there is no error in PSS and SSS detection stages. We define
(
V = arg max [& , ijk as the probability that the hth largest path is a correct path
& (10)
and i k as the probability that the hth largest path is a correct
where the detection metric [& = [/\ ,& + [/a ,& + [5\,& + path in the remaining paths (i.e., the hth ~ the 8th paths). Their
[5a,& + [6\ ,& + [6a ,& . The detection metrics of each part relation can be expressed as
are correlated with each other, thus, [& may not be the _A

ijk = i k MK1 − i l L.
optimal form. However, since the dependency between
metrics almost disappeared by using dozens of additions and (12)
multiplications, [& can be the best choice in practical. mH

For comparison, the conventional scheme is shown as
follows, which is based on differential correlation of adjacent
subcarriers carrying RS presented in [4].
(
V = arg max g/,& + g5,& + g6,& ,
& (11)
where the terms g/,& , g5,& , and g6,& are defined as
? A
ReD∑_H> ∑!@@H> #!@ , _` %!∗@ , _` ,& #!∗@ ` , _` %!@ ` , _` G ,
? A
ReD∑_H> ∑!bbH> #!b ,_` %!∗b,_` ,& #!∗b ` ,_` %!b ` ,_` G , and
? A
Red∑_H> ∑!eeH> #!e ,_` %!∗e ,_` ,& #!e ` ,_`
∗
%!e `
The detection metric of the proposed scheme looks similar
to that of the conventional scheme in terms of compensating
channel effect. However, the proposed scheme is based on the
coherent detection in terms of channel information used for
detection, unlike the conventional scheme based on the
noncoherent detection, and this makes the proposed scheme to
The transfer function until PBCH decoding success can be
expressed as
$o (n)
$(n) = ,
1 − $p (n)
(13)
where the transfer function $o (n) = i \ n + K1 −
i \ Li a n I + ⋯ + K1 − i \ L … K1 − i kr\ Li k n _` means
the successful decoding from the 1st result to the hth result and
$p (n) = K1 − i \ L … K1 − i k Ln _` is the transfer function
,_` f, respectively. of unsuccessful decoding from the 1st result to the hth result.
If the PBCH decoding is failed until the h th result, the
following step is new PBCH DMRS sequence detection. By
the relation of ijk and i k , $o (n) = ij\ n + ija n I + ⋯ +
ijk n _` = ∑_mH ijl n m` and $p (n) = K1 − i \ L … K1 −
i k Ln _` = ∑smH_` ijl n _` . Note that, for h = 8, $p (n) = 0
and $(n) = $o (n).

Authorized licensed use limited to: INDIAN INSTITUTE OF TECHNOLOGY DELHI. Downloaded on October 28,2022 at 05:28:27 UTC from IEEE Xplore. Restrictions apply.
 ju(v)
Then, *( _ ) can be obtained as *( _ ) = w , where
1 jv vH
ju(v) uxy(v)K Auz (v)L`ux (v)uz
y (v)
0.9 = a , $o{ (n) = ∑_mH (| +
jv K Auz(v)L
0.8
1)ijl n m , and $p{ (n) = ∑smH_` ijl (h + 1)n _ . With $o (1) =
0.7 ∑_mH ijl , $p (1) = ∑smH_` ijl , $o{ (1) = ∑_mH (| + 1)ijl ,
0.6 and $p{ (1) = $p (1)(h + 1), the MST *( _ ) can be simply
0.5
expressed as

h + 1 − ∑_mH (h − |)ijl
*( _ ) = .
0.4

∑_mH ijl
0.3
(15)
0.2
As SNR becomes larger, since ij\ ≅ 1 , *( _ ) is
Proposed
0.1
Conventional
converged to 2. This means 1 trial for PBCH DMRS sequence
detection and 1 trial for PBCH decoding. Meanwhile, as SNR
becomes smaller, ijl is converged to , then, *( _ ) is
0
-20 -15 -10 -5 0 5 10
SNR [dB] s
_ s
converged to 8.5 − + . The minimum MST with h = 8 is
Fig. 5. Detection probability in AWGN channel model _
5.5, this means 1 trial for PBCH DMRS sequence detection
1
and 4.5 trials for PBCH decoding same to the averaged trial
0.9 number without PBCH DMRS sequence detection. In the
interesting SNR areas, *( _ ) can be different as which
detector is used, since ijl is determined by detector type. It is
0.8

expected that the detector with the largest ij\ has the
0.7

0.6
minimum MST in same SNR condition. This will be shown
0.5
with the numerically obtained ijl for the proposed and
0.4 conventional schemes in next section.
0.3
V. SIMULATION RESULTS
0.2
In this section, we show the detection probability of the
Proposed
0.1
Conventional proposed and conventional schemes as a function of SNR
based on simulation results. The detection probability is
defined as the probability that the detected SSB index (V is the
0
-20 -15 -10 -5 0 5 10
SNR [dB]
correct index. For simulations, we consider a NR system with
Fig. 6. Detection probability in single path Rayleigh fading channel model subcarrier spacing of 30kHz and the center frequency of
6GHz, and consider various channel models: AWGN channel
1
model, single path Rayleigh fading channel model, and tapped
0.9 delay line (TDL)-A channel model introduced in NR
0.8
specification for link level simulation [8]. TDL-A channel
model has 23 Rayleigh distributed multi-paths and path delay
0.7
can be extended by delay spread (DS) setting. Doppler
0.6 frequencies corresponding to various vehicle speeds are also
0.5
considered. For comparison, the conventional scheme in
equation (11) is also shown with the proposed scheme. Note
0.4
that the numbers of correlation samples employed in the
detection metric are 3;/ + 2;5 + 2;6 (= 144) and 2;/ +
3;5 + 3;6 − 8 (= 128) for the proposed and conventional
0.3

0.2 Proposed (DS 600ns)

Conventional (DS 600ns) schemes, respectively, thus, there is no significant difference
Proposed (DS 1000ns)
0.1
Conventional (DS 1000ns) in their computational complexity.
0
-20 -15 -10 -5 0 5 10 Fig. 5 and Fig. 6 show the detection probability of the
SNR [dB] proposed and conventional schemes in AWGN channel model
Fig. 7. Detection probability in TDL-A channel model with mobile speed of
and single path Rayleigh fading channel model, respectively.
30km/h and DS of 600ns and 1000ns The mobile speed of 30km/h is assumed in the single path
Rayleigh fading channel model. In the figures, we can see that
We denote _ as the number of trials required to achieve the the proposed scheme shows better detection probability than
successful decoding when we try PBCH decoding from the 1st
result to the hth result. _ can be modeled as a discrete random
the conventional scheme in both channel models. Especially
variable (RV) and $(n) is the characteristic function of this
in low SNR region, the proposed scheme shows better
detection probability than the conventional scheme. As
RV defined as follows [7] mentioned before, this is due to the fact that the proposed
$(n) = *(n tk ).
scheme is based on coherent detection unlike the conventional
(14) scheme.

Authorized licensed use limited to: INDIAN INSTITUTE OF TECHNOLOGY DELHI. Downloaded on October 28,2022 at 05:28:27 UTC from IEEE Xplore. Restrictions apply.
 100ns and mobile speed of 30km/h and 100km/h. As a mobile
1
speed increases, there is not a significant change on relative
0.9 difference of detection performance between proposed and
0.8
conventional schemes. From this result, we can see that the
proposed scheme is also suitable for high speed mobile
0.7
environments.
0.6
Fig. 9 shows the MST of the proposed and conventional
0.5 schemes in TDL-A channel model with DS of 1000ns. For
simulation, the mobile speed of 30km/h is assumed. In the
synchronization procedure, h is set to 8 to have the minimum
0.4

0.3
MST for both proposed and conventional schemes. The
0.2 Proposed (30km/h)
Conventional (30km/h)
proposed scheme shows shorter MST since it has a better
0.1 Proposed (100km/h) detection performance than the conventional scheme. From
Conventional (100km/h)
this result, we can see that the proposed scheme is a good
0
-20 -15 -10 -5 0 5 10 choice for fast NR synchronization process in practical.
SNR [dB]
VI. CONCLUSION
Fig. 8. Detection probability in TDL-A channel model with DS of 100ns and
mobile speed of 30km/h and 100km/h In this paper, an efficient PBCH DMRS sequence
detection scheme for fast synchronization process of NR
7 systems has been proposed. To obtain the detection scheme,
Proposed
Conventional
we first divided SSB into some parts and derived ML based
6 detection metrics from each part, and then, propose their
combining form as the final detector. Based on Markov chain
5
analysis, MST has been provided as a function of detection
probability. Through the simulation results, it has been shown
4
that the proposed scheme is superior to the conventional
scheme in terms of detection probability and MST.
3

2
1 March 2019, version 15.5.0.
0 Partnership Project (3GPP) Technical specification (TS) 38.213,
-20 -15 -10 -5 0 5
SNR [dB]
Fig. 9. MST in TDL-A channel model with mobile speed of 30km/h and DS
of 1000ns
Fig. 7 shows the detection probability of the proposed and
conventional schemes in TDL-A channel model with DS of
600ns and 1000ns. This simulation result has been obtained
with the assumption that the mobile speed of 30km/h. As DS
increases, performance difference between proposed and
conventional schemes is increased. Since an increase in DS
means an increase in the time delay between multi-paths,
channel selectivity is also increased in the frequency domain.
Thus, performance of the conventional scheme based on
equality between adjacent channel coefficients becomes
deteriorate with the increase of DS.
Fig. 8 shows the detection probability of the proposed and
conventional schemes in TDL-A channel model with DS of
REFERENCES
[1] 3GPP, NR: Physical channels and modulation, 3rd Generation
Partnership Project (3GPP) Technical specification (TS) 38.211,
[2] 3GPP, NR: Physical layer procedures for control, 3rd Generation
10
March 2019, version 15.5.0.
[3] A. Omri, M. Shaqfeh, A. Ali, and H. Alnuweiri, “Synchronization
procedure in 5G NR systems,” IEEE Access, vol. 7, pp. 41286-41295,
Mar. 2019.
[4] C.-C. Liao, P.-Y. Tsai, and T.-D. Chiueh, “Low-complexity cell search
algorithm for interleaved concatenation ML-sequences in 3GPP-LTE
systems,” IEEE Wireless Commun. Lett., vol. 1, no. 4, pp. 280-283,
Aug. 2012.
[5] Y.-H. You, J.-H. Park, and I.-Y Ahn, “Complexity effective sequential
detection of secondary synchronization signal for 5G new radio
communication systems,” IEEE Systems Journal, pp. 1-9, June 2020.
[6] A. Polydoros and C. L. Weber, “A unified approach to serial search
spread spectrum acquisition-Part I: General theory,” IEEE Trans.
Commun., vol. COM-32, no. 5, pp. 542-549, May 1984.
[7] A. Keshavarzian and J. A. Salehi, "Multiple-shift code acquisition of
optical orthogonal codes in optical CDMA systems," IEEE Trans.
Commun., vol. 53, no. 3, pp. 687-697, Apr. 2005.
[8] 3GPP, NR: Study on channel model for frequency spectrum above
6GHz, 3rd Generation Partnership Project (3GPP) Technical
specification (TS) 38.900, June 2018, version 15.0.0.

Authorized licensed use limited to: INDIAN INSTITUTE OF TECHNOLOGY DELHI. Downloaded on October 28,2022 at 05:28:27 UTC from IEEE Xplore. Restrictions apply.