The LTE Access Procedure

Brian Katumba1 , Johannes Lindgren1 and Kateryna M ariushkina2

1
Department of Computer Science and Engineering and 2 Department of Signals and Systems
Chalmers University of Technology
Gothenburg, Sweden
{katumba, johlinb, katmar}@student.chalmers.se

AbstractThis paper describes the LTE access procedure with part [1].
a main focus on the cell search procedures. The cell search All in all, the main reasons of developing LTE was to sustain
is carried out by two synchronization signals i.e. the primary packet switched traffic (IP traffic), voice traffic e.g. voice over
synchronization signal which is needed when a user equipment
(UE) connects for the first time to a cell or is looking for a new one IP. In addition it permits both frequency-division duplexing
to make a cell handover, and secondary synchronization signal (FDD) and time-division duplexing (TDD) communication. Its
which is needed to provide the terminal with information about support for multiple input multiple output (MIMO) technology
the cell ID, frame timing properties and the cyclic prefix (CP) gives it an advantage in the communication arena [3].
length. The report goes through the different synchronization As a starting point, in LTE, before a terminal can start to
methods in the cell search discussing their advantages and
disadvantages in synchronization. We propose an algorithm that use the network there must be some connection associated with
aims for improving the cell search procedure in terms of lower the network and that is what is called the access procedure.
complexity and increased detection probability while maintaining This procedure consists of the following parts: finding and
a robust connection. acquiring synchronization to a cell within the network, receive
KEYWORDS : LTE, Access procedure, Cell search, and decode the information (cell system information), request
Synchronization signals, Cell search algorithms a connection setup (random access) and network-initiated
connection setup (paging) [1].
The cell search in 3GPP LTE is complex and computation-
I. I NTRODUCTION ally expensive. It is also power and time consuming since
The driving forces behind the evolution of 3G is that it is computing correlation between transmitted and received
the carriers need to stay competitive by providing better signals. The fundamental issues in cell search synchronization
services at lower cost. It is this competitiveness that drives are rotated on cell detection, complexity, channel fading and
the technology advancement. Since the fundamental goal of robustness. Although many algorithms are in place to solve
any mobile communication system is to deliver services to the fore mentioned issues, still we have not found one that
the end users, the engineers need to build systems that can capture them at once hence making the cell search even more
adapt to the changing environment i.e. predict which services complex with even higher power consumption by applying
that could become popular in a period of five to ten years [1]. different algorithms to solve the issue.
To be able to solve these challenges the third generation This research is focused on the cell search and synchro-
partnership project (3GPP) group came up with a standard nization with a main objective of increasing the detection
consisting of two parts. One part is the high speed packet probability of the cell ID and reducing complexity while
access (HSPA) Evolution which is built on existing specifica- maintaining robustness. In this, the report explains how the
tions and can use already installed equipment that uses the 5 user equipment (UE) behaves depending on if it is an initial
MHz spectrum. However, one drawback is that HSPA must be synchronization procedure or new cell identification. The
backward compatible with older terminals [1]. different synchronization methods and algorithms are used as a
The other part is the long term evolution (LTE) which basis for a proposed algorithm for cell search synchronization.
is based on orthogonal frequency-division multiple access This algorithm tries to increase detection probability, reduce
(OFDMA) in down-link and single-carrier frequency-division complexity, and handle channel fading yet leaving the access
multiple access (SC-FDMA) in up-link. It offers favorable procedure robust and yet in a single algorithm.
features such as high spectral efficiency, robust performance Together with this introduction, the paper is organized as
in frequency selective channel conditions, simple receiver follows; section II describes the general view of the access
architecture and lower latencies [2]. It also uses the same procedure steps i.e. the cell search, the system information,
spectrum bands as most of the other 3G technologies. In LTE the random access and paging. Section III covers the different,
there is the possibility to use new designs and LTE does not already existing cell search algorithms, Section IV covers the
need to be backward compatible with the older terminals. proposed algorithm, and section V covers the conclusion of
This made it possible to design the radio interface to be the paper.
completely based on packet-switched network technology and
the designers did not need to care about the circuit-switched
 II. ACCESS P ROCEDURE
