IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 61, NO.

4, MAY 2012 1719

Low-Complexity Cell Search With Fast PSS
Identication in LTE
Zhongshan Zhang, Member, IEEE, Jian Liu, Student Member, IEEE, and Keping Long, Senior Member, IEEE
AbstractCell search and synchronization in the Third-
Generation Partnership Project (3GPP) Long-Term Evolution
(LTE) system is performed in each user equipment (UE) by using
the primary synchronization signal (PSS) and secondary synchro-
nization signal (SSS). The overall synchronization performance is
heavily dominated by robust PSS detection, which can be achieved
in the conventional noncoherent detector by exploiting the es-
sential near-perfect autocorrelation and cross-correlation prop-
erties of ZadoffChu (ZC) sequences. However, a relatively high
computational complexity is observed in conventional algorithms.
As compared with them, two new detectors, i.e., almost-half-
complexity (AHC) and central-self-correlation (CSC) detectors,
are proposed in this paper to achieve reliable PSS detection
with much lower complexity by exploiting the central-symmetric
property of ZC sequences. The complexity of the proposed CSC
detector is only 50% that of the AHC detector, which achieves ex-
actly the same PSS detection accuracy as that of the conventional
detector with one half of complexity being saved. An improvement
of CSC, i.e., CSC
Ins
, is also proposed in this paper to combat the
large-frequency offset. The performance of the CSC
Ins
detector
is independent of the frequency offset, and numerical results show
that the 90% PSS acquisition time of CSC
Ins
can be well within an
80-ms duration, even in a heavy intercell-interference environment
with a signal-to-noise ratio (SNR) of 10 dB.
Index TermsLong-Term Evolution (LTE), primary synchro-
nization signal (PSS), Third-Generation Partnership Project
(3GPP), ZadoffChu (ZC) sequence.
I. INTRODUCTION
T
HE Third-Generation Partnership Project (3GPP) Long-
Term Evolution (LTE) is envisioned to be a key tech-
nology for next-generation wireless communications [2], [3].
The LTE network, which is also known as Evolved Universal
Terrestrial Radio Access Network (E-UTRAN), has been stan-
dardized by 3GPP, with orthogonal frequency-division multiple
access and single-carrier frequency-division multiple access
Manuscript received September 5, 2011; revised December 13, 2011 and
February 2, 2011; accepted February 8, 2012. Date of publication February 15,
2012; date of current version May 9, 2012. This work was supported in part by
the National Basic Research Program of China under Grant 2012CB315905;
by the National Natural Science Foundation of China under Grant 61172050;
by the National Key Projects, Beijing Science and Technology Program; by the
Chang Jiang Scholars Program of the Ministry of Education of China; and by
the Program for New Century Excellent Talents in University. This paper will
be presented in part at the IEEE Vehicular Technology Conference, Yokohama,
Japan, May 69, 2012. The review of this paper was coordinated by Dr. H. Lin.
The authors are with the University of Science and Technology Beijing,
Beijing 100083, China (e-mail: zhangzs@ustb.edu.cn; liujian@ustb.edu.cn;
longkepingg@ustb.edu.cn).
Color versions of one or more of the gures in this paper are available online
at http://ieeexplore.ieee.org.
Digital Object Identier 10.1109/TVT.2012.2188109
Fig. 1. PSS mapping of a length-63 ZC sequence into the central 62 sub-
carriers in LTE.
being adopted as the downlink (DL) transmission and uplink
access schemes in LTE, respectively.
In the LTE system, each cell is identied by the cell iden-
tication (cell-ID) information carried by both the primary
synchronization signal (PSS) and secondary synchronization
signal (SSS). A length-63 Zadoff-Chu (ZC) sequence, which
occupies the central six resource blocks (RBs) of the system
bandwidth, is used to generate the PSS, as shown in Fig. 1.
1
Since the SSS detection can be performed only after the PSS
being successfully identied, the overall DL synchronization
performance is therefore heavily dominated by a robust PSS
detection at user equipment (UE).
Currently, PSS detection in LTE has been considerably stud-
ied. An optimized algorithm, as well as the architecture for
computing ZC sequence elements, is proposed in [4]. Synchro-
nization and cell search in 3GPP LTE systems based on the
frequency-domain identication of PSS and SSS are discussed
in [5]. In [6], a robust time and frequency synchronization
scheme in 3GPP LTE is proposed. In this algorithm, the cyclic
prex (CP)-based autocorrelation algorithm is rst performed
to identify the CP type, and the gross symbol synchronization
is performed at the same time. After that, the accurate symbol
and frame timing synchronization is performed by detecting the
PSS symbol. The PSS detection depends on a cross-correlation
1
Note that only the central 62 subcarriers (from #-31 to #-1 and from #1 to
#31) are occupied by the PSS elements, and subcarrier #0, i.e., the dc subcarrier,
is left unmodulated. There are also two guard-bands, with each occupying
ve consecutive subcarriers being placed at the two boundaries of the PSS
modulated subcarriers to constitute a total of six RBs.
0018-9545/$31.00 2012 IEEE
1720 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 61, NO. 4, MAY 2012
operation being performed between the received and local
ZC sequences and has a relatively high complexity. Optimal
neighboring-cell search for LTE systems based on PSS and SSS
is studied in [7], and the sufcient signal metric for multicell
search is derived for various channel conditions. The SSS
detection method for initial cell search in 3GPP LTE time-
division-duplex/frequency-division-duplex dual mode is pro-
posed in [8], and in this algorithm, the SSS detection depends
on the PSS-enabled channel frequency response estimation. A
performance degradation is observed in [8] in the presence of
channel difference between PSS and SSS symbols.
However, all the algorithms previously mentioned detect
the PSS symbol by exploiting the ZC sequences near-perfect
autocorrelation and cross-correlation properties, but this kind
of noncoherent detection requires a full-length complex cor-
relation operation between the received symbol and the local
reference ZC sequence, and a relatively high computational
complexity is observed. Since the computational capability of a
UE is much lower than that of an Evolved NodeB (eNodeB),
a low-complexity PSS detection algorithm is critical to sim-
plify the UEs operation when it is in a high-speed mobility
environment and very frequently perform the handover. Due
to another very important character of ZC sequences, i.e.,
the central-symmetric structure, and by exploiting it, UE can
achieve a reliable PSS detection with a complexity that is
much lower than that observed in the conventional noncoherent
algorithms.
In this paper, improved PSS detection algorithms are studied
by exploiting the central-symmetric structure of the ZC se-
quences. First, a low-complexity detector, i.e., the almost-half-
complexity (AHC) detector, is proposed, and it achieves exactly
the same accuracy as that met in the conventional noncoherent
detector but with a complexity of only one half that of the
latter. A much more complexity-efcient PSS detector, i.e.,
central-self-correlation (CSC)-based PSS fast detector, is then
proposed to further reduce the PSS acquisition complexity to
one half that of the AHC detector. However, both AHC and
CSC detectors are very sensitive to the frequency offset. Amore
robust detector, which is an improvement to the CSC-based
detector, is then proposed to combat the frequency offset. We
call it the frequency offset insensitive PSS detection based on
the CSC property (CSC
Ins
), because its performance is totally
independent of the frequency offset. Athreshold-based decision
mechanism is performed at the receiver to enable an optimal
tradeoff between false-alarm and misdetection probabilities in
PSS detection, and the performance of all these detectors is
evaluated in terms of the 90% PSS acquisition time.
The remainder of this paper is organized as follows: Asystem
model of PSS transmit and receive in LTE is provided in
Section II, and the AHC detector is proposed in Section III.
The central-symmetric property of the ZC sequence is then
exploited, and based on it, the CSC-based PSS fast detector is
proposed in Section IV, followed by its improvement detector,
i.e., CSC
Ins
, being proposed in Section V. The relationship
between the false-alarm and misdetection probabilities of the
proposed algorithms is derived in Section VI, followed by
numerical results given by Section VII. Finally, the conclusions
are drawn in Section VIII.
Notation: ()
1
, ()
T
, and ()
H
are the inverse, transpose,
and complex conjugate transpose of a matrix. The imaginary
unit is j =

1. A circularly symmetric complex Gaussian RV

w with mean mand variance
2
is denoted by w CN(m,
2
).
0
N
is an N 1 all-zero vector. a[i] is the ith entry of vector a,
and a
2
2
=

i
|a[i]|
2
. [B]
mn
is the mnth entry of matrix B.
An N N inverse discrete Fourier transform (IDFT) matrix
F is dened as [F]
nk
= e
j2nk/N
/

N for 0 n, k N 1.
(x)
n
represents the remainder after division of x by n.
II. SYSTEM SIGNAL MODEL
Three PSS sequences are utilized in LTE, with each corre-
sponding to one physical-layer identier within each cell group.
The frequency-domain length-63 ZC sequence is given by
ZC
63
M
(n) = exp
_
jMn(n + 1)
N
ZC
_
(1)
where N
ZC
= 63, n = 0, 1, . . . , N
ZC
1, and M
{1, . . . N
ZC
1} stands for the ZC sequence root.
For a given M, ZC
63
M
(31) is not used to avoid modulating
the dc subcarrier, and the remaining 62 elements of this ZC
sequence can be represented as
z
M
=
_
ZC
63
M
(0),. . ., ZC
63
M
(30), 0, ZC
63
M
(32),. . ., ZC
63
M
(62)

T
.
(2)
ZC sequences with different roots have a low cross correlation
among them and enable high PSS identication capability in
practice [1]. In LTE, the eNodeBbroadcasts the PSS signal once
every 5 ms, and a UE performing the cell search
2
will receive
the DL frame and identify its specic PSS signal to enable DL
synchronization.
By using h
k,m
(z) to represent the discrete-time impulse
response of the zth tap channel between the mth eNodeB and
the kth UE, the related channel response vector can be repre-
sented as h
k,m
= [h
k,m
(0), h
k,m
(1), . . . , h
k,m
(L
max
1)]
T
,
with L
max
representing the maximum channel length. Without
loss of generality, we use x
m
= [0
N62/2
, z
M
, 0
N64/2
]
T
,
which is an N 1 vector, to represent the PSS vector transmit-
ted by the mth eNodeB, where N is the systems IDFT length.
Only the central 62 elements in x
m
are nonzero and modulated
by ZC sequences, as shown in Fig. 1.
The received baseband PSS vector in the kth UE, with the
mth eNodeB acting as its serving eNodeB, is given by
y
k
= E
k,m
FH
k,m
x
m
+

zI
m
E
k,z
FH
k,z
x
z
+w
k
(3)
where H
k,l
=diag{H
k,l
(0), H
k,l
(1), . . . , H
k,l
(N1)} repre-
sents the frequency-domain channel attenuation matrix
with H
k,l
(n) =

L
max
1
d=0
h
k,l
(d)e
j2nd/N
, and E
k,l
=
diag{1, e
j2
k,l
/N
, . . . , e
j2
k,l
(N1)/N
}, with
k,l
represent-
ing the normalized frequency offset (frequency offset normal-
ized to a subcarrier spacing of OFDM symbols) between the
2
UE may perform cell search either when it starts power-on or because it just
moves from another cell to the current cell (i.e., handover).
ZHANG et al.: LOW-COMPLEXITY CELL SEARCH WITH FAST PSS IDENTIFICATION IN LTE 1721
kth UE and the lth eNodeB.
3
I
l
represents the set of interfering
eNodeBs of the lth eNodeB. Note that the ZC sequence roots
of the objective and interfering eNodeBs may be identical
or not. w
k
is a vector of additive white Gaussian noise with
w
k
[i] CN(0,
2
w
).
The receiver may perform PSS detection by using either
a coherent detector (requires the receiver to nd the optimal
M and the start position of the sequence to maximize the
likelihood function) or a noncoherent detector (to maximize
the cross-correlation function between the transmit and re-
ceive ZC sequences [2, Ch. 7.3]. Since the coherent detection
requires the knowledge of channel state information, which
is unavailable at the cell-search phase, we consider only the
noncoherent detection in this paper.
4
Let us use to represent
the discrete-time index of the rst received sample. Dening
s
M
= F[0
N62/2
, z
M
, 0
N64/2
]
T
, the ZC sequence can be
identied by the UE as
{

M,

} = arg max
M,
_

s
H
M
y
()
k

2
_
= arg max
M,
_

s
M
_
y
()
k
_
H

2
_
= arg max
M,

N1

n=0
s
M
[n]y

k
[ +n]

= arg max
M,
_
|s
M
[0]y

k
[] +s
M
[N/2]
y

k
[ +N/2] +
k,
|
2
_
(4)
where the received vector y
()
k
is represented as
y
()
k
= [y
k
[], y
k
[ + 1], . . . , y
k
[ +N 1]]
T
, and
k,
=

N/21
n=1
s
M
[n]y

k
[ +n] +

N1
n=N/2+1
s
M
[n]y

k
[ +n].
III. ALMOST-HALF-COMPLEXITY NONCOHERENT
PRIMARY SYNCHRONIZATION SIGNAL DETECTION
Although the near-perfect correlation property of the ZC
sequence guarantees robust PSS identication, the full-length
correlation-and-comparison operation performed in (4) is basi-
cally complexity concentrated. The high complexity in the PSS
detection degrades the cell-search speed and, as a result, makes
the conventional noncoherent algorithm unsuitable to work in a
high-mobility environment.
An improved PSSdetection scheme is proposed in this section
to considerably reduce cell search complexity. From Appendix,
the odd-length ZC sequences and their IDFT transforms are
always central symmetric, regardless of what the M values are.
From [9], the central-symmetric character still holds in s
M
, i.e.,
s
M
[i] = s
M
[N i], i = 1, . . . , N/2 1. (5)
3
In the succeeding sections,
k,l
and
k,l
are used to represent the initial
phase and the normalized frequency offset between the kth UE and the lth
eNodeB, respectively. Since the initial phase is independent of the frequency
offsets and channel attenuation and because the estimation of the initial phase
is beyond the discussion of this paper, we assume that
k,l
for each (k, l) has
been estimated and compensated for and that, therefore,
k,l
= 0.
4
Frequency offset and channel estimation have been considerably studied
(e.g., either pilot-assisted estimators [9][26] or blind algorithms [27][29] are
available; just list some for survey), and they are beyond the scope of this paper.
Based on this central symmetric property,
k,
can be
simplied as

k,
=
N/21

n=1
s
M
[n]y

k
[ +n] +
N1

n=N/2+1
s
M
[N n]y

k
[ +n]
=
N/21

n=1
s
M
[n]y

k
[ +n] +
N/21

n=1
s
M
[n]y

k
[ +N n]
=
N/21

n=1
s
M
[n] (y
k
[ +n] +y
k
[ +N n])

. (6)
Evidently, the central-symmetric property in s
M
consider-
ably reduces the computational complexity of (4). In the orig-
inal arg max
M,
{|s
H
M
y
()
k
|
2
} computation, it requires a total of N
complex conjugate multiplication operations for each M. How-
ever, (6) reduces the number of complex conjugate multipli-
cation operations to (N/2 + 1) but with additional (N/2 1)
complex addition operations being introduced. Since the com-
plexity of the complex addition operation is much lower than
that of the complex conjugate multiplication operation, almost
one-half the complexity is saved in the proposed algorithm by
exploiting the central-symmetric property of the ZC sequences.
Therefore, we call the proposed detector AHC algorithm. The
detailed procedure of AHC is shown in Fig. 2(a).
IV. CENTRAL-SELF-CORRELATION-BASED PRIMARY
SYNCHRONIZATION SIGNAL FAST DETECTION
Although PSS is very infrequently transmitted (once per
5-ms period), the computational burden of reacquisition of a
PSS sequence by using the AHC detector is still too high for
a loss-synchronization UE, because the UE needs to compare
each received symbol with all the three local ZC sequences
(corresponding to the three roots) to see which root matches the
received one. Only after all the three local ZC sequences fail to
match the received symbol will the UE skip the current received
symbol and move to the next received symbol to perform
the same correlation operation. Even though most of the DL
symbols are data symbols rather than PSS, the UE still needs
to identify each received symbol three times, and this kind
of unwieldy operation wastes a large amount of computation.
The AHC detector considerably improves the computational
efciency, compared with the conventional ones; however, its
meaningless computation consumed on the data symbols still
restricts a further performance improvement.
Due to the central-symmetric property of ZC sequences
and also because this property always holds, regardless of
the exact M values (as proven by the Appendix), the PSS
acquisition speed can be considerably improved by exploiting
this property.
5
Since the case of a data symbol accidently
having a central-symmetric structure is almost impossible, we
can distinguish a PSS symbol from a data symbol simply by
checking whether a received symbol is central symmetric or
not. In PSS initial acquisition, the UE needs only to know
whether a received symbol is PSS or not without necessarily
5
CSC-assistant synchronization in OFDM has already been studied, e.g., in
[9], [10], and [23].
1722 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 61, NO. 4, MAY 2012
Fig. 2. Noncoherent PSS detection in LTE. (a) AHC PSS detection. (b) CSC-based PSS detection.
identifying the exact sequence root. The UE can quickly
know whether a received symbol is a PSS symbol or not
by performing only one self-correlation operation using
the central-symmetric property of ZC sequences. Since a
large amount of computation is foolishly wasted on the data
symbols and because this meaningless computation dominates
the complexity of the PSS acquisition, the CSC detector
considerably improves the PSS acquisition speed due to its
simplied operation preformed on the data symbols.
Once a UE detects the central-symmetric pattern in the re-
ceived vector, it knows that a PSS sequence is coming (without
knowing the exact M value yet). The detailed CSC procedure
is shown in Fig. 2(b).
A. PSS Fast Acquisition
Like in [30], a timing metric for PSS detection is dened by
6
Z
C
() =

N/21

n=1
(, n)

2
(7)
6
The timing metric used for PSS detection is not unique, and the other
well-knowledged timing metrics, e.g., Z() = (|

N/21
n=1
y
k
[ + N
n] y

k
[ + n]|)/(

N/21
n=1
(|y
k
[ + N n]|
2
+ |y
k
[ + n]|
2
)) or simply
Z() = |

N/21
n=1
y
k
[ + N n] y

k
[ + n]|, can also be applied here.
where (, n) = y
k
[ +N n] y

k
[ +n]/|y
k
[ +N
n] y

k
[ +n]|. The PSS can be identied by the UE by
detecting the locally maximal Z
C
() value. Another method
for PSS detection is the threshold-enabled scheme, which helps
the mth UE make a decision by presetting a threshold T
m
and
nding the rst value that makes Z
C
() larger than T
m
(as
shown in Fig. 3).
B. ZC Sequence Root M Identication in CSC
After a PSS being successfully detected, the UE will then
identify its root M. Fig. 3 shows the procedure of PSS root M
Identication, and this operation can be performed in either the
time or the frequency domain.
V. FREQUENCY-OFFSET-INSENSITIVE PRIMARY
SYNCHRONIZATION SIGNAL DETECTION BASED ON THE
CENTRAL-SELF-CORRELATION PROPERTY (CSC
Ins
)
Frequency offset accumulation in the time domain introduces
a linearly increasing phase offset in the received sequences, and
the orthogonality between the received and local ZC sequences
will be destroyed as a result. In both the conventional and pro-
posed AHC algorithms, the timing metric for PSS detection is
always a function of frequency offset, and the maximum value
is met at zero frequency offset. Once the normalized frequency
offset approaches 1, the timing metric becomes very small
ZHANG et al.: LOW-COMPLEXITY CELL SEARCH WITH FAST PSS IDENTIFICATION IN LTE 1723
Fig. 3. CSC-based PSS detection, with a threshold being used to reduce the complexity.
and will be totally buried by the background interference and
noise, in which case the PSS detection will totally fail. The
similar condition is met in the proposed CSC algorithm.
To combat the frequency offset, a frequency-offset-
insensitive PSS detection algorithm, i.e., CSC
Ins
, is proposed.
Since this algorithm is an improvement of the CSC detector, it
also exploits the central symmetric property of PSS to improve
the detection performance.
For the kth UE, without loss of generality, we assume
that the mth eNodeB is the objective eNodeB and dominates
the received power of the kth UE, and the other eNodeBs
transmit power is simply seen as interference. Let us dene

()
y,n
= y
k
[ +N n] y
k
[ +n]. From (3), the argument
of
()
y,n
can be represented as arg{
()
y,n
} = j2Mn(n +
1)/N
ZC
+ 2
k,m
+ 2e
k,m
+
k,m
, where e
k,m
represents
the frequency offset errors induced by the interference and
noise, and
k,m
stands for the phase noise accumulated by
the signal propagation. Evidently, the phase rotation/offset, i.e.,
2
k,m
+ 2e
k,m
+
k,m
, is independent of n and appears as
a common parameter.
In PSS detection, the detector only needs to compensate
for the phase rotations induced by the rst element, i.e.,
j2Mn(n + 1)/N
ZC
. Multiplying
()
y,n
by exp[j2Mn(n +
1)/N
ZC
], the resultant phase rotation in expression, i.e.,

()
y,M,n
= exp[j2Mn(n + 1)/N
ZC
]
()
y,n
, becomes
arg
_

()
y,M,n
_
= 2
k,m
+ 2e
k,m
+
k,m
(8)
for each n, and the phase rotation due to the frequency offset
becomes a common value in the argument of
()
y,M,n
. There-
fore, the effect of frequency offset on the detector is totally
eliminated.
From analysis aforementioned, let us derive the new PSS
detector CSC
Ins
. Let us rst dene a new vector
()
k
as

()
k
=
_

()
y,1
,
()
y,2
, . . . ,
()
y,
N
2
1
_
T
. (9)
In addition, dene the local vector as
s
2M
= F
_
0N62
2
, z
2M
, 0N64
2
_
T
(10)
where z
2M
[n] = exp[j2Mn(n + 1)/N
ZC
]. The PSS detec-
tor CSC
Ins
can be derived as
{

M,

} = arg max
M,
_

s
H
2M

()
k

2
_
(11)
where
s
2M
=
_
s
2M
[1], s
2M
[2], . . . , s
2M
_
N
2
1
__
T
. (12)
VI. RELATIONSHIP BETWEEN FALSE-ALARM AND
MISDETECTION PROBABILITIES OF THE
PROPOSED ALGORITHMS
In a multipath channel, the tap with the highest power is most
probably to be detected. Since the other taps and the signals
transmitted by the interfering eNodeBs will be seen as inter-
ference to this highest power tap, the signal-to-interference-
and-noise ratio (SINR) of the objective tap will be degraded.
Therefore, the performance of the PSS detection algorithms,
either the conventional noncoherent detector or the proposed
detectors (AHC and CSC), are all interference limited.
A. False-Alarm Probabilities of the Proposed Detectors
In the process of PSS detection, a threshold-based PSS de-
tection scheme can be performed to enable fast synchronization
with satised reliability. Choosing a suitable PSS identication
threshold, which is a dimensionless and algorithm-specic pa-
rameter [e.g., if the CSC algorithm is performed, the threshold
should be chosen based on (7)], is critical to successfully
identify a PSS while, at the same time, minimize the mistake of
1724 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 61, NO. 4, MAY 2012
identifying a non-PSS symbol as PSS due to the high interfer-
ence and/or noise level.
Therefore, a tradeoff between the false-alarm probability
(P
FA
) and misdetection probability (P
MD
) appears in the
threshold selection. A relatively higher threshold will simul-
taneously reduce P
FA
and result in the increase of P
MD
.
However, reducing the threshold level may improve the P
MD
performance but at the cost of sacricing the P
FA
performance.
Only one out of the two parameters (P
FA
and P
MD
) would be
enough to specify the threshold due to the essential relationship
between them. In this paper, similar to [23], P
FA
is used to
derive the threshold.
For AHC detection, let us rst dene the threshold as
T
AHC
Threshold
. By using the same mathematical method as in [23],
P
FA
is represented as
P
AHC
FA
= e

T
AHC
Threshold
2
2
AHC
(13)
where
2
AHC
= N
2
w
/2. T
AHC
Threshold
can therefore be derived as
T
AHC
Threshold
= 2
2
AHC
ln
_
1
P
AHC
FA
_
. (14)
Similarly, for the CSC detector, dene
2
CSC
= (N
2)(2
2
w
+
4
w
)/4, we have
P
CSC
FA
= e

T
CSC
Threshold
2
2
CSC
(15)
and the threshold for the CSC detector can be derived as
T
CSC
Threshold
= 2
2
CSC
ln
_
1
P
CSC
FA
_
. (16)
B. Misdetection Probabilities of the Proposed Detectors
In this section, we will derive the misdetection probabilities
of the proposed detectors.
1) Misdetection Probability of AHC: AHC has exact the
same accuracy as that of the conventional noncoherent detector
by saving almost one-half complexity. Assume that a at-fading
channel is considered, from [31, Ch. 2, p. 44], the AHC detector
Z
A
() = |s
H
M
y
()
k
|
2
can be approximated as a noncentral chi-
square random variable with 2N degrees of freedom. The
expectation of Z
A
() can be derived as
E
_
Z
A
()
_
=
sin
2

sin
2
N
+N
2
w
(17)
where the subscript of is removed for brevity. Note that
the multipath interference and some inter-eNodeB interference
will degrade the PSS detection performance in AHC, and
the maximum expectation obtained in the multipath channel
cannot be as high as that given by (17). However, due to the
near-perfect cross-correlation property of ZC sequences, the
multipath interference and the other intercell interference can
be greatly eliminated, and as a result, a reliable PSS detection
can still be obtained.
For a given threshold T
AHC
Threshold
, the probability of Z
A
()
not being larger than T
AHC
Threshold
(i.e., P
AHC
MD
) is derived as
P
AHC
MD
=P
r
_
Z
A
() T
AHC
Threshold
_
=1exp
_

AHC
N,
_
2
+
_

AHC
N,
_
2
2
_

AHC
N,
(18)
where

AHC
N,
=I
0
_

AHC
N,

AHC
N,
_
+
N1

k=1

AHC
N,

AHC
N,
_
k
+
_

AHC
N,

AHC
N,
_
k

I
k
_

AHC
N,

AHC
N,
_
+

k=N
_

AHC
N,

AHC
N,
_
k
I
k
_

AHC
N,

AHC
N,
_
(19)

AHC
N,
=|sin()/sin(/N)|
_
2/
2
w
,
AHC
N,
=
_
2T
AHC
Threshold
/
2
w
,

AHC
N,
>
AHC
N,
> 0, and I
k
() is the kth-order modied Bessel
function of the rst kind and can be represented as
I
k
(x) =

m=0
(x/2)
k+2m
m!(m+k + 1)
=

m=0
(x/2)
k+2m
m!(m+k)!
, x 0, (m+k) 0.
(20)
2) Misdetection Probability of CSC: As discussed in [30],
for a large-enough N, the Central Limit Theorem works, and
different Z
C
() realizations will all converge to their common
expectation. Similar to (17), the expectation of Z
C
() for CSC
is directly given out without providing the detailed derivation as
E
_
Z
C
()
_
=
sin
2 (N2)
N
sin
2 2
N
+
_
N
2
1
_
_
2
2
w
+
4
w
_
.
(21)
As in the AHC analysis, for a given threshold T
CSC
Threshold
, the
misdetection probability is derived as
P
CSC
MD
=P
r
_
Z
C
() T
CSC
Threshold
_
=1exp
_

