This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Pilot-Aided Joint Time Synchronization and Channel Estimation for OTFS

Jiazheng Sun, Peng Yang, , Xianbin Cao, ,
Zehui Xiong, , Haijun Zhang, , and Tony Q. S. Quek, 
J. Sun, P. Yang, and X. Cao are with School of Electronic and Information Engineering, Beihang University, Beijing 100191, China. Z. Xiong and T. Quek are with the Information Systems Technology and Design Pillar, Singapore University of Technology and Design, Singapore 487372. H. Zhang is with the Beijing Engineering and Technology Research Center for Convergence Networks and Ubiquitous Services, University of Science and Technology Beijing, Beijing 100083, China.
Abstract

This letter proposes a pilot-aided joint time synchronization and channel estimation (JTSCE) algorithm for orthogonal time frequency space (OTFS) systems. Unlike existing algorithms, JTSCE employs a maximum length sequence (MLS) rather than an isolated signal as the pilot. Distinctively, JTSCE explores MLS’s autocorrelation properties to estimate timing offset and channel delay taps. After obtaining delay taps, closed-form expressions of Doppler and channel gain for each propagation path are derived. Simulation results indicate that, compared to its counterpart, JTSCE achieves better bit error rate performance, close to that with perfect time synchronization and channel state information.

Index Terms:
OTFS, synchronization, timing offset estimation, channel estimation

I Introduction

With the rapid development of next-generation wireless networks, the application scenarios of wireless communications are characterized by high carrier frequencies and high mobility [1]. In such high Doppler shift scenarios, the rapidly time-varying multipath channels, i.e., doubly-selective channels, degrade the performance of widely adopted modulation schemes like orthogonal frequency division multiplexing (OFDM). This is because this type of modulation schemes is based on the assumption of time-invariant channels. To address this issue, researchers have proposed a promising orthogonal time frequency space (OTFS) modulation scheme based on the assumption of doubly-selective channels [2]. OTFS characterizes channels and modulates information symbols in the two-dimensional delay-Doppler (DD) domain. Therefore, this new modulation scheme enables accurate estimation of both multipath delay and Doppler shift through channel estimation, demonstrating strong robustness in high mobility communication scenarios.

In any practical communication system including OTFS systems, synchronization and channel estimation are crucial techniques. This paper investigates the issues of signal synchronization and channel estimation in OTFS systems.

There has been extensive research on OTFS channel estimation [3][4][5][6], with a representative work being the embedded pilot-aided algorithm (EPA) [3]. This method performed channel estimation in the DD domain and addresses the fractional Doppler issue by arranging additional guard symbols. Another significant work [4] superimposed pilot and data symbols. It iteratively estimated channels and detected data symbols. However, these methods do not investigate the synchronization problem. Regarding synchronization, the research on OTFS system synchronization is under-studied currently [7][8]. The embedded pilot signal in [3] exhibits constant amplitude with equal phase difference in the delay-time (DT) domain. Utilizing this characteristic, the authors in [7] achieved time synchronization in the DT domain. Particularly, they utilized an absolute timing metrics for TO estimation, which could identify the strongest path. Nevertheless, when the first path is not the strongest, this method fails to locate the first multipath component, resulting in TO estimation errors. Besides, due to the poor autocorrelation properties of the constant amplitude sequence in the DT domain, this method requires a two-step process for TO estimation in both delay and time dimensions.

To address the aforementioned issues, this letter utilizes maximum length sequence (MLS) as the pilot signal and proposes a joint time synchronization and channel estimation (JTSCE) algorithm for OTFS systems. JTSCE provides two primary advantages. In terms of synchronization, it eliminates the need for time-dimension TO estimation and improves TO estimation accuracy under specific channel conditions. In terms of channel estimation, particularly for Doppler estimation, it employs an off-grid estimation scheme, which enhances estimation accuracy in fractional Doppler cases.

The main contributions of this letter are summarized as follows: 1) We utilize MLS as the pilot signal and correlate the received signal with the local MLS in the DT domain to achieve time synchronization without the need for time-dimension TO estimation. 2) Using the same pilot signal, we accomplish channel estimation and derive closed-form solutions for both channel gain and off-grid Doppler estimation based on the correlation results obtained from time synchronization. 3) We conduct extensive simulations to evaluate the accuracy of TO and channel estimation of the proposed algorithm. Simulation results verify that the proposed algorithm achieves high synchronization accuracy in doubly-selective channels. Further, in terms of channel estimation, compared to benchmark algorithms with the same embedded pilot signal power level, the proposed algorithm achieves better bit error rate (BER) performance, close to that with perfect time synchronization and channel state information (CSI).

II OTFS principles

By performing an inverse symplectic finite Fourier transform (ISFFT) on the DD domain signal followed by a Heisenberg transform, the OTFS signal can be obtained. Further, when both the transmission pulse and the reception pulse are rectangular windows, the aforementioned signal generation process can be simplified. Specifically, an inverse discrete Fourier transform (IDFT) can be firstly applied to the DD domain signal along the Doppler dimension (each row of the DD grid), resulting in the DT domain signal. Secondly, the DT domain signal is serialized column-wise to obtain the OTFS signal.

Mathematically, let XDD[l,k]{X_{{\rm{DD}}}}\left[{l,k}\right] be a DD domain signal composed of quadrature amplitude modulation (QAM) data symbols, with NN delay and MM Doppler bins, where l=0,1,,M1l=0,1,\cdots,M-1 and k=0,1,,N1k=0,1,\cdots,N-1 are the delay and Doppler indices, respectively. The DT domain signal can be represented as XDT[l,n]=1Nk=0N1XDD[l,k]ej2πNkn{X_{{\rm{DT}}}}\left[{l,n}\right]=\frac{1}{{\sqrt{N}}}\sum\nolimits_{k^{\prime}=0}^{N-1}{{X_{{\rm{DD}}}}\left[{l,k^{\prime}}\right]{{\rm{e}}^{{\rm{j}}\frac{{2\pi}}{N}k^{\prime}n}}}, where n=0,1,N1n=0,1,\cdots N-1 is the time index. To obtain the OTFS signal, the DT domain signal needs to be serialized column-wise, that is, s[n]=XDT[l,n]s\left[{n^{\prime}}\right]={X_{{\rm{DT}}}}\left[{l,n}\right] with n=l+nMn^{\prime}=l+nM. Before transmitting the signal, a guard interval (GI) is added to eliminate inter-symbol interference (ISI) between OTFS symbols. This letter adopts reduced cyclic prefix (RCP) as the GI. That is, a cyclic prefix (CP) of length LRCP{L_{{\rm{RCP}}}} is added to the beginning of each OTFS block, containing MNMN samples. The length LRCP{L_{{\rm{RCP}}}} should be greater than the delay spread of the channel.