Before the user equipment can start transmitting and receiv-
ing data it must connect to the network. This connection phase
consists of 3 stages where different information is obtained in
each stage. In this section we give an over view of the cell
search procedure stages which is the main concern of this
paper. That is, the cell search with the different types of cell
search procedures, the synchronization signals, the structure of
those signals and how to detect the signals. The other stages of
the access procedure will also be explained i.e. the derivation
of system information, the random access and the paging.
A. The Cell Search
The first thing that happens in the access procedure is that Fig. 1. Cell search and Synchronization Signals
the UE must be identified within the network. This procedure
is called the cell search and includes synchronization between
UE and the cell and acquiring the information about cell
or is searching for a new one to perform a cell handover.
[1]. The synchronization procedures which are mentioned
Primary synchronization detects the base station (eNodeB)
later are performed in order to obtain timing synchronization
sector and time offset [3]. The PSS is constructed from signal
for correct symbol detection. It is also used for frequency
sequences that are known as Zadoff-Chu (ZC) sequences and
synchronization to annihilate frequency mismatches caused by
the length of the sequence is 62 in the frequency domain [4].
moving of UE or different oscillators at the receiving and
These sequences are used because they provide good detection
transmitting sides. Moreover it is needed to obtain cell ID
probability at the same time they provide low false alarm
as it is described later [4]. Section 1 covers the different types
rate which is very useful in LTE. The Zadoff-Chu sequences
of cell search procedures, section 2 covers the synchronization
belong to a class of complex exponential sequences and is
signals, section 3 covers the structure of those synchronization
a type of waveform that is called constant amplitude zero
signals and section 4 covers how the detection is done for the
auto-correlation sequences (CAZAC) [14]. When a terminal
signals.
detects a PSS it can then extract information about slot timing
1) Cell Search Procedures: There are two different types
properties and the ID of the physical layer [4].
of synchronization procedures. The first one is when the UE is
The SSS on the other hand uses two interleaved sequences
not connected to LTE cell and wants to access LTE network.
that are called maximum length sequences (MLS), SRG-
This happens when the UE is switched on or when the
sequences or m-sequences which are of length 31. They
reception is restored after being in an area with no connection.
are scrambled with PSS sequences that determine physical
The second type of synchronization procedure happens when
layer ID. The m-sequence is defined as the longest sequences
the UE is already connected to LTE cell and detects a new cell.
possible to generate using a shift register. The m-sequence is
This means the UE will prepare for a handover to a new cell
a binary sequence and the next value is linearly dependent on
and will report this to the old cell. This behavior is repeated
k sequences of preceding values that are calculated using the
until the reception is satisfactory as long as there are new
same method [5].
cells available. Both these procedures use two types of syn-
The purpose of the SSS is to provide the terminal with
chronization signals, that is the primary synchronization signal
information about the cell ID, frame timing properties and
(PSS) and the secondary synchronization signal (SSS) which
the cyclic prefix (CP) length. The terminal is also informed
are broadcasted in each cell. For the initial synchronization
whether to use TDD or FDD [4].
the UE is also required to decode physical broadcast channel
(PBCH). The PSS and SSS provide the UE with its physical 3) Structure of PSS and SSS: Each OFDM unit is 10ms
layer identity within the cell. There are 504 possible physical long. Each unit is divided into 10 subframes of 1 ms, sub-
layer cell identities, to obtain cell ID hierarchical scheme is frames are also splitted into 0,5ms slots. Such slot can contain
applied according to which all physical layers are divided into seven OFDM symbols with normal CP length and six with
tree groups of physical layer identities where each contains extended CP . In FDD cells PSS is located in the last OFDM
168 cell layer identities. The signals also provide frequency symbol in first and eleventh slot of the frame, SSS follows it in
and time synchronization within the cell [4]. What is obtained the next symbol. In TDD cell PSS is sent in the third symbol of
from the synchronization signals can be seen in in Fig.1. the 3rd and 13th slots while SSS is transmitted three symbols
2) Synchronization Signals: Since OFDM systems are sen- earlier as in the Fig. 2. PSS gives UE information about to
sitive to time and frequency synchronization errors, there is which of the three groups of physical layers the cell belogs to
a need to have synchronization, power control and random (3 groups of 168 physical layers). One of 168 SSS sequences
access [3]. As in [3], primary synchronization is required is decoded right after PSS and defines the cell group identity
when a mobile terminal connects to a cell for the first time directly [4].
 more deeply in this project. For detailed information about