CSC
N,
_
2
+
_

CSC
N,
_
2
2
_

CSC
N,
(22)
where

CSC
N,
=I
0
_

CSC
N,

CSC
N,
_
+
N1

k=1

CSC
N,

CSC
N,
_
k
+
_

CSC
N,

CSC
N,
_
k

I
k
_

CSC
N,

CSC
N,
_
+

k=N
_

CSC
N,

CSC
N,
_
k
I
k
_

CSC
N,

CSC
N,
_
(23)
ZHANG et al.: LOW-COMPLEXITY CELL SEARCH WITH FAST PSS IDENTIFICATION IN LTE 1725
TABLE I
SIMULATION PARAMETERS FOR THE CONVENTIONAL ALGORITHM, AHC,
AND CSC WITH M = 25, 29, 34 STANDING FOR PSS1, PSS2,
AND PSS3, RESPECTIVELY
with
CSC
N,
=| sin((N2)/N)/sin(2/N)|
_
2/2
2
w
+
4
w
,

CSC
N,
=
_
2T
CSC
Threshold
/2
2
w
+
4
w
, and
CSC
N,
>
CSC
N,
> 0.
3) Misdetection Probability of CSC
Ins
: CSC
Ins
has a very
similar statistical character to that of CSC, with the frequency
offset combating capability being much higher than that of
the latter. Dene the timing metric of CSC
Ins
as Z
C
Ins
() =
|s
H
2M

