JOURNAL OF COMMUNICATIONS AND NETWORKS, VOL. 21, NO.
1, FEBURARY 2019
Recovery of Carrier Frequency Offset and Set
Information for LTE Device-to-Device
Communications
Jooheum Yoon, Changgyu Lee, and Yun Hee Kim
Abstract: Sidelink channels have been standardized in the long-
term evolution (LTE) to support device-to-device communications
for public safety, vehicular-to-everything services, and other fea-
tures. The channels provide sidelink synchronization signals (SSSs)
for synchronization among the user equipment (UE), which obtain
the timing, carrier frequency offset (CFO), and sidelink identity
from a synchronization source UE. This paper focuses on the recov-
ery of a CFO and the sidelink identity set information by exploiting
the two primary SSS (PSSS) symbols after the symbol timing is ob-
tained. We propose the use of detection metrics for the quantized
CFO and set information by estimating a multi-path fading chan-
nel subject to unknown delay times and residual CFO (RFO) er-
rors. The proposed metrics have been shown to be implementable
with low complexity by exploiting the properties of the PSSS se-
quence. The metrics were also analyzed in multi-path fading chan-
nels without RFO errors for a quick estimate regarding the per-
formance and guidelines of the sequence design. The results indi-
cate that the proposed detection metrics outperform the conven-
tional metric under realistic scenarios with unknown delay times
and RFO errors.
Index Terms: Carrier frequency offset, detection and estima-
tion, device-to-device communication, long term evolution,
pri-mary sidelink synchronization signal.
I. INTRODUCTION
S INCE the successful deployment of long-term evolution
(LTE) developed by the 3rd generation partnership project
(3GPP) for broadband mobile communications, its enhanced
standards have been periodically released to improve the to im-
prove the system capacity and support various emerging appli-
cations. A notable change in the recent releases resides in the
sidelink channels for device-to-device (D2D) communications,
which were specified initially in 3GPP LTE Release 12 for prox-
imity services including public safety [1], [2], and have been
enhanced for vehicular-to-everything (V2X) services [3], [4].
The sidelink channels utilizing an uplink spectrum are
based on single-carrier frequency division multiple access (SC-
FDMA) waveforms adopted for the uplink channels. However,
Manuscript received April 18, 2018; approved for publication by Riccardo De
Gaudenzi, Division I Editor, December 4, 2018.
This work was supported by the National Research Foundation of Ko-
rea (NRF) grant funded by the Korea government under Grant NRF-
2018R1D1A1B07045515.
J. Yoon, C. Lee, and Y. H. Kim are with the Department of Electronic En-
gineering, Kyung Hee University, Yongin, Korea, e-mail: {jooheumy, lee1007,
yheekim}@khu.ac.kr.
Y. H. Kim is the corresponding author.
Digital Object identifer: 10.1109/JCN.2019.000001
1229-2370/19/$10.00 
c 2019 KICS
Creative Commons Attribution-NonCommercial (CC BY-NC).
This is an Open Access article distributed under the terms of Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/3.0)
which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided that the original work is properly cited.
1
unlike the uplink, the sidelink provides synchronization signals
(SSs) for one user equipment (UE) to communicate with another
UE directly without any intervention of the network. There are
two types of SS in the sidelink, namely, a primary sidelink SS
(PSSS) and a secondary sidelink SS (SSSS), which are similar
to the primary SS (PSS) and secondary SS (SSS) in the down-
link [4]. The PSSS and SSSS transmitted by a synchronization
source UE are exploited by neighboring UEs, allowing them to
acquire the carrier frequency offset (CFO), subframe and sym-
bol timings, and sidelink identity of the source UE, whereas the
PSS and SSS transmitted by a base station (BS) are exploited by
the UEs to acquire the CFO, frame and symbol timings, and cell
identity of the BS. The sidelink identity is determined by com-
bining the set information (SI) transmitted in the PSSS and the
sidelink ID transmitted in the SSSS, similar to the cell ID ob-
tained by the sector ID transmitted in the PSS and the cell group
ID transmitted in the SSS in the downlink. The SI embedded in
the PSSS indicates whether the transmitting UE is inside or out-
side of the network coverage. Although the sidelink SSs have
roles similar to the downlink SSs, their transmission strategies
are different for synchronization in a bursty sidelink channel in
contrast to that in a continuous downlink channel. Specifically,
the PSSS is transmitted twice in a synchronization subframe,
as is the SSSS for quick synchronization, as demanded by the
bursty sidelink channels [5].
Studies on LTE synchronization have mainly been performed
conducted for an initial cell search in the downlink [6]–[11],
which is in general accomplished using three steps for practi-
cal implementation. The first step estimates the coarse symbol
timing and the fractional part of the CFO (FFO) using the pe-
riodicity of the cyclic prefix (CP) in the orthogonal frequency
division multiplexing (OFDM) symbols [12]. The second step
recovers the sector ID and the integral part of the CFO (IFO), in
addition to the subframe timing, by detecting the PSS [7]–[10].
The third step identifies the cell ID group and the frame bound-
ary by detecting the SSS [11]. Here, more attention is given to
the second step because the performance during this step influ-
ences the performance of the third step.
Unlike with downlink synchronization, to the best of the au-
thor’s knowledge, few studies on sidelink synchronization have
been conducted [13], [14]. In [13], the PSSS timing and SI are
jointly detected by correlating the received signal samples with
all candidate sequences, which requires high complexity for
a cross-correlation because the PSSS and SSSS are not trans-
mitted as frequently as the PSS and SSS; the PSSS and SSSS
are sent at the period of 40 ms, whereas the PSS and SSS are
sent during a period of 5 ms. In [14], the authors introduced to
2 JOURNAL OF COMMUNICATIONS AND NETWORKS, VOL. 21, NO. 1, FEBURARY 2019
the sidelink a pragmatic three-step synchronization process em-
ployed in the downlink with some necessary modifications for
the sidelink SSs; the first step obtains the PSSS symbol timing
and the FFO by applying the well-known autocorrelation ap-
proach to the two PSSS symbols adopted for bursty packet trans-
missions [15], the second step acquires the SI and IFO with the
two PSSS symbols by applying the maximum likelihood (ML)
detection in the frequency domain [16], and the third step detects
the UE sidelink identity from the two SSSS symbols, although
this step is not covered herein because it can be readily obtained
using the SSS detection method in [11].
The present paper aims at a reliable and efficient recovery of
the SI and CFO during the second step of sidelink synchroniza-
tion after the PSSS timing and FFO are estimated during the first
step. Similar problems regarding the IFO recovery in general
OFDM systems [16]–[20] and the recovery of the sector ID and
IFO in an LTE downlink [8]–[10] have been addressed. How-
ever, in these studies, detection metrics were devised for cases in
which the CFO remaining after FFO compensation is a multiple
integer of the subcarrier spacing, called IFO, through the use of
an FFO estimation method whose estimation range is given in
a multiple integer of the subcarrier spacing. For instance, such
FFO estimation methods utilize a preamble with identical sub-
parts [16]–[20] or the CP of the OFDM symbols [8]–[10]. In
addition, the metrics developed in [8]–[10], [16]–[20] assume
perfect FFO estimation. However, the CFO remaining after the
FFO estimation during the sidelink synchronization is not a mul-
tiple integer of the subcarrier spacing when estimating the FFO
with two identical PSSS symbols [14]. In this case, the remain-
ing CFO incurs inter-carrier interference (ICI), unlike the IFO,
and cannot be found well by searching for a subcarrier index
shift in the received signal used for IFO detection [10], [16],
[17]. Furthermore, the FFO estimation in the first step is not per-
fect, significantly degrading the detection performance of the SI
and uncompensated CFO during the second step.
In this context, we first generalize the expression of the CFO
based on the quantized value (QFO) and residue (RFO) after
being quantized based on the step size of the CFO estimation
range of the first step; the QFO and RFO are equivalent to the
IFO and FFO when the CFO estimation range of the first step is
a multiple integer of the subcarrier spacing. We then formulate
the detection problem of the SI and QFO from the two PSSS
symbols observed by following an ML approach with an un-
known RFO error and unknown multi-path fading channel. To
cope with unknown multi-path fading, we apply the ML channel
estimation approach adopted in [10], [16], [19], which is more
robust than the differential correlation of the received symbols
over the adjacent subcarriers [8], [9], [17], [18], [20].
The contributions of this paper as compared with existing
studies can be summarized as follows.
• We obtain the detection metrics for the SI and QFO by ex-
tending the channel impulse response (CIR) estimation in the
time domain [19] for the two PSSS symbols by taking into
account the unknown CIR length and non-zero RFO error en-
countered under practical scenarios.
• To lower the computational complexity, we propose a metric
computation in the frequency domain that exploits the signal
space of the PSSS symbol matrix for a rank reduction. Our
approach differs from the metrics developed in the frequency
domain for IFO detection without a rank reduction [16], and
and with a rank reduction by exploiting the channel frequency
response (CFR) [10].
• The detection performance of the metrics is analyzed in
multi-path fading channels under a perfect RFO estimation.
The performance behaviors can be readily estimated for vari-
ous multi-path intensity profiles with the known and unknown
channel delay times and for the different transmit sequences
embedded in the PSSS symbol.
The remainder of this paper is organized as follows. Section II
describes the 3GPP LTE sidelink SSs and the signal model for
the detection problem. Section III provides two types of metrics
for joint detection of the SI and QFO according to the time-
domain CIR estimation methods. The low-complexity imple-
mentation methods used for the proposed metrics are presented
in Section IV based on a complexity analysis. Section V de-
rives the distribution of the metrics under a perfect RFO estima-
tion, by which the average detection error probability in general
multi-path fading channels is analyzed. The performance based
on the analysis and simulation results is evaluated in Section VI.
Finally, we provide some concluding remarks in Section VII.
Notation: The operations (·)∗ , (·)T , (·)H , and tr(·) repre-
sent a complex conjugation, transposition, Hermitian transposi-
tion, and trace, respectively. We use 0N for an all-zero vector
of length N , I N for the N × N identity matrix, diag(a) for
the diagonal matrix with the components of vector a along the
diagonal, and [A]n,m is the (n, m)th element of matrix A. In
addition, E[·] denotes the expectation, Pr[·] denotes the proba-
bility of an event, and ∼ signifies “distributed as”. To denote the
distribution, we use CN(μ, R) for a complex Gaussian vector
with mean vector μ and covariance matrix R, and χ2ν (θ) for a
chi-square random variable with ν degrees of freedom and non-
centrality parameter θ.
II. SIGNAL MODEL
Consider sidelink channels of a 3GPP LTE system for D2D
communication, which are designed using SC-FDMA wave-
forms for transmission over the uplink spectrum. A UE acting as
a synchronization source transmits synchronization subframes
over the sidelink every ms or when required such that its neigh-
boring UEs can be synchronized to the UE for D2D commu-
nication. Fig. 1 shows a subframe configured for sidelink syn-
chronization in the LTE system under a normal CP operation. In
a sidelink synchronization subframe, a maximum of NSS sub-
carriers around the center frequency are utilized for synchro-
nization and signalling, whereas the other subcarriers are not
allowed to be used for any purpose whatsoever [4]. The PSSS
and SSSS symbols constructed using Nd subcarriers are trans-
mitted twice within the same subframe for a quick acquisition
of the timing and frequency information, as well as the sidelink
identifier.
The PSSS symbols carry the set information (SI) i ∈ IS =
{1, 2} of the sidelink identifer by delivering one of the two se-
quences {di (0), di (1), · · ·, di (Nd − 1)}2i=1 within the frequency
domain. The sequences are designed using Zadoff-Chu (ZC)
YOON et al.: RECOVERY OF CARRIER FREQUENCY OFFSET AND SET INFORMATION... 3