these procedures refer to [1].

III. S YNCHRONIZATION METHODS AND ALGORITHMS

Synchronization is relevant when it comes to the context
of wireless communication, however there are some problems
associated to it. There are many attempts to simplify and
improve synchronization algorithms in the LTE cell search.
Some of the latest suggestions have been observed below.
In [3], they present two robust algorithms for primary
Synchronization method which rely on the traditional methods
based on cross-correlation properties of Zadoff-Chu sequences
[1], [6], [7], [8], [9] and [13]. This is presented with a main fo-
cus of increasing the probability of detection at lower signal to
noise ratios because the possibility to realize synchronization
in harsh environment is also of utmost importance. The two
Fig. 2. The Structure the PSS and SSS proposed algorithms in [3], provide extra robustness through
a validation process proposed to be soft or hard. The soft
validation increases the detection probability of the cell ID
4) Coherent and Non-Coherent Detection: Coherent de- and the hard validation although easy to implement, has got
tection is based on detecting sequence that maximizes the a lower performance. Their result contain the value for the
probability of transmitting the sequence taking already known sector identifier and location of the primary sequence which
information about the channel. To be able to use coherent is necessary for further synchronization and confirmation
detection a channel estimation needs to be done before the through the cell specific reference (RS) [3].
sequence detection can start [4]. Similarly to [3], Ni et al. [10], they also propose a com-
In the case where the channel estimation cannot be done and plexity effective cell search scheme based on the combination
any other knowledge about the channel exists, non-coherent of the coherent sequence detection and sign decision. In their
detection can be used. This is done by removing the depen- paper, integrating the sector ID detection and cell group ID
dency that exists for a given channel and compute the average detection in the Secondary Synchronization Channel, and us-
of the distribution of the random channel coefficients [4]. For ing the primary Synchronization Channel as a phase reference,
both the coherent and non-coherent maximum likelihood (ML) their complexity effective cell search scheme can overcome
approach is implemented as in equations as seen in 7.8 and the adverse effect of channel fading and frequency offset with
7.14 in [4]). low complexity at the cost of robustness.
Both these detection methods are important for the synchro- The cell search in 3GPP LTE is complex and computa-
nization procedures. For the existing implementation of LTE, a tionally expensive and power and time consuming since it
non-coherent approach is used for the PSS and both a coherent is computing correlation between transmitted and received
or non-coherent approach can be used for the SSS. signal. One of the proposed method to decrease the complexity
of the cell ID acquisition was based on the developing a
B. Deriving System Information, Random Access and Paging perfect sequence with a special structure for this procedure.
The second part of the access procedure is where the UE Proposed primary and secondary synchronization signals are
needs to derive system information. This system information described in details in [11]. As a result the number of complex
is periodically broadcasted in the network and this information multiplications and complex additions has decreased from
is needed for the UE to be able to connect to the network and 336No to 5 No and 336(No-1) to 30(No/8) respectively, where
a specific cell within that network. When the UE has received No is the length of the sequence.
and decoded the system information it has information about Also as described in [12], the Ericsson/Lund university team
for example cell bandwidths, whether to use FDD or TDD has come up with a novel, low complexity cell search algo-
and enough information to be able to access the cell via the rithm. The aim of this algorithm is to make the implementation
random-access procedure [1]. robust in the sense that it should tolerate doppler spread and
The third and fourth stage is the random access and the handle sample time mismatches that result in phase shifting.
paging. The random access is when the UE requests a con- To be able to do that they used a non-coherent approach that
nection setup. That is used for initial synchronization or when is useful both in synchronized LTE TDD and high speeding
the UEs serving cell needs to handover the UE to another scenarios. The results that they came up with showed that the
cell among other purposes. The paging on the other hand is non-coherent approach gained much better performance and
used for network initiated connection setup [1]. The system was more robust against doppler spreads and phase shifting
information, random access and the paging is not covered [12].
 In all the algorithms seen, each of them has got some issues