()
k
|
2
, which is independent of . As in (21), the expecta-
tion of Z
C
Ins
() can be straightforwardly derived as
E
_
Z
C
Ins
()
_
=
sin
2 (N2)
N
sin
2 2
N

=0
+
_
N
2
1
_
_
2
2
w
+
4
w
_
=
_
N
2
1
_
_
2
2
w
+
4
w
+ 1
_
. (24)
Similarly, for a given threshold T
CSC
Ins
Threshold
, the misdetection
probability is derived as
P
CSC
Ins
MD
=P
r
_
Z
C
Ins
() T
CSC
Ins
Threshold
_
=1 exp
_

CSC
N,=0
_
2
+
_

CSC
N,=0
_
2
2
_

CSC
N,=0
.
(25)
VII. NUMERICAL RESULTS
In this section, the performance of the proposed PSS detec-
tors is evaluated. The detailed simulation parameters, which
have been dened in [2, Ch. 7, Tab. 7.1], are given by Table I.
A three-cell environment is considered, with cell #1 being the
objective cell and cells #2 & #3 acting as the interfering cells.
By considering the effect of signal-propagation large-scale path
loss, the UE in the objective cell receives the average transmit
power from cell #2, which is 4.89 dB lower than that from
cell #1, and that power difference between cells #3 and #1
is 5.93 dB. Scenarios of both synchronous and asynchronous
eNodeBs are analyzed. The other simulation parameters follow
the scenario dened in [32].
7
The timing metrics for the conventional noncoherent detector
and the proposed detector (including AHC, CSC, and CSC
Ins
)
as functions of normalized frequency offset are shown in Fig. 4.
The working range of the conventional noncoherent detector
and the proposed AHC algorithm in terms of normalized fre-
quency offset is (0.74, 0.74), and beyond this range, the
7
For example, the multipath channel models associated with Extended
Typical Urban with a UE speed of 5 km/h (ETU5), ETU300 with a UE speed
of 300 km/h, and Extended Pedestrian A with a UE speed of 5 km/h (EPA5).
Fig. 4. Expectation of the timing metric of the conventional noncoherent
detector and the proposed AHC, CSC, and CSC
Ins
detectors, respectively, as a
function of normalized frequency offset.
Fig. 5. Simulation scenarios for the proposed algorithms. (a) UE locates in
the center area of the objective cell. (b) UE locates at the cell-edge area of three
neighboring cells.
algorithms will fail. Compared with them, a relatively smaller
working range, i.e., (0.56, 0.56), is met for the proposed CSC
detector, and this shortened range makes the CSC detector more
sensitive to the large frequency offset. The most robust detector
in terms of frequency-offset-combating capability is the pro-
posed CSC
Ins
detector, whose performance is independent of
the frequency offset. A PSS detection capability that is always
equal to the optimal performance of the CSC detector can
be obtained in CSC
Ins
detector. This always-optimal property
makes the CSC
Ins
detector capable of providing the most robust
PSS acquisition performance, even in the presence of a large
frequency offset.
Simulations about the performance comparison among the
conventional detector and the proposed algorithms in terms of
90% PSS acquisition time are performed, with two scenarios
being considered: 1) UE locates at the center area of the
objective cell, and 2) UE locates at the cell-edge area of three
neighboring cells, as shown in Fig. 5. Let us rst consider sce-
nario 1 with the related numerical results being shown in Fig. 6.
In this simulation, the normalized frequency offset is assumed
to be 0.1 (corresponding to 1.5 kHz). AHC detector achieves
exactly the same accuracy as that obtained in the conventional
noncoherent algorithm. Compared with AHC, the CSC detector
1726 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 61, NO. 4, MAY 2012
Fig. 6. Ninety-percent PSS acquisition time comparison among the conven-
tional, AHC, and CSC algorithms with a normalized frequency offset of 0.1 and
the PSS1, PSS2, and PSS3 being dened as ZC sequences rooted by 25, 29, and
34, respectively [Scenario (a) in Fig. 5].
Fig. 7. Ninety-percent PSS acquisition time for the proposed CSC
Ins
algorithm with a normalized frequency offset of 0.1 and the PSS1, PSS2, and
PSS3 being dened as ZC sequences rooted by 25, 29, and 34, respectively
[Scenario (a) in Fig. 5].
can further save one-half complexity if the simpler timing
metric Z() = |