Synchronization subframe (1 ms) for m = 1, 2 and n = 0, 1, · · ·, N − 1, where φm =

2πmfo Tsym , xi (n) is the time-domain PSSS sequence, and
wm (n) ∼ CN(0, σ 2 ) is the additive white Gaussian noise
(AWGN). Specifically, the time-domain PSSS sequence subject
ܰௌௌ

ܰௗ

to E[|xi (n)|2 ] = P is given by

0 1 2 3 4 5 6 7 8 9 10 11 12 13

 Nd
/2−1
PSSS SSSS P Nd j 2πnk
xi (n) = Nd di (k + 2 )e
N . (6)
k=−Nd /2
Fig. 1. Sidelink synchronization subframe of 3GPP LTE.
For a concise expression, let F N denote the N × N nor-
malized FFT matrix with [F N ]k,n = √1N e−j2π N satisfying
kn
sequences of length 63 as [4]
 FHN F N = I N for the IFFT matrix F N . The sequence vector is
ui k(k+1) H
e−jπ 63 , k = 0, 1, · · ·, Nd /2 − 1,
di (k) = ui (k+1)(k+2) (1) then expressed as
e−jπ 63 , k = Nd /2, · · ·, Nd − 1,
where ui is the root index, which is chosen as u1 = 26 and xi = [xi (0), xi (1), · · ·, xi (N − 1)]T = F H
N Xi , (7)
u2 = 37. A UE within the network coverage transmits PSSS
where
 Xi = [Xi (0), Xi (1), · · ·, Xi (N − 1)]T , with Xi (k) =
symbols with u1 = 26 for the SI i = 1 and a UE outside of the
Nd di ((k + 2 )N ) for k = 0, 1, · · ·, Nd /2 − 1, and N −
PN Nd
network coverage transmits PSSS symbols with u2 = 37 for the
SI i = 2. For an LTE system employing an N -point fast Fourier Nd /2, N − Nd /2 + 1, · · ·, N − 1, and Xi (k) = 0, otherwise.
transform (FFT), and for the sampling time Ts , the continuous Here, (n)D is the modulo operation producing the remainder of
time baseband signal model for the two PSSS symbols can be n+kD divided by D with a choice of positive integer k to make
written as [4] the dividend n + kD positive.
N
d −1
By arranging (5) into the vector y m = [ym (0), ym (1), · · ·,
Nd j2π (k+ 12 )Δf (t−TCP −mTsym )
s(t) = di (k + 2 )e (2) ym (N − 1)]T , we have the following:
k=−Nd /2
2πmo
for mTsym ≤ t < (m + 1)Tsym and m = 1, 2. Here, y m = ej R Go X i h + wm , m = 1, 2, (8)
Δf = 1/(N Ts ) is the subcarrier spacing, TCP = NCP Ts is
the CP duration of the PSSS symbol with NCP samples for the where o = fo N Ts is the CFO  normalized by the sub-
2πν(N −1)
j 2πν
CP, and Tsym = (N + NCP )Ts is the PSSS symbol duration. carrier spacing; Gν = diag 1, e N , · · ·, e j N ,
The sidelink synchronization subframe is converted into a radio X i is the N × Lp matrix whose columns are the cyclic
frequency signal by mixing with a carrier for transmission. shifts of xi based on the channel delay times, and wm =
A receiving UE converts the received sidelink signal into a [wm (0), wm (1), · · ·, wm (N − 1)]T ∼ CN(0N , σ 2 I N ) is the
baseband signal using its local oscillator and then samples the AWGN vector of the mth PSSS. Specifically, the lth column
baseband signal at the sampling time Ts for signal processing. of X i is given by [xi ((−nl )N ), xi ((1 − nl )N ), · · ·, xi ((N − 1 −
We assume that the receiving UE has obtained the starting time nl )N )]T .
of the PSSS symbols, which can be obtained by searching the This paper expresses the normalized CFO as
two identical PSSS symbols using the autocorrelation method
described in [15]. The channel impulse response (CIR) experi- o = (q + ε)R, (9)
enced by the two PSSS symbols is modeled as
Lp −1
where ε ∈ (−1/2, 1/2) and q ∈ IQ = {−Q, −Q + 1, · · ·, Q}
 for a nonnegative integer Q. The autocorrelation of the two re-
