Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Maximum likelihood synchronization algorithm correction for photon-counting communications with blocking loss

Open Access Open Access

Abstract

To realize deep space optical communications with high capacity and sensitivity, synchronization of pulse-position modulation (PPM) signals is crucial. In this study, the maximum likelihood synchronization algorithm based on inter-symbol guard times was generalized to the scenario with strong blockage of single-photon detectors, where higher PPM slot frequency and signal-noise ratio could be adopted. Furthermore, a slot frequency offset compensation method was proposed, and simulations and experiments were performed to verify the performance improvement of the proposed corrected synchronization algorithm under blockage. The results indicated that the deadtime-corrected synchronization scheme could effectively overcome the performance degradation of the original model under high photon flux, provide estimation (0.02749 slots @ root-mean-square error) close to the Cramér-Rao Bound, and error rates close to ideal synchronization in the experiment.

© 2023 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement

1. Introduction

Owing to advancements in deep space exploration, photon-counting communication systems based on pulse position modulation (PPM) and single-photon detectors have been widely applied to deep space optical communication to achieve high photon efficiency [13]. In such systems, the arrival time of the optical pulse is detected and demodulated at the receiver to recover the information from transmitter. However, because demodulation depends on the arrival time of photons, the PPM slot clock discrepancy between communication terminals, including frequency and phase offsets, introduces symbol errors [4]. Therefore, clock synchronization is crucial in photon-counting PPM communication systems.

Various slot and frame synchronization schemes are applicable to different scenarios of optical PPM communication systems. Previously, a slot edge detection synchronization scheme based on integral circuits was proposed in [5], and a few schemes using the special PPM acquisition sequences for timing synchronization were studied [68]. In [8], under the data link up of 622 Mbps at the ground optical receiver of the Lunar Laser Communications Demonstration (LLCD) project, the combination of synchronization sequence detection based on autocorrelation values and early-late gate was used to verify the slot and frame synchronization performance. However, the synchronization performance of such schemes depends on the insertion period and length of the acquisition sequence, which occupies data transmission bandwidth. In [9], the two synchronization schemes based on pilot and inter-symbol guard slots were compared. In [10], a maximum a posteriori (MAP) estimator and particle filter were used to estimate random phase and frequency jitters for slot synchronization. Studies [11,12] adopted a slot synchronization method that used several gated clocks at the receiver with the same frequency as that of the transmitter and different phase delays. Thereafter, the clock with the maximum pulse counts inside the gate was selected as the receiver clock. However, the precision was determined using the number of phase divisions requiring multiple sampling clocks, which hinders system implementation. In [13], a real-time slot clock recovery based on oversampling and pulse matching filter was introduced. However, the synchronization accuracy was limited by the oversampling factor, and the sampling clock frequency restricted the communication transmission bandwidth.

Another feasible synchronization technology in PPM communication is based on the maximum likelihood estimator (MLE) [14,15]. R. Rogalin et al. utilized an inter-symbol guard time (ISGT) containing the timing information of symbol boundaries and MLE for excellent performance and low-complexity timing estimation scheme [16,17], which will be applied to the synchronization module in the optical receiver of NASA’s Deep Space Optical Communications (DSOC) project, scheduled for September 2023 [18]. Similarly, [19] applied MLE to the 2${\times} $1 multiple-in single-out (MISO) optical systems, which use the sampling frequency of the transmitter clock without requiring explicit slot synchronization sequences, thereby maximizing the data bandwidth resources.

However, the MLE model in [1619] is based on the assumption of blocking mitigation [20] by a large scale detector array (e.g. a 64-pixel tungsten silicide SNSPD) [21], wherein the slot counts obey the ideal Poisson statistics well, whose mean varies linearly with the slot offset. Since the fabrication of large-scale array is currently facing technological challenges such as low multi-pixel yield, difficulty in controlling the uniformity of thin films and nanowires, and the complexity of parallel signal readout electronics, medium-scale arrays (8-elements, 16-elements) [22] or single-pixel detectors in deep space optical communications still have advantages in communication applications with different data rates in terms of stability and cost.

In order to achieve high data rate and slot signal-noise ratio (SNR), the slot width is reduced to the sub-dead time scale and the photon flux is increased. Furthermore, the blocking effects become significant [22,23] and the nonlinearity caused by blocking in the estimation model becomes more apparent, resulting in performance degradation of the original algorithm. Therefore, the present study extends the application of maximum likelihood synchronization algorithm to the sub-deadtime slot scenario with blocking loss and introduces the corresponding corrections to the model.

The main contributions are summarized as follows:

  • 1. The renewal process was used to derive the distribution of photon arrivals in sub-deadtime slots, and the corrected MLE was proposed for the PPM symbol boundary offset between communication terminals, considering the blocking effect. Thereafter, the Cramér-Rao lower bounds (CRLB) were deduced and compared with the corrected algorithm.
  • 2. The corrected MLE and linear-least-squares (LLS) algorithm were combined to estimate and compensate for the actual slot frequency offset between terminals.
  • 3. The synchronization performance was evaluated using simulation and an experiment based on a single-photon detector. The results indicated that the proposed synchronization method can significantly improve the degradation of the original model under severe blockage and achieve an error performance similar to ideal synchronization. Meanwhile, we add simulation based on medium-scale arrays to proves that our algorithm can also provide better timing estimation performance than the original algorithm under medium and low blocking conditions when a detector array is applied to partially mitigate blockage.

The remainder of the paper is organized as follows. Section 2 describes the model, wherein subsection 2.1 describes the MLE with deadtime correction, subsection 2.2 provides the CRLB, and subsection 2.3 introduces the slot frequency offset compensation. Section 3 introduces the simulation performance of the algorithm and the experiment based on a single-photon detector, including the experimental design and result analysis. Simulation based on detector arrays is also performed in this section. Finally, the conclusions are presented in Section 4.

2. Model

2.1 Estimation algorithm with deadtime correction

Essentially, the scenarios, wherein the proposed algorithm is applicable, are discussed. A modulated symbol consists of M and P number of PPM and ISGT slots, respectively, which contain no optical pulses. At the receiver, a same-frequency slot clock is used to divide the photon arrivals into slot bins. However, owing to transmission delay, crystal oscillator frequency drift, and Doppler frequency shift, a timing offset $\tau $ (slot phase offset) between the TX and RX symbol boundaries may exist. Without timing offset compensation, photons falling into adjacent slots cause erroneous demodulation and increased bit-error rate (BER).

Furthermore, for scenarios with severe blockage, the slot width ${T_s}$ is shorter than the detector deadtime ${\tau _\textrm{d}}$. For non-photon-number-resolution detectors, only one photon per slot is detected, and the duration of optical pulse is equal to the slot width when high-speed electro-optical modulation is applied. The measured ${\tau _\textrm{d}}$ was 28.5 ns, and to ensure the complete recovery of detector at the arrival of each pulsed slot, the parameters were set as M = 8, P = 4, ${T_s}$=10 ns. However, the inter-symbol interference caused by the detector’s deadtime may reduce the response probability of pulsed slots.

The impact of detector deadtime on estimation model is discussed as follows. For ${T_s} \le {\tau _\textrm{d}}$, the photon arrival distribution within the sub-deadtime slot $\textrm{f (t)}$ is attributed to the first photon detected in the slot. Thus, the first photon detection can be regarded as a renewal process [23].

For the pulsed slot with uniform intensity and duration of ${T_s}$, the immediate failure probability at time $\textrm{t}$, $\phi (t) = \lambda ,\textrm{ }t \in [0,{T_s}]$. Here, for ease of understanding, we can treat $\lambda $ as the Poisson intensity. And $\textrm{f(t)}$ is the probability density function of the survival time, given as follows:

$$f(t) = \phi (t)\exp ( - \phi (t)t) = \left\{ {\begin{array}{{cc}} {\lambda \exp ( - \lambda t)}&{0 \le t \le {T_s}}\\ 0&{t > {T_s}} \end{array}} \right.$$

Eq. (1) provides the theoretical distribution $\textrm{f (t)}$ of photon arrivals within the slot. Fig. 1(a) shows $\textrm{f (t)}$ with different Poisson intensities and histograms of simulated photon arrivals for comparison. Fig. 1(b) shows the time-digital converter (TDC) histograms of measured photon arrivals detected using a single photon avalanche diode (SPAD).

 figure: Fig. 1.

Fig. 1. (a) Normalized arrival time distribution of detected photons in the slot under different Poisson intensity $\lambda $.$f(t)$ and simulation results are compared. (b) TDC histogram of SPAD-detected photon timestamps.${K_\textrm{s}} = \lambda {T_s}$. The distribution degenerates to uniform as $\lambda \to 0$.

Download Full Size | PDF

Owing to the detector’s deadtime, the photon arrivals within a slot do not obey the uniform distribution mentioned in [16,17] when the Poisson intensity increases. Additionally, the average counts in each slot within a symbol are related to the offset between the symbol boundaries of TX/RX. Let the symbol boundary offset that RX succeeds TX be $\tau = k + \varepsilon $, where k and $\varepsilon $ are the integer and fractional parts of $\tau $, respectively. The counts of each slot within N symbols $x[n],n = 0,1, \ldots N(M + P) - 1$ are cyclically accumulated into the aggregated slot vector $\boldsymbol{y} = [{y_0},{y_1}, \cdots ,{y_{M + P - 1}}]$, wherein${y_m} = \sum\nolimits_{i = 0}^{N - 1} {x[i(M + P) + m]} ,m = 0,1, \ldots M + P - 1.$This vector provides sufficient statistic samples for estimating each slot count. As shown in Fig. 2, the percentage leakage of average photon counts from the last TX PPM slot to the first RX guard slot, $\varepsilon ^{\prime}({K_s},\varepsilon )$, is non-linear with fractional offset $\varepsilon $. Furthermore, it also depends on the average number of signal photons in the signal slots ${K_\textrm{s}}$ and background photons in each slot ${K_\textrm{b}}$.

$$\varepsilon ^{\prime}({K_s},\varepsilon ) = 1 - \frac{{\int_0^{(1 - \varepsilon ){T_\textrm{s}}} {\lambda [{1 - \exp ( - \lambda t)} ]dt} }}{{\int_0^{{T_\textrm{s}}} {\lambda [{1 - \exp ( - \lambda t)} ]dt} }} = \frac{{\exp [{ - (1 - \varepsilon )({K_s} + {K_b})} ]- \exp [{ - ({K_s} + {K_b})} ]}}{{1 - \exp [{ - ({K_s} + {K_b})} ]}}$$

 figure: Fig. 2.

Fig. 2. Mean photon numbers contained in each slot of a symbol at RX when $\tau $ and ${\tau _d}$ exist. The red slots represent the RX slots, wherein the photon counts are affected by non-integer timing offset $\varepsilon $, whereas the blue slots remain unaffected. PPM slots and ISGT are represented by semi-transparent and shaded rectangles, respectively.

Download Full Size | PDF

After correction, the average counts in each slot of a symbol, namely ${\lambda _m}^{\prime}(\tau )$, is derived as Eq. (3) with the approximation $({(1 - \varepsilon^{\prime}) + \varepsilon } )N{K_b} \approx N{K_b}$, which is reasonable for high slot SNR requirement (${K_\textrm{s}} \gg {K_b}$) essential for obtaining reliable BER. Therefore, the approximated noise term has negligible influence on estimation performance. Furthermore, only the signal photon term includes the offset. Fig. 2 depicts the relationship between ${\lambda _m}^{\prime}(\tau )$ and fractional offset $\varepsilon $.

$${\lambda _m}^{\prime}(\tau ) = \left\{ \begin{array}{lr} \frac{{1 - \exp [{ - (1 - \varepsilon )({K_s} + {K_b})} ]}}{{1 - \exp [{ - ({K_s} + {K_b})} ]}}\frac{N}{M}{K_s} + N{K_b},&m = k\bmod (M + P)\\ \frac{N}{M}{K_s} + N{K_b},& \textrm{ }m \in \{ k + 1,\ldots ,k + M - 1\} \bmod (M + P)\\ \frac{{\exp [{ - (1 - \varepsilon )({K_s} + {K_b})} ]- \exp [{ - ({K_s} + {K_b})} ]}}{{1 - \exp [{ - ({K_s} + {K_b})} ]}}&\frac{N}{M}{K_s} + N{K_b},\textrm{ }m = (k + M)\bmod (M + P)\\ N{K_b},& \textrm{ }m \in \{ k + M + 1,\ldots ,k + M + P - 1\} \bmod (M + P) \end{array} \right.$$

The probability mass function of each slot count ${y_m}$ within ${y}$ can be obtained using Eq. (3), and the count process is modeled as Poisson statistics [24]

$${P_{{Y_m}|\tau ({y_m}|\tau )}} = \frac{{{\lambda _m}^{\prime}{{(\tau )}^{{y_m}}}\exp ({ - {\lambda_m}^{\prime}(\tau )} )}}{{{y_m}!}}$$

And ${\lambda _m}^{\prime}(\tau )$ could be considered as the sum of signal term and noise term, namely:

$${\lambda _m}^{\prime}(\tau ) = \frac{N}{M}{K_{s,m}}^{\prime}(\tau ) + N{K_b}$$
${K_{s,m}}^{\prime}(\tau )$ can be considered as the average number of signal photons in the m-th slot of the symbol with a timing offset $\varepsilon $. Let m = 0, we have:
$${K_{s,0}}^{\prime}(\tau ) = \left\{ {\begin{array}{{lr}} {\frac{{1 - \exp [{ - (1 - \varepsilon )({K_s} + {K_b})} ]}}{{1 - \exp [{ - ({K_s} + {K_b})} ]}}{K_s}}&{\textrm{ },\tau \bmod (M + P) \in [0,1]}\\ 0&{\textrm{ },\tau \bmod (M + P) \in [1,P]}\\ {\frac{{\exp [{ - (1 - \varepsilon )({K_s} + {K_b})} ]- \exp [{ - ({K_s} + {K_b})} ]}}{{1 - \exp [{ - ({K_s} + {K_b})} ]}}{K_s}}&{\textrm{ },\tau \bmod (M + P) \in [P,P + 1]}\\ {{K_s}}&{,\tau \bmod (M + P) \in [P + 1,M + P]} \end{array}} \right.$$

Then, ${K_{s,m}}^{\prime}(\tau )$ in the rest (m-1) slots can be written as cyclic shifts of ${K_{s,0}}^{\prime}(\tau )$:

$${K_{s,m}}^{\prime}(\tau ) = {K_{s,0}}^{\prime}({(\tau - m)\bmod (M + P)} )$$

The log-likelihood function $\ell ^{\prime}(\tau ;y)$ of ${P_{{Y_m}|\tau ({y_m}|\tau )}}$ given an offset $\tau $ is

$$\begin{aligned} \ell ^{\prime}(\tau ;y) &= \log \prod\limits_{m = 0}^{M + P - 1} {{P_{{Y_m}|\tau }}({y_m}|\tau )} \\& = \sum\limits_{m = 0}^{M + P - 1} {{y_m}\log {\lambda _0}^{\prime}[(\tau - m)\bmod (M + P)] - {\lambda _0}^{\prime}((\tau - m)\bmod (M + P)) - \log ({y_m}!)} \\& = \sum\limits_{m = 0}^{M + P - 1} {{y_m}\log \{ \frac{N}{M}{K_{s,0}}^{\prime}[(\tau - m)\bmod (M + P)] + N{K_b}\} + cons} t \end{aligned}$$

Because the sum of the last two terms in $\ell ^{\prime}(\tau ;y)$ is independent of $\tau $, it can be discarded as a constant to compare the likelihood functions corresponding to M + P slots. When $\tau $ equals to the actual symbol boundary offset, the maximum likelihood estimation is obtained using Eq. (8). Therefore, the actual offset can be obtained by maximizing the function $\ell ^{\prime}(\tau ;y)$ with respect to $\tau $. Because this function is not differentiable at integer values, the zeros of partial derivative equations of $\ell ^{\prime}(\tau ;y)$ are obtained with respect to $\tau $ over M + P integer intervals.$\tau \in ({j,j + 1} ),j = 0,1, \ldots M + P - 1.$From Eqs. (6)–(7), for each j, the first and second order partial derivatives of ${K_{s,m}}^{\prime}(\tau )$ with respect to $\tau $ are non-zero when $m = ({j + M} )\bmod ({M + P} )$ or $m = j\bmod ({M + P} )\textrm{. }$Thus, the local optimal estimate of $\tau $ on each interval $(j,j + 1)$ is:

$${\hat{\tau }_{ML,(j,j + 1)}} = ({j + 1} )+ {({{K_s} + {K_b}} )^{ - 1}} \cdot \log \textrm{A}$$
with
$$\begin{array}{l} \textrm{A} = {\left[ {({{y_{_{({j + M} )\bmod (M + P)}}} + {y_{_{j\bmod (M + P)}}}} )\frac{{N{K_s}}}{M}} \right]^{ - 1}} \times \left( {\{{{y_{({j + M} )\bmod (M + P)}} + {y_{j\bmod (M + P)}}\exp [{ - ({{K_s} + {K_b}} )} ]} \}\frac{{N{K_s}}}{M}} \right.\\ { + ({{y_{({j + M} )\bmod (M + P)}} - {y_{_{j\bmod (M + P)}}}} )\{{1 - \exp [{ - ({{K_s} + {K_b}} )} ]} \}N{K_b}} )\end{array}$$

Furthermore, adding the constraint for ${\hat{\tau }_{ML,(j,j + 1)}}$ to each integer interval is crucial

$${\hat{\tau }_{ML,(j,j + 1)}} = \left\{ {\begin{array}{{cc}} {\begin{array}{{ll}} j\\ {{{\hat{\tau }}_{ML,(j,j + 1)}}}\\ {j + 1} \end{array}}&{\begin{array}{{l}} {,{{\hat{\tau }}_{ML,(j,j + 1)}} \le j}\\ {,j < {{\hat{\tau }}_{ML,(j,j + 1)}} < j + 1}\\ {,{{\hat{\tau }}_{ML,(j,j + 1)}} \ge j + 1} \end{array}} \end{array}} \right.$$

Finally, the local optimal offset estimation with the largest likelihood function value is selected as the overall timing offset estimation

$${\hat{\tau }_{ML}} = \mathop {\arg \max }\limits_{{{\hat{\tau }}_{ML,(j,j + 1)}}} \ell ^{\prime}({\hat{\tau }_{ML,(j,j + 1)}},y)$$

Furthermore, a set of photon arrivals were simulated with blocking loss. For comparison, the log-likelihood function $\ell (\tau ;y)$ from the original algorithm in [16] and $\ell ^{\prime}(\tau ;y)$ in Eq. (8) are plotted in Fig. 3. The estimated offsets before and after correction are 6.4858 and 6.7059 slot, respectively. Hence, the original algorithm degrades when affected by blockage.

 figure: Fig. 3.

Fig. 3. Log-likelihood function before and after deadtime correction (denoted by blue and red, respectively). The modified likelihood function loses symmetry on each integer subinterval. The horizontal coordinates of the open circles are the local optimal estimates of timing offset in each subinterval. The estimated ${\hat{\tau }_{ML}}$ equals to 6.71 and 6.49 slot with and without correction, respectively. Furthermore, $M = 8.\textrm{ }P = 4.\textrm{ }{K_s} = 2.\textrm{ }{K_b} = 0.0001.\textrm{ }N = 5000.\textrm{ }\tau \textrm{ = 6}\textrm{.70 slot}\textrm{. }{\tau _d} = 3{T_s}.$

Download Full Size | PDF

2.2 Cramér-Rao lower bound

In estimation theory and statistics, CRLB represents the lower limit of the variance of an unbiased estimator for a deterministic but unknown parameter. The minimum value of the variance of such an estimator is equal to the reciprocal of Fisher information that represents the upper limit of an unbiased estimator’s accuracy [25,26]. Thus, with the given parameters, the optimal estimation performance of the offset estimator is provided using its CRLB. However, its function with respect to input parameters varies owing to the deadtime correction. For the estimator in Eq. (9), the new CRLB value is derived to compare the performances of MLE algorithms in subsequent sections.

First, the Fisher information $I(\tau )$ is calculated, which equals to the second partial derivative of $\ell ^{\prime}(\tau ;y)$ with respect to $\tau $

$$I(\tau ) ={-} \mathrm{\mathbb{E}}\left[ {\frac{{{\partial^2}}}{{\partial {\tau^2}}}l^{\prime}(\tau ;y)} \right]$$

Because $\ell ^{\prime}(\tau ;y)$ is not differentiable at integer slot offsets, the interval of $\tau $ is $\tau \in (j,j + 1)$, and the aggregated photon counts of each slot in ${y}$ obey the Poisson statistics. Hence, the mean of ${y_m}$ is ${\lambda _m}(\tau )^{\prime}$, wherein $1 - \varepsilon = j + 1 - \tau $

$$\begin{array}{l} \mathrm{\mathbb{E}}[{y_{({j + M} )\bmod \textrm{ }(M + P)}}] = \frac{{\exp [{ - (j + 1 - \tau )({{K_s} + {K_b}} )} ]- \exp [{ - ({{K_s} + {K_b}} )} ]}}{{1 - \exp [{ - ({{K_s} + {K_b}} )} ]}}\frac{N}{M}{K_s} + N{K_b}\\ \mathrm{\mathbb{E}}[{y_{j\bmod \textrm{ }(M + P)}}] = \frac{{1 - \exp [{ - (j + 1 - \tau )({{K_s} + {K_b}} )} ]}}{{1 - \exp [{ - ({{K_s} + {K_b}} )} ]}}\frac{N}{M}{K_s} + N{K_b} \end{array}$$

Therefore, the CRLB of corrected MLE is

$$\begin{array}{l} C(\tau ) = {I^{ - 1}}(\tau )\\ = \frac{{{K_s}^2\frac{{1 - \exp [{ - (1 - \varepsilon )({{K_s} + {K_b}} )} ]}}{{1 - \exp [{ - ({{K_s} + {K_b}} )} ]}}\left( {1 - \frac{{1 - \exp [{ - (1 - \varepsilon )({{K_s} + {K_b}} )} ]}}{{1 - \exp [{ - ({{K_s} + {K_b}} )} ]}}} \right) + M{K_s}{K_b} + {M^2}{K_b}^2}}{{{{\left[ {{K_s}({{K_s} + {K_b}} )\frac{{\exp [{ - (1 - \varepsilon )({{K_s} + {K_b}} )} ]}}{{1 - \exp [{ - ({{K_s} + {K_b}} )} ]}}} \right]}^2}\left( {\frac{N}{M}{K_s} + 2N{K_b}} \right)}} \end{array}$$

Herein, the CRLB descents with $O({N^{ - 1}})$; however, it exhibits a non-linear relationship with the flux parameter ${K_s}$ and fractional offset $\varepsilon $.

Second, the estimation of $\tau $ using Eq. (9) is unbiased by including deadtime correction. From Eq. (13), it can be inferred that

$$\mathrm{\mathbb{E}}\{{\exp [{ - ({j + 1 - {{\hat{\tau }}_{ML,(j,j + 1)}}} )({K_s} + {K_b})} ]} \}= \exp [{ - (j + 1 - \tau )({{K_s} + {K_b}} )} ]$$

According to the corollary of Jensen's inequality [27], for convex exponential functions, if X represents a random variable, then

$$\exp ({\mathrm{\mathbb{E}}[X ]} )\le \mathrm{\mathbb{E}}[{\exp (X )} ]$$

Therefore, let $X = \exp [{ - ({j + 1 - {{\hat{\tau }}_{ML,(j,j + 1)}}} )({{K_s} + {K_b}} )} ]$.

Using Eqs. (15)–(16), the following is obtained:

$$\exp [{ - (j + 1 - \tau )({{K_s} + {K_b}} )} ]\ge \exp [{ - ({j + 1 - \mathrm{\mathbb{E}}[{{{\hat{\tau }}_{ML,(j,j + 1)}}} ]} )({{K_s} + {K_b}} )} ]$$
and
$$\mathrm{\mathbb{E}}[{{{\hat{\tau }}_{ML,(j,j + 1)}}} ]\le \tau$$

However, the mean of estimated offsets approaches the actual offset as ${K_s}$ and N increase, which is also demonstrated in the numerical results of Section 3.1.

2.3 Non-ideal frequency offset compensation

In actual communication scenarios, the non-ideal factors affecting the MLE performance include the slot clock frequency offset $\gamma $ between the transmitter and receiver. When the accumulated symbol number N is sufficiently large, the estimated timing offset $\tau $ is significantly affected by the small $\gamma $ owing to its short slot duration of several nanoseconds. The frequency offset $\gamma $ is attributed to the frequency error of oscillator and on-chip PLL (such as the mixed-mode clock manager (MMCM) of FPGA), which is related to the device itself and other factors, such as ambient temperature and Doppler frequency shift.

From Fig. 4(a)-(b), for the same offset $\tau $, the existence of $\gamma $ has a significant influence on the aggregated slot vector. Let the actual slot duration at the transmitter and receiver be ${T_t}$ and ${T_r}$, respectively. Assuming an initial symbol boundary offset of ${\tau _0}{T_t}$, under the continuous accumulation effect of $\gamma $, the offset at the start of the $N\textrm{ - th}$ symbol at the receiver transforms to

$${\tau _\textrm{n}} = ({{\tau_0}{T_t} - N({M + P} )\gamma {T_r}} )\bmod (M + P){T_r}$$
where $\gamma = ({{T_r} - {T_t}} )/{T_r}$.

 figure: Fig. 4.

Fig. 4. $N = 5 \times {10^4},\textrm{ }{K_s} = 1,\textrm{ }{K_\textrm{b}}\textrm{ = 0}\textrm{.0001, }\tau = 6.70\textrm{ slot}.$ (a) ${{y}_{m}}$ with no slot frequency offset. (b) ${{y}_{m}}$ with a slot clock frequency offset $\gamma = 5 \times {10^{ - 6}}$ between the TX and RX terminals. (c)-(e) Frequency offset estimation using linear least squares (LLS) and maximum likelihood estimator (MLE). Red and blue triangles correspond to the results of MLE with and without deadtime correction, respectively. (c) corresponds to K instances of phase offset estimates without frequency compensation. (d) demonstrates re-estimated phase offsets after compensating the frequency offset once. While the influence of frequency offset is neglectable in (e) because the compensation of frequency offset has been performed twice.

Download Full Size | PDF

The accumulation time used to estimate $\gamma $ is short compared to the required time during which, the crystal oscillator temperature drift and Doppler shifts trigger slot frequency variation (despite using tens of ${\hat{\tau }_{ML}}$ to estimate $\gamma $, the time required is several milliseconds); hence, $\gamma $ is considered to be constant in each frequency offset estimation. Thereafter, the real ${\tau _\textrm{n}}$ and estimated offsets ${\hat{\tau }_{ML}}$ increase linearly with $N.$Therefore, slot photon counts are collected in $K \times N$ consecutive symbols to generate K consecutive estimated offsets ${\hat{\tau }_{ML,1}},\textrm{ }\ldots \textrm{ ,}{\hat{\tau }_{ML,K}}$ using the MLE algorithm. Finally, $\gamma $ is estimated by leveraging the linear relationship between ${\hat{\tau }_{ML}}$ and the cumulative number of slots.

In Fig. 4(c), the variation in ${\hat{\tau }_{ML}}$ was simulated with respect to the cumulative number of slots when ${\tau _0} = 6.7,\textrm{ }\gamma ={-} 5 \times {10^{ - 6}},\textrm{ }{\tau _d} = 3{T_s}$. Here, $K = 40,\textrm{ }N = 5 \times {10^4}\textrm{, }{K_s} = 1,\textrm{ }{K_b} = 0.0001$. Because $\gamma $ causes linear variation in estimated offsets, its effect on MLE before and after deadtime correction is approximately the same. Applying the LLS method to $K$ estimated offsets for slope calculation, the estimated slot frequency offset $\hat{\gamma }$ is obtained. Figures 4(d)-(e) illustrate K re-estimated offsets ${\hat{\tau }_{ML}}$ after compensating slot frequency offset once and twice, respectively. Evidently, the influence of $\gamma $ can be eliminated after compensation, and proper values of K and N can be selected based on the photon flux and synchronization accuracy requirement for practical applications.

3. Quantitative performance

3.1 Simulation results

Before characterizing the estimation performance, the CRLB indicating the optimal estimator's performance with given parameters, is discussed.

In Figs. 5(a)-(b), the surface with blue grid represents the original form of CRLB in [14] without considering deadtime effects. The average photon counts within the slot varies linearly with the timing offset $\tau $. Herein, CRLB is symmetric about the fractional offset $\varepsilon $ and decreases with $O({K_\textrm{s}}^{ - 1})$ and $O({N^{ - 1}})$. The corrected CRLB is plotted on the surface with red grid. Owing to the exponential suppression of deadtime on the photon arrival time distribution, CRLB decreases linearly with $O({N^{ - 1}})$ after correction. Furthermore, the fractional offsets $\varepsilon $ and $1 - \varepsilon $ are dissimilar, and CRLB attains a minima as ${K_\textrm{s}}$ increases.

 figure: Fig. 5.

Fig. 5. Distribution of CRLB1/2 before (denoted by blue grid) and after (denoted by red grid) deadtime correction. (a) The variation of CRLB1/2 with ${K_s}$ and $\varepsilon $. $N = 5000,\textrm{ }{K_b} = 0.0001.$(b) The variation of CRLB1/2 with $N$ and $\varepsilon $. ${K_s} = 1,\textrm{ }{K_b} = 0.0001$

Download Full Size | PDF

When $\varepsilon \to 0$ and ${K_s}$∼10 photons/symbol, CRLB attains its minima and continues to increase, in contrast to the situation when $\varepsilon \to 1$, in which the minima of CRLB appears at larger ${K_s}$, indicating an asymmetric CRLB with respect to $\varepsilon $. However, in DSOC, the received photon flux achieving a reliable BER is generally of the order 0.1∼10 photons/symbol. Therefore, the theoretical optimal performance of the corrected MLE can attain the level of ${10^{ - 2}}$ slot at root mean square error (RMSE), despite $\varepsilon $ approaching zero.

Furthermore, the performances of MLE algorithms before and after deadtime correction under various $\varepsilon ,\; {K_s},\; and\; N,$ have been discussed. To verify the estimation performance quantitatively, serially concatenated PPM-coded (SCPPM) frames of random binary data with a total length of 15120 (length of the interleaver) were randomly sent, and the response of single photon detectors to the pulsed slots was simulated using the Monte-Carlo method. The method for generating photon arrival timestamps is similar to [28], and the detector efficiency recovery model was changed to the step function for SPAD. In the simulation, the relative parameters were set as follows: ${\tau _\textrm{d}} = 3{T_\textrm{s}},\textrm{ }M = 8,\textrm{ }P = 4$. To verify the performance improvement of MLE after deadtime correction, the slot frequency offset was set to zero.

The MLE performance is characterized by $\textrm{RMSE}({\hat{\tau }_{ML}}) = \sqrt {\mathrm{\mathbb{E}}[{{{({{{\hat{\tau }}_{ML}} - \tau } )}^2}} ]}$, RMSE of ${\hat{\tau }_{ML}}$, and $\textrm{bias}({{{\hat{\tau }}_{ML}}} )= \mathrm{\mathbb{E}}({{{\hat{\tau }}_{ML}}} )- \tau$, representing the bias between the mean of ${\hat{\tau }_{ML}}$ and actual offset. In Fig. 6, the corrected $\textrm{CRLB}{({{K_s},\varepsilon } )^{1/2}}$ values are plotted for comparison.

 figure: Fig. 6.

Fig. 6. (a) $\textrm{RMSE}({\hat{\tau }_{ML}})$vs. $({{K_s},\varepsilon } )$ before (marked with blue grid) and after (marked with red grid) deadtime correction. The black grid surface is $\textrm{CRLB}{({{K_s},\varepsilon } )^{\textrm{1/2}}}$ after deadtime correction. (b)$\textrm{bias}({{{\hat{\tau }}_{ML}}} )$vs. $({{K_s},\varepsilon } )$ before (marked with blue grid) and after (marked with red grid) deadtime correction. (c) $\textrm{RMSE}({\hat{\tau }_{ML}})$ vs. ${K_s}$ at several fixed $\varepsilon .$(d) $\textrm{bias}({{{\hat{\tau }}_{ML}}} )$vs.${K_s}$ at several fixed $\varepsilon .$

Download Full Size | PDF

Figures 6(a)-(b) show the variation in estimation performance with $\varepsilon ,\textrm{ }{K_s}$ when $N = 5000,\textrm{ }{K_b} = 0.0001$. For each pair of $({{K_s},\varepsilon } )$, two-thousand ${\hat{\tau }_{ML}}$ values were estimated to calculate the corresponding RMSE and bias. Figures 6(c)-(d) show the relationship between RMSE and bias at several fixed fractional offsets $\varepsilon $.

In Eq. (2), owing to reduction of blocking effect, the percentage of photon leakage into adjacent guard slots, $\varepsilon ^{\prime}({K_s},\varepsilon )$ degrades to the fractional offset $\varepsilon $ at low photon fluxes

$$\varepsilon ^{\prime}{({K_s},\varepsilon )_{{K_s} \to 0 + }} = {\left. {\frac{{\exp [{ - (1 - \varepsilon )({{K_s} + {K_b}} )} ]- \exp [{ - ({{K_s} + {K_b}} )} ]}}{{1 - \exp [{ - ({{K_s} + {K_b}} )} ]}}} \right|_{{K_s} \to 0 + }} = \varepsilon$$

Therefore, the RMSE and bias values of ${\hat{\tau }_{ML}}$ are similar to those before correction at low fluxes. As the flux increases, particularly in the typical intensity range of communication ${K_\textrm{s}} \in [{0.1,\textrm{ }10} ],$ the original MLE experiences significant performance degradation, whereas the RMSE and bias values obtained by the corrected MLE are better than those before correction by 1∼2 orders of magnitude. The performance difference is further enlarged as $\varepsilon \to 1$. Further increase in the intensity of flux (e.g., ${K_\textrm{s}} > 10$ photons/symbol) causes performance degradation of the corrected MLE as $\varepsilon \to 0$, which can be attributed to the non-monotonic variation in CRLB with ${K_s}$, as shown in Fig. 5(a). Figure 6(b) and 6(d), and Eq. (18) indicate that the corrected estimate does not satisfy the unbiased estimation, and the bias approaches zero as flux intensity increases. Contrastingly, insufficient photon flux is not conducive to ensuring frame synchronization and low error rate in communication. Furthermore, excessive photon flux is difficult to realize in large loss scenarios, such as deep space link. Thus, the proposed MLE algorithm exhibits better performance within the suitable photon flux range for communication.

Figure 7 shows the variations in estimation performance with $\varepsilon ,\textrm{ }N$ when ${K_b} = 0.0001$ and ${K_s} = 1.0$. Furthermore, to calculate the RMSE and bias, 2000 ${\hat{\tau }_{ML}}$ values were estimated for each pair of $({N,\varepsilon } )$. Figures 7(a)-(d) indicate that the estimation performances before and after correction improve as N increases, and RMSE after correction is approximately equal to CLRB1/2. However, RMSE experienced saturation as N increased, which can be attributed to the following reasons.

 figure: Fig. 7.

Fig. 7. (a)$RMSE({\hat{\tau }_{ML}})$ vs. $({N,\varepsilon } )$ before (marked with blue grid) and after (marked with red grid) deadtime correction. The black grid surface is $CRLB{({N,\varepsilon } )^{\textrm{1/2}}}$ after deadtime correction. (b) $bias({{{\hat{\tau }}_{ML}}} )$ vs. $({N,\varepsilon } )$ before (marked with blue grid) and after (marked with red grid) deadtime correction. (c)$RMSE({\hat{\tau }_{ML}})$ vs.$N$ at several fixed $\varepsilon .$ (d)$bias({{{\hat{\tau }}_{ML}}} )$ vs.$N$ at several fixed $\varepsilon .$

Download Full Size | PDF

The mean-square-error (MSE) of the estimated offsets ${\hat{\tau }_{ML}}$ consists of its variance $\mathrm{\mathbb{D}}[{{{\hat{\tau }}_{ML}}} ]$ and bias $bias({\hat{\tau }_{ML}})$:

$$\textrm{MSE}({\hat{\tau }_{ML}}) = \mathrm{\mathbb{D}}[{{{\hat{\tau }}_{ML}}} ]+ \textrm{bias}{({\hat{\tau }_{ML}})^2}$$

When uncertain data is mapped to PPM slots, the distribution of aggregate slot counts obeys a combination of Poisson and binomial distributions [17], wherein the mean and variance are unequal. Furthermore, because ${\hat{\tau }_{ML}}$ is a biased estimate based on Eq. (18), there may be some terms that do not converge to zero as N increases in $\mathrm{\mathbb{D}}[{{{\hat{\tau }}_{ML}}} ]$.

In order to evaluate the timing estimation performance of the algorithm under the influence of other factors, we also characterize the timing estimation performance before and after correction under the scenarios of higher background noise (scenario 2-3), higher modulation order (scenario 4-5) and arrays of different scale (scenario 6-7) (8-pixels, 16-pixels). In these simulations, we mainly focus on the RMSE of offset estimation $\textrm{RMSE}({\hat{\tau }_{ML}})$ as signal flux intensity ${K_s}$ increases.

Table 1 listed other example scenarios 2-7 for which the estimation performance is simulated, while communication scenario 1 has already been simulated above in Figs. 67.

Tables Icon

Table 1. The system parameters for which the timing estimation is simulated

In scenario 2-3, higher noise level was assumed (${K_b} = {10^{ - 3}},{10^{ - 2}}$ detected photons/slot) which may occur due to incident background light and photon leakage from electro-optic modulation, while other system parameters keep unchanged, the estimation performance is shown in two subfigures of Fig. 8(a). The $\textrm{RMSE}({\hat{\tau }_{ML}})$ after correction in these scenarios can still reach the order of 10−2 slot under blocking loss, but we can see from the difference between dashed curves (${K_b} = {10^{ - 3}}$) and solid curves (${K_b} = {10^{ - 2}}$) that higher noise level can negatively affect the estimation performance, both for the corrected and original model.

 figure: Fig. 8.

Fig. 8. (a) Under higher noise level, simulated $\textrm{RMSE}({\hat{\tau }_{ML}})$vs.${K_s}$ at $\varepsilon = 0.3\textrm{ and 0}\textrm{.9}.$Dashed curves correspond to scenario 2 when ${K_b} = {10^{ - 3}}$ and solid curves correspond to scenario 3 when ${K_b} = {10^{ - 2}}$. (b) Use higher PPM order, simulated $\textrm{RMSE}({\hat{\tau }_{ML}})$vs.${K_s}$ at $\varepsilon = 0.3\textrm{ and 0}\textrm{.9}.$Dashed curves correspond to scenario 4 when M = 16 and solid curves correspond to scenario 5 when M = 64.

Download Full Size | PDF

In scenario 4-5, higher PPM order was assumed (M = 16, 64) and the symbol scale N is set to the number of symbols contained in an SCPPM frame. The simulation results are shown in two subfigures of Fig. 8(b). Increasing the PPM order clearly has a more negative impact on the estimation performance than the noise, which may significantly reduce the contrast between PPM slot counts and guard slot counts in the aggregate slot vector $\boldsymbol{y}$. And we can also find from Eq. (14) in this paper and Eq. (25) of [17] that CRLB will grow with $O({M^3})$, so the target RMSE of 10−2 slot level at high PPM orders put forward higher requirements for low noise levels.

Although increasing noise and PPM order will both degrade timing estimation performance, we can mitigate the noise to 10−2 level at slot frequency more than hundreds of MHz by various ways such as high modulation extinction ratio transmitter [29] and adaptive optical receivers [30]. Additionally, higher-order PPM modulation also introduces more loss on data bandwidth. Therefore, in high-speed deep space communication applications, the algorithm proposed here is still effective.

Another fact we aim to verify through simulation is that the corrected estimation is an extension of the original model under blocking conditions. In array applications, this algorithm can also alleviate synchronization performance losses that may occur in small to medium-scale arrays due to moderate blocking. In large-scale arrays capable of significantly mitigating blocking loss, the performance of the corrected algorithm approaches that of the original one. Scenario 6 and 7 illustrate such two cases, and the corresponding performance is shown in Fig. 9(a)-(b). It can be observed that our proposed approach is not only effective for synchronization estimation under strong blocking conditions for single detector. Moreover, when the array cannot completely eliminate detector blockage, the modified algorithm further compensates for estimation performance loss. And the algorithm also exhibits higher tolerance to noise levels in array detection scenarios (${K_b} = {10^{ - 2}}$).

 figure: Fig. 9.

Fig. 9. Detector array configuration with slight blocking. (a) Scenario 6, simulated $\textrm{RMSE}({\hat{\tau }_{ML}})$vs. ${K_s}$ at several fixed $\varepsilon $ with an 8-pixel array. (b) Scenario 7, simulated $\textrm{RMSE}({\hat{\tau }_{ML}})$vs. ${K_s}$ at several fixed $\varepsilon $ with a 16-pixel array.

Download Full Size | PDF

3.2 Experimental verification

In this section, an experiment is designed to verify the performance of the proposed MLE algorithm, and the communication performance after synchronization. In the experimental system, the slot phase and frequency offset, respectively denoted as $\tau \textrm{ and }\gamma $, exist between the transmitter and receiver. Furthermore, the detector experiences severe blockage owing to the insufficient slot duration. The schematic diagram of the experimental system is shown in Fig. 10.

 figure: Fig. 10.

Fig. 10. Schematic diagram of the experimental system for verifying the performance of MLE algorithm. The binary data frame is loaded into the FPGA (Xilinx, XC7K325T-2FFG900C) and sent in a loop by GTX transceiver. RF amplifier driver (iXBlue, DR-VE-10-MO) amplifies the signal and drives the laser (Omicron, LuxX + 450-500) to generate modulated laser pulses. The beam enters the free space through the collimator and undergoes a fixed attenuation (50 dB) and adjustable attenuation ($\le $40 dB) to simulate channel loss. Pulses attenuated to several photons are detected by an SPAD (Excelitas, SPCM-AQRH-13-FC, deadtime is 28.5 ns). Thereafter, the rising edges of the detector output pulses are converted into timestamps by TDC (qutools, quTAG-MC-32) as the input for estimation algorithms. An auxiliary frame with the same length of data frame is transmitted using another GTX channel and drives an SFP optical transceiver (Accelink, RTXM192-500). This auxiliary signal is used for obtaining actual phase offset to compare with the offset estimation and does not exist in practical communication scenarios. Furthermore, a PIN detector (Thorlabs, DET08CFC) is used for photoelectric conversion to feed the waveform into TDC for obtaining timestamps. The pulsed slot of each symbol in the auxiliary frame is fixed at the first slot, and the interval between adjacent pulses equals to 8-PPM + 4ISGT symbol duration.

Download Full Size | PDF

Herein, the random binary data are encoded with SCPPM frames of 8PPM + 4ISGT modulation and 2/3 code rate and using MATLAB. Frame synchronization is required prior to the BER calculation. Hence, an FSM32 (frame synchronization marker) marker with the length of 32 symbols is added at the beginning of each encoded frame to perform frame synchronization based on autocorrelation value peak searching. Each element of FSM32 is mapped to an 8PPM + 4ISGT symbol. The marker is obtained by connecting the FSM8 marker [31] twice in reverse to realize better autocorrelation characteristics and ensure frame synchronization robustness under various SNRs. The autocorrelation characteristics of FSM8 and FSM32 are shown in Fig. 11. The total frame consists of 60684 bits comprising 5072 symbols.

 figure: Fig. 11.

Fig. 11. Autocorrelation characteristics of FSM8 and FSM32.

Download Full Size | PDF

The actual slot width ${T_\textrm{s}}$ used herein is 12 ns instead of 10 ns, owing to the optical pulse stretching (as shown in the top-left subfigure of Fig. 2(b)), which is caused by the bandwidth limitation of laser modulation ($\le $100 MHz) and additional system jitter (∼1 ns FWHM, mainly from SPAD). Considering the guard slots insertion and encoding redundancy, the final pulse repetition frequency is 6.94 MHz, with an effective data rate of 13.89Mbps. The data rate could be improved to hundreds of Mbps or Gbps by applying high extinction ratio electro-optic modulation and detectors with high count rate and low temporal jitter parameters (such as SNSPD) to address the limiting factors.

$N = 5072$ symbols were used to generate each estimated offset ${\hat{\tau }_{ML}}.$ After the slot frequency offset compensation ($\gamma $ is about ${10^{ - 6}}$), 100 consecutive estimated phase offsets were selected to calculate the RMSE and bias from the actual phase offset ${\tau _{real}}$, which was obtained using the auxiliary frame signal detected by PIN and the single-photon signal detected by SPAD, as shown in Fig. 12(a)-(b). The auxiliary signal behaved as a periodic signal with period equal to the symbol duration including path delay. Using the rising edge of auxiliary signal as trigger, the histogram of SPAD output timestamps reflected the actual path delay of the SPAD signal relative to the auxiliary signal. The actual symbol boundary offset ${\tau _{real}}$ remained almost constant (equal to the path delay between the two signals) because the starting point of the receiver symbol was set at the auxiliary signal timestamp. Therefore, the estimation performance before and after correction could be characterized under different signal intensities.

 figure: Fig. 12.

Fig. 12. (a) The yellow signal is the auxiliary signal waveform output by the PIN detector, and whose period is equal to the symbol duration of 144 ns. The green signal is the single-photon response TTL pulse output by SPAD. (b) The histogram of the rising edge timestamp of the SPAD response pulse using that of the auxiliary signal as a trigger. The exact position of the symbol boundary at the receiver is determined using the lowest hard decision BER.

Download Full Size | PDF

A photometer was used to calibrate the signal intensity and set various attenuation values. Using the aforementioned methods, the experimental performances of the deadtime-corrected and uncorrected MLE algorithms under different intensities are shown in Fig. 13. In Fig. 13(a), the black solid lines in each subFig. indicate the corresponding ${\tau _{real}}$ at each signal intensity. Owing to the inter-symbol interference, ${\tau _{real}}$ decreases slightly with increase in attenuation. However, ${\hat{\tau }_{ML}}$ values estimated at each intensity were compared to the current ${\tau _{real}}$ values. The blue and red hollow circles represent ${\hat{\tau }_{ML}}$ before and after deadtime-correction, respectively, and the solid lines of the corresponding colors represent the mean of 100 estimated offsets. Figures 13(b)-(c) quantitatively compare the RMSE and bias of ${\hat{\tau }_{ML}}$ in Fig. 13(a) with simulation results and CRLB1/2 under the same parameters. Figures 13(a)-(c) indicate that in the experimental and simulation results, the two algorithms exhibited similar performances at low photon flux, thereby validating Eq. (20) that the deadtime-corrected model degrades to a linear offset model at low flux. As the intensity increases, the RMSE of the deadtime-corrected offset estimate ${\tau _{ML}}_{ - deadtime}$ decreases, and the mean gradually approaches ${\tau _{real}}$, whereas the estimate ${\tau _{ML}}_{ - uncorrected}$ based on the linear offset model suffered serious performance degradation.

 figure: Fig. 13.

Fig. 13. Experimental results. (a) Estimate of PPM + ISGT symbol boundary offset between TX and RX (phase offset) using the two algorithms under different photon fluxes. $N = 5072$, estimate number = 100. (b) Experimental RMSE of ${\hat{\tau }_{ML}}$ using the following two algorithms: uncorrected (blue solid triangle) and corrected (red solid triangle). Black open triangles represent CRLB1/2 in Eq. (14). Simulated RMSE under experimental parameters are plotted with open triangles of corresponding colors. (c)$\textrm{bias}({{{\hat{\tau }}_{ML}}} )$ of experimental and simulation results obtained using the two algorithms. Simulated bias under experimental parameters are plotted with open triangles of corresponding colors. (d) Experimental hard decision BERs of PPM demodulation under various photon fluxes using the MLE without correction (blue triangle) and with deadtime correction (red triangle). Black triangles are hard decision BERs at ideal synchronization. (e) SCPPM-decoded BERs using the following two synchronization algorithms: uncorrected (blue open pentagram) and corrected (red open pentagram). (f-g) Autocorrelation results of the FSM32 marker after phase and frequency offset compensation at different photon fluxes.

Download Full Size | PDF

Notably, the experimental and simulation results differ at low photon flux in Fig. 13(b)-(c) because the shape of photon arrival distribution within the slot approaches the modulated laser pulse superimposed with jitter. Owing to the limited laser modulation bandwidth, the optical pulse is similar to the Gaussian rather than rectangular pulse (see the top-left subfigure of Fig. 2(b)), which is inconsistent with the assumption of rectangular pulses in the model. Increasing the electro-optic modulation bandwidth can effectively overcome this limitation. At higher photon flux, the exponential distribution distortion caused by blocking effect gradually dominates and the impact of non-rectangular modulation pulses decreases; hence, the observed simulation and experimental performance tend to be consistent.

Because low photon intensity is not suitable for reliable communication, the synchronization performance at higher flux is investigated. Based on the experimental results, RMSE of the deadtime-corrected offset estimate can reach 0.02749 slots at ${K_s} = 2.45,{K_b} = 0.0037$ and approach the lower bound, whereas the uncorrected model has an RMSE of 0.18734 slots under the same conditions. The CRLB1/2 in the Fig. 13(b) was calculated using Eq. (14) and the corresponding experimental parameters.

Simultaneously, Figures 13(f)-(g) show the frame synchronization results of the FSM32 marker after slot synchronization, including slot frequency and phase offset compensation. After frame synchronization, Figures 13(d)-(e) show the hard decision BER using PPM demodulation and decoded BER, respectively. Evidently, the frame synchronization performance and hard decision BER at ideal synchronization do not satisfy the requirements of reliable communication at low photon flux (see the black hollow triangles in Fig. 13(d)). They improved with increasing signal intensity; however, the performance degradation of the uncorrected MLE decreases the BER. The hard decision BER synchronized using the original MLE is 7.28%, whereas performance close to ideal synchronization (5.67%) was obtained using the corrected synchronization algorithm. The decoded BER decreased from 3.11 × 10−5 before correction to less than 10−6 after correction. These experimental results prove that the deadtime-corrected MLE synchronization scheme can effectively solve the performance degradation of the original model under higher photon flux.

4. Conclusion

This study investigated the synchronization of PPM photon-counting communication systems containing slot frequency and phase offsets between the terminals, and detector blockage owing to sub-deadtime slots. First, the deadtime-correction was introduced to MLE based on ISGT in [16,17] using the renewal process, and the variations in CRLB and expectation of the estimator were described. Second, a method to compensate slot frequency offset using LLS and MLE algorithms was proposed. Third, the synchronization performances (including the RMSE and bias of estimated offsets) of MLE under various parameters were quantitatively simulated before and after correction. The corrected MLE was observed to degenerate to the original form at low signal intensity; however, it effectively improved the original model’s performance degradation under higher photon flux. Finally, experiments were performed to validate the theory and simulation results. At a signal flux intensity of ${K_\textrm{s}} = 2.45$ photons/symbol and $N = 5072$, the synchronization performance of the corrected MLE attained 0.02749 slots @RMSE. The hard decision BER approached the performance at ideal synchronization (5.67%), and the decoded BER was less than 10−6. Contrastingly, the original MLE's estimation performance was 0.18734 slots @RMSE, corresponding to hard decision and decoded BERs of 7.28% and 3.11 × 10−5 respectively.

Our work provides a viable solution for realizing the synchronization of PPM photon counting communication systems with blocking loss. And in future work, we will verify our algorithm on higher-speed communication systems based on superconducting nanowire single-photon detectors.

Funding

Ministry of Science and Technology of the People's Republic of China (National Key R&D Program of China (2020YFB2205900)); Science and Technology Commission of Shanghai Municipality (Shanghai Sci. & Tech. Major Project (2019SHZDZX01)); Youth Innovation Promotion Association of the Chinese Academy of Sciences (Youth Innovation Promotion Association); Shanghai Institute of Technical Physics, Chinese Academy of Sciences (Innovation Project of SITP, CAS (CX-425)).

Acknowledgment

The authors want to thank Dr. J. Wu for his valuable suggestions on this work.

Disclosures

The authors declare no conflicts of interest.

Data availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

References

1. X. Sun, D. R. Skillman, E. D. Hoffman, D. Mao, J. F. McGarry, L. McIntire, R. S. Zellar, F. M. Davidson, W. H. Fong, and M. A. Krainak, “Free space laser communication experiments from Earth to the Lunar Reconnaissance Orbiter in lunar orbit,” Opt. Express 21(2), 1865–1871 (2013). [CrossRef]  

2. M. Srinivasan, E. Alerstam, E. Wollman, R. Rogalin, S. Meenehan, M. Shaw, A. E. Velasco, A. Biswas, N. Richard, and D. Cho, “The Deep Space Optical Communications project ground laser receiver,” in Free-Space Laser Communications XXXV, (SPIE, 2023), 195–206.

3. D. M. Boroson, J. J. Scozzafava, D. V. Murphy, and B. S. Robinson, “The lunar laser communications demonstration (LLCD),” in 2009 Third IEEE International Conference on Space Mission Challenges for Information Technology, (IEEE, 2009), 23–28.

4. K. Yan, S. Cheng, H.-C. Wu, H. Xiao, and X. Zhang, “Analysis and rectification of the asynchronous sampling effect in the pulse-position modulation systems,” IEEE Sensors J. 20(8), 4189–4199 (2020). [CrossRef]  

5. R. Gagliardi, “Synchronization using pulse edge tracking in optical pulse-position modulated communication systems,” IEEE Trans. Commun. 22(10), 1693–1702 (1974). [CrossRef]  

6. R. Gagliardi, J. Robbins, and H. Taylor, “Acquisition sequences in ppm communications (corresp.),” IEEE Trans. Inf. Theory 33(5), 738–744 (1987). [CrossRef]  

7. K. Rahnamai, P. Arabshahi, and T.-Y. Yan, “A computationally intelligent fast acquisition algorithm for deep space optical communications,” in Proc. Int. Conf. Signal Processing Applications and Technology, (1998).

8. M. Willis, B. Robinson, M. Stevens, B. Romkey, J. Matthews, J. Greco, M. Grein, E. Dauler, A. Kerman, and D. Rosenberg, “Downlink synchronization for the lunar laser communications demonstration,” in 2011 International Conference on Space Optical Systems and Applications (ICSOS), (IEEE, 2011), 83–87.

9. K. J. Quirk, J. W. Gin, and M. Srinivasan, “Optical PPM synchronization for photon counting receivers,” in MILCOM 2008-2008 IEEE Military Communications Conference, (IEEE, 2008), 1–7.

10. M. S. Bashir and S. S. Muhammad, “Time synchronization in photon-limited deep space optical communications,” IEEE Trans. Aerosp. Electron. Syst. 56(1), 30–40 (2020). [CrossRef]  

11. Q. R. Yan, M. Wang, W. H. Dai, and Y. H. Wang, “Synchronization scheme of photon-counting underwater optical wireless communication based on PPM,” Opt. Commun. 495, 127024 (2021). [CrossRef]  

12. G. Wen, J. Huang, L. Zhang, C. Li, T. Wen, and J. Wang, “A high-speed and high-sensitivity photon-counting communication system based on multichannel SPAD detection,” IEEE Photonics J. 13(2), 1–10 (2021). [CrossRef]  

13. J. Huang, C. Li, J. Dai, R. Shu, L. Zhang, and J. Wang, “Real-Time and High-Speed Underwater Photon-Counting Communication Based on SPAD and PPM Symbol Synchronization,” IEEE Photonics J. 13(5), 1–9 (2021). [CrossRef]  

14. C. N. Georghiades, “Optimum joint slot and symbol synchronization for the optical PPM channel,” IEEE Trans. Commun. 35(6), 632–636 (1987). [CrossRef]  

15. K. Kiasaleh, “Joint maximum likelihood symbol and slot synchronization for optical OPPM channels,” IEEE Trans. Commun. 39(5), 632–635 (1991). [CrossRef]  

16. R. Rogalin and M. Srinivasan, “Maximum likelihood synchronization for pulse position modulation with inter-symbol guard times,” in 2016 IEEE Global Communications Conference (GLOBECOM), (IEEE, 2016), 1–6.

17. R. Rogalin and M. Srinivasan, “Synchronization for optical ppm with inter-symbol guard times,” IPN Progress Report 42, 209 (2017).

18. M. Srinivasan, R. Rogalin, N. Lay, M. Shaw, and A. Tkacenko, “Downlink receiver algorithms for deep space optical communications,” in Free-Space Laser Communication and Atmospheric Propagation XXIX, (SPIE, 2017), 69–79.

19. Y. Li, T. Geng, and S. Gao, “Likelihood based synchronization algorithms in optical pulse position modulation systems with photon-counting receivers,” Opt. Express 30(17), 31472–31485 (2022). [CrossRef]  

20. B. Moision, M. Srinivasan, and J. Hamkins, “The blocking probability of Geiger-mode avalanche photo-diodes,” in Satellite Data Compression, Communications, and Archiving, (SPIE, 2005), 137–146.

21. M. Shaw, F. Marsili, A. Beyer, R. Briggs, J. Allmaras, and W. H. Farr, “Superconducting nanowire single photon detectors for deep space optical communication (Conference Presentation),” in Free-Space Laser Communication and Atmospheric Propagation XXIX, (SPIE, 2017), 145.

22. W. Zhang, J. Huang, C. Zhang, L. You, C. Lv, L. Zhang, H. Li, Z. Wang, and X. Xie, “A 16-pixel interleaved superconducting nanowire single-photon detector array with a maximum count rate exceeding 1.5 GHz,” IEEE Trans. Appl. Supercond. 29(8), 1–7 (2019). [CrossRef]  

23. D. R. Cox, Renewal theory (Methuen, 1962), Chap.1.

24. R. M. Gagliardi and S. Karp, Optical communications (Wiley, 1976).

25. H. Cramér, Mathematical methods of statistics (Princeton University, 1999), Vol. 26.

26. C. Radhakrishna Rao, “Information and accuracy attainable in the estimation of statistical parameters,” Bull. Calcutta. Math. Soc. 37, 1–13 (1945). [CrossRef]  

27. D. Chandler, “Introduction to modern statistical,” Mechanics. Oxford University, Oxford, UK5, 449 (1987).

28. T. Wen, J. Huang, J. Huang, H. Li, L. You, Y. Si, X. Guo, L. Zhang, and J. Wang, “Improved response model of a superconducting nanowire array for high photon count rate communication,” Opt. Commun. 537, 129437 (2023). [CrossRef]  

29. J. Dailey, M. Dinu, R. Prego, J. Kolchmeyer, M. Berry, A. Monte, J. Engelberth, A. Maliakal, A. Piccirilli, and J. LeGrange, “High output power laser transmitter for high-efficiency deep-space optical communications,” in Free-Space Laser Communications XXXI, (SPIE, 2019), 110–121.

30. S. Lee, K. E. Wilson, and M. Troy, “Background noise mitigation in deep-space optical communications using adaptive optics,” IPN Progress Report 42, 1–16 (2005).

31. “Red Book, Optical communications coding and synchronization,” (CCSDS 142.0-B-1, 2018).

Data availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (13)

Fig. 1.
Fig. 1. (a) Normalized arrival time distribution of detected photons in the slot under different Poisson intensity $\lambda $.$f(t)$ and simulation results are compared. (b) TDC histogram of SPAD-detected photon timestamps.${K_\textrm{s}} = \lambda {T_s}$. The distribution degenerates to uniform as $\lambda \to 0$.
Fig. 2.
Fig. 2. Mean photon numbers contained in each slot of a symbol at RX when $\tau $ and ${\tau _d}$ exist. The red slots represent the RX slots, wherein the photon counts are affected by non-integer timing offset $\varepsilon $, whereas the blue slots remain unaffected. PPM slots and ISGT are represented by semi-transparent and shaded rectangles, respectively.
Fig. 3.
Fig. 3. Log-likelihood function before and after deadtime correction (denoted by blue and red, respectively). The modified likelihood function loses symmetry on each integer subinterval. The horizontal coordinates of the open circles are the local optimal estimates of timing offset in each subinterval. The estimated ${\hat{\tau }_{ML}}$ equals to 6.71 and 6.49 slot with and without correction, respectively. Furthermore, $M = 8.\textrm{ }P = 4.\textrm{ }{K_s} = 2.\textrm{ }{K_b} = 0.0001.\textrm{ }N = 5000.\textrm{ }\tau \textrm{ = 6}\textrm{.70 slot}\textrm{. }{\tau _d} = 3{T_s}.$
Fig. 4.
Fig. 4. $N = 5 \times {10^4},\textrm{ }{K_s} = 1,\textrm{ }{K_\textrm{b}}\textrm{ = 0}\textrm{.0001, }\tau = 6.70\textrm{ slot}.$ (a) ${{y}_{m}}$ with no slot frequency offset. (b) ${{y}_{m}}$ with a slot clock frequency offset $\gamma = 5 \times {10^{ - 6}}$ between the TX and RX terminals. (c)-(e) Frequency offset estimation using linear least squares (LLS) and maximum likelihood estimator (MLE). Red and blue triangles correspond to the results of MLE with and without deadtime correction, respectively. (c) corresponds to K instances of phase offset estimates without frequency compensation. (d) demonstrates re-estimated phase offsets after compensating the frequency offset once. While the influence of frequency offset is neglectable in (e) because the compensation of frequency offset has been performed twice.
Fig. 5.
Fig. 5. Distribution of CRLB1/2 before (denoted by blue grid) and after (denoted by red grid) deadtime correction. (a) The variation of CRLB1/2 with ${K_s}$ and $\varepsilon $. $N = 5000,\textrm{ }{K_b} = 0.0001.$(b) The variation of CRLB1/2 with $N$ and $\varepsilon $. ${K_s} = 1,\textrm{ }{K_b} = 0.0001$
Fig. 6.
Fig. 6. (a) $\textrm{RMSE}({\hat{\tau }_{ML}})$vs. $({{K_s},\varepsilon } )$ before (marked with blue grid) and after (marked with red grid) deadtime correction. The black grid surface is $\textrm{CRLB}{({{K_s},\varepsilon } )^{\textrm{1/2}}}$ after deadtime correction. (b)$\textrm{bias}({{{\hat{\tau }}_{ML}}} )$vs. $({{K_s},\varepsilon } )$ before (marked with blue grid) and after (marked with red grid) deadtime correction. (c) $\textrm{RMSE}({\hat{\tau }_{ML}})$ vs. ${K_s}$ at several fixed $\varepsilon .$(d) $\textrm{bias}({{{\hat{\tau }}_{ML}}} )$vs.${K_s}$ at several fixed $\varepsilon .$
Fig. 7.
Fig. 7. (a)$RMSE({\hat{\tau }_{ML}})$ vs. $({N,\varepsilon } )$ before (marked with blue grid) and after (marked with red grid) deadtime correction. The black grid surface is $CRLB{({N,\varepsilon } )^{\textrm{1/2}}}$ after deadtime correction. (b) $bias({{{\hat{\tau }}_{ML}}} )$ vs. $({N,\varepsilon } )$ before (marked with blue grid) and after (marked with red grid) deadtime correction. (c)$RMSE({\hat{\tau }_{ML}})$ vs.$N$ at several fixed $\varepsilon .$ (d)$bias({{{\hat{\tau }}_{ML}}} )$ vs.$N$ at several fixed $\varepsilon .$
Fig. 8.
Fig. 8. (a) Under higher noise level, simulated $\textrm{RMSE}({\hat{\tau }_{ML}})$vs.${K_s}$ at $\varepsilon = 0.3\textrm{ and 0}\textrm{.9}.$Dashed curves correspond to scenario 2 when ${K_b} = {10^{ - 3}}$ and solid curves correspond to scenario 3 when ${K_b} = {10^{ - 2}}$. (b) Use higher PPM order, simulated $\textrm{RMSE}({\hat{\tau }_{ML}})$vs.${K_s}$ at $\varepsilon = 0.3\textrm{ and 0}\textrm{.9}.$Dashed curves correspond to scenario 4 when M = 16 and solid curves correspond to scenario 5 when M = 64.
Fig. 9.
Fig. 9. Detector array configuration with slight blocking. (a) Scenario 6, simulated $\textrm{RMSE}({\hat{\tau }_{ML}})$vs. ${K_s}$ at several fixed $\varepsilon $ with an 8-pixel array. (b) Scenario 7, simulated $\textrm{RMSE}({\hat{\tau }_{ML}})$vs. ${K_s}$ at several fixed $\varepsilon $ with a 16-pixel array.
Fig. 10.
Fig. 10. Schematic diagram of the experimental system for verifying the performance of MLE algorithm. The binary data frame is loaded into the FPGA (Xilinx, XC7K325T-2FFG900C) and sent in a loop by GTX transceiver. RF amplifier driver (iXBlue, DR-VE-10-MO) amplifies the signal and drives the laser (Omicron, LuxX + 450-500) to generate modulated laser pulses. The beam enters the free space through the collimator and undergoes a fixed attenuation (50 dB) and adjustable attenuation ($\le $40 dB) to simulate channel loss. Pulses attenuated to several photons are detected by an SPAD (Excelitas, SPCM-AQRH-13-FC, deadtime is 28.5 ns). Thereafter, the rising edges of the detector output pulses are converted into timestamps by TDC (qutools, quTAG-MC-32) as the input for estimation algorithms. An auxiliary frame with the same length of data frame is transmitted using another GTX channel and drives an SFP optical transceiver (Accelink, RTXM192-500). This auxiliary signal is used for obtaining actual phase offset to compare with the offset estimation and does not exist in practical communication scenarios. Furthermore, a PIN detector (Thorlabs, DET08CFC) is used for photoelectric conversion to feed the waveform into TDC for obtaining timestamps. The pulsed slot of each symbol in the auxiliary frame is fixed at the first slot, and the interval between adjacent pulses equals to 8-PPM + 4ISGT symbol duration.
Fig. 11.
Fig. 11. Autocorrelation characteristics of FSM8 and FSM32.
Fig. 12.
Fig. 12. (a) The yellow signal is the auxiliary signal waveform output by the PIN detector, and whose period is equal to the symbol duration of 144 ns. The green signal is the single-photon response TTL pulse output by SPAD. (b) The histogram of the rising edge timestamp of the SPAD response pulse using that of the auxiliary signal as a trigger. The exact position of the symbol boundary at the receiver is determined using the lowest hard decision BER.
Fig. 13.
Fig. 13. Experimental results. (a) Estimate of PPM + ISGT symbol boundary offset between TX and RX (phase offset) using the two algorithms under different photon fluxes. $N = 5072$, estimate number = 100. (b) Experimental RMSE of ${\hat{\tau }_{ML}}$ using the following two algorithms: uncorrected (blue solid triangle) and corrected (red solid triangle). Black open triangles represent CRLB1/2 in Eq. (14). Simulated RMSE under experimental parameters are plotted with open triangles of corresponding colors. (c)$\textrm{bias}({{{\hat{\tau }}_{ML}}} )$ of experimental and simulation results obtained using the two algorithms. Simulated bias under experimental parameters are plotted with open triangles of corresponding colors. (d) Experimental hard decision BERs of PPM demodulation under various photon fluxes using the MLE without correction (blue triangle) and with deadtime correction (red triangle). Black triangles are hard decision BERs at ideal synchronization. (e) SCPPM-decoded BERs using the following two synchronization algorithms: uncorrected (blue open pentagram) and corrected (red open pentagram). (f-g) Autocorrelation results of the FSM32 marker after phase and frequency offset compensation at different photon fluxes.

Tables (1)

Tables Icon

Table 1. The system parameters for which the timing estimation is simulated

Equations (22)

Equations on this page are rendered with MathJax. Learn more.

f(t)=ϕ(t)exp(ϕ(t)t)={λexp(λt)0tTs0t>Ts
ε(Ks,ε)=10(1ε)Tsλ[1exp(λt)]dt0Tsλ[1exp(λt)]dt=exp[(1ε)(Ks+Kb)]exp[(Ks+Kb)]1exp[(Ks+Kb)]
λm(τ)={1exp[(1ε)(Ks+Kb)]1exp[(Ks+Kb)]NMKs+NKb,m=kmod(M+P)NMKs+NKb, m{k+1,,k+M1}mod(M+P)exp[(1ε)(Ks+Kb)]exp[(Ks+Kb)]1exp[(Ks+Kb)]NMKs+NKb, m=(k+M)mod(M+P)NKb, m{k+M+1,,k+M+P1}mod(M+P)
PYm|τ(ym|τ)=λm(τ)ymexp(λm(τ))ym!
λm(τ)=NMKs,m(τ)+NKb
Ks,0(τ)={1exp[(1ε)(Ks+Kb)]1exp[(Ks+Kb)]Ks ,τmod(M+P)[0,1]0 ,τmod(M+P)[1,P]exp[(1ε)(Ks+Kb)]exp[(Ks+Kb)]1exp[(Ks+Kb)]Ks ,τmod(M+P)[P,P+1]Ks,τmod(M+P)[P+1,M+P]
Ks,m(τ)=Ks,0((τm)mod(M+P))
(τ;y)=logm=0M+P1PYm|τ(ym|τ)=m=0M+P1ymlogλ0[(τm)mod(M+P)]λ0((τm)mod(M+P))log(ym!)=m=0M+P1ymlog{NMKs,0[(τm)mod(M+P)]+NKb}+const
τ^ML,(j,j+1)=(j+1)+(Ks+Kb)1logA
A=[(y(j+M)mod(M+P)+yjmod(M+P))NKsM]1×({y(j+M)mod(M+P)+yjmod(M+P)exp[(Ks+Kb)]}NKsM+(y(j+M)mod(M+P)yjmod(M+P)){1exp[(Ks+Kb)]}NKb)
τ^ML,(j,j+1)={jτ^ML,(j,j+1)j+1,τ^ML,(j,j+1)j,j<τ^ML,(j,j+1)<j+1,τ^ML,(j,j+1)j+1
τ^ML=argmaxτ^ML,(j,j+1)(τ^ML,(j,j+1),y)
I(τ)=E[2τ2l(τ;y)]
E[y(j+M)mod (M+P)]=exp[(j+1τ)(Ks+Kb)]exp[(Ks+Kb)]1exp[(Ks+Kb)]NMKs+NKbE[yjmod (M+P)]=1exp[(j+1τ)(Ks+Kb)]1exp[(Ks+Kb)]NMKs+NKb
C(τ)=I1(τ)=Ks21exp[(1ε)(Ks+Kb)]1exp[(Ks+Kb)](11exp[(1ε)(Ks+Kb)]1exp[(Ks+Kb)])+MKsKb+M2Kb2[Ks(Ks+Kb)exp[(1ε)(Ks+Kb)]1exp[(Ks+Kb)]]2(NMKs+2NKb)
E{exp[(j+1τ^ML,(j,j+1))(Ks+Kb)]}=exp[(j+1τ)(Ks+Kb)]
exp(E[X])E[exp(X)]
exp[(j+1τ)(Ks+Kb)]exp[(j+1E[τ^ML,(j,j+1)])(Ks+Kb)]
E[τ^ML,(j,j+1)]τ
τn=(τ0TtN(M+P)γTr)mod(M+P)Tr
ε(Ks,ε)Ks0+=exp[(1ε)(Ks+Kb)]exp[(Ks+Kb)]1exp[(Ks+Kb)]|Ks0+=ε
MSE(τ^ML)=D[τ^ML]+bias(τ^ML)2
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.