N/21
n=1
y
k
[ +N n] y

k
[ +n]| is used.
It is also shown in this simulation that, for an SNR of 10 dB,
the 90% PSS acquisition time of 150 ms can be obtained by
all the algorithms. For example, with P
FA
being kept 10
3
unchanged and (PSS1, PSS2, PSS1) being transmitted from cell
#1, cell #2, and cell #3, respectively, the 90% PSS acquisition
time for the synchronous and asynchronous scenarios are about
30 and 80 ms, respectively.
Fig. 7 shows the performance of the proposed CSC
Ins
de-
tector in the scenario dened by Fig. 5(a), with P
FA
being
set to 10
3
unchanged. A much shorter 90% PSS acquisition
Fig. 8. Ninety-percent PSS acquisition time comparison among the conven-
tional, AHC, and CSC algorithms with a normalized frequency offset of 0.1 and
the PSS1, PSS2, and PSS3 being dened as ZC sequences rooted by 25, 29, and
34, respectively [Scenario (b) in Fig. 5].
time compared to the other detectors is obtained in the CSC
Ins
detector because of its frequency-offset-combating capability.
With (PSS1, PSS2, PSS1) being transmitted, the performance
obtained in the synchronous interference scenario is relatively
better than that obtained in the asynchronous interference en-
vironment in CSC
Ins
. For example, at the SNR of 10, a PSS
acquisition time of 30 ms can be obtained in the synchronous
scenario, and it is shorter than that achieved in the asynchronous
scenario (which is 55 ms). For the synchronous interference
environment, the PSS acquisition time obtained in the scenario
of (PSS1, PSS2, PSS1) will be shorter than that obtained in the
scenario of (PSS1, PSS2, PSS3), because of the add-up effect
of the interfering PSS to the objective PSS. For example, at the
SNR of 13 dB, the 90% PSS acquisition time in the (PSS1,
PSS2, PSS1) scenario is 30 ms, but an acquisition time of
70 ms is required for the scenario of (PSS1, PSS2, PSS3).
Compared with the scenario dened in Fig. 5(a), a very
similar PSS detection performance is obtained in the scenario
Fig. 5(b) in the conventional algorithm and the proposed AHC
and CSC detectors. Simulation results are shown in Fig. 8.
Since, in the scenario of Fig. 5(b), UE locates in the cell
boundaries and the signal propagation fading will deteriorate its
SINR more than that in the scenario of Fig. 5(a), this degraded
SINR makes the PSS detection performance relatively worse
than that obtained in the scenario of Fig. 5(a). In all detectors,
the 90% PSS acquisition time of not larger than 205 ms can be
obtained at the SNR of 10 dB.
Fig. 9 shows the performance of the CSC
Ins
detector ob-
tained in the scenario Fig. 5(b). Similar to Fig. 7, with (PSS1,
PSS2, PSS1) being transmitted, the performance obtained in the
synchronous interference scenario is also relatively better than
that obtained in the asynchronous interference environment, as
dened by Fig. 5(b). From the numerical results, it is observed
that, even with the heavier interference that comes from the
neighboring cells, the proposed CSC
Ins
detector still works well
ZHANG et al.: LOW-COMPLEXITY CELL SEARCH WITH FAST PSS IDENTIFICATION IN LTE 1727
Fig. 9. Ninety-percent PSS acquisition time for the proposed CSC
Ins
algorithm with a normalized frequency offset of 0.1 and the PSS1, PSS2, and
PSS3 being dened as ZC sequences rooted by 25, 29, and 34, respectively
[Scenario (b) in Fig. 5].
TABLE II
COMPUTATIONAL COMPLEXITY COMPARISON AMONG THE THREE PSS
ACQUISITION ALGORITHMS: CONVENTIONAL ALGORITHM, AHC, CSC,
AND CSC
Ins
(M = 25, 29, 34)
due to its frequency-offset-combating capability. For example,
in all the transmission scenarios, the 90% PSS acquisition time
of not larger than 80 ms can be obtained at the SNR of 10.
Computational complexity comparisons among the conven-
tional noncoherent detector, the proposed AHC, CSC, and
CSC
Ins
detectors are illustrated in Table II. From the product
design perspective, the complexity of a complex conjugate
multiplication operation is much higher than that of a complex
addition operation, and the complexity of the latter can be
neglected in a simplied complexity evaluation. It is observed
in the table that the proposed CSC detector has only about
one-half complexity of that of the other two proposed detec-
tors (about one fourth that of the conventional noncoherent
detector) in terms of PSS acquisition. Therefore, among the
three proposed detectors, the CSC detector is the most ef-
cient detector in terms of complexity reduction. For a small
frequency offset with a frequency-offset-combating capability
being not necessarily enabled, CSC, instead of CSC
Ins
, is the
most suitable candidate to achieve reliable and low-complexity
PSS detection.
VIII. CONCLUSION
The essential central-symmetric property of the ZC se-
quences have been exploited to improve the PSS detection per-
formance, and based on this property, three high-performance
PSS detectors, i.e., AHC, CSC, and CSC
Ins
, have been pro-
posed. Compared with the proposed AHC detector, which
achieves exactly the same accuracy as that obtained in the
conventional noncoherent detector, with 50% complexity being
saved, the proposed CSC detector can further cut its complexity
by half. To avoid the frequency offset sensitivities that were ob-
served in the detectors, an improved CSC detector, i.e., CSC
Ins
,
has also been proposed in this paper to improve the frequency-
offset-combating capability. Compared with the conventional
noncoherent detector, the proposed CSC and CSC
Ins
detectors
are more suitable for working in a synchronous-interference
scenario due to the add-up effect of the interfering PSS to the
objective PSS. With (PSS1, PSS2, PSS1) being transmitted by
cells #1, #2, and #3, respectively, a fast PSS acquisition with the
90% acquisition time of 55 ms can be achieved in the proposed
CSC detector at an SNR of 10 dB, and this acquisition time
can be further reduced to 30 ms if the proposed CSC
Ins
de-
tector is applied. Compared with the conventional noncoherent
detectors, the proposed low-complexity PSS detectors are much
more suitable for working in a high-mobility environment with
a frequent handover being performed.
APPENDIX
CENTRAL SYMMETRIC PROPERTY IN
ZADOFFCHU SEQUENCES
The relationship between the pth and (N
ZC
1 p)th ele-
ments of ZC
N
ZC
M
is derived as
8
ZC
N
ZC
M
(N
ZC
1 p)
= exp
_
jM(N
ZC
1 p)(N
ZC
p)
N
ZC
_
= exp
_
jM
_
N
2
ZC
(2p + 1)N
ZC
+p(p + 1)
_
N
ZC
_
= exp [jM (N
ZC
(2p + 1))] exp
_
jMk(p + 1)
N
ZC
_
= exp [jM (N
ZC
(2p + 1))] ZC
N
ZC
M
(p) (26)
where p = 0, 1, . . . , N
ZC
1. Since N
ZC
is an odd number,
without loss of generality, we can represent N
ZC
as N
ZC
=
2B
ZC
+ 1, where B
ZC
is a nonnegative integer. Equation (26)
can then be further simplied as
ZC
N
ZC
M
(N
ZC
1 p)
= exp [jM(2B
ZC
2p)] ZC
N
ZC
M
(p)
= exp [j2M(B
ZC
p)]
. .
=1
ZC
N
ZC
M
(p)
= ZC
N
ZC
M
(p). (27)
ACKNOWLEDGMENT
The authors would like to thank the anonymous reviewers for
their critical comments, which greatly improved this paper.
8
To generate a length-N
s
sequence with a better cross-correlation property,
N
ZC
is usually chosen as the maximum prime number in the range of [2, N
s
].
With N
s
= 62, we have N
ZC
= 61 in real systems. The length-62 sequence
can be generated by cyclically padding the last element of the generated length-
61 sequence to the front of this sequence. Without loss of generality, we use
N
ZC
instead of 63 here. The central symmetric property derived in this section
holds for any odd-length ZC sequence, whether the length is a prime number
or not.
1728 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 61, NO. 4, MAY 2012
REFERENCES
[1] J. D. C. Chu, Polyphase codes with good periodic correlation properties,
IEEE Trans. Inf. Theory, vol. IT-18, no. 4, pp. 531532, Jul. 1972.
[2] S. Sesia, I. Touk, and M. Baker, LTEThe UMTS Long Term Evolution:
From Theory to Practice. New York: Wiley, 2009.
[3] Third-Generation Partnership Project TS 36.211 v8.5.0, Physical channels
and modulation (Release 8) Technical Specication Group Radio Access
Network: Evolved Universal Terrestrial Radio Access (E-UTRAN).
[4] M. M. Mansour, Optimized architecture for computing Zadoff-Chu se-
quences with application to LTE, in Proc. IEEE GLOBECOM, Honolulu,
HI, 2009, pp. 16.
[5] K. Manolakis, D. M. G. Estevez, V. Jungnickel, W. Xu, and C. Drewes,
A closed concept for synchronization and cell search in 3GPP LTE sys-
tems, in Proc. IEEE Wireless Commun. Netw. Conf., Budapest, Hungary,
Apr. 2009, pp. 16.
[6] W. Xu and K. Manolakis, Robust synchronization for 3GPP LTE sys-
tems, in Proc. IEEE GLOBECOM, Miami, FL, 2010, pp. 15.
[7] Y. Shen, T. Luo, and M. Z. Win, Neighboring cell search techniques for
LTE systems, in Proc. IEEE ICC, Kyoto, Japan, 2010, pp. 16.
[8] 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, in Proc.
9th ISCIT, Incheon, Korea, 2009, pp. 199203.
[9] Z. Zhang, K. Long, M. Zhao, and Y. Liu, Joint frame synchronization and
frequency offset estimation in OFDM systems, IEEE Trans. Broadcast,
vol. 51, no. 3, pp. 389394, Sep. 2005.
[10] Z. Zhang, M. Zhao, H. Zhou, Y. Liu, and J. Gao, Frequency offset
estimation with fast acquisition in OFDM system, IEEE Commun. Lett.,
vol. 8, no. 3, pp. 171173, Mar. 2004.
[11] L. Bai, Q. Yin, and H. Wang, Analysis of carrier frequency offset estima-
tion with multiple pilot block sequences, IEEE Commun. Lett., vol. 14,
no. 5, pp. 456458, May 2010.
[12] Y. Li, L. J. Cimini, and N. R. Sollenberger, Robust channel estimation
for OFDM systems with rapid dispersive fading channels, IEEE Trans.
Commun., vol. 46, no. 7, pp. 902915, Jul. 1998.
[13] H. Minn, X. Fu, and V. K. Bhargava, Optimal periodic training signal for
frequency offset estimation in frequency-selective fading channels, IEEE
Trans. Commun., vol. 54, no. 6, pp. 10811096, Jun. 2006.
[14] M.-O. Pun, M. Morelli, and C.-C. Kuo, Maximum-likelihood synchro-
nization and channel estimation for OFDMA uplink transmissions, IEEE
Trans. Commun., vol. 54, no. 4, pp. 726736, Apr. 2006.
[15] Z. Zhang, W. Zhang, and C. Tellambura, MIMO-OFDM channel estima-
tion in the presence of frequency offsets, IEEE Trans. Wireless Commun.,
vol. 7, no. 6, pp. 23292339, Jun. 2008.
[16] M.-H. Hsieh and C.-H. Wei, A low-complexity frame synchronization
and frequency offset compensation scheme for OFDM systems over fad-
ing channels, IEEE Trans. Veh. Technol., vol. 48, no. 5, pp. 15961609,
Sep. 1999.
[17] F. Gao, T. Cui, and A. Nallanathan, Scattered pilots and virtual carriers
based frequency offset tracking for OFDM systems: Algorithms, identi-
ability, and performance analysis, IEEE Trans. Commun., vol. 56, no. 4,
pp. 619629, Apr. 2008.
[18] H. Mehrpouyan and S. D. Blostein, Bounds and algorithms for multiple
frequency offset estimation in cooperative networks, IEEE Trans. Wire-
less Commun., vol. 10, no. 4, pp. 13001311, Apr. 2011.
[19] Y.-H. Kim and J.-H. Lee, Joint maximum likelihood estimation of carrier
and sampling frequency offsets for OFDM systems, IEEE Trans. Broad-
cast, vol. 57, no. 2, pp. 277283, Jun. 2011.
[20] Z. Zhang, W. Zhang, and C. Tellambura, Robust ofdma uplink synchro-
nization by exploiting the variance of carrier frequency offsets, IEEE
Trans. Veh. Technol., vol. 57, no. 5, pp. 30283039, Sep. 2008.
[21] Z. Zhang, W. Zhang, and C. Tellambura, Cooperative OFDM channel es-
timation in the presence of frequency offsets, IEEE Trans. Veh. Technol.,
vol. 58, no. 7, pp. 34473459, Sep. 2009.
[22] R. Corvaja and A. G. Armada, SINR degradation in MIMO-OFDM
systems with channel estimation errors and partial phase noise com-
pensation, IEEE Trans. Commun., vol. 58, no. 8, pp. 21992203,
Aug. 2010.
[23] Z. Zhang, H. Kayama, and C. Tellambura, New joint frame synchronisa-
tion and carrier frequency offset estimation method for OFDM systems,
Euro. Trans. Telecommun., vol. 20, no. 4, pp. 413430, Jun. 2009.
[24] K. J. Kim, M.-O. Pun, and R. A. Iltis, Joint carrier frequency offset
and channel estimation for uplink MIMO-OFDMA systems using par-
allel Schmidt Rao-Blackwellized particle lters, IEEE Trans. Commun.,
vol. 58, no. 9, pp. 26972708, Sep. 2010.
[25] Z. Zhang, W. Jiang, H. Zhou, Y. Liu, and J. Gao, High accuracy fre-
quency offset correction with adjustable acquisition range in OFDM
systems, IEEE Trans. Wireless Commun., vol. 4, no. 1, pp. 228237,
Jan. 2005.
[26] B. Ai, Z. Yang, C. Pan, J. Ge, Y. Wang, and Z. Lu, On the synchronization
techniques for wireless OFDM systems, IEEE Trans. Broadcast, vol. 52,
no. 2, pp. 236244, Jun. 2006.
[27] M. Movahhedian, Y. Ma, and R. Tafazolli, Blind CFO estimation for
linearly precoded OFDMA uplink, IEEE Trans. Signal Process., vol. 58,
no. 9, pp. 46984710, Sep. 2010.
[28] S. L. Talbot and B. Farhang-Boroujeny, Spectral method of blind car-
rier tracking for OFDM, IEEE Trans. Signal Process., vol. 56, no. 7,
pp. 27062717, Jul. 2008.
[29] F. Gao and A. Nallanathan, Blind maximum likelihood CFO estimation
for OFDM systems via polynomial rooting, IEEE Signal Process. Lett.,
vol. 13, no. 2, pp. 7376, Feb. 2006.
[30] Z. Zhang, K. Long, and Y. Liu, Complex efcient carrier frequency offset
estimation algorithm in OFDM systems, IEEE Trans. Broadcast, vol. 50,
no. 2, pp. 159164, Jun. 2004.
[31] J. G. Proakis, Digital Communications, 4th ed. New York: McGraw-
Hill, 2001.
[32] M.E. Texas Instrum., NXP, and Nokia, R4-072215: Simulation assump-
tions for intra-frequency cell identication, in Proc. 3GPP TSG RAN
WG4 634 Meeting, vol. 45, Jeju, Korea, 2007.
Zhongshan Zhang (M04) received the B.E. and
M.S. degrees in computer science and the Ph.D.
degree in electrical engineering from Beijing Uni-
versity of Posts and Telecommunications, Beijing,
China, in 1998, 2001, and 2004, respectively.
In August 2004, he joined DoCoMo Beijing Lab-
oratories as an Associate Researcher and was pro-
moted to Researcher in December 2005. In February
2006, he joined the University of Alberta, Edmonton,
AB, Canada, as a Postdoctoral Fellow. In April 2009,
he joined the Department of Research and Innovation
(R&I), Alcatel-Lucent, Shanghai, China, as a Research Scientist. From August
2010 to July 2011, he was with NEC China Laboratories, Beijing, as a Senior
Researcher. He is currently a Professor with the School of Computer and
Communication Engineering, University of Science and Technology Beijing.
His research interests include statistical signal processing, synchronization and
channel estimation in multiple-inputmultiple-output orthogonal frequency-
division multiplexing systems, and cooperative communications.
Jian Liu (S03) received the B.S. degree in auto-
matic control theory and applications and the Ph.D.
degree from Shandong University, Shandong, China,
in 2000 and 2008, respectively.
He is currently an Associate Professor with
the University of Science and Technology Beijing,
Beijing, China. His research interests include cog-
nitive radio networks, mobile mesh networks, and
Long-Term Evolution-Advanced.
ZHANG et al.: LOW-COMPLEXITY CELL SEARCH WITH FAST PSS IDENTIFICATION IN LTE 1729
Keping Long (SM06) received the M.S. and Ph.D.
degrees from the University of Electronic Science
and Technology of China, Chengdu, China, in 1995
and 1998, respectively.
From September 1998 to August 2000, he was
a Postdoctoral Research Fellow with the National
Laboratory of Switching Technology and Telecom-
munication Networks, Beijing University of Posts
and Telecommunications (BUPT), Beijing, China.
From September 2000 to June 2001, he was an
Associate Professor with BUPT. From July 2001 to
November 2002, he was a Research Fellow with the ARC Special Research
Centre for Ultra Broadband Information Networks, University of Melbourne,
Melbourne, Australia. He is currently a Professor and Dean with the School
of Computer and Communication Engineering, University of Science and
Technology Beijing. He has authored more than 200 papers and has delivered
20 keynote speeches. He is a Member of the Editorial Committee of Sciences in
China Series F and China Communications. His research interests are optical
internet technology, new-generation network technology, wireless information
networks, value-added service, and secure technology of networks.
Dr. Long has been a Technical Program Committee (TPC) and Interna-
tional Steering Committee member for COIN2003/04/05/06/07/08/09/10, IEEE
IWCN2010, ICON04/06, and APOC2004/06/08; a Co-chair of the organization
membership for the 2006 International Wireless Communications and Mobile
Computing Conference; the TPC chair of COIN2005/2008; and a TPC Co-
chair of COIN2008/2010. He has been invited to talk at both international and
local conferences. He received the National Science Fund for Distinguished
Young Scholars of China in 2007 and was selected as the Chang Jiang Scholars
Program Professor of China in 2008.