hCIR (n) = h(l)δ(n − nl ), (3)
ceived PSSS symbols provides an ML estimate of ε as [21]
l=0

where Lp is the number of resolvable multi-paths, h(l) is the 1

H 
ε̂ = ∠ y1 y2 . (10)
complex fading amplitude of the l-th multi-path at the delay time 2π
nl Ts , and δ(n) is the Kronecker-delta function with δ(n) = 1
The values qR and εR are similar to IFO and FFO in the liter-
if n = 0, and δ(n) = 0 otherwise. Under the assumption of
ature [10], [15]–[19], which have integer values for R using a
Rayleigh fading, the CIR vector is described by
training sequence with R ≥ 2 repetitions in the N FFT sam-
h = [h(0), h(1), · · ·, h(Lp − 1)]T ∼ CN(0Lp , Rh ), (4) ples. In this paper, R = N +NN
CP
is not an integer value, and
H
thus, qR and εR are called the quantized value of the normal-
where Rh = E[hh ] is the channel correlation matrix subject ized CFO (QFO) and the residue of the normalized CFO after
to tr(Rh ) = 1. quantization (RFO), respectively, owing to their resemblance to
After CP removal, the nth sample of the mth received PSSS the quantization model employing the step size R.
symbol suffering from the CFO fo can be written as After compensating the RFO with its estimate ε̂R in the re-
Lp −1
 ceived signal as z m = e−j2πmε̂ GHε̂R y m , we have
ym (n) = e jφm j2πfo nTs
e h(l)xi (n − nl ) + wm (n) (5)
l=0 z m = ej2πξm Ωq+ξ X i h + v m (11)
4 JOURNAL OF COMMUNICATIONS AND NETWORKS, VOL. 21, NO. 1, FEBURARY 2019

L −1
for m = 1, 2, where ξ = ε − ε̂ is the RFO error, v m = by considering the unknown delay times {nl }l=0 p
. For un-
e−j2πmε̂ GH 2
ε̂R w m ∼ CN(0N , σ I N ), and known delay times, we first rewrite the log-likelihood function
  (17) as
2πνR 2πνR(N −1)
Ων = GνR = diag 1, ej N , · · ·, ej N . (12) 2 
 2
 
Ψ(i, q, h̃, ξ) = − z m − ej2πξm Ωq+ξ X̃ i h̃ , (18)
To capture the effect of QFO qR and RFO error ξ, we trans- m=1
form (11) into the frequency domain as
where X̃ i is the N × L̃ matrix extension X i and h̃ is the
Zm = F N z m = ej2πξm Ξq+ξ diag(H)diag(Xi ) + Vm , (13) L̃ × 1 vector extension h for L̃ ≥ Lp . If the delay times of
the CIR are perfectly known, we have X̃ i = X i and h̃ = h.
where Ξν = F N Ων F H N , H = F N h, and Vm = F N v m ; In If only the maximum delay time Lmax = nLp −1 is known and
addition, diag(H)diag(Xi ) = F N X i h is obtained from the Lmax < NCP , we may set L̃ = Lmax and construct X̃ i using
property of the circulant matrix X i . In detail, the kth element the cyclic shifts of xi from 0 to Lmax −1. If there is no informa-
of (13) is given by tion on the delay times, which is more likely to occur during the
initial synchronization step, we may set L̃ = NCP and construct
N −1
1  X̃ i using the cyclic shifts of xi from 0 to NCP − 1, remember-
Zm (k) = e j2πξm
√ [Ξq+ξ ]k,l H(l)Xi (l) + Vm (k) (14)
N l=0 ing that the LTE system was designed to cope with a multi-path
delay spreading up to the CP length.
with
A. Detection with Common CIR Estimation (CCE)
π(N −1)(l−k+νR)
e j N sin(π(l − k + νR)) In this subsection, we estimate the CIR h̃ common to
[Ξν ]k,l = π . (15)
N sin N (l − k + νR) {z m }2m=1 by assuming ξ is known. The ML solutions of h̃ that
maximize the metric Ψ(i, q, h̃, ξ) in (18) are equivalent to the
For the case of IFO detection with a perfect FFO estimation (R least squares solutions that minimize the metric, −Ψ(i, q, h̃, ξ).
being integral and ξ = 0), (14) becomes a circularly shifted The ML estimate with the minimal norm is given by [22]
version as
2
ˆ 1 †
Zm (k) = H((k − qR)N )Xi ((k − qR)N ) + Vm (k), (16) h̃ = X̃ i ΩH
q+ξ e−j2πξm z m , (19)
2 m=1

which enables a low-complexity detection of the SI i and IFO q

where A† is the Moore–Penrose inverse of the matrix A [23]1 .
in the frequency domain, as developed in [10], [16]. †
This paper considers a more general scenario of R < 1 and For any X̃ i , we can obtain X̃ i through singular value decom-
H † † H
ξ ∈ (−1, 1) in which the frequency-domain signal (14) suffers position (SVD) X̃ i = Ũ i Σ̃i Ṽ i of X̃ i as X̃ i = Ṽ i Σ̃i Ũ i ,
from the signal leakage into the unused subcarriers causing the where Ũ i and Ṽ i are the N × N and L̃ × L̃ unitary matrices,
ICI. For this scenario, the SI i and QFO q are detected using the respectively, Σ̃i is the N × L̃ rectangular diagonal matrix with
†
metrics developed from the time-domain signals (11) to effec- the singular values on the diagonal, and Σ̃i is the L̃ × N rectan-
tively combine the signals leaked into the adjacent subcarriers. †
gular diagonal matrix with [Σ̃i ]m,m = 1/[Σ̃i ]m,m for nonzero
†
[Σ̃i ]m,m , and [Σ̃i ]m,m = 0 otherwise.
III. DETECTION OF SI AND QFO With the channel estimate (19) common to two received sym-
bols, {z m }2m=1 , the metric (18) becomes
To obtain the SI and QFO from (11), we set up a multi-
ple composite hypothesis testing problem using the hypotheses ΨC (i, q, ξ) = (z 1 + e−j2πξ z 2 )H
{H(i,q) }(i,q)∈IS ×IQ on the SI and QFO with unknown param- −j2πξ
·Ωq+ξ P X̃ i ΩH
q+ξ (z 1 + e z2) (20)
eters h and ξ. This section derives the detection metrics for the
problem based on the ML criterion with different strategies in after the irrelevant factors were removed. We may set ξ = 0
handling the unknown parameters h and ξ. For this purpose, we in the metric (20) by assuming the perfect RFO estimation to
provide the log-likelihood function of the parameters (i, q) and obtain
(h, ξ) for the observed data {z m }2m=1 as
M0 (i, q) = ΨC (i, q, 0) = z H
+ P B i,q z + , (21)
2
  