it address for the cell search and some short comings. So the
trade off can be at the expense of some qualities. As in [3],
robustness and probability detection are addressed where as
the complexity issue is not solved. In [10], complexity and
detection are addressed but not robustness and similarly in
[12], robustness and complexity are the issue solved and less
focus on the detection probability. In this, it mean in order to
have a robust connection with low complexity and yet with a
high probability detection there is a need to combine each of
the advantages in one algorithm other than using them different
since this can result in yet another complex solution.

IV. P ROPOSED D ETECTION M ETHOD

The profound search of new algorithms for the cell search

showed that most of them are looking for a accurate detector
of the PSS and SSS. The detection of the PSS is dome usually
in a traditional way using non-coherent method without using
Fig. 3. The Structure of Non-Coherent SSS Detection
any prior information about the channel. thus slot boundaries
are found and the channel estimation is done to detect SSS
further.
In TDD cells, coherent detection of SSS may be inaccurate
2
due to the following problems; According to the structure  30
X
(i) (i)

of the 10 ms radioframe and the location of synchronization m1 = arg max 
 m1 [l]m1 [l 1]s [l]s [l 1] (2)
i
signals in the time domain cells PSS and SSS are separated l=1

by two OFDM symbols. Therefore if the object is moving Where m0 [l] and m1 [l] are the descrambled SSS sequences
with a high speed the channel can vary from symbol to at the receiver and s(i)[l] is the SSS sequences itself (based
symbol, the same happens in the conditions of fading channel on eq. 10 and 11 in [15]).
or a phase shift caused by the sample time mismatch. Non- Combined effective non-coherent detection in TDD cells
coherent detection provides the better detection of SSS in those with perfect sequence helps to escape from complexity of the
conditions but is done with higher complexity and requires system. The sequence results in the decreasing of the com-
longer operation time compared to coherent approach [4], [6], plexity in times while maintaining the detection probability
[16]. and robustness against channel effects. Though the detection
According to the traditional scheme for SSS detection the may fail with low SNR levels.
received signal is correlated with all possible sequences and V. C ONCLUSION
after applying ML detector the timing is obtained.
In this article, we have studied the cell search procedure
Practically the number of multiplications and additions in
in 3GPP LTE system. The main focus has been put on cell
this procedure is quite large [11], thus the whole system is
search and synchronization. The two synchronaization signals
beneficial in terms of correct detection of all synchronization
used in the cell search have been presented i.e. the primary
signals but is also needed to be simplified.
synchronization and secondary synchronization signals. where
To decrease the computational costs, the new sequence for
the primary synchronization signal is needed when a user
SSS is proposed to be applied for this algorithm.The sequence
equipment (UE) connects for the first time to a cell or is look-
is based on the Gaussian integer perfect sequence (GIPS)
ing to make a cell handover, and secondary synchronization
of length 16N. The sequence was clearly described in [11].
signal is needed to provide the terminal with information about
Non-coherent detection is based on differential correlation that
the cell ID, frame timing properties and the cyclic prefix (CP)
replaces the effect of that channel to the signal. The detection
length. Different algorithms have been discussed for enhancing
process can be seen in Fig.3. The SSS detection is done in the
mobility, reliability and robustness in the cell search which aim
frequency domain therefore FFT is applied to the sequence.
at handling channel fading, frequency offset, doppler spread
After deinterleaving and descrambling the decision devise is
and phase shifting.The presented algorithms either improve
detecting a cell ID [15] as in equations (1) and (2).
the probability of the cell ID detection, reduce complexity or
give a robust connection. Non of the algorithm however, can
 30
X 2 enhance all the qualities. This article however has proposed
(i) (i) a theoretical base of an algorithm based on the discussed