For a doubly-selective channel, we denote its response to an impulse with delay τ\tau and Doppler shift ν\nu as h(τ,ν)h\left({\tau,\nu}\right). The received signal r(t)r\left(t\right) can then be expressed as

r(t)=h(τ,ν)s(tτ)ej2πν(tτ)dνdτ.r\left(t\right)=\iint h\left(\tau,\nu\right)s\left(t-\tau\right)\mathrm{e}^{\mathrm{j}2\pi\nu\left(t-\tau\right)}\mathrm{d}\nu\mathrm{d}\tau. (1)

Sampling r(t)r(t) with delay and Doppler resolutions of TM\frac{T}{M} andΔfN\frac{{\Delta f}}{N}, respectively, i.e., t=nTMt=\frac{{n^{\prime}T}}{M}, τ=lTM\tau=\frac{{lT}}{M} and ν=kΔfN\nu=\frac{{k\Delta f}}{N}, we can obtain a discrete form of the time domain input-output relationship, i.e.,

r[n]=i=1Phis[nli]ej2πMNki(nli),r\left[{n^{\prime}}\right]=\sum\limits_{i=1}^{P}{{h_{i}}s\left[{n^{\prime}-{l_{i}}}\right]{{\rm{e}}^{{\rm{j}}\frac{{2{\rm{\pi}}}}{{MN}}{k_{i}}\left({n^{\prime}-{l_{i}}}\right)}}}, (2)

where PP is the number of paths of the channel, lil_{i}, kik_{i}, and hi=h[li,ki]h_{i}=h\left[l_{i},k_{i}\right] are the delay tap, Doppler tap, and channel gain of the ii-th path, respectively.

By performing serial-to-parallel conversion on s[nli]s\left[n^{\prime}-l_{i}\right] and r[n]r\left[n^{\prime}\right] in (2) , we can obtain the input-output relationship in the DT domain. Let n=nM+ln^{\prime}=nM+l (assuming li<l{l_{i}}<l) and r[n]=YDT[l,n]r\left[{n^{\prime}}\right]={Y_{{\rm{DT}}}}\left[{l,n}\right], the relationship can be expressed as

YDT[l,n]=i=1PhiXDT[lli,n]ej2πMNki(lli)ej2πNkin.{Y_{{\rm{DT}}}}\left[{l,n}\right]=\sum\limits_{i=1}^{P}{{h_{i}}{X_{{\rm{DT}}}}\left[{l-{l_{i}},n}\right]{{\rm{e}}^{{\rm{j}}\frac{{2{\rm{\pi}}}}{{MN}}{k_{i}}\left({l-{l_{i}}}\right)}}{{\rm{e}}^{{\rm{j}}\frac{{2{\rm{\pi}}}}{N}{k_{i}}n}}}. (3)

The above derivation assumes no TO. Therefore, to recover the transmitted signal s[n]s\left[{n^{\prime}}\right], one should first achieve time synchronization and then obtain channel parameters set ={(li,ki,hi);i=1,2,,P}\mathcal{H}=\left\{{\left({{l_{i}},{k_{i}},{h_{i}}}\right);i=1,2,\cdots,P}\right\} by channel estimation.

III Proposed joint time synchronization and channel estimation algorithm

In this section, we propose the JTSCE algorithm for OTFS systems. OTFS systems can treat carrier frequency offset (CFO) caused by Doppler effects and local oscillator mismatch as a part of channel response [9]. Therefore, during the synchronization phase, we only consider TO estimation. The task of frequency estimation can be handled during channel estimation. Next, we will estimate TO, delay, Doppler, and channel gain in two steps to achieve JTSCE.

III-A TO & delay estimation

We first estimate the TO and delay. The proposed algorithm deploys MLS in the DT domain, which eliminates the need for time-dimension TO estimation, and can estimate all delay taps of the channel. Additionally, it maintains high TO estimation accuracy even if the 1st path of the channel is not strongest.

The TO estimation method proposed in [7] requires an additional step for time-dimension TO estimation. This is largely because the constant amplitude linear phase structure explored in [7] has poor autocorrelation properties, making the timing metric insensitive to time-dimension TO.