Ψ(i, q, h, ξ) = − z m − ej2πξm Ωq+ξ X i h2 (17)
where z + = z 1 + z 2 , P A = AA† is the orthogonal projection
m=1
of the matrix A, and B̃ i,q = Ωq X̃ i . It is worth noting that the
after removing the constants and irrelevant factors. The gener- 1 The ML (least squares) solutions are not unique if X̃ is rank deficient.
i
alized ML approach should obtain ĥ and ξˆ for h and ξ, where However, all of these solutions provide the identical maximum value for
the ML estimate ξˆ is not given in a closed form. ˆ
Ψ(i, q, h̃, ξ), which is the metric computed for the proposed detection meth-
In this paper, we estimate the CIR h in different ways under ods. It is thus sufficient to provide the minimal norm solution for the derivation
ˆ
different assumptions regarding ξ in the following subsections of Ψ(i, q, h̃, ξ).
YOON et al.: RECOVERY OF CARRIER FREQUENCY OFFSET AND SET INFORMATION... 5

metric (21) is equivalent to the Lu metric proposed in [19] if z + in Subsection III.A to (27) as
is replaced with a single PSSS symbol z 1 and B̃ i,q is replaced 1
with B i,q = Gq X i for the known delay times and the IFO M̆I (i, q) = j=−1 ΨI (i, q, 0.5j) (28)
detection in (21). In the following, (21) is called the extended 
2 1
Lu scheme. = zH
m j=−1 P B̃ i,q+0.5j z m ,
m=1
To handle the unknown ξ occurring in (−1, 1), we propose
the detection metric by adding the metric (20) for the three rep- although no significant improvement is shown compared to (27)
resentative values of ξ as despite the tripled complexity.
1

MC (i, q) = ΨC (i, q, 0.5j). (22) IV. IMPLEMENTATION WITH REDUCED COMPLEXITY
j=−1
The proposed metrics consist of similar components in a
The metric (22) guarantees a robust detection of the SI and quadratic form, resulting in a high complexity for direct compu-
QFO for the RFO error ξ ∈ (−0.5, 0.5) by making the met- tations. Specifically, the quadratic from z H m P B̃ i,q z m requires
ric MC (io , qo ) for the correct value (io , qo ) remain at maximum 4(N + 1)N real multiplications per hypothesis using the pre-
even with the RFO error; as an example, when ξ increases from computed matrix P B̃ i,q for all (i, q) ∈ IS × IQ . Therefore,
0 to 0.5, ΨC (io , qo , 0) becomes smaller whereas ΨC (io , qo , 0.5) the complexity of MC (i, q) in (23) and MI (i, q) in (27) obtained
becomes larger, making MC (io , qo ) remain at the maximum. It through a direct computation using the pre-computed matrices is
should be mentioned that we only consider the RFO error to be given by 8(N + 1)N .
within (−0.5, 0.5) instead of its actual range (−1, 1) because the To reduce the computational complexity of the proposed met-
normalized CFO would be better estimated better if the QFO is H
rics, we first apply P X̃ i = Ũ i Ũ i to P B̃ i,ν = Ων P X̃ i ΩHν ,
detected by qo −1 if ξ ∈ (−1, −0.5) and by qo +1 if ξ ∈ (0.5, 1). H
Explicitly, the modified metric (22) with the CCE is given as where Ũ i is the N × r̃i matrix from the SVD X̃ i = Ũ i Σ̃i Ṽ i
H
of rank r̃i . Therefore, with P B̃ i,ν = Ων Ũ i Ũ i ΩH
ν , we can
MC (i, q) = z H
+ P B̃ i,q z + rewrite the metrics as
− (P B̃ i,q−0.5 + P B̃ i,q+0.5 )z − ,
+z H (23) 1 
  H  
2
MC (i, q) = W i,q+0.5j z 1 + (−1)j z 2  , (29)
where z − = z 1 − z 2 and B̃ i,q = Ωq X̃ i . j=−1
2 
 2
B. Detection using Independent CIR Estimation (ICE)  H 
MI (i, q) = W i,q z m  , (30)
This subsection estimates the CIR independently for each re- m=1
ceived symbol by taking into account the phase shift incurred by
the RFO error. For this purpose, we rewrite the metric (18) with where W i,ν = Ων Ũ i is an N × r̃i matrix. Using the pre-
h̃m = ej2πξm h̃ as computed matrix W i,ν , the number of real multiplications re-
quired for computing (29) and (30) is given by 3r̃i (4N + 2)
2 
 2
  and 2r̃i (4N + 2), respectively, because the computation of
Ψ(i, q, {h̃m }, ξ) = − z m − Ωq+ξ X̃ i h̃m  . (24)  
 H 2
m=1 W i,ν z  requires r̃i N complex multiplications and 2r̃i real
multiplications. The complexity of the metric computation with
The minimal norm ML estimate of h̃m maximizing (24) for the the eigen-decomposition of P X̃ i is reduced since r̃i ≤ L̃ and
given ξ is derived as r̃i = 14 for the PSSS matrix X̃ i with L̃ = NCP .
ˆ † To reduce the computational complexity of the proposed met-
h̃m = X̃ i ΩH
q+ξ z m , m = 1, 2 (25) rics further, we compute the metrics within the frequency do-
main by applying the FFT to z m and W i,ν . The quadratic form
through which the metric (24) can be rewritten as
is then equivalent to
2
  2  2
 H 
zH
m Ωq+ξ P X̃ i Ωq+ξ z m W i,q z m  = WH 
H
i,q Zm ,
ΨI (i, q, ξ) = (26) (31)
m=1

after removing the irrelevant factors during detection. Unlike where Wi,ν = F N W i,ν .
the approach proposed in Section III.A, we set ξ = 0 in (25) to By taking into account the fact that the PSSS symbols are
obtain the proposed ICE metric constructed with Nd subcarriers and the CFO shifts the received
signal over several subcarriers, we compute the metric (31) over
2
 the NSS subcarriers of the synchronization subframe as
MI (i, q) = ΨI (i, q, 0) = zH
m P B̃ i,q z m (27)  2
m=1  NSS −1 
i −1 
r̃ 
 H   
2
Wi,q Zm 2 = ∗ 
because the dominant effect of the nonzero RFO error is re-  [Wi,q ](k)N ,l Zm ((k)N ) . (32)
 
solved through the ICE; we may apply the approach described l=0 k=− NSS
2

6 JOURNAL OF COMMUNICATIONS AND NETWORKS, VOL. 21, NO. 1, FEBURARY 2019

Table 1. Computational complexity per hypothesis.

channels and provides guidelines regarding the sequence design.
Real multiplications
Schemes The distribution of metrics is analyzed for both correct and in-
Time domain Frequency domain
correct detections, and the average DEP of the metrics then fol-
Proposed CCE 3r̃i (4N + 2) 3r̃i (4NSS + 2) lows.
Propose ICE 2r̃i (4N + 2) 2r̃i (4NSS + 2)
Lu [19] 4L̃N · A. Distribution of Metrics
Morelli [10], [16] · V (8NSS + 2) Assume that Ho = H(io ,qo ) is true for the analysis of the
metrics. The received PSSS symbols conditioned on the CIR h
are then modeled as
Similarly, the metrics (29) and (30) are computed in the fre-
quency domain as z m ∼ CN(B io ,qo h, σ 2 I N ), m = 1, 2 (35)
 with B i,q = Ωq X i , which results in
 i −1 
1 r̃ 
NSS /2−1

MfC (i, q) =  [Wi,q+0.5j ]∗(k)N ,l
 z + ∼ CN(2B io ,qo h, 2σ 2 I N ). (36)
j=−1 l=0 k=−NSS /2
2

  It is worth noting that B i,q in (35) and (36) differs from B̃ i,q in
· Z1 ((k)N ) + (−1) Z2 ((k)N )  ,
j
(33)
 that the former is related to the PSSS matrix X i embedded in
the received signal, and the latter is related to the PSSS matrix
and X̃ i employed for the metric computation. In the derivation of
 2 the distribution of the metrics, the following lemmas are applied.
 NSS −1  Lemma 1: [24] The quadratic form of the complex Gaussian