m0 = arg max  m0 [l]m0 [l 1]s [l]s [l 1] (1)

i  algorithms which tries to handle all the qualities in one. The
l=1
algorithm is based on the low complex perfect sequence for
SSS and applying non-coherent detection with differential
correlation to obtain cell ID. This then makes the algorithm
to be protected from the inaccurate results due to Doppler
spread, phase shifts of any other channel impact. However
one weakness of the algorithm may be in implementing the
search procedure when SNR is approximately -4dB or lower.
It is important to note however, that the proposed algorithm
is proposed theoretically hence need for future research to
include its implementation.
R EFERENCES
[1] E. Dahlman, S. Parkvall, J. Skld and P. Beming, 3G Evolution: HSPA
and LTE for Mobile Broadband, 2nd ed. Elsevier Ltd., Oxford, UK:
2008.
[2] K. Manolakis, D. Manuel Gutierrez Estevez, V. Jungnickel, W. Xu,
C. Drewes, A Closed Concept for Synchronization and Cell Search in
3GPP LTE Systems, IEEE Communications Society 2009.
[3] A. Andreescu, A. Ghita, A. Enescu, C. Anghel, Long Term Evolution
Primary Synchronization Algorithms IEEE 2010.
[4] S. Sesia, I. Toufik and M. Baker, LTE The UMTS Long Term Evolution
From Theory to Practice, 1st ed. John Wiley and Sons, Ltd. UK: 2009
[5] Z. Syroka and T. Zajac, Optimized Architecture for Computing Zadoff-
Chu Sequences with Application to LTE, in CISIM, 2010, paper 10.1109,
p. 309
[6] Y. Tsai, G. Zhang, D. Grieco, and F. Ozluturk, Cell Search in 3GPP
Long Term Evolution Systems, IEEE Vehicular Technology Magazine,
Jun. 2007, vol. 2, issue 2, pp. 23-29.
[7] Qualcomm Europe, Details on PSC Sequence Design, 3GPP Tech. Doc.,
Tdoc R1-072009, Kobe, Japan, May 2007.
[8] NEC Group, Package of PSC and SSC Proposals for LTE Cell Search,
3GPP Tech. Doc., Tdoc R1-071497, Malta, Mar. 2007.
[9] Qualcomm Europe, Details on SSC sequence Design, 3GPP Tech. Doc.,
Tdoc R1-072093, Kobe, Japan, May 2007
[10] H. Ni, G. Ren, Y. Chang, Complexity Effective Cell Search Scheme for
OFDM Cellular System, IEEE 2010.
[11] Tseng, Pin-Kai ,Wang, Sen-Hung, Li, Chih-Peng A novel low complexity
cell search scheme for LTE systems, IEEE Vehic. Techno. Conf. (VTC
2010-Spring), 2010 IEEE 71st
[12] B. Lindoff, T. Ryden, D. Astely, A Robust Cell Search Algorithm for
3GPP LTE, paper 10.1109, p. 303
[13] 3GPP TR 36.211 v8.6.0, Physical Channels and Modulation, (Release
8), Mar. 2009
[14] M. Mansour, Optimized Architecture for Computing Zadoff-Chu Se-
quences with Application to LTE, in GLOCOM, 2009, paper 10.1109,
p. 1
[15] J-I. Kim, J-S Han, H-J Roh and H-J Choi, SSS detection method for
initial cell search in 3GPP LTE FDD/TDD dual mode receiver Com-
munications and Information Technology, ISCIT 2009. 9th International
Symposium, p. 199 - 203
[16] H. Cao, C. Ma and P. Lin, An Area-efficient Implementation of Primary
Synchronization Signal Detection in LTE Communication Technology
(ICCT), 12th IEEE International Conference, Nov. 2010, p.722-725
 VI. R EVIEW QUESTION FOR THE FINAL EXAM
What is the 3 first steps that are performed in the access
procedure before the user equipment can start using the
network? Answer: First step: Cell search and synchronization
Second step: Deriving System Information Third step: Random
access