To tackle this issue, this letter leverages MLS with good autocorrelation properties in the DT domain for TO estimation. An MLS is a pseudo-random sequence of length 2p1{2^{p}}-1, where pp is a positive integer. Typically, NN is chosen as 2p{2^{p}}. Therefore, we generate a bipolar MLS xMLS[n]{x_{{\rm{MLS}}}}\left[n\right] of length N1N-1 with total power of PMLS{P_{{\rm{MLS}}}} (sequence values are ±PMLSN1\pm\sqrt{\frac{{{P_{{\rm{MLS}}}}}}{{N-1}}}), where n=0,1,,N2n=0,1,\cdots,N-2. A zero is appended to the end of xMLS[n]{x_{{\rm{MLS}}}}\left[n\right] to obtain x~MLS[n]={xMLS[n],n=0,1,,N2,0,n=N1\tilde{x}_{\mathrm{MLS}}\left[n\right]=\begin{cases}x_{\mathrm{MLS}}\left[n\right],&n=0,1,\cdots,N-2,\\ 0,&n=N-1\end{cases}.

Next, a NN-point discrete Fourier transform (DFT) is performed on x~MLS[n]{\tilde{x}_{{\rm{MLS}}}}\left[n\right] to obatain X~MLS[k]=DFT{x~MLS[n]}{\tilde{X}_{{\rm{MLS}}}}\left[k\right]={\rm{DFT}}\left\{{{{\tilde{x}}_{{\rm{MLS}}}}\left[n\right]}\right\}. X~MLS[k]{\tilde{X}_{{\rm{MLS}}}}\left[k\right] is then placed in the lMLS{l_{{\rm{MLS}}}}-th row of the DD domain grid, as shown in Fig. 1. To prevent interference between data symbols and the MLS, guard symbols are deployed between them. The guard symbols are set to 0, with a width 2L+12L+1 where LL is no less than the delay tap corresponding to the channel’s delay spread [3].

Refer to caption
Figure 1: Pilot patterns for both transmitter and receiver.

Based on the input-output relationship derived in section II, we can derive the signal expression for the received MLS at the receiver, as illustrated in Fig. 1. According to (3), the MLS in the received DT domain signal will be spread across different rows with delay lMLS+li{l_{{\rm{MLS}}}}+{l_{i}}. Further, the mathematical expression for the sequence in the (lMLS+li)\left({l_{{\rm{MLS}}}}+{l_{i}}\right)-th row of the DT grid is given by yMLS(li)[n]=hiej2πMNkilMLSx~MLS[n]ej2πNkiny_{{\rm{MLS}}}^{\left({{l_{i}}}\right)}\left[n\right]={h_{i}}{{\rm{e}}^{{\rm{j}}\frac{{2{\rm{\pi}}}}{{MN}}{k_{i}}{l_{{\rm{MLS}}}}}}{\tilde{x}_{{\rm{MLS}}}}\left[n\right]{{\rm{e}}^{{\rm{j}}\frac{{2{\rm{\pi}}}}{N}{k_{i}}n}}.

It can be observed that the non-zero rows in the received DT grid are in the form of MLS multiplied by a complex exponential sequence. Therefore, by utilizing the good autocorrelation properties of MLS to locate yMLS(li)[n]y_{{\rm{MLS}}}^{\left({{l_{i}}}\right)}\left[n\right] and obtain li{l_{i}}, we can complete the estimation of TO and delay.

To locate yMLS(li)[n]y_{{\rm{MLS}}}^{\left({{l_{i}}}\right)}\left[n\right] in the DT domain, we first extract a portion of the received signal r[n]r\left[{n^{\prime}}\right] that can serve as a row in the DT domain grid. We denote the row as Yn~[n]=r[n~+nM]{Y_{\tilde{n}}}\left[n\right]=r\left[{\tilde{n}+nM}\right], and use the local MLS to correlate with the corresponding part of Yn~[n]{Y_{\tilde{n}}}\left[n\right]. This process can be mathematically represented as qn~[n]=Yn~[n]x~MLS[n]{q_{\tilde{n}}}\left[n\right]={Y_{\tilde{n}}}\left[n\right]{\tilde{x}_{{\rm{MLS}}}}\left[n\right].

When locating yMLS(li)[n]y_{{\rm{MLS}}}^{\left({{l_{i}}}\right)}\left[n\right], we have Yn~[n]=yMLS(li)[n]{Y_{\tilde{n}}}\left[n\right]=y_{{\rm{MLS}}}^{\left({{l_{i}}}\right)}\left[n\right] and qn~[n]=yMLS(li)[n]x~MLS[n]=hiej2πMNkilMLSx~MLS2[n]ej2πNkin{q_{\tilde{n}}}\left[n\right]=y_{{\rm{MLS}}}^{\left({{l_{i}}}\right)}\left[n\right]{\tilde{x}_{{\rm{MLS}}}}\left[n\right]={h_{i}}{{\rm{e}}^{{\rm{j}}\frac{{2{\rm{\pi}}}}{{MN}}{k_{i}}{l_{{\rm{MLS}}}}}}\tilde{x}_{{\rm{MLS}}}^{2}\left[n\right]{{\rm{e}}^{{\rm{j}}\frac{{2{\rm{\pi}}}}{N}{k_{i}}n}}. For the bipolar MLS x~MLS[n]{\tilde{x}_{{\rm{MLS}}}}\left[n\right], we have x~MLS2[n]={PMLSN1,n=0,1,,N2,0,n=N1,\tilde{x}_{\mathrm{MLS}}^{2}\left[n\right]=\begin{cases}\frac{P_{\mathrm{MLS}}}{N-1},&n=0,1,\cdots,N-2,\\ 0,&n=N-1,\end{cases} and qn~[n]={PMLSN1hiej2πMNkilMLSej2πNkin,n=0,1,,N2,0,n=N1q_{\tilde{n}}\left[n\right]=\begin{cases}\frac{P_{\mathrm{MLS}}}{N-1}h_{i}\mathrm{e}^{\mathrm{j}\frac{2\pi}{MN}k_{i}l_{\mathrm{MLS}}}\mathrm{e}^{\mathrm{j}\frac{2\pi}{N}k_{i}n},&n=0,1,\cdots,N-2,\\ 0,&n=N-1\end{cases}. Then, we perform an NN-point DFT on qn~[n]{q_{\tilde{n}}}\left[n\right] to yield Qn~[k]{Q_{\tilde{n}}}\left[k\right]. Since qn~[n]{q_{\tilde{n}}}\left[n\right] is a complex exponential sequence, the magnitude |Qn~[k]|\left|{{Q_{\tilde{n}}}\left[k\right]}\right| will exhibit a distinct peak. When ki{k_{i}} is an integer, the peak occurs at k=kik={k_{i}}, and its value is |Qn~[k]|=|hi|NPMLS\left|{{Q_{\tilde{n}}}\left[k\right]}\right|=\frac{{\left|{{h_{i}}}\right|}}{{\sqrt{N}}}{P_{{\rm{MLS}}}}. According to this principle, the proposed algorithm can detect all paths in the channel.

Next, we analyze the case of yMLS(li)[n]y_{{\rm{MLS}}}^{\left({{l_{i}}}\right)}\left[n\right] not being located accurately, i.e., there is a TO. In this case, we decompose TO θ\theta as θ=θd+Mθt\theta={\theta_{\rm{d}}}+M{\theta_{\rm{t}}}, where θd{\theta_{\rm{d}}} and θt{\theta_{\rm{t}}} represent delay and time dimensions TO, respectively. When there is a delay dimension TO, i.e., θd0{\theta_{\rm{d}}}\neq 0, Yn~[n]{Y_{\tilde{n}}}\left[n\right] does not correlate with x~MLS[n]{\tilde{x}_{{\rm{MLS}}}}\left[n\right]. As a result, Qn~[k]{Q_{\tilde{n}}}\left[k\right] will not exhibit a distinct peak. For the case that only the time-dimension TO exists, i.e., θt0{\theta_{\rm{t}}}\neq 0 and θd=0{\theta_{\rm{d}}}=0, the following lemma explains why the proposed algorithm does not require additional time-dimension TO estimation.

Lemma 1.

When θt0{\theta_{\rm{t}}}\neq 0 and θd=0{\theta_{\rm{d}}}=0, |Qn~[k]|\left|{{Q_{\tilde{n}}}\left[k\right]}\right| will not exhibit a distinct peak, i.e.,

maxk=0,1,N1{|Qn~[k]|}|hi|NPMLS.\mathop{\max}\limits_{k=0,1,\cdots N-1}\left\{{\left|{{Q_{\tilde{n}}}\left[k\right]}\right|}\right\}\ll\frac{{\left|{{h_{i}}}\right|}}{{\sqrt{N}}}{P_{{\rm{MLS}}}}. (4)
Proof.

Please refer to the Appendix. ∎

The above lemma tells that, due to the good autocorrelation properties of MLS, even if θt{\theta_{\rm{t}}} is very small, making qn~[n]{q_{\tilde{n}}}\left[n\right] and yMLS(li)[n]y_{{\rm{MLS}}}^{\left({{l_{i}}}\right)}\left[n\right] nearly identical except for a slight shift, |Qn~[k]|\left|{{Q_{\tilde{n}}}\left[k\right]}\right| will not exhibit a distinct peak. Therefore, the proposed algorithm does not require additional time-dimension TO estimation.

Based on the above analysis, we can estimate the delay taps and TO by performing normalized threshold detection on the maximum magnitude of DFT of qn~[n]{q_{\tilde{n}}}\left[n\right]. The detailed steps are summarized in the latter Algorithm 1.

We then discuss how to determine the detection threshold 𝒯\mathcal{T}. The value of 𝒯\mathcal{T} is determined based on the “non-peak” condition. In the presence of TO, Yn~[n]{Y_{\tilde{n}}}\left[n\right] is usually data symbols with E{Yn~[n]}=0E\left\{{{Y_{\tilde{n}}}\left[n\right]}\right\}=0. Therefore, E{qn~[n]}=E{Yn~[n]}x~MLS[n]=0E\left\{{{q_{\tilde{n}}}\left[n\right]}\right\}=E\left\{{{Y_{\tilde{n}}}\left[n\right]}\right\}{\tilde{x}_{{\rm{MLS}}}}\left[n\right]=0 and Qn~[k]=k=0N1qn~[n]ej2πnkN{Q_{\tilde{n}}}\left[k\right]=\sum\nolimits_{k=0}^{N-1}{{q_{\tilde{n}}}\left[n\right]{{\rm{e}}^{-{\rm{j}}\frac{{2{\rm{\pi}}nk}}{N}}}} with E{Qn~[k]}=0E\left\{{{Q_{\tilde{n}}}\left[k\right]}\right\}=0. According to the central limit theorem, Qn~[k]{Q_{\tilde{n}}}\left[k\right] approximately follows a complex Gaussian distribution with zero mean and σ2{\sigma^{2}} variance. |Qn~[k]|\left|{{Q_{\tilde{n}}}\left[k\right]}\right| follows a Rayleigh distribution with π2σ\sqrt{\frac{\pi}{2}}\sigma mean and 4π2σ2\frac{{4-\pi}}{2}{\sigma^{2}} variance. Besides, k=0N1|Qn~[k]|\sum\nolimits_{k=0}^{N-1}{\left|{{Q_{\tilde{n}}}\left[k\right]}\right|} follows a complex Gaussian distribution with Nπ2σN\sqrt{\frac{\pi}{2}}\sigma mean and N4π2σ2N\frac{{4-\pi}}{2}{\sigma^{2}} variance. Considering the complex Gaussian white noise, the above three distributions still hold, but the value of σ\sigma changes. Given a very small probability PP, there exist parameters β1,β2{\beta_{1}},{\beta_{2}} such that Pr{α>π2σ+β14π2σNπ2σβ2N4π2σ}=P\Pr\left\{{\alpha>\frac{{\sqrt{\frac{\pi}{2}}\sigma+{\beta_{1}}\sqrt{\frac{{4-\pi}}{2}}\sigma}}{{N\sqrt{\frac{\pi}{2}}\sigma-{\beta_{2}}N\sqrt{\frac{{4-\pi}}{2}}\sigma}}}\right\}=P. Thus, we can set 𝒯=1Nπ2+β14π2π2β24π2\mathcal{T}=\frac{1}{N}\cdot\frac{{\sqrt{\frac{\pi}{2}}+{\beta_{1}}\sqrt{\frac{{4-\pi}}{2}}}}{{\sqrt{\frac{\pi}{2}}-{\beta_{2}}\sqrt{\frac{{4-\pi}}{2}}}}, where π2+β14π2π2β24π2\frac{{\sqrt{\frac{\pi}{2}}+{\beta_{1}}\sqrt{\frac{{4-\pi}}{2}}}}{{\sqrt{\frac{\pi}{2}}-{\beta_{2}}\sqrt{\frac{{4-\pi}}{2}}}} can be obtained experimentally. This value is only related to β1,β2{\beta_{1}},{\beta_{2}}, i.e., the given probability PP. Hence, the threshold is applicable to different signal-to-noise ratios (SNRs) and OTFS sizes.

Refer to caption
(a) Designed TO estimation scheme
Refer to caption
(b) TO estimation method in [7]
Figure 2: A snapshot of α(n~)\alpha\left({\tilde{n}}\right) and P(n~)P\left({\tilde{n}}\right) for the designed scheme and the method in [7] at SNRd=10dB{\rm{SN}}{{\rm{R}}_{\rm{d}}}=10{\rm{\ dB}} with M=128M=128 and N=32N=32.

Fig. 2 depicts a snapshot of the timing metric α(n~)\alpha\left({\tilde{n}}\right) and correlation function P(n~)P\left({\tilde{n}}\right), used for TO estimation in the proposed algorithm and [7] respectively. The parameters for OTFS systems are M=128M=128, N=32N=32, data SNR SNRd=10dB{\rm{SN}}{{\rm{R}}_{\rm{d}}}=10{\rm{\ dB}}, MLS SNR SNRM=30dB{\rm{SN}}{{\rm{R}}_{\rm{M}}}=30{\rm{\ dB}}, pilot SNR [7] SNRp=44.9dB{\rm{SN}}{{\rm{R}}_{\rm{p}}}=44.9{\rm{\ dB}}. The detection threshold 𝒯=8.0/N\mathcal{T}=8.0/N is set reasonably and helps to effectively capture the delay taps, as seen in Fig. 2(a). We can also observe from Figs. 2(a) and 2(b) that the obtained α(n~)\alpha\left({\tilde{n}}\right) by the proposed algorithm does not exhibit a peak at θ=Mθt\theta=M{\theta_{\rm{t}}}. As a result, the proposed algorithm does not require additional TO estimation. Further, as observed in Fig. 2(b), the method in [7] suffers from TO estimation errors due to the first path of the channel not being the strongest path. In contrast, the proposed algorithm accurately estimates TO by capturing all paths of the channel.

III-B Doppler & Channel Gain Estimation

After obtaining the TO θ\theta and channel delay taps, we then estimate the Doppler taps and channel gains. For any path in the channel with delay li{l_{i}}, let n~i=θ+LRCP+lMLS+li{\tilde{n}_{i}}=\theta+{L_{{\rm{RCP}}}}+{l_{{\rm{MLS}}}}+{l_{i}}, we have qn~i[n]={PMLSN1hiej2πkinN,n=0,1,,N2,0,n=N1q_{\tilde{n}_{i}}\left[n\right]=\begin{cases}\frac{P_{\mathrm{MLS}}}{N-1}h_{i}\cdot\mathrm{e}^{\mathrm{j}\frac{2\pi k_{i}n}{N}},&n=0,1,\cdots,N-2,\\ 0,&n=N-1\end{cases}. To estimate the Doppler tap ki{k_{i}}, a direct approach is to estimate it based on the location of the peak in Qn~i[k]{Q_{{{\tilde{n}}_{i}}}}\left[k\right], which is feasible when ki{k_{i}} is an integer. However, when ki{k_{i}} is fractional, spectral leakage will greatly affect accurate estimation of ki{k_{i}}. Given that qn~i[n]{q_{{{\tilde{n}}_{i}}}}\left[n\right] is a complex exponential sequence, this letter estimates ki{k_{i}} using the following expression: k^i=N(N2)2πn=0N3(qn~i[n+1]qn~i[n]){\hat{k}_{i}}=\frac{N}{{\left({N-2}\right)\cdot 2{\rm{\pi}}}}\sum\limits_{n=0}^{N-3}{\angle\left({{q_{{{\tilde{n}}_{i}}}}\left[{n+1}\right]q_{{{\tilde{n}}_{i}}}^{*}\left[n\right]}\right)}, where \angle denotes the phase angle operation. After obtaining k^i{\hat{k}_{i}}, the estimated gain hi{h_{i}} can be computed by the following close-formed expression: h^i=1PMLSn=0N2qn~i[n]ej2πk^inN{\hat{h}_{i}}=\frac{1}{{{P_{{\rm{MLS}}}}}}\sum\limits_{n=0}^{N-2}{{q_{{{\tilde{n}}_{i}}}}\left[n\right]\cdot{{\rm{e}}^{{\rm{-j}}\frac{{2{\rm{\pi}}{{\hat{k}}_{i}}n}}{N}}}}.

Finally, on the basis of the above derivations, we can summarize the main steps of time synchronization and channel estimation in Algorithm 1.

Algorithm 1 Joint time synchronization and channel estimation, JTSCE
1:  Input: received signal r[n]r\left[n^{\prime}\right], local MLS x~MLS[n]{\tilde{x}_{{\rm{MLS}}}}\left[n\right], threshold 𝒯\mathcal{T}, lMLS{l_{{\rm{MLS}}}}, delay spread LL, and RCP length LRCP{L_{{\rm{RCP}}}}.
2:  Output: timing offset θ^\hat{\theta} and channel parameters set ^{\hat{\mathcal{H}}}.
3:  Initialize: ^={\hat{\mathcal{H}}}=\emptyset, n~=0\tilde{n}=0, stop={\rm{stop}}=\infty, and trigger=True{\rm{trigger}}={\rm{True}}.
4:  while n~<stop\tilde{n}<{\rm{stop}} do
5:     Let Yn~[n]=r[n~+nM]{Y_{\tilde{n}}}\left[n\right]=r\left[{\tilde{n}+nM}\right], qn~[n]=Yn~[n]x~MLS[n]{q_{\tilde{n}}}\left[n\right]={Y_{\tilde{n}}}\left[n\right]{\tilde{x}_{{\rm{MLS}}}}\left[n\right], and Qn~[k]=DFT{qn~[n]}{Q_{\tilde{n}}}\left[k\right]={\rm{DFT}}\left\{{{q_{\tilde{n}}}\left[n\right]}\right\}.
6:     Calculate the timing metric α(n~)\alpha\left({\tilde{n}}\right), defined as α(n~)=maxk=0,1,N1{|Qn~[k]|}k=0N1|Qn~[k]|\alpha\left({\tilde{n}}\right)=\frac{{\mathop{\max}\limits_{k=0,1,\cdots N-1}\left\{{\left|{{Q_{\tilde{n}}}\left[k\right]}\right|}\right\}}}{{\sum\nolimits_{k=0}^{N-1}{\left|{{Q_{\tilde{n}}}\left[k\right]}\right|}}}.
7:     if α(n~)>𝒯\alpha\left({\tilde{n}}\right)>\mathcal{T} then
8:        if trigger=True{\rm{trigger}}={\rm{True}} then
9:           stop=n~+L+1{\rm{stop}}=\tilde{n}+L+1, trigger=False{\rm{trigger}}={\rm{False}}, and θ^=n~lMLSLRCP\hat{\theta}=\tilde{n}-{l_{{\rm{MLS}}}}-{L_{{\rm{RCP}}}}.
10:        end if
11:        Get (l^,k^,h^)\left({\hat{l},\hat{k},\hat{h}}\right) through l^=n~θ^LRCPlMLS\hat{l}=\tilde{n}-\hat{\theta}-{L_{{\rm{RCP}}}}-{l_{{\rm{MLS}}}}, k^=N(N2)2πn=0N3(qn~[n+1]qn~[n])\hat{k}=\frac{N}{{\left({N-2}\right)\cdot 2\pi}}\sum\limits_{n=0}^{N-3}{\angle\left({{q_{\tilde{n}}}\left[{n+1}\right]q_{\tilde{n}}^{*}\left[n\right]}\right)}, and h^=1PMLSn=0N2qn~[n]ej2πk^nN\hat{h}=\frac{1}{{{P_{{\rm{MLS}}}}}}\sum\limits_{n=0}^{N-2}{{q_{\tilde{n}}}\left[n\right]\cdot{{\rm{e}}^{{\rm{-j}}\frac{{2\pi\hat{k}n}}{N}}}}. Then append (l^,k^,h^)\left({\hat{l},\hat{k},\hat{h}}\right) to ^{\hat{\mathcal{H}}}.
12:     end if
13:     n~=n~+1\tilde{n}=\tilde{n}+1.
14:  end while

IV Simulation results

In this section, we analyze the performance of the proposed algorithm through simulations. The default system parameters are set as follows: carrier frequency 8 GHz, subcarrier spacing 15 kHz, M=128M=128, N=32N=32, RCP length LRCP=M/4{L_{{\rm{RCP}}}}=M/4, detection threshold 𝒯=8.0/N\mathcal{T}=8.0/N, and 4-QAM signals. We refer to [3] for the definitions of average data SNR SNRd=E{|xd|2}/σ2\begin{aligned} {\rm{SN}}{{\rm{R}}_{\rm{d}}}={\rm{E}}\left\{{{{\left|{{x_{\rm{d}}}}\right|}^{2}}}\right\}{\rm{/}}{\sigma^{2}}\end{aligned} and average MLS SNR SNRM=E{|xMLS|2}/σ2\begin{aligned} {\rm{SN}}{{\rm{R}}_{\rm{M}}}={\rm{E}}\left\{{{{\left|{{x_{{\rm{MLS}}}}}\right|}^{2}}}\right\}{\rm{/}}{\sigma^{2}}\end{aligned}. The channel model in [10] is utilized. The maximum speed of a mobile user is set to v=250Kmphv={\rm{250\ Kmph}}, corresponding to a maximum Doppler shift index kνmax=4{k_{{\nu_{\max}}}}=4 , and we assume a maximum delay index lτmax=10{l_{{\tau_{\max}}}}=10.

In Fig. 3, we investigate the performance of the designed TO and delay estimation scheme. Specifically, under the condition of SNRd{10,15,20}dB{\rm{SN}}{{\rm{R}}_{\rm{d}}}\in\{10,15,20\}{\rm{\ dB}}, we conduct simulations for each SNRM{\rm{SN}}{{\rm{R}}_{\rm{M}}}, measuring the performance of the estimation scheme by the proportion of accurately estimated TO and channel delay taps. In Fig. 3, the dashed line represents the proportion of accurately estimated TO, while the solid line represents the proportion of accurately estimated TO and delay taps. The results show that the estimation accuracy is independent of SNRd{\rm{SN}}{{\rm{R}}_{\rm{d}}} and positively correlated with SNRM{\rm{SN}}{{\rm{R}}_{\rm{M}}}. This is because the added guard symbols ensure that the data symbols and MLS do not interfere with each other. Further, when SNRM25dB{\rm{SN}}{{\rm{R}}_{\rm{M}}}\geq 25{\rm{\ dB}}, the designed TO and delay estimation scheme achieves accurate TO estimation. Although there are some errors in the delay estimation, it also reaches a high level of accuracy. The sources of error in the delay estimation are twofold: 1) Missed detection: paths with smaller channel gains have correlation peaks below the threshold and are missed. 2) False detection: spurious peaks above the threshold are falsely identified as paths. Missed detection decreases with increasing SNRM{\rm{SN}}{{\rm{R}}_{\rm{M}}}, while false detection is independent of SNRM{\rm{SN}}{{\rm{R}}_{\rm{M}}}. Therefore, the high accuracy at SNRM=40dB{\rm{SN}}{{\rm{R}}_{\rm{M}}}=40{\rm{\ dB}} indicates that missed detection is the main source of delay estimation error. Paths with smaller channel gains have a relatively minor impact on the accuracy of channel estimation. Thus, the missed detection of these paths is acceptable for the decision process to some extent. This will be verified in the subsequent BER simulations.

Refer to caption
Figure 3: The accuracy of TO and delay estimation of the proposed algorithm.

Next, we examine the impact of threshold 𝒯\mathcal{T} on the estimation of TO and delay. Fig. 4 illustrates the relationship between estimation accuracy and threshold 𝒯\mathcal{T} under conditions of SNRM=25dB{\rm{SN}}{{\rm{R}}_{\rm{M}}}=25{\rm{\ dB}} and 35dB35{\rm{\ dB}}, respectively. The previous simulation results indicate that the estimation performance is independent of SNRd{\rm{SN}}{{\rm{R}}_{\rm{d}}}. The following simulations are conducted under the assumption of SNRd=20dB{\rm{SN}}{{\rm{R}}_{\rm{d}}}=20{\rm{\ dB}}. The simulation results shown in Fig. 4 reveal that 𝒯=8.0/N\mathcal{T}=8.0/N has a significant advantage in low MLS power scenarios and maintains good accuracy under high MLS power conditions. This is because missed detection is more likely to happen at low MLS power levels, where a relatively lower threshold is more beneficial. In summary, for the given system parameters, the optimal threshold approximates 𝒯=8.0/N\mathcal{T}=8.0/N.

Refer to caption
(a) SNRM=25dB{\rm{SN}}{{\rm{R}}_{\rm{M}}}=25{\rm{\ dB}}
Refer to caption
(b) SNRM=35dB{\rm{SN}}{{\rm{R}}_{\rm{M}}}=35{\rm{\ dB}}
Figure 4: The accuracy of TO and delay estimation versus thresholds at SNRM=25dB{\rm{SN}}{{\rm{R}}_{\rm{M}}}=25{\rm{\ dB}} and 35dB35{\rm{\ dB}}.

In Fig. 5, we evaluate the performance of the designed Doppler and channel gain estimation scheme. To focus solely on the accuracy of Doppler and channel gain estimation, we assume perfect acquisition of TO and delay information. We assess the mean square error (MSE) performance of the designed Doppler and channel gain estimation scheme and discuss the trend of MSE versus the value of SNRM{\rm{SN}}{{\rm{R}}_{\rm{M}}}. It can be observed that, similar to delay estimation, as SNRM{\rm{SN}}{{\rm{R}}_{\rm{M}}} increases, the Doppler and channel gain estimation errors decrease.

Refer to caption
Figure 5: MSE of Doppler and channel gain estimation for the proposed algorithm.
Refer to caption
Figure 6: Comparison of BER performance of JTSCE, EPA with perfect time synchronization and perfect time synchronization & CSI.

Finally, in Fig. 6, we compare the proposed JTSCE with EPA to evaluate its BER performance. For signal detection, we employ the linear minimum mean-square error (LMMSE) algorithm [9]. To ensure accurate estimation of TO and delays, we set SNRM{\rm{SN}}{{\rm{R}}_{\rm{M}}} to 25 dB and 35 dB based on the conclusions drawn from Fig. 3. For a fair comparison, we ensure that the total power of the embedded sequences in both algorithms is the same. That is, set the pilot power of EPA to be log10(N1)dB{\log_{10}}\left({N-1}\right){\rm{\ dB}} greater than that of JTSCE. The BER curve with perfect synchronization and CSI is also plotted. Simulation results show that as the power of pilot increases, the BER performance of both algorithms improves, which aligns with the improved accuracy of Doppler and gain estimation observed in Fig. 5. Additionally, when allocating the same pilot power, JTSCE achieves better BER performance than EPA. When SNRM{\rm{SN}}{{\rm{R}}_{\rm{M}}} reaches 35 dB, the achieved BER of JTSCE is close to that of the case of perfect time synchronization and CSI.

V Conclusion

In this letter, we proposed a joint time synchronization and channel estimation algorithm for OTFS. In this algorithm, we leveraged MLS as pilots to accomplish time synchronization and channel estimation. Initially, we utilized the good autocorrelation properties of the MLS to estimate TO and delay. This approach had the advantage of not requiring additional time-dimension TO estimation and maintaining TO estimation accuracy when the first path in the channel was not the strongest. After determining the starting position of OTFS signal and the delay of each path of the channel, we estimated the Doppler and channel gain for each path. We analyzed the accuracy of the proposed algorithm’s TO and delay estimation performance through simulations, as well as the MSE of Doppler and channel gain estimation. We also evaluated the BER performance, and the results indicated that the proposed algorithm’s BER performance was close to the perfect time synchronization and CSI scenario. Moreover, with the same pilot power, it outperformed the embedded pilot-aided counterpart.

[Proof of Lemma 1] When θt0{\theta_{\rm{t}}}\neq 0 and θd=0{\theta_{\rm{d}}}=0, Yn~[n]{Y_{\tilde{n}}}\left[n\right] can be expressed as Yn~[n]={yTO[n],nθt,yMLS(li)[nθt],n>θtY_{\tilde{n}}\left[n\right]=\begin{cases}y_{\mathrm{TO}}\left[n\right],&n\leq\theta_{\mathrm{t}},\\ y_{\mathrm{MLS}}^{(l_{i})}\left[n-\theta_{\mathrm{t}}\right],&n>\theta_{\mathrm{t}}\end{cases}, where yTO[n]{y_{{\rm{TO}}}}\left[n\right] represents the interference caused by θt{\theta_{\rm{t}}}. yTO[n]{y_{{\rm{TO}}}}\left[n\right] does not correlate with Yn~[n]{Y_{\tilde{n}}}\left[n\right]. Thus, we consider the case of θtN{\theta_{\rm{t}}}\ll N.

The MLS xMLS[n]{x_{{\rm{MLS}}}}\left[n\right] has the property n=0N2xMLS[n]xMLS[(nθt)N1]=PMLSN1\sum\nolimits_{n=0}^{N-2}{{x_{{\rm{MLS}}}}\left[n\right]{x_{{\rm{MLS}}}}\left[{{{\left({n-{\theta_{\rm{t}}}}\right)}_{N-1}}}\right]}=-\frac{{{P_{{\rm{MLS}}}}}}{{N-1}}, for θt0{\theta_{\rm{t}}}\neq 0. Therefore, we have

|n=θtN2xMLS[n]xMLS[nθt]|=|PMLSN1n=0θt1xMLS[n]xMLS[(nθt)N1]|(1+θt)PMLSN1.\begin{array}[]{l}\left|{\sum\nolimits_{n={\theta_{\rm{t}}}}^{N-2}{{x_{{\rm{MLS}}}}\left[n\right]{x_{{\rm{MLS}}}}\left[{n-{\theta_{\rm{t}}}}\right]}}\right|\\ =\left|{-\frac{{{P_{{\rm{MLS}}}}}}{{N-1}}-\sum\nolimits_{n=0}^{{\theta_{\rm{t}}}-1}{{x_{{\rm{MLS}}}}\left[n\right]{x_{{\rm{MLS}}}}\left[{{{\left({n-{\theta_{\rm{t}}}}\right)}_{N-1}}}\right]}}\right|\\ \leq\frac{{\left({1+{\theta_{\rm{t}}}}\right){P_{{\rm{MLS}}}}}}{{N-1}}.\end{array} (5)

Performing DFT on

qn~[n]=yMLS(li)[n]x~MLS[n]={yTO[n]x~MLS[n]nθthix~MLS[n]x~MLS[nθt]ej2πki(nθt)Nn>θt,\begin{aligned} q_{\tilde{n}}\left[n\right]&=y_{\mathrm{MLS}}^{(l_{i})}\left[n\right]\cdot\tilde{x}_{\mathrm{MLS}}\left[n\right]\\ &=\begin{cases}y_{\mathrm{TO}}\left[n\right]\cdot\tilde{x}_{\mathrm{MLS}}\left[n\right]&n\leq\theta_{\mathrm{t}}\\ \\ h_{i}\cdot\tilde{x}_{\mathrm{MLS}}\left[n\right]\tilde{x}_{\mathrm{MLS}}\left[n-\theta_{\mathrm{t}}\right]\cdot\mathrm{e}^{\mathrm{j}\frac{2\pi k_{i}\left(n-\theta_{\mathrm{t}}\right)}{N}}&n>\theta_{\mathrm{t}}\end{cases}\end{aligned}, (6)

we get

Qn~[k]=1Nn=0θt1yTO[n]x~MLS[n]ej2πnkN+1Nn=θtN2hixMLS[n]xMLS[nθt]ej2πki(nθt)Nej2πnkN1Nn=θtN2hixMLS[n]xMLS[nθt]ej2πki(nθt)Nej2πnkN.\begin{array}[]{l}{Q_{\tilde{n}}}\left[k\right]=\frac{1}{{\sqrt{N}}}\sum\nolimits_{n=0}^{{\theta_{\rm{t}}}-1}{{y_{{\rm{TO}}}}\left[n\right]\cdot{{\tilde{x}}_{{\rm{MLS}}}}\left[n\right]{{\rm{e}}^{{\rm{-j}}\frac{{2{\rm{\pi}}nk}}{N}}}}\\ +\frac{1}{{\sqrt{N}}}\sum\nolimits_{n={\theta_{\rm{t}}}}^{N-2}{{h_{i}}\cdot{x_{{\rm{MLS}}}}\left[n\right]{x_{{\rm{MLS}}}}\left[{n-{\theta_{\rm{t}}}}\right]\cdot{{\rm{e}}^{{\rm{j}}\frac{{2{\rm{\pi}}{k_{i}}\left({n-{\theta_{\rm{t}}}}\right)}}{N}}}{{\rm{e}}^{{\rm{-j}}\frac{{2{\rm{\pi}}nk}}{N}}}}\\ \approx\frac{1}{{\sqrt{N}}}\sum\nolimits_{n={\theta_{\rm{t}}}}^{N-2}{{h_{i}}\cdot{x_{{\rm{MLS}}}}\left[n\right]{x_{{\rm{MLS}}}}\left[{n-{\theta_{\rm{t}}}}\right]\cdot{{\rm{e}}^{{\rm{j}}\frac{{2{\rm{\pi}}{k_{i}}\left({n-{\theta_{\rm{t}}}}\right)}}{N}}}{{\rm{e}}^{{\rm{-j}}\frac{{2{\rm{\pi}}nk}}{N}}}}\end{array}. (7)

When k=kik={k_{i}}, according to (5), we obtain

|Qn~[ki]|=|hi|N|n=θtN2xMLS[n]xMLS[nθt]||hi|N(1+θt)PMLSN1|hi|NPMLS.\begin{array}[]{c}\left|{{Q_{\tilde{n}}}\left[{{k_{i}}}\right]}\right|=\frac{{\left|{{h_{i}}}\right|}}{{\sqrt{N}}}\left|{\sum\nolimits_{n={\theta_{\rm{t}}}}^{N-2}{{x_{{\rm{MLS}}}}\left[n\right]{x_{{\rm{MLS}}}}\left[{n-{\theta_{\rm{t}}}}\right]}}\right|\\ \leq\frac{{\left|{{h_{i}}}\right|}}{{\sqrt{N}}}\frac{{\left({1+{\theta_{\rm{t}}}}\right){P_{{\rm{MLS}}}}}}{{N-1}}\ll\frac{{\left|{{h_{i}}}\right|}}{{\sqrt{N}}}{P_{{\rm{MLS}}}}\end{array}. (8)

Thus, when θt0{\theta_{\rm{t}}}\neq 0 and θd=0{\theta_{\rm{d}}}=0, |Qn~[k]|\left|{{Q_{\tilde{n}}}\left[k\right]}\right| does not exhibit a significant peak.

This completes the proof.

References

  • [1] M. H. Abid, I. A. Talin, and M. I. Kadir, “Wavelet-aided OTFS for RIS-assisted high-mobility wireless channels,” IEEE Wireless Communications Letter, vol. 13, no. 6, pp. 1611–1615, 2024.
  • [2] A. Singh, S. Sharma, M. Sharma, K. Deka, and D. B. da Costa, “Autoencoder based end-to-end OTFS system design with hardware impairments,” IEEE Wireless Communications Letters, 2024, in Press. DOI 10.1109/LWC.2024.3412240.
  • [3] P. Raviteja, K. T. Phan, and Y. Hong, “Embedded pilot-aided channel estimation for OTFS in delay–doppler channels,” IEEE transactions on vehicular technology, vol. 68, no. 5, pp. 4906–4917, 2019.
  • [4] W. Yuan, S. Li, Z. Wei, J. Yuan, and D. W. K. Ng, “Data-aided channel estimation for OTFS systems with a superimposed pilot and data transmission scheme,” IEEE wireless communications letters, vol. 10, no. 9, pp. 1954–1958, 2021.
  • [5] N. Hashimoto, N. Osawa, K. Yamazaki, and S. Ibi, “Channel estimation and equalization for CP-OFDM-based OTFS in fractional doppler channels,” in 2021 IEEE International Conference on Communications Workshops (ICC Workshops).   IEEE, 2021, pp. 1–7.
  • [6] Z. Wei, W. Yuan, S. Li, J. Yuan, and D. W. K. Ng, “Off-grid channel estimation with sparse bayesian learning for OTFS systems,” IEEE Transactions on Wireless Communications, vol. 21, no. 9, pp. 7407–7426, 2022.
  • [7] M. Bayat and A. Farhang, “Time and frequency synchronization for OTFS,” IEEE Wireless Communications Letters, vol. 11, no. 12, pp. 2670–2674, 2022.
  • [8] S. Li, M. Zhang, C. Ju, D. Wang, W. Chen, P. Zhou, and D. Wang, “Downlink carrier frequency offset estimation for OTFS-based LEO satellite communication system,” IEEE Communications Letters, 2023.
  • [9] Y. Hong, T. Thaj, and E. Viterbo, Delay-Doppler Communications: Principles and Applications.   Academic Press, 2022.
  • [10] W. Yuan, Z. Wei, J. Yuan, and D. W. K. Ng, “A simple variational Bayes detector for orthogonal time frequency space (OTFS) modulation,” IEEE transactions on vehicular technology, vol. 69, no. 7, pp. 7976–7980, 2020.