i −1 
2 r̃
 
 
2
∗  random vector y ∼ CN(μ, σ 2 I N ) with the symmetric idempo-
MfI (i, q) =  [Wi,q ](k)N ,l Zm ((k)N ) . (34)
  tent matrix P of rank r has a chi-square distribution as
m=1 l=0 k=− NSS
2

 H 
yH P y 2μ P μ
The proposed approach differs from a rank-reduction method ∼ χ2r . (37)
of [10] in that the former reduces the rank of the PSSS σ 2 /2 σ2
matrix X̃ i whereas the latter reduces the rank of the CFR Lemma 2: [25] For the independent chi-square random vari-
Nd /2
{H((k)N )}k=−N d /2
. ables ym ∼ χνm (θm ) for m = 1, 2, the sum y1 + y2 is also
The computational complexity is summarized in Table 1 in chi-square distributed as
terms of the number of real multiplications per hypothesis; a
multiplication is of higher complexity than an addition. We con- y1 + y2 ∼ χ2ν1 +ν2 (θ1 + θ2 ). (38)
sider both cases of metrics computed in the time and frequency
domains, where the frequency domain computation addition- The metric M0 (i, q) in (21) is a quadratic form of the complex
ally requires two FFT operations to transform the received PSSS Gaussian random vector z + with the idempotent matrix P B̃ i,q ,
symbols. For reference, we also provide the complexity of the which becomes the chi-square random variable from Lemma 1.
Lu scheme computing the metric in the time domain [19] and Specifically, we have
that of the Morelli schemes computing the metric in the fre-
quency domain [10], [16] using two PSSS symbols, namely, M0 (i, q) ∼ σ 2 χ22r̃i (θi,q|Ho ), (39)
V = L̃ for the Morelli scheme without a rank reduction [16]
where the degrees of freedom of the chi-square distribution are
and V ≤ min(Nd , L̃), which is the number of orthogonal vec-
determined by the rank of P B̃ i,q , or equivalently the rank r̃i of
tors used for the CFR estimation in the Morelli scheme with-
out a rank reduction (Morelli-RR) [10]. The proposed metrics X̃ i , and the non-centrality parameter is given by
computed in the time domain with a reduced rank have a lower
complexity than the Lu scheme because r̃i = 14 for the PSSS 4hH B H
io ,qo P B̃ i,q B io ,qo h
θi,q|Ho =
symbol matrix X̃ i . In addition, the complexity of the proposed σ2
H
metrics computed in the frequency domain is comparable to that 4h XH
io Ωqo −q P X̃ i Ωqo −q X io h
H

of the Morelli schemes for L̃ = NCP and NSS = 76. = . (40)

σ2
Meanwhile, the distribution of the metric MI (i, q) in (27) is also
V. PERFORMANCE ANALYSIS WITH PERFECT RFO identified as
ESTIMATION
In this section, we analyze the detection error probability σ2 2
MI (i, q) ∼ χ (θi,q|Ho ) (41)
(DEP) of the SI and QFO in an ideal case of perfect RFO es- 2 4r̃i
timation for the extended Lu metric M0 (i, q) and proposed ICE from Lemma 2 because the summands are distributed as
metric MI (i, q), where the DEP of the extended Lu metric pro-  
vides a lower bound on the proposed CCE metric MC (i, q). This σ2 2 θi,q|Ho
z m P B̃ i,q z m ∼
H
χ , m = 1, 2, (42)
analysis identifies the asymptotic behaviors in multi-path fading 2 2r̃i 2
YOON et al.: RECOVERY OF CARRIER FREQUENCY OFFSET AND SET INFORMATION... 7

which are independent. Furthermore, the non-centrality param- B. Average Detection Error Probability (DEP)
eter (40) is given by θio ,qo |Ho = 4γio with
With the distribution of the metrics obtained thus far, we an-
alyze the average DEP of the metrics M0 (i, q) and MI (i, q) in a
hH X H
io X io h common framework where Ho is true. For a concise exposition,
γ io = (43)
σ2 we use the notation M for the equations corresponding to both
metrics M0 and MI .
for a correct metric with (i, q) = (io , qo ). For an incorrect Let us first consider the probability Pe|Ho ,h (i, q) of an error
metric with (i, q) = (io , qo ), we assume θi,q|Ho ≈ 0 from event in which (i, q) = (io , qo ) is detected using the metric
XH io Ωqo −q P X̃ i Ωqo −q ≈ 0 owing to a low auto-correlation
H
M(i, q) for the given CIR h as
property of the PSSS sequence for a non-zero time difference.
Based on this analysis, we can summarize the distribution of Pe|Ho ,h (i, q) = Pr [M(io , qo ) ≤ M(i, q)|Ho , h] . (50)
the metrics as
 By employing the distributions (44) and (45) of the metrics, (50)
σ 2 χ22r̃i (4γio ), (i, q) = (io , qo ), can be expressed in a common form as
M0 (i, q) ∼ (44)
σ 2 χ22r̃i (0), (i, q) = (io , qo ),  
Pe|Ho ,h (i, q) = Pr χ2αM r̃i (4γio ) < χ2αM r̃i (0) , (51)
and where αM is a constant determined based on the metric em-
 ployed as αM0 = 2 and αMI = 4. Because the ratio of the
σ 2 χ24r̃i (4γio ), (i, q) = (io , qo ), two independent chi-square random variables χ2αM r̃i (4γio ) and
MI (i, q) ∼ (45)
σ 2 χ24r̃i (0), (i, q) = (io , qo ). χ2αM r̃i (0) has an F -distribution [28], we can express (51) as

The parameter γio can be regarded as the sum of the signal- Pe|Ho ,h (i, q) = FαM r̃i ,αM r̃i (1; 4γio ), (52)
to-noise power ratio (SNR) for a single PSSS symbol condi-
tioned on the CIR h. Here, the distribution of γio can be iden- where Fν1 ,ν2 (x; θ) is the cumulative distribution function of the
tified by applying the transform in [26] to (43) because γio singly non-central F -distribution with ν1 and ν2 degrees of free-
is a quadratic form of the complex Gaussian random vector dom and non-centrality parameters θ and 0. By using the ex-
h ∼ CN(0Lp , Rh ). Specifically, γio can be expressed as plicit expression of Fν1 ,ν2 (x; θ) given in [28], we have
∞

γio = uH e−2γio (2γio )k
w diag(γ̄ io )uw , (46) Pe|Ho ,h (i, q) = I 12 (αM r̃i + k, αM r̃i ) , (53)
k!
k=0
where γ̄ io = [γ̄io ,0 , γ̄io ,1 , · · ·, γ̄io ,Leio −1 ]T is the vector of the
non-zero eigenvalues of matrix where Ix (a, b) is the regularized incomplete beta function de-
fined by
1 12 H 1
 x
Γ io = 2
Rh X io X io Rh2 (47) 1
σ Ix (a, b) = ta−1 (1 − t)b−1 dt (54)
B(a, b) 0
with rank Leio and uw ∼ CN(0Leio , I Leio ). Note that the average
1
SNR γ̄io = E[γio ] in one PSSS symbol is given by for a, b > 0 with B(a, b) = 0 ta−1 (1 − t)b−1 dt.
The average probability of an error event is then obtained by
1  H NP
taking the expectation of (53) with respect to h, or equivalently
γ̄io = tr X X i R h ≤ 2 (48)
σ2 io o
σ with respect to γio , as

because E[γio ] = tr(diag(γ̄ io )) = tr(Γio ), tr(AB) = ∞


tr(BA), tr(AB) ≤ tr(A)tr(B), tr(X H Pe|Ho (i, q) = βk (γ̄ io )I 12 (αM r̃i + k, αM r̃i ) , (55)
io X io ) = N P , and
tr(Rh ) = 1. k=0

From (46), γio can be seen as the sum of Leio independent  

e−2γio (2γio )k
exponential random variables whose expected values are given where βk (γ̄ io ) = Eγio k! is obtained through the
Leio −1 distribution of γio given in (49). Here, the function βk (γ̄) can
by {γ̄io ,l }l=0 . The probability density function (pdf) of γio
for certain special cases can be expressed as [27] be defined using the vector γ̄ = [γ̄0 , γ̄1 , · · ·, γ̄L−1 ]T of positive
entries as
⎧ e
⎪ Lio −1
 ⎧L−1
⎪
⎪ 1 − 1 x
 e γ̄io ,l , x ≥ 0, ⎪ 
⎪
⎪  ⎪
⎪ 
1  1 
k,
⎪
⎪ l=0 γ̄io ,l 1− γ̄
γ̄i ,j
o ⎪
⎪
γ̄
1− γ̄j
l=0 2γ̄l
1
⎪
⎨ j=l io ,l ⎪
⎪
1+ 2γ̄
⎨ j=l l l

pγio (x) = if γ̄ io ,l 
= γ̄ io ,j for ∀l = j (49) if γ̄l = γ̄j for ∀l = j
⎪ βk (γ̄) = (56)
⎪
⎪ 1 L e − 1 x
x ≥ 0, ⎪
⎪ k+L−1 CL−1
⎪
⎪ Le x io e γ̄io ,l ,
⎪
⎪  k+L−1 ,
⎪
⎪ γ̄ioi,lo (Leio −1)! ⎪
⎪ (2γ̄l )L 1+ 2γ̄1
⎪
⎩ ⎪
⎩ l
if γ̄io ,0 = γ̄io ,1 · · · = γ̄io ,Leio −1 . if γ̄0 = γ̄1 = · · · = γ̄L−1 .
8 JOURNAL OF COMMUNICATIONS AND NETWORKS, VOL. 21, NO. 1, FEBURARY 2019

n!
where n Ck = k!(n−k)! . Finally, the average DEP when Ho is 10 0 10 0

true is approximated by applying a union bound as Anal Anal

Simul Simul
Lu (unknown) ICE (unknown)
 
Q Lu (known) ICE (known)
PE,SI|Ho ≤ Pe|Ho (i, q) (57) 10 -1 10 -1

i=io q=−Q

for SI detection and 10 -2 10 -2

P E,QFO
 2

PE,QF O|Ho ≤ Pe|Ho (i, q) (58)
q=qo i=1 10 -3 10 -3

for QFO detection.

To obtain a simpler expression for the average DEP, we fur-
ther assume that X H i X i is invariant for i ∈ IS because the 10 -4 10 -4

PSSS sequences constructed using the ZC sequences exhibit

-15 -10 -5 0 -15 -10 -5 0
similar autocorrelation functions. We can then rewrite the pa- SNR (dB) SNR [dB]
rameters related to X H i X i as ri = rX , r̃i = r̃X , Li = LX ,
e e
(a) (b)
and γ̄ i = γ̄ X , to be invariant over the SI i ∈ IS . In this case,
Pe|Ho (i, q) becomes invariant as Fig. 2. Average DEP for QFO detection without RFO errors in EVA channel
with known and unknown delay times: Metrics with (a) CCE and (b) ICE.
∞

Pe|Ho (i, q) = Pe = βk (γ̄ X )I 12 (αM r̃X + k, αM r̃X ) (59)
k=0 VI. PERFORMANCE EVALUATION
for all (i, q) = (io , qo ). For equally likely hypotheses, the aver- The recovery performance of the SI and CFO is evaluated us-
age DEP is then expressed as ing the system parameters designed for the LTE system with a
10 MHz bandwidth and normal CP operation. The sampling fre-
PE,SI = PE,SI|Ho ≈ (2Q + 1)Pe , (60) quency is fs = 15.36 MHz, the FFT size is N = 1024, and the
PE,QF O = PE,QF O|Ho ≈ 4QPe . (61) CP length is NCP = 72. For the multi-path fading model, we
adopt the extended vehicular A (EVA), extended pedestrian A
Remark: If the fading gains in the CIR are independent of
(EPA), and flat fading channel models [9]; although the EVA and
Rh = diag([ρ0 , ρ1 , · · ·, ρLp −1 ]), the rank of (47) is given by
EPA channels in a continuous time consist of 9 and 7 delay com-
LeX = min(Lp , rX ) (62) ponents, respectively, they are modeled as Lp = 8 and Lp = 5
delay components in a discrete time with the sampling fre-
and the average SNR γ̄io in (48) attains the maximum value of quency. The true SI io is generated randomly from IS = {1, 2}.
Lp −1 For QFO detection when the true normalized CFO is o = 1.20,
PN  PN we set Q = 2 to have IQ = {−2, −1, 0, 1, 2} which offers
γ̄ = 2
ρl = 2 (63)
σ
l=0
σ a CFO estimation range of |fo | < 35.97 kHz. When the true
normalized CFO is o = 3.40, we set Q = 5 to provide a CFO
owing to the diagonal property of Rh . We further assume equal estimation range of |fo | < 76.73 kHz. For the performance with
entries γ̄X,l = Lγ̄e for γ̄ X to derive an asymptotic behavior of an RFO error, we incorporate the RFO estimation using (10).
X
the error probability in a simple form as We first compare the analysis and simulation results for the
 e LeX  ∞ average DEP without RFO errors (ξ = 0) in Figs. 2 and 3. In
LX
Pe → k+L CL I 12 (αM r̃X + k, αM r̃X ) (64) this comparison, the proposed metrics are computed in the time
γ̄→∞ 2γ̄ domain when o = 1.2 with Q = 2.
k=0

k+Le −1 CLe −1
Fig. 2 shows the average DEP for QFO detection in the EVA
with L = LeX − 1 from βk (γ̄ X ) → X X
e . The channel with the known and unknown delay times. The ex-
γ̄→∞ (2γ̄/LeX )LX
diversity order [29] of the average DEP PE,∗ in (60) and (61) is tended Lu scheme with M0 (i, q) is shown in Fig. 2(a), and the
also obtained as ICE scheme with MI (i, q) is indicated in Fig. 2(b). The figures
compare the average DEP as a function of the SNR P/σ 2 per
log PE,∗
D = − lim = min(Lp , rX ). (65) sample when L̃ = Lp for the known delay times resulting in
γ̄→∞ log γ̄
r̃i = 7 and L̃ = NCP for the unknown delay times resulting in
Therefore, the diversity order of the average DEP is given by r̃i = 14. The analytical results tend to provide upper-bounds on
LeX = min(Lp , rX ), which does not depend on the design pa- the simulation results because the analysis of the error probabil-
rameter L̃ used for the metric computation at the receiver, but in- ity is based on the computation of the union bound. Nonethe-
stead on the channel parameter Lp and the rank rX of the PSSS less, the results from the analysis provide a good estimation of
matrix X i . This also implies that the rank of the PSSS matrix the simulation results with a similar diversity order. As expected
should be sufficiently large (rX ≥ Lp ) to attain the maximum from the analysis, an SNR gain is observed with the known de-
diversity provided by the channel. lay times as compared with the unknown case, whereas the di-
versity order is the same for both cases. With a perfect RFO
YOON et al.: RECOVERY OF CARRIER FREQUENCY OFFSET AND SET INFORMATION... 9

0 100 100
10 ICE/Direct CCE/Direct
ICE/Time-RR CCE/Time-RR
ICE ICE/Freq-RR CCE/Freq-RR
Lu Lu/Direct Lu/Direct
Anal. 10-1 Lu/Time-RR 10-1 Lu/Time-RR
Simul. Lu/Freq-RR Lu/Freq-RR
-1
10
w/ RFO error
w/ RFO error
10-2 10-2

PE,SI

PE,SI
PE,SI

10-2 Flat
10-3 10-3

w/o RFO error

w/o RFO error
-3
10 10 -4
10-4

EVA EPA
10-5 10-5
10-4 -15 -10 -5 -15 -10 -5
-15 -10 -5 0 5 10 15 SNR (dB) SNR (dB)
SNR dB (a) (b)

Fig. 3. Average DEP for SI detection without RFO errors in several multi-path Fig. 4. Average DEP in the SI detection when the metrics are computed in the
fading channels with unknown delay times. time and frequency domains in the EVA channel: (a) Proposed ICE and (b)
proposed CCE.

estimation, the extended Lu scheme in the left subfigure slightly

0
outperforms the ICE scheme in the right subfigure in terms of 10
Lu
the average DEP. ICE
CCE
Fig. 3 compares the average DEP for the SI detection when 10-1
L̃ = NCP for the unknown delay times in three fading chan- Solid lines: Unknown DT
Dashed lines: Known DT
nels. The performance trend is similar to that observed in Fig. 2
except for the slopes of the curves according to the fading chan- 10-2
PE,SI

nel model. The ICE scheme provides the same slope with the
extended Lu scheme but at an SNR loss of approximately 1 dB 10-3
without RFO errors, which is expected from the performance
analysis. As the number Lp of multiple paths increases in the
-4
order of “flat,” “EPA,” and “EVA,” the slope of the average DEP 10
becomes steeper after min(Lp , r̃i ) = Lp in the figure, resulting
in a significant improvement in the performance, as expected 10
-5
from the diversity order analysis provided in (65). -14 -12 -10 -8 -6 -4
In the following, we provide the performance of the SI and
QFO detection followed by a practical RFO estimation result-
ing in RFO errors. The detection performance with RFO errors
is evaluated in terms of the DEP of the SI because the QFO can
be detected based on incorrect QFO values qo ± 1 with a large
RFO error as |ξ| > 0.5 for a better CFO estimation. The perfor-
mance of the QFO is incorporated into the performance of the
mean square error (MSE) of the estimate ˆo = (q̂ + ε̂)R on the
normalized CFO o .
Fig. 4 confirms the equivalence of the proposed metrics com-
puted in different ways by comparing the average DEP of the SI
detection in the EVA channel when Q = 2 for the normalized
CFO o = 1.2. The performance with a perfect RFO estimation
(w/o RFO error) is also included for the reference to that with
practical RFO estimation (w/ RFO error). In the figure, “Di-
rect” denotes the metrics computed directly in the time domain
using (23) and (27), “Time-RR” denotes the metrics computed
with reduced rank in the time domain using (29) and (30), and
“Freq-RR” denotes the metrics computed with reduced rank in
the frequency domain through (33) and (34). The extended Lu
metric in (21) is also computed by applying these three methods.
It was observed that three computation methods for each scheme
result in indistinguishable performances for both with and with-
SNR dB
Fig. 5. Average DEP for SI detection with RFO errors in the EVA channel
according to the knowledge on the channel delay times.
out RFO errors. Therefore, the metric computed with a reduced
rank in the frequency domain is preferable for each scheme to
lower the computational complexity. The figure also confirms
that the ICE and CCE schemes outperform the extended Lu
scheme when RFO errors exist.
Fig. 5 shows the effects of the knowledge of the channel delay
times on the average DEP of the metrics with RFO errors when
Q = 2 for the normalized CFO o = 1.2 in the EVA channel.
The performance is evaluated using the metrics computed with
a reduced rank in the frequency domain for the known (“Known
DT”) and unknown delay times (“Unknown DT”). The CCE and
ICE schemes outperform the extended Lu scheme noticeably for
both “Known DT” and “Unknown DT” with a larger gain for
the former. It was also observed that the CCE scheme exhibits
a slight gain over the ICE scheme for both cases, although the
gain is infinitesimal.
The average DEP of the proposed and conventional schemes
in terms of the SI detection is compared for three fading chan-
nels with L̃ = NCP for “Unknown DT” when Q = 2 for
10 JOURNAL OF COMMUNICATIONS AND NETWORKS, VOL. 21, NO. 1, FEBURARY 2019

-1 Morelli-RR -1 Morelli-RR
10 Morelli 10 Morelli
Lu Lu
ICE ICE
CCE CCE

10-2 10-2
PE,SI

PE,SI
Flat Flat

-3 -3
10 10

EVA EVA

-4 EPA -4 EPA
10 10

-15 -10 -5 0 5 10 15 -15 -10 -5 0 5 10 15

SNR dB SNR dB
Fig. 6. Average DEP in SI detection with RFO errors in several multi-path Fig. 7. Average DEP in SI detection with RFO errors in several multi-path
fading channels when Q = 2 and o = 1.2. fading channels when Q = 5 and o = 3.4.

CFO o = 1.2, shown in Fig. 6 and when Q = 5 for CFO 100

Morelli-RR
o = 3.4, shown in Fig. 7. The figures also include the conven- Morelli
tional Morelli [16] and Morelli-RR [10] schemes for computing 10-1 Lu
ICE
the metrics with two PSSS symbols in the frequency domain CCE
-2
without and with a rank reduction, respectively. The Morelli-RR 10
EVA
scheme with a choice of V = 5 for the CFR estimation slightly
-3 EPA
outperforms the Morelli scheme in the EPA and flat channels 10 Flat
MSE

with a small number of multiple paths by estimating V = 5

principal components instead of L̃ = 72 CIR components. Both 10-4

figures show that the proposed schemes outperform the conven-

tional schemes, where the DEP curves become steeper in order 10-5

of “flat,” “EPA,” and “EVA” as the number of multiple paths

10-6
increases.
When Q is increased from 2 in Fig. 6 to 5 in Fig. 7 affording a
10-7
larger CFO estimation range, the gain of the proposed schemes -15 -10 -5 0 5 10 15 20 25 30
over the Morelli schemes [10], [16] becomes larger because the
assumption of qR ≈ q made in the Morelli schemes causes a
larger error in the detection metrics with a larger Q. In general,
the proposed schemes are more robust to a wide range of CFO
than the conventional schemes in terms of SI detection.
Finally, the MSE E[|ˆ o − o |2 ] of the normalized CFO esti-
mate ˆo is shown in Fig. 8 when Q = 2 for CFO o = 1.2. In
a higher SNR region where the RFO estimation dominates the
MSE performance, the performances of the considered schemes
become identical. In a lower SNR region where the QFO de-
tection dominates the MSE performance, the MSE has a simi-
lar tendency as the average DEP, as shown in Fig. 6, and thus
the CCE and ICE schemes provide certain gains over the other
schemes. In summary, the ICE and CCE schemes outperform
the conventional schemes in both the SI detection and CFO es-
timation for an LTE sidelink.
VII. CONCLUSIONS
We considered the recovery of the SI and QFO for the sidelink
after the symbol timing is obtained and the RFO is estimated
using two PSSS symbols. The metrics for the SI and QFO re-
covery are derived by estimating the channels of the two PSSS
SNR dB
Fig. 8. MSE of normalized CFO estimation in several multi-path fading chan-
nels when Q = 2 and o = 1.2.
symbols in a common form (CCE) and in an independent form
(ICE) by taking into account the RFO error incurred during the
previous step and the unknown channel delay times. For the pro-
posed metrics, we presented a low-complexity implementation
method by exploiting the properties of the PSSS symbol matrix,
and analyzed the detection error probability of the metrics under
the assumption of perfect RFO estimation. The results indicate
that the proposed CCE and ICE schemes of a lower complexity
outperform the conventional schemes under realistic scenarios
with RFO errors.
REFERENCES
[1] X. Lin, J. Andrews, A. Ghosh, and R. Ratasuk, “An overview of 3GPP
device-to-device proximity services,” IEEE Commun. Mag., vol. 52, no. 4,
pp. 40–49, Apr. 2014.
[2] J. Liu, N. Kato, and J. Ma, and N. Kadowaki, “Device-to-device commu-
nication in LTE-Advanced networks: A survey,” IEEE Commun. Surveys
Tut., vol. 17, no. 4, pp. 1923–1940, 4th Quart., 2015.
[3] 3GPP TR 36.885, Study on LTE-based V2X Services, R14, v14.0.0, June
2016.
YOON et al.: RECOVERY OF CARRIER FREQUENCY OFFSET AND SET INFORMATION...
[4] 3GPP TS 36.211, Evolved Universal Terrestrial Radio Access (E-UTRA);
Physical Channels and Modulation, R14, v14.2.0, Apr. 2017.
[5] F. Berggren and B. M. Popovic, “Primary synchronization signal for D2D
communications in LTE-Advanced,” IEEE Commun. Lett., vol. 19, no. 7,
pp. 1241–1244, May 2015.
[6] Y. Tsai, G. Zhang, D. Grieco, F. Ozluturk, and X. Wang, “Cell search in
3GPP long term evolution systems,” IEEE Veh. Technol. Mag., vol. 2, no.
2, pp. 23–29, June 2007.
[7] Z. Zhang, J. Liu, and K. Long, “Low-complexity cell search with fast PSS
identification in LTE,” IEEE Trans. Veh. Technol., vol. 61, no. 4, pp. 1719–
1729, May 2012.
[8] S. L. Su, Y. C. Lin, and Y. J. Fan, “Joint sector identity and integer part of
carrier frequency offset detection by phase-difference in long term evolu-
tion cell search process,” IET Commun., vol. 7, no. 10, pp. 950–959, July
2013.
[9] C. Y. Chu, I. W. Lai, Y. Y. Lan, and T. D. Chiueh, “Efficient sequential inte-
ger CFO and sector identity detection for LTE cell search,” IEEE Wireless
Commun. Lett., vol. 3, no. 4, pp. 389–392, Aug. 2014.
[10] M. Morelli and M. Moretti, “A robust maximum likelihood scheme for
PSS detection and integer frequency offset recovery in LTE systems,”
IEEE Trans. Wireless Commun., vol. 15, no. 2, pp. 1353–1363, Feb. 2016.
[11] M. Morelli and M. Moretti, “A maximum likelihood approach for SSS
detection in LTE systems,” IEEE Trans. Wireless Commun., vol. 16, no. 4,
pp. 2423–2433, Apr. 2017.
[12] M. Sandell, J.J. van de Beek, and P.O. Börjesson, “ML estimation of time
and frequency offst in OFDM systems,” IEEE Trans. Sig. Process., vol. 45,
no. 7, pp. 1800–1805, July 1997.
[13] A. Bhamri, Z. Li, L. Lindh, and C. Ribeiro, “Primary synchronization
signal detection method for device-to-device in LTE-Rel 12 and beyond,”
in Proc. IEEE VTC, Sept. 2015, pp. 1–5.
[14] J. Yoon, Y. Jeong, G. Sacarelo, and Y. H. Kim, “A modified primary
sidelink synchronization signal for vehicular to vehicular communica-
tions,” in Proc. ICTC, Oct. 2017, pp. 450–452.
[15] T. M. Schmidl and D. C. Cox. “Robust frequency and timing synchroniza-
tion for OFDM,” IEEE Trans. Commun., vol. 45, no. 12, pp. 1613–1621,
Dec. 1997.
[16] M. Morelli and M. Moretti, “Integer frequency offset recovery in OFDM
transmissions over selective channels,” IEEE Trans. Wireless Commun.,
vol. 7, no. 12, pp. 5220–5226, Dec. 2008.
[17] Y. H. Kim, I. Song, S. Yoon, and S. R. Park, “An efficient frequency offset
estimator for OFDM systems and its performance characteristics,” IEEE
Trans. Veh. Technol., vol. 50, no. 5, pp. 1307–1312, Sept. 2001.
[18] J. Zhang, G. Liao, and J. Wang, “Efficient frequency offset resolution for
OFDM systems based on ML principle,” IEEE Trans. Consum. Electr.,
vol. 50, no. 3, pp. 709–806, Aug. 2004.
[19] Z. Lu, L. Zhao, and J. Li, “Further results on the maximum-likelihood
IFO estimation for OFDM systems,” IEEE Trans. Consum. Electr., vol.
53, no. 2, pp. 286–288, Feb. 2007.
[20] T. H. Pham, S. A. Fahmy, and I. V. McLoughlin, “Efficient integer freqe-
uncy offset estimation architecture for enhanced OFDM synchronization,”
IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 24, no. 4, pp. 1412–
1420, Apr. 2016.
[21] M. Morelli and U. Mengali, “Carrier-frequency estimation for transmis-
sions over selective channels,” IEEE Trans. Commun., vol. 48, no. 9,
pp. 1580–1588, Sept. 2000.
[22] I.C.F. Ipsen, Numerical Matric Analysis: Linear Systems and Least
Squares, SIAM, Philadelphia, PA, 2009.
[23] J. C. A. Barata and M. S. Hussein, “The Moore-Penrose pseudo-inverse:
a tutorial review of the theory,” J. Physics, vol. 42, no. 1-2, pp. 146–165,
Apr. 2012.
11
[24] M. Simon, Probability Distributions Involving Gaussian Random Vari-
ables, Springer, US, 2002.
[25] K. Krishnamoorthy, Handbook of Statistical Distributions with Applica-
tions, Chapman & Hall/CRC, FL, 2006.
[26] T.Y. Al-Naffouri and B. Hassibi, “On the distribution of indefinite
quadratic forms in Gaussian random variables,” in Proc. ISIT, June 2009,
pp. 1744–1748.
[27] M. Akkouchi, “On the convolution of exponential distributions,” J. Chung.
Mathm. Society. vol. 21, no. 4, pp. 502–510, Dec. 2008.
[28] R.W. Butler and M.S. Paolella, “Calculating the density and distribution
function for the singly and doubly noncentral F,” Statistics and Comput.,
vol. 12, no. 1, pp. 9–16, Jan. 2002.
[29] A. Paulraj, R. Nabar, and D. Gore, Introduction to Space-Time Wireless
Communications, Cambridge University Press, Cambridge, UK, 2003.
Jooheum Yoon received received B.S. degrees in
Astonomy and Space Science and Electronic Engi-
neering from Kyung Hee University, Yongin, Korea,
in 2016. He also received an M.S. degree in Electronic
Engineering from the same university in 2018. His re-
search interest includes syncrhoniztion and multiple
access for V2X and 5G communicaitons.
Changgyu Lee received a B.S. degree in Electronic
Engineering from Kyung Hee University in 2018. He
is currently pursuing an M.S. degree in Electronic En-
gineering at the same university. His research interest
includes massive multiple access and intelligent de-
tection for future wireless communications.
Yun Hee Kim received a B.S. degree (Summa Cum
Laude), M.S. degree, and Ph.D. in Electrical Engi-
neering from the Korea Advanced Institute of Science
and Technology, Daejeon, Korea, in 1995, 1997, and
2000, respectively. From Sept. 2000 to Aug. 2004,
she was with the Electronics and Telecommunications
Research Institute, Daejeon, Korea, as a Senior Mem-
ber of the Research Staff. In Sept. 2004, she joined
the Department of Electronic Engineering, Kyung Hee
University, Yongin, Korea, where she is currently a
Full Professor. Between 2000 and 2011, she was with
the Department of Electrical and Computer Engineering, University of Califor-
nia at San Diego, La Jolla, CA, USA, as a visiting researcher. Her research
interests include communication theory, statistical signal processing, and wire-
less and mobile communications.