Next Article in Journal
SpiderID_APP: A User-Friendly APP for Spider Identification in Taiwan Using YOLO-Based Deep Learning Models
Next Article in Special Issue
Development of the Phaseless Calibration Algorithm for a Digital Antenna Array
Previous Article in Journal
Review of Key Technologies of Rotary-Wing Mars UAVs for Mars Exploration
Previous Article in Special Issue
Model Problems on Oscillations of Mechanical and Biological Membranes
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Cyclic Detectors in the Fraction-of-Time Probability Framework

by
Dominique Dehay
1,†,
Jacek Leśkow
2,†,
Antonio Napolitano
3,*,† and
Timofey Shevgunov
4,†
1
IRMAR-UMR CNRS 6625, University Rennes, 35000 Rennes, France
2
Institute of Mathematics, Krakow University of Technology, 31-155 Cracow, Poland
3
Department of Engineering, University of Napoli “Parthenope”, 80143 Napoli, Italy
4
Graduate School of Business, HSE University, 101000 Moscow, Russia
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Inventions 2023, 8(6), 152; https://doi.org/10.3390/inventions8060152
Submission received: 17 October 2023 / Revised: 23 November 2023 / Accepted: 24 November 2023 / Published: 29 November 2023
(This article belongs to the Special Issue Recent Advances and New Trends in Signal Processing)

Abstract

:
The signal detection problem for cyclostationary signals is addressed within the fraction-of-time probability framework, where statistical functions are constructed starting from a single time series, without introducing the concept of stochastic process. Single-cycle detectors and quadratic-form detectors based on measurements of the Fourier coefficients of the almost-periodically time-variant cumulative distribution and probability density functions are proposed. The adopted fraction-of-time approach provides both methodological and implementation advantages for the proposed detectors. For single-cycle detectors, the decision statistic is a function of the received signal and the threshold is derived using side data under the null hypothesis. For quadratic-form detectors, the decision statistic can be expressed as a function of the received signal without using side data, at the cost of some performance degradation. The threshold can be derived analytically. Performance analysis is carried out using Monte Carlo simulations in severe noise and interference environments, where the proposed detectors provide better performance with respect to the analogous detectors based on second- and higher-order cyclic statistic measurements.

1. Introduction

Cyclostationarity is a property exhibited by almost all modulated signals adopted in communications, radar/sonar, and telemetry [1,2]. Cyclostationary signals exhibit statistical functions, such as the cumulative distribution, probability density, autocorrelation, moments, and cumulants that are periodic functions of time. More generally, these statistical functions can be almost periodic [3]; that is, they can be expressed by the superposition of sine waves with possibly incommensurate frequencies. In such a case, the signals are referred to as almost cyclostationary (ACS). The statistical properties of ACS signals are suitably described by the Fourier coefficients, referred to as cyclic statistics, of these almost-periodic functions. The frequencies of the (generalized) Fourier series expansions are related to signal parameters such as the carrier frequency, baud rate, and sampling or scanning frequency. Thus, the frequencies of the harmonics, referred to as cycle frequencies, are a characteristic of a signal. In particular, signals having different abovementioned parameters exhibit different cycle frequencies. This fact has been exploited for the design of detection and estimation algorithms that are signal selective. In fact, in the presence of a mixture of signal of interest (SOI) and disturbance, characteristics of the SOI alone can be estimated, provided that a cycle frequency of the SOI exists, which is not shared with the disturbance signal, regardless of the temporal and spectral overlap of the SOI and disturbance [1] (Chapter 14), [2] (Section 9.2).
Several cyclostationarity-based detectors have been presented in the literature. Single-cycle and multi-cycle detectors are proposed in [4,5,6], with reference to second-order statistics, and in [7], with reference to higher-order statistics. A statistical test for the presence of cyclostationarity is proposed in [8] and its application to signal detection is discussed in [2] (Section 8.4), [9]. A statistical test for the presence of spectral coherence is proposed in [10]. Spectral coherence is also exploited in [11,12]. Detection strategies based on the estimated confidence interval of estimated cyclic statistics are presented in [2] (Section 8.7). They are based on the results in [13]. Applications to cognitive radio are presented in [14,15,16,17,18]. The case of an unknown cyclostationarity period is addressed in [19,20]. The case of irregular cyclicity is treated in [21,22,23,24].
All the of abovementioned cyclostationarity-based detectors exploit measurements of second- or higher-order cyclic statistics. In this paper, a new class of cyclic detectors is proposed. Specifically, detectors based on measurements of the Fourier coefficients of the almost-periodically time-variant cumulative distribution function (CDF) and probability density function (pdf) are introduced. Numerical results presented here show that performance gains can be obtained by constructing cyclostationarity-based detectors that exploit these cyclic statistical functions.
In practical detection problems, a single realization of the received signal is available and a decision on the hypothesis “SOI not present” (null hypothesis) or “SOI present” (alternative hypothesis) must be taken on the basis of this unique observed signal. That is, no ensemble of realizations is available for making the decision. For this reason, in this paper, the statistical characterization of the received signal and of its cyclic statistical function measurements is made using the fraction-of-time (FOT) probability approach. In such an approach, a signal is modeled as a single function of time, rather than a realization of a stochastic process [1,25,26,27,28]. Then, statistical functions such as distribution, autocorrelation, moments, and cumulants are constructed, starting from this unique function of time. This approach has the methodological advantage that the statistical characterization of the measurements of the cyclic statistical functions of the received signal can be performed without resorting to any abstract stochastic process. The advantage is not only methodological but also in the detector implementation. In fact, a class of detectors is presented here such that the decision statistic is derived exclusively from the received signal, with no aid from side data under the null hypothesis, and the threshold is analytically determined.
Two classes of cyclostationarity-based detectors are considered: single-cycle (SC) detectors, and quadratic-form (QF) detectors. For each class, the decision statistic is constructed using measurements of the Fourier coefficients of the almost-periodically time-variant CDF and pdf. Moreover, for comparison purposes, analogous detectors based on measurements of second- and higher-order cyclic statistic are also considered.
Performance analysis in a very severe noise and interference environment is carried out via Monte Carlo simulations.
The novel contributions of this paper are (i) the proposal of new cyclostationarity-based detection tests that exploit the almost-periodicity of the first-order FOT CDF and pdf; (ii) the proposal of new kernel-based cyclic CDF and pdf estimators; (iii) the exploitation of the FOT approach to statistically characterize the decision statistic, in order to analytically derive the detection threshold; and (iv) the presentation of the cyclostationarity-based detectors in a unified framework that accommodates both existing and new detectors.
The paper is organized as follows: The materials and methods are presented in Section 2. Specifically, in Section 2.1, the signal decomposition into an almost-periodic component and a residual term is considered; in Section 2.2, the definitions and notation for signal analysis in the FOT approach for almost-cyclostationary signals are briefly reviewed. In Section 2.3, estimators for FOT cyclic statistical functions are presented. Specifically, the estimator for the cyclic CDF (Section 2.3.1), the new proposed kernel-based estimators for the cyclic CDF and pdf (Section 2.3.2), estimators for cyclic autocorrelation (Section 2.3.3), the cyclic spectrum (Section 2.3.4), and the 4th-order cyclic moment (Section 2.3.5) are considered. The detection problem is stated in Section 2.4 and cyclostationarity-based detectors are presented in a unified general formalism that accommodates several detection strategies. Single-cycle detectors are treated in Section 2.5, and quadratic-form detectors in Section 2.6. QF detectors based on measurements of the cyclic autocorrelation, spectrum, and moment are addressed in Section 2.6.1. A new class of QF detectors based on measurements of the cyclic CDF and pdf is presented in Section 2.6.2. For QF detectors, the detector structure is presented in Section 2.6.3. A statistical test for the presence of cyclostationarity is described in Section 2.6.4. The numerical results are reported in Section 3. The simulation setup is described in Section 3.1. The cases of threshold determined using Monte Carlo simulation and of analytically derived threshold are treated in Section 3.2 and Section 3.3, respectively. Performance analysis is carried out in Section 3.4, in terms of the probability of missed detection versus data-record length, and in Section 3.5 and Section 3.6, in terms of the receiver operating characteristic (ROC). For the QF detectors, the match or mismatch between the Monte Carlo probability of false alarm and the nominal or design probability of false alarm is analyzed in Section 3.7. A conclusive discussion is given in Section 4.

2. Materials and Methods

2.1. Signal Decomposition

Let us denote by
z ( t ) t lim T 1 T t 0 T / 2 t 0 + T / 2 z ( t ) d t
the continuous-time infinite-time average of the signal z ( t ) , provided that the limit in the right-hand side exists. When such a limit exists, it does not depend on t 0 . In notation · t , subscript t emphasizes that the average is made with respect to t.
A signal z ( t ) can be decomposed into its almost-periodic component z ap ( t ) and a residual term z r ( t ) not containing any finite-strength additive sine-wave component [2] (Section 2.3.1)
z ( t ) = z ap ( t ) + z r ( t )
where
z ap ( t ) = α A z α e j 2 π α t
is the (generalized) Fourier series of the almost-periodic component whose convergence can be uniform, or in a generalized sense [2] (Appendix B.4), [3] (Chapter 2),
z α = z ap ( t ) e j 2 π α t t = z ( t ) e j 2 π α t t α A
are the Fourier coefficients, and
z r ( t ) e j 2 π α t t = 0 α R
is the residual term. In (3), A is a countable set of possibly incommensurate frequencies.
The almost-periodic component extraction operator is defined as [2] (Definition 2.14)
E { α } { z ( t ) } z ap ( t )
that is, the operator E { α } { · } extracts all the finite-strength additive sine-wave components of its argument. This turns out to be the expectation operator in the FOT probability framework.

2.2. Fraction-of-Time Probability

In this section, a brief review of the FOT approach is provided, in order to introduce the essential definitions and notation. In the FOT approach, signals are modeled as single functions of time rather than as realizations of an ensemble of functions, namely a stochastic process. All time-invariant statistical functions such as the distribution, autocorrelation, moments, and cumulants can be constructed starting from the unique available signal by resorting to the concept of relative measure [29,30], which plays a role analogous to the probability measure in the classical stochastic approach [25]. In such a case, the infinite-time average turns out to be the expectation operator that allows one to construct time-invariant statistical functions. The time-invariant FOT approach can be extended to accommodate periodically or almost-periodically time-variant statistical functions, in order to provide a suitable FOT probabilistic description for time series that exhibit cyclostationarity. In such a case, the expectation operator is the almost-periodic component extraction operator (6). For comprehensive treatments, see [1], [2] (Chapter 2), [31,32]. For extensions, see [33,34].
Let x ( t ) be a continuous-time real-valued signal. The almost-periodic FOT cumulative distribution function (CDF) of x ( t ) is defined as [2] (Equation (2.33))
F x { α } ( ξ ; t ) E { α } { u ( ξ x ( t ) ) }
= γ Γ 1 F x γ ( ξ ) e j 2 π γ t
where
u ( ξ ) 1 ξ 0 0 ξ < 0
is the unit-step function, Γ 1 is a countable set of possibly incommensurate cycle frequencies, and the Fourier coefficients [2] (Equation (2.34))
F x γ ( ξ ) u ( ξ x ( t ) ) e j 2 π γ t t γ Γ 1
are referred to as cyclic CDFs.
If the CDF is differentiable with respect to ξ , the almost-periodic FOT probability density function (pdf) of the real-valued signal x ( t ) can be defined. This can be formally expressed (in the sense of generalized functions [35]) as [2] (Equation (2.37))
f x { α } ( ξ ; t ) d d ξ F x { α } ( ξ ; t )
= E { α } { δ ( ξ x ( t ) ) }
= γ Γ 1 f x γ ( ξ ) e j 2 π γ t
where the Fourier coefficients are formally expressed as
f x γ ( ξ ) δ ( ξ x ( t ) ) e j 2 π γ t t
= d d ξ F x γ ( ξ ) γ Γ 1
and are referred to as cyclic pdfs. In (10b) and (11a), δ ( · ) denotes Dirac delta.
The following fundamental theorem of expectation holds [31]:
E { α } { x ( t ) } R ξ d F x { α } ( ξ ; t )
= R ξ f x { α } ( ξ ; t ) d ξ
= η A 1 x η e j 2 π η t
where the Fourier coefficients of the almost-periodic component of x ( t ) can be expressed as
x η x ( t ) e j 2 π η t t
= R ξ d F x η ( ξ )
= R ξ f x η ( ξ ) d ξ η A 1
with
A 1 Γ 1
The function defined in (12a) is the almost-periodic mean (in the FOT sense) of the signal x ( t ) and (12b) is the FOT counterpart of the fundamental theorem of expectation in the stochastic approach. The Fourier coefficients defined in (13a) are referred to as cyclic means.
The second-order characterization of a time series x ( t ) is based on the almost-periodic joint FOT CDF of x ( t + τ ) and x ( t ) [2] (Theorem 2.34), [31]
F x { α } ( ξ 1 , ξ 2 ; t , τ ) E { α } { u ( ξ 1 x ( t + τ ) ) u ( ξ 2 x ( t ) ) }
= γ Γ 2 F x γ ( ξ 1 , ξ 2 ; τ ) e j 2 π γ t
where Γ 2 is a countable set of possibly incommensurate cycle frequencies, and the Fourier coefficients
F x γ ( ξ 1 , ξ 2 ; τ ) u ( ξ 1 x ( t + τ ) ) u ( ξ 2 x ( t ) ) e j 2 π γ t t γ Γ 2
are referred to as cyclic joint CDFs.
If the joint FOT CDF is differentiable with respect to both ξ 1 and ξ 2 , the almost-periodic joint FOT pdf of x ( t + τ ) and x ( t ) can be defined. This can be formally expressed as [2] (Equation (2.50))
f x { α } ( ξ 1 , ξ 2 ; t , τ ) 2 ξ 1 ξ 2 F x { α } ( ξ 1 , ξ 2 ; t , τ )
= E { α } { δ ( ξ 1 x ( t + τ ) ) δ ( ξ 2 x ( t ) ) }
= γ Γ 2 f x γ ( ξ 1 , ξ 2 ; τ ) e j 2 π γ t
where the Fourier coefficients
f x γ ( ξ 1 , ξ 2 ; τ ) δ ( ξ 1 x ( t + τ ) ) δ ( ξ 2 x ( t ) ) e j 2 π γ t t
= 2 ξ 1 ξ 2 F x γ ( ξ 1 , ξ 2 ; τ ) γ Γ 2
are referred to as cyclic joint pdfs.
The following fundamental theorem of expectation holds [2] (Theorem 2.35), [31]:
E { α } { x ( t + τ ) x ( t ) } = R ξ 1 ξ 2 d F x { α } ( ξ 1 , ξ 2 ; t , τ )
= R ξ 1 ξ 2 f x { α } ( ξ 1 , ξ 2 ; t , τ ) d ξ 1 d ξ 2
= α A 2 R x α ( τ ) e j 2 π α t
where the function E { α } { x ( t + τ ) x ( t ) } has all the properties of an autocorrelation function and the Fourier coefficient
R x α ( τ ) x ( t + τ ) x ( t ) e j 2 π α t t
= R ξ 1 ξ 2 d F x α ( ξ 1 , ξ 2 ; τ )
= R ξ 1 ξ 2 f x α ( ξ 1 , ξ 2 ; τ ) d ξ 1 d ξ 2
is referred to as cyclic autocorrelation function at cycle frequency  α . It results that
A 2 Γ 2 .
The second-order characterization of a time series x ( t ) in the spectral domain is made in terms of the cyclic spectrum  S x α ( f ) . This is defined as the correlation between the spectral components of the signal at frequencies f and f α , where α A 2 is one of the cycle frequencies of the signal x ( t ) [1] (Chapter 11), [2] (Chapter 2). For this reason, S x α ( f ) is also referred to as spectral correlation density. It is linked to the cyclic autocorrelation by Gardner’s relation [2] (Section 2.3.1.10)
S x α ( f ) = R R x α ( τ ) e j 2 π f τ d τ
also referred to as the cyclic Wiener–Khinchin relation.
Higher-order statistics of almost-cyclostationary signals in the FOT probability framework were introduced in [7,32]. In this paper, only the 4th-order reduced-dimension cyclic temporal moment function
R x α ( τ 1 , τ 2 , τ 3 ) x ( t + τ 1 ) x ( t + τ 2 ) x ( t + τ 3 ) x ( t ) e j 2 π α t t
referred to as, in short, 4th-order cyclic moment, is considered to build a higher-order cyclostationarity (HOCS)-based detector.

2.3. Cyclic Statistical Functions Estimators

In this section, estimators for the FOT cyclic statistical functions considered in Section 2.2 are presented. These estimators are obtained by considering finite time-averages in place of the infinite-time averages present in the definitions of the FOT statistical functions [1] (Chapter 13), [2,36] (Section 5.6). Moreover, for the cyclic CDF and the cyclic pdf, kernel-based estimators are proposed here for the first time.
In the FOT approach, the randomness (variability) of the estimate depends on the choice of the central point of the finite observation interval (i.e., t 0 in (1) with T finite; that is, without the limit operation) [36], [2] (Section 5.6). In the almost-periodic case, one estimates the Fourier coefficients of almost-periodic functions. Thus, z ( t ) in (1) is a sinusoidally weighted version of the second-order lag-product x ( t + τ ) x ( t ) or of the indicator function u ( ξ x ( t ) ) . Statistical functions of estimates for t [ t 0 T / 2 , t 0 + T / 2 ] are built considering estimates in smaller observation intervals [ u b / 2 , u + b / 2 ] , with b T , and averaging these estimates when u ranges within [ t 0 T / 2 + b / 2 , t 0 + T / 2 b / 2 ] [36]. An example is provided in Section 2.6.3.

2.3.1. Cyclic CDF

The natural estimator of the cyclic CDF (9) is
F x ( T ) ( γ , ξ ; t 0 ) 1 T t 0 T / 2 t 0 + T / 2 u ( ξ x ( t ) ) e j 2 π γ t d t
Under [36] (Assumptions 3.4 and 3.5), with x ( t ) replaced by u ( ξ x ( t ) ) e j 2 π γ t , according to [36] (Theorem 3.7), the function in (24) is a mean-square consistent estimator of the Fourier coefficient (9), and the normalized estimation error
T F x ( T ) ( γ , ξ ; t 0 ) F x γ ( ξ )
is asymptotically ( T ) complex normal.
Note that [36] (Assumptions 3.4 and 3.5), with x ( t ) replaced by u ( ξ x ( t ) ) e j 2 π γ t , correspond to assuming asymptotic independence, in the FOT sense, for the signal x ( t ) .

2.3.2. Cyclic CDF and pdf (Kernel-Based Estimators)

Kernel-based estimators of the cyclic CDF and the cyclic pdf are proposed here for the first time. They are obtained by generalizing the definitions for time-invariant CDF and pdf. However, only early results are so far available for these estimators, and their properties are still under investigation.
The kernel-based estimators of the FOT cyclic pdf (11b) and of the FOT cyclic CDF (9) of a continuous-time signal x ( t ) are a generalization of the continuous-time counterparts of the kernel-based estimators of the pdf and CDF proposed for discrete-time processes in [37,38], [39] (Section 2.1.8, pp. 64–65). They are given by
f x ( T , b T ) ( γ , ξ ; t 0 ) = 1 T t 0 T / 2 t 0 + T / 2 1 b T W ξ x ( t ) b T e j 2 π γ t d t
and
F x ( T , b T ) ( γ , ξ ; t 0 ) = ξ f x ( T , b T ) ( γ , s ; t 0 ) d s
= 1 T t 0 T / 2 t 0 + T / 2 W c ξ x ( t ) b T e j 2 π γ t d t
respectively, where W ( s ) is a unit-area smoothing window,
W c ( ξ ) ξ W ( s ) d s
and b T is the smoothing parameter. When t 0 = 0 or the dependence on t 0 is not of interest, in the left-hand sides of (26) and (27a) such a dependence is omitted for the sake of brevity.
In the special case γ = 0 , the discrete-time counterparts of the estimators (26) and (27b) are characterized in the stochastic approach in [37,38], [39] (Section 2.1.8, pp. 64–65) (in which case, t 0 = 0 and the variability (randomness) of the estimate is considered on the ensemble of realizations of a stochastic process). Specifically, under mild assumptions, f x ( T , b T ) ( 0 , ξ ) and F x ( T , b T ) ( 0 , ξ ) are shown to be mean-square consistent estimators of the pdf f x 0 ( ξ ) and the CDF F x 0 ( ξ ) , respectively, provided that [38] the following conditions hold:
T b T 0 T b T
In addition, for γ = 0 , Silverman’s rule of thumb
b T = ( 4 / 3 ) 1 / 5 σ x T 1 / 5
where σ x is the standard deviation of x ( t ) , assures the minimum mean-squared error of the CDF and pdf estimates [38] (Equation (20)). Furthermore, for γ = 0 , the normalized estimation errors
T b T f x ( T , b T ) ( 0 , ξ ) f x 0 ( ξ )
and
T b T F x ( T , b T ) ( 0 , ξ ) F x 0 ( ξ )
are asymptotically normal, provided that T b T 3 as T [38] (p. 1822). See [40] for the case of continuous-time processes.
Numerical experiments have shown that, for γ 0 , the estimators (26) and (27b) provide reliable estimates (i.e., exhibiting small bias and variance) of the cyclic pdf and the cyclic CDF, respectively, as the data record length T increases and the smoothing parameter b T decreases. This fact suggests that, under appropriate conditions, the mean-square consistence can be proved. In contrast, the asymptotic normality property does not seem to hold. The plausibility of this conjecture is corroborated by the results presented in Section 3.
An alternative technique for FOT pdf estimation based on linear interpolation of time series is presented in [41].

2.3.3. Cyclic Autocorrelation

The natural estimator of the cyclic autocorrelation Function (20a) is the cyclic correlogram [2] (Definition 5.1)
R x ( T ) ( α , τ ; t 0 ) 1 T t 0 T / 2 t 0 + T / 2 x ( t + τ ) x ( t ) e j 2 π α t d t
Under mild assumptions, the cyclic correlogram (33) is a mean-square consistent estimator of the cyclic autocorrelation (20a) [2] (Theorem 5.15), [42] and the normalized estimation error
T R x ( T ) ( α , τ ; t 0 ) R x α ( τ )
is asymptotically ( T ) complex normal [2] (Theorem 5.18), [43].
The results in [2] (Theorems 5.15 and 5.18) are derived with the classical stochastic approach. Their FOT counterpart can be obtained by using [36] (Theorem 3.7) for the time-average of the function of time
t x ( t + τ ) x ( t ) e j 2 π α t

2.3.4. Cyclic Spectrum

The cyclic spectrum (22) can be consistently estimated using the frequency-smoothed cyclic periodogram [1], [2] (Section 5.2.3), [44] (Chapter 13), [45] (Section 4.6) or with the time-smoothed cyclic periodogram [1] (Chapter 13), [2] (Section 5.2.4), [45] (Section 4.5), [46].
Let Δ f be the spectral frequency resolution of the cyclic spectrum estimator. This is coincident with the width of the frequency-smoothing window for the frequency-smoothed cyclic periodogram and with the reciprocal of the block-length for the time-smoothed cyclic periodogram. For both estimators, under mild assumptions, the normalized error estimates are asymptotically ( T ) complex normal, provided that Δ f = Δ f T 0 and T Δ f T .

2.3.5. 4th-Order Cyclic Moment

The natural estimator of the 4th-order cyclic moment (23) is the 4th-order cyclic correlogram [2] (Definition 5.1)
R x ( T ) ( α , τ 1 , τ 2 , τ 3 ; t 0 ) 1 T t 0 T / 2 t 0 + T / 2 x ( t + τ 1 ) x ( t + τ 2 ) x ( t + τ 3 ) x ( t ) e j 2 π α t d t
Asymptotic results similar to those valid for the cyclic correlogram (33) can be derived [2] (Section 5.7) [7,47,48]. Moreover, their counterpart in the FOT approach can be obtained using [36] (Theorem 3.7).

2.4. Detection

Let us consider the hypothesis test
H 0 : r ( t ) = n ( t ) H 1 : r ( t ) = x ( t ) + n ( t ) t [ T / 2 , T / 2 ]
where x ( t ) is the signal-of-interest (SOI) and n ( t ) is noise.
The detection problem consists in deciding which hypothesis holds true on the basis of the observation of the (unique) received signal r ( t ) observed in the finite time interval t [ T / 2 , T / 2 ] . If this unique observed signal is modeled as a segment of an infinitely long time series, the natural framework for its statistical characterization is the FOT probability framework.
If the joint FOT probability density functions of x ( t + τ i ) and n ( t + τ i ) for t + τ i [ 0 , T ] , i = 1 , , N , is unknown or complicated, then the likelihood ratio test (LRT) or the generalized likelihood ratio test (GLRT) cannot be derived. However, sub-optimal receivers can be adopted which use cyclic statistical function measurements as front end data.
In this section, several cyclostationarity-based detectors; that is, that adopt cyclic statistical function measurements as front end data, are presented by a unified notation. Specifically, let us denote by z r α ( θ ) any of the cyclic statistical functions introduced in Section 2.2. Thus, θ represents any of the parameters τ , f, or ξ . In the case of the 4th-order cyclic moment, θ is the three-dimensional vector of lags ( τ 1 , τ 2 , τ 3 ) . Let z ^ r ( α , θ ; t 0 ) be an estimator of z r α ( θ ) obtained by observing r ( t ) for t [ t 0 T / 2 , t 0 + T / 2 ] (see Section 2.3). In order to simplify the notation, the dependence on t 0 in z ^ r ( α , θ ; t 0 ) is omitted when unnecessary, if this does not create ambiguity.
As discussed in Section 2.3, under mild assumptions, the normalized estimation error
ν T z ^ r ( α , θ ; t 0 ) z r α ( θ )
is asymptotically ( T ) complex normal. In (38), the normalizing factor ν T is given by ν T = T for the estimators of the cyclic CDF (Section 2.3.1), cyclic autocorrelation (Section 2.3.3), and cyclic 4th-order moment (Section 2.3.5), by ν T = T Δ f T for the estimators of the cyclic spectrum (Section 2.3.4), and by ν T = T b T for the kernel-based estimators of the cyclic CDF and pdf with γ = 0 (Section 2.3.2). Furthermore, the normalized estimation errors
ν T z ^ r ( α k , θ k ; t 0 ) z r α k ( θ k )
at pairs ( α k , θ k ) , k = 1 , , K can be shown to be asymptotically jointly complex normal (see [2] (Sections 5.2 and 5.7), [45] (Sections 2.4 and 4.7) and [47,48] for results with the stochastic approach).
All the considered cylostationarity-based detectors have the following structure:
T H 0 H 1 λ
where the decision statistics T are built from cyclic statistical function measurements z ^ r ( α , θ ) and possibly their FOT statistics as the autocovariance matrix. The thresholds λ are derived analytically when the FOT distribution of T | H 0 can be derived from the FOT asymptotic properties of z ^ r ( α , θ ; t 0 ) . Otherwise, the thresholds are derived by Monte Carlo trials using side data under H 0 .
Although the structure and parameters of the proposed detectors are derived in the FOT approach—that is, considering the received signal as a unique time series, without interpreting this time series as a realization of a stochastic process—the detector performances are defined in terms of classical probabilities computed over an ensemble of realizations. In fact, the advantage of some of the FOT-based detector structures considered here consists in not exploiting side data such as other realizations under the null hypothesis. In contrast, the detector performance is of interest when checked through multiple experiments.
The performance analysis is carried out in terms of the probability of detection
P d = P T > λ | H 1
and probability of false alarm
P fa = P T > λ | H 0
See [36] for the interpretation of P d and P fa in the FOT approach.

2.5. Single Cycle (SC) Detectors

Let α be a cycle frequency of the SOI. The structure of a single-cycle detector is
T Θ z ^ r ( α , θ ) 2 d θ H 0 H 1 λ
where Θ is a set of values of θ where z r α ( θ ) is significantly non zero.
The cases where z ^ r ( α , θ ) is the cyclic correlogram (Section 2.3.3) or the frequency-smoothed cyclic periodogram (Section 2.3.4) are addressed in [4,5,6,49], where the optimal choices for the corresponding sets Θ are also discussed. Single-cycle detectors based on cyclic higher-order statistics are presented in [7].
A simplified SC detector based on the 4th-order cyclic moment is obtained by considering fixed two lag parameters and integrating with respect to the remaining variable. That is,
T = τ M τ M R x ( T ) ( α , τ 1 , τ ¯ 2 , τ ¯ 3 ) 2 d τ 1
with τ ¯ 2 , τ ¯ 3 fixed.
A new class of single-cycle detectors is proposed here for the first time. Specifically, those where z ^ r ( α , θ ) is any of the cyclic CDF or cyclic pdf estimators of Section 2.3.1 and Section 2.3.2. The advantages of these new SC detectors and their better performance with respect to the other SC detectors are analyzed in Section 3.

2.6. Quadratic Forms (QF) Detectors

In this section, detectors whose structure is a quadratic form that is compared with a threshold are presented in a unified framework. First, the case of quadratic forms constructed from measurements of cyclic autocorrelation, cyclic spectrum, and 4th-order cyclic moment are presented (Section 2.6.1). Then, a new class of detectors is introduced here for the first time, where quadratic forms are constructed from measurements of cyclic CDF and pdf (Section 2.6.2). Since the derived detector structures (Section 2.6.3) require the availability of side data under H 0 , to estimate the quadratic-form covariance matrix, a suboptimum detector is derived where such a matrix is estimated using the available data (Section 2.6.4).

2.6.1. QF Detectors Based on Measurements of the Cyclic Autocorrelation, Spectrum, and Moment

Let us consider a zero-mean real-valued SOI x ( t ) and a zero-mean noise signal n ( t ) .
Let z r α ( θ ) be any of the cyclic statistical functions R r α ( τ ) , S r α ( f ) , and R r α ( τ 1 , τ 2 , τ 3 ) , and let us denote by z x n α ( θ ) the corresponding cyclic cross statistic between x ( t ) and n ( t ) .
Let the following Assumptions be satisfied:
1.
x ( t ) exhibits cyclostationarity at ( α , θ ) : z x α ( θ ) 0 ;
2.
n ( t ) does not exhibit cyclostationarity at ( α , θ ) : z n α ( θ ) 0 ;
3.
x ( t ) and n ( t ) do not exhibit joint cyclostationarity at ( α , θ ) : z x n α ( θ ) z n x α ( θ ) 0 .
Thus, this results that
H 0 : z r α ( θ ) = z n α ( θ ) = 0 H 1 : z r α ( θ ) = z x α ( θ ) + z n x α ( θ ) + z x n α ( θ ) + z n α ( θ ) = z x α ( θ )
Equations (37) and (45) suggest the following ad hoc (non-optimum and not equivalent to (37)) binary hypothesis test for discriminating between the hypotheses H 0 and H 1 when r ( t ) is observed for t [ T / 2 , T / 2 ] [2] (Section 8.4):
H 0 : z ^ r ( α , θ ) = ϵ 0 ( T ) ( α , θ ) H 1 : z ^ r ( α , θ ) = z x α ( θ ) + ϵ 1 ( T ) ( α , θ )
In (46), ϵ i ( T ) ( α , θ ) denotes the estimation error on z r α ( θ ) using the measurement r ( t ) observed for t [ T / 2 , T / 2 ] , under hypothesis H i .
The decision test (46) can be generalized considering measurements in multiple pairs ( α k , θ k ) , k = 1 , , K . Under the Assumptions,
1.
x ( t ) exhibits cyclostationarity at ( α k , θ k ) : z x α k ( θ k ) 0 ;
2.
n ( t ) does not exhibit cyclostationarity at ( α k , θ k ) : z n α k ( θ k ) 0 ;
3.
x ( t ) and n ( t ) do not exhibit joint cyclostationarity at ( α k , θ k ) : z x n α k ( θ k ) z n x α k ( θ k ) 0 .
The test (46) for several pairs ( α k , θ k ) , k = 1 , , K is
H 0 : z ^ r ( α k , θ k ) = ϵ 0 ( T ) ( α k , θ k ) H 1 : z ^ r ( α k , θ k ) = z x ( α k , θ k ) + ϵ 1 ( T ) ( α k , θ k ) k = 1 , , K
Let us define the normalized measurement column vector
Z { ν T z ^ r ( α k , θ k ) ; k = 1 , , K } .
Due to the asymptotic joint complex normality of the normalized measurement errors (39), for T sufficiently large the column random vector Z is (practically) complex normal under both hypotheses
Z | H i N ( μ i , i , i ( c ) ) i = 0 , 1
with mean vectors
μ 0 = E { Z | H 0 } = 0 μ 1 = E { Z | H 1 } = { ν T z r α k ( θ k ) ; k = 1 , , K }
asymptotic covariance matrix i with entries
i ( k 1 , k 2 ) = lim T cov Z k 1 , Z k 2 | H i = lim T ν T 2 cov ϵ i ( T ) ( α k 1 , θ k 1 ) , ϵ i ( T ) ( α k 2 , θ k 2 ) i = 0 , 1
and asymptotic conjugate covariance matrix i ( c ) with entries
i ( c ) ( k 1 , k 2 ) = lim T cov Z k 1 , Z k 2 * | H i = lim T ν T 2 cov ϵ i ( T ) ( α k 1 , θ k 1 ) , ϵ i ( T ) * ( α k 2 , θ k 2 ) i = 0 , 1 ,
where superscript ∗ denotes complex conjugation.
Complex-valued random vectors can be suitably described and characterized by introducing the augmented random vector
ζ Z Z *
the augmented mean vector
μ ζ | H i E { Z | H i } E { Z * | H i } = μ i μ i *
and the augmented covariance matrix
Γ i E ( ζ μ ζ | H i ) ( ζ μ ζ | H i ) H | H i = i i ( c ) i ( c ) * i *
where superscript H denotes the Hermitian transpose.
Due to the asymptotic complex normality of Z, the joint probability density function of the real and imaginary parts of the components Z k of Z can be written in the complex form as [50]
f ζ | H i ( ζ a ) = 1 π K | det Γ i | 1 / 2 exp 1 2 ( ζ a μ ζ | H i ) H Γ i 1 ( ζ a μ ζ | H i )
The case where z ^ r ( α , θ ) is the cyclic correlogram R r ( T ) ( α , τ ) is addressed in [2] (Section 8.4), [8,9].

2.6.2. QF Detectors Based on Measurements of the Cyclic CDF and pdf

Let x ( t ) and n ( t ) be independent time-series in the FOT sense; that is, the joint almost-periodic FOT distribution of x ( t + τ 1 ) , , x ( t + τ N ) , n ( t + τ N + 1 ) , , n ( t + τ N + M ) factorizes into the product of the joint almost-periodic FOT distributions of x ( t + τ 1 ) , , x ( t + τ N ) and of n ( t + τ N + 1 ) , , n ( t + τ N + M ) , for every τ 1 , , τ N , τ N + 1 , , τ N + M and for every N and M [31].
Let
f x { α } ( ξ , t ) = γ x Γ x f x γ x ( ξ ) e j 2 π γ x t
f n { α } ( ξ , t ) = γ n Γ n f n γ n ( ξ ) e j 2 π γ n t
be the 1st-order almost-periodic FOT pdf of x ( t ) and n ( t ) , respectively. With reference to the SOI-noise additive model in the hypothesis test (37), under hypothesis H 0 , one has
f r | H 0 { α } ( ξ , t ) = f n { α } ( ξ , t )
and under hypothesis H 1 , one obtains
f r | H 1 { α } ( ξ , t ) = f x { α } ( ξ , t ) ξ   f n { α } ( ξ , t )
= γ x Γ x γ n Γ n f x γ x ( ξ ) ξ   f n γ n ( ξ ) e j 2 π [ γ x + γ n ] t
where ξ denotes convolution with respect to the variable ξ . Therefore, from (59) it follows that
f r | H 0 β ( ξ ) f r | H 0 { α } ( ξ , t ) e j 2 π β t t
= f n β ( ξ )
and from (60b), one has
f r | H 1 β ( ξ ) f r | H 1 { α } ( ξ , t ) e j 2 π β t t
= γ x Γ x f x γ x ( ξ ) ξ   f n β γ x ( ξ )
Let the following Assumptions be satisfied:
1.
x ( t ) exhibits 1st-order cyclostationarity at ( β , ξ ) : β Γ x and f x β ( ξ ) 0 ;
2.
β γ x Γ n / { 0 } γ x Γ x .
Condition 2 is satisfied, for example, if n ( t ) is a stationary time series.
Thus, for β Γ x , it results that
H 0 : f r | H 0 β ( ξ ) = f n β ( ξ ) = 0 H 1 : f r | H 1 β ( ξ ) = f x β ( ξ ) ξ   f n 0 ( ξ )
or, equivalently,
H 0 : F r | H 0 β ( ξ ) = F n β ( ξ ) = 0 H 1 : F r | H 1 β ( ξ ) = R F x β ( ξ s ) d F n 0 ( s )
Equations (37) and (63) suggest the following ad hoc (non-optimum and not equivalent to (37)) binary hypothesis test to discriminate between hypotheses H 0 and H 1 when r ( t ) is observed for t [ T / 2 , T / 2 ] :
H 0 : f ^ r | H 0 β ( ξ ) = ϵ 0 ( T ) ( β , ξ ) H 1 : f ^ r | H 1 β ( ξ ) = f x β ( ξ ) ξ   f n 0 ( ξ ) + ϵ 1 ( T ) ( β , ξ )
or, equivalently,
H 0 : F ^ r | H 0 β ( ξ ) = η 0 ( T ) ( β , ξ ) H 1 : F ^ r | H 1 β ( ξ ) = R F x β ( ξ s ) d F n 0 ( s ) + η 1 ( T ) ( β , ξ )
where f ^ r | H i β ( ξ ) and F ^ r | H i β ( ξ ) denote estimates of f r | H i β ( ξ ) and F r | H i β ( ξ ) , respectively, for i = 0 , 1 (see Section 2.3.1 and Section 2.3.2). In (66) and (65), ϵ i ( T ) ( β , ξ ) and η i ( T ) ( β , ξ ) , i = 0 , 1 , represent estimation errors.
If f n 0 ( ξ ) is unimodal around ξ = 0 (e.g., zero-mean Gaussian), then the magnitude of the convolution product f x β ( ξ ) ξ   f n 0 ( ξ ) has the same point of maximum as the magnitude of f x β ( ξ ) . This fact is exploited for the choice of the value of ξ to be used in the quadratic-form detector.
In those cases where the estimation errors can be modeled as Gaussian, the pdf (56) of augmented measurement vectors ζ can be constructed by following the guidelines of Section 2.6.1.

2.6.3. QF Detector Structure

If in (56) the augmented mean vectors and covariance matrix are unknown, the hypothesis test can be performed using the generalized log-likelihood ratio test (GLLRT) [51] (Section 2.5)
ln f ζ | H 1 ( ζ a ; μ ^ ζ | H 1 , Γ ^ 1 ) f ζ | H 0 ( ζ a ; μ ^ ζ | H 0 , Γ ^ 0 ) H 0 H 1 λ
where the estimated parameters are maximum likelihood estimates. If the parameter estimates happen to not be maximum likelihood estimates, then the test is no longer GLLRT. However, if such estimates are consistent, the test can still be applied as an ad hoc test for the considered problem [52].
In (67), ζ a is the measurement of Z made on the whole observation interval [ T / 2 , + T / 2 ] , μ ^ ζ | H 0 = 0 , μ ^ ζ | H 1 = ζ a , and the estimates Γ ^ 1 , and Γ ^ 0 can be obtained using an FOT-subsampling procedure. For example, if z r α ( θ ) is the cyclic autocorrelation function, then by defining
R r r ( * ) ( b , u ) ( α , τ ) 1 b u b / 2 u + b / 2 r ( t + τ ) r ( * ) ( t ) e j 2 π α t d t = 1 b b / 2 b / 2 r ( t + u + τ ) r ( * ) ( t + u ) e j 2 π α ( t + u ) d t
with b T , one has
^ i ( k 1 , k 2 ) = b R r r ( * ) k 1 ( b , u ) ( α k 1 , τ k 1 ) b R r r ( * ) k 2 ( b , u ) * ( α k 2 , τ k 2 ) | H i u b R r r ( * ) k 1 ( b , u ) ( α k 1 , τ k 1 ) | H i u b R r r ( * ) k 2 ( b , u ) * ( α k 2 , τ k 2 ) | H i u
where · u is the time average made on the whole observation interval u [ T / 2 + b / 2 , + T / 2 b / 2 ] and the convergence conditions are T , b , with T / b .
Therefore, with these estimates substituted into, the decision test (67) reduces to comparing a quadratic form Q ^ ( ζ a ) with a threshold [2] (Sections 8.4–8.5), [9]:
Q ^ ( ζ a ) ζ a H Γ ^ 0 1 ζ a H 0 H 1 λ
The detector (70) is not optimum. However, if one assumes as front-end data the cyclic statistic measurements Z, then such a detector is optimum in the sense of Neyman–Pearson.
In (70), the estimate Γ ^ 0 1 of the inverse of the covariance matrix Γ 0 must be obtained using the available side data under H 0 . If these data are not available, one should resort to the statistical test for presence of cyclostationarity (Section 2.6.4). When such a test is adopted for signal detection, this results in a sub-optimum detector with respect to (70) [2] (Section 8.4.3), [9].
The quadratic forms Q ( ζ ) and Q ^ ( ζ ) have asymptotically the same central χ 2 K 2 distribution F χ 2 K 2 ( · ) (over the ensemble of realizations) [39] (Section 4.1.2, p. 140). Therefore, for a desired false-alarm rate
P fa = P [ Q ^ > λ | H 0 ] = 1 F χ 2 K 2 ( λ )
the threshold λ can be analytically derived
λ = F χ 2 K 2 1 ( 1 P fa ) .

2.6.4. Statistical Test for Presence of Cyclostationarity

Let us consider the following statistical test for the presence of cyclostationarity:
H 0 : ( α , θ ) supp { z r α ( θ ) } H 1 : ( α , θ ) supp { z r α ( θ ) }
where supp { · } denotes the support of the argument in the brackets.
If the signal r ( t ) is observed for t [ T / 2 , T / 2 ] , from (73), it follows that
H 0 : z ^ r ( α , θ ) = ϵ ( T ) ( α , θ ) H 1 : z ^ r ( α , θ ) = z r α ( θ ) + ϵ ( T ) ( α , θ )
where ϵ ( T ) ( α , θ ) denotes the measurement error (not depending on the hypothesis). By reasoning as Section 2.6, the test (73) reduces to
Q ^ ( ζ a ) ζ a H Γ ^ 1 ζ a H 0 H 1 λ
where Γ ^ 1 is an estimate of the inverse augmented covariance matrix obtained from the observed data.
If this statistical test for the presence of cyclostationarity is adopted to perform a detection test (identifying H 0 with H 0 and H 1 with H 1 ), then one obtains a detector with some performance degradation with respect to the test (70), but with the advantage that side data (under H 0 ) are no longer needed to estimate the covariance matrix [2] (Section 8.4.3), [9].
Note that, in such a case, the decision-statistic parameter (the covariance matrix) is computed from the uniquely observed received signal r ( t ) with t [ T / 2 , + T / 2 ] and the threshold is derived analytically. Thus, no side data have been required to make the decision.
A version of the statistical test for the presence of cyclostationarity based on a vector of real and imaginary parts of cyclic autocorrelations or higher-order moments was originally presented in [8] in the stochastic process framework. However, in [8], a different estimator for the covariance matrix is proposed.

3. Results

In this section, numerical results are reported aimed at corroborating the effectiveness of the new proposed cyclic detectors. Performance analysis is carried out in terms of Monte Carlo probability of missed detection P md versus data-record length T (Section 3.4); Monte Carlo P d versus nominal P fa (Section 3.5); and Monte Carlo probability of detection P d versus Monte Carlo probability P fa (Section 3.6). These performances are compared with those of competitive cyclostationarity-based detectors and the energy detector.
In order to check the effectiveness of the assumptions made on the distribution of the decision statistics, the Monte Carlo P fa versus the nominal P fa is computed for those detectors whose threshold is derived analytically (Section 3.7).

3.1. Simulation Setup

Let T s denote the sampling period and f s = 1 / T s the sampling frequency. The signal of interest (SOI) is the complex envelope of a binary frequency-shift-keyed (FSK) signal with bit period T p = 8 T s , frequency shifts ± Δ f fsk / 2 , with Δ f fsk = 1 / ( 2 T p ) , and a binary white modulating sequence.
In all cyclostationarity-based detectors, a cycle frequency of the SOI which is not shared with the disturbance is known (see Section 2.5, Section 2.6.1 (Assumption 1), and Section 2.6.2 (Assumption 1)). Thus, it is convenient to choose a sampling period T s commensurate with the period of cyclostationarity of the continuous-time SOI, in order to obtain a cyclostationary, rather than an almost-cyclostationary, discrete-time SOI [2] (Section 3.6.2). The continuous-time FSK SOI is cyclostationary with period T p and the sampled SOI is cyclostationary with period T p / T s = 8 .
FSK modulation is adopted in satellite communications due to its constant-envelope property, which minimizes the effect of nonlinear amplification in the high-power amplifier. In addition, FSK radars are used for a highly accurate range detection.
The disturbance is constituted by additive colored circular Gaussian noise and narrow-band interference. The colored circular Gaussian noise has power spectral density (PSD) proportional to sinc 2 ( f / B n ) , with B n = 3 / ( 2 T p ) . The noise power fluctuates from one realization to another. The average (over all realizations) signal-to-noise ratio (SNR) is −20 dB. Thus, the noise PSD completely overlaps the PSD of the SOI. The interference is constituted by three tones. The amplitudes, frequencies, and phases of the tones change randomly from one realization to the other. The signal-to-interference ratio (SIR) for each realization is −20 dB.
N MC = 10 4 Monte Carlo trials are made to compute the sample statistics for data-record lengths T = 2 k T s with k = 15 , , 19 .
For cyclic spectra estimates, the width of the frequency-smoothing window is Δ f T = T 2 / 3 . Such a rate assures the asymptotic complex normality of the frequency-smoothed cyclic periodogram (see [45] (Theorem 4.7.11) applied to the special case of ACS signals). Single-cycle detectors and quadratic-form detectors based on cyclic spectrum estimates have a performance similar to those of the corresponding detectors based on cyclic autocorrelation estimates. Thus, in order to avoid crowded figures, the results for detectors based on cyclic spectrum estimates are not reported in the following sections.
Cyclic statistical functions are estimated at cycle frequency α = 1 / T p . For the quadratic-form detectors, only one value of the parameter θ is considered ( K = 1 in (47)). The chosen value is the one that maximizes the magnitude of the considered cyclic statistic. The cyclic CDF and pdf are evaluated for the real part of the complex-valued received signal.

3.2. Threshold Determined by Monte Carlo Simulations

Let T 0 ( i ) be the decision statistic under H 0 for the ith Monte Carlo trial, i = 1 , , N MC . Assigned a value of probability of false alarm P fa , the threshold λ MC is computed such that
P fa = # ( T 0 ( i ) > λ MC ) N MC
where # ( · ) denotes the number of occurrences of the event in parentheses. Then, let T 1 ( i ) be the decision statistic under H 1 for the ith Monte Carlo trial, i = 1 , , N MC . The probability of detection is computed as
P d = # ( T 1 ( i ) > λ MC ) N MC
The computation of the threshold λ MC requires the availability of T 0 ( i ) ; that is, of side-data under H 0 .
The threshold is derived via Monte Carlo simulations for the single-cycle detectors (Section 2.5) and the energy detector (radiometer).

3.3. Threshold Derived Analytically

If the distribution of the decision statistic under H 0 , T 0 , is known, then the threshold λ an can be derived analytically from an assigned value of the probability of false alarm P fa 0 (referred to as nominal or design P fa ). For example, from (72), we have
λ an = F χ 2 K 2 1 ( 1 P fa 0 ) .
Then, starting from this analytically derived threshold λ an , from data under H 0 , the effective probability of false alarm P fa (referred to as Monte Carlo P fa ) is computed using Monte Carlo simulations as
P fa = # ( T 0 ( i ) > λ an ) N MC
If the statistical description of T 0 is correct, then one should expect that the Monte Carlo P fa is approximately equal to the nominal P fa 0 .
From data under H 1 , the probability of detection P d (Monte Carlo P d ) is computed using Monte Carlo simulations as
P d = # ( T 1 ( i ) > λ an ) N MC
The computation of λ an does not require the availability of T 0 ( i ) ; that is, of side-data under H 0 .
Detectors whose decision statistic is a quadratic form with known distribution (see Section 2.6) have a threshold that can be determined analytically.

3.4. Monte Carlo P md versus T

In this experiment, the Monte Carlo probability of missed detection P md versus the data-record length T is computed for the energy detector, quadratic-form detectors, and single-cycle detectors. The results are reported in Figure 1.
The results show that the best performance was obtained by the SC detectors based on estimates of the cyclic pdf (kernel-based estimator) and the cyclic CDF (Fourier coefficient of the indicator). A good performance was obtained by the QF detectors based on estimates of the cyclic CDF (kernel-based estimator) and the cyclic CDF (Fourier coefficient of the indicator).
The poor performance of the energy detector was the consequence of the severe noise and interference environment. In fact, due to the very low values of SNR and SIR and the fluctuation of the noise power from one Monte Carlo realization to the other, the estimated threshold of this detector, which was obtained from measurements under H 0 , was not reliable.
Detectors based on cyclic statistic measurements benefit from the signal selectivity property of cyclostationarity-based algorithms and are intrinsically immune to the effect of noise and interference, regardless of the temporal and spectral overlap of SOI and disturbance, provided that a sufficiently long data-record length is adopted for the measurements [1] (Chapter 14), [2] (Section 9.2). The stationary noise only affects the cyclic statistic measurements due to the leakage phenomenon, and the performance degradation decreases as the data record increases [2] (Section 9.7). The narrow-band interference can degrade the cyclic detector performance only in the rare case in which the double of the carrier frequency of one of the three tones (which randomly changes from one realization to the other) is equal to the cycle frequency 1 / T p within an error of the order of 1 / T . Therefore, all the cyclostationarity-based detectors are potentially able to counteract the effects of noise and interference, provided that a sufficiently long observation interval is available. For the FSK signal considered here, the strength of the sine wave regenerated by computing the cyclic CDF and cyclic pdf, compared with the corresponding continuous component, is higher than that obtained by computing the second- and fourth-order cyclic statistics, and this constitutes an advantage at very low values of SNR and SIR. In particular, for the considered values of T, these detectors provide satisfactory performance, while larger values of T are needed to obtain the same performance with SC and QF detectors based on second- and fourth-order statistic measurements.
The CS detectors exhibit better performance than the QF detectors, since the former exploit side information for the threshold computation.
The results obtained for moderate or high values of SNR and SIR are not presented here, since they showed that all cyclostationarity-based methods exhibit comparable performance.

3.5. Receiver Operating Characteristic (ROC): Monte Carlo P d versus Nominal P fa

In this experiment, the receiver operating characteristic (Monte Carlo P d versus nominal P fa , in short MC- P d vs. nominal- P fa ) is computed for the energy detector, quadratic-form detectors, and single-cycle detectors. The results are reported in Figure 2.
These results confirm those of Section 3.4.

3.6. Receiver Operating Characteristic (ROC): Monte Carlo P d versus Monte Carlo P fa

In this experiment, the receiver operating characteristic (Monte Carlo P d versus Monte Carlo P fa , in short MC- P d vs. MC- P fa ) is computed for quadratic-form detectors. The results are reported in Figure 3.
For SC detectors and for the energy detector, the nominal P fa is practically coincident with the Monte Carlo P fa , since the threshold is obtained using Monte Carlo simulation under H 0 . Therefore, the results were practically coincident with those of Section 3.5 and are not reported here. In contrast, for QF detectors, the nominal P fa is practically coincident with the Monte Carlo P fa only if the assumed distribution for the decision statistic T 0 under H 0 is correctly predicted.
By comparing the curves in Figure 3 with the corresponding ones in Figure 2, it follows that, when the data-record length increases from T = 2 15 to T = 2 19 , the ROCs MC- P d vs. MC- P fa are practically coincident with the ROCs MC- P d vs. nominal- P fa for the QF detectors based on estimates of second- and 4th-order cyclic statistics or based on estimates of the cyclic CDF (Fourier coefficient of the indicator). In contrast, the ROC MC- P d vs. MC- P fa for the QF detectors based on estimates of the cyclic CDF (kernel-based estimator) presents irregularly spaced points and based on estimates of the cyclic pdf (kernel-based estimator) does not fit the corresponding ROC MC- P d vs. nominal- P fa . Such a behavior for the ROCs of the detectors based on the cyclic CDF and pdf kernel estimators suggests that for these estimators the normalized estimation error is not Gaussian and, consequently, the threshold determined by (78) is not correct.

3.7. Monte Carlo P fa versus Nominal or Design P fa

For detectors whose threshold is determined using Monte Carlo simulations (Section 3.2) we have, as expected, that the Monte Carlo (effective) P fa is practically equal to the nominal or design P fa .
For detectors whose threshold is derived analytically, it make sense to check how far the effective Monte Carlo P fa is from the nominal or design P fa .
In this experiment, the Monte Carlo P fa versus the nominal P fa is computed for the QF detectors. The results are reported in Figure 4.
According to the results of Section 3.6, when the data-record length increases from T = 2 15 to T = 2 19 , the MC- P fa approaches the nominal- P fa for the QF detectors based on estimates of second- and 4th-order cyclic statistics or based on estimates of the cyclic CDF (Fourier coefficient of the indicator). Moreover, for the QF detectors based on estimates of the cyclic CDF (kernel-based estimator) and the cyclic pdf (kernel-based estimator), the effective Monte Carlo P fa is far from the nominal or design P fa . Therefore, according to the results of Section 3.6, this fact could suggest that, for these detectors, the normalized estimation errors are not asymptotically complex normal. At least if the smoothing parameter b is chosen according to Silverman’s rule (30).

4. Discussion

The problem of cyclostationary signal detection is addressed in the fraction-of-time probability approach. In this approach, signals are modeled as single functions of time, rather than realizations of a stochastic process. Two classes of detectors are considered: the single-cycle detectors, and the quadratic-form detectors. The single-cycle detectors have a decision statistic that only depends on the received signal. Such a decision statistic is compared with a threshold that is derived from the available side data in the null hypothesis. In contrast, quadratic-form detectors have a decision statistic that depends on the received signal and side data in the null hypothesis and the threshold that can be derived analytically, provided that the decision statistic has a chi-squared fraction-of-time distribution under the null hypothesis. However, at the price of a modest performance degradation, the decision statistic can be computed using the received signal only, with no need of side data. For quadratic-form detectors, the covariance matrix is estimated with a subsampling procedure that is naturally derived in the fraction-of-time approach. For both single-cycle and quadratic-form detectors, a new class of cyclic statistical function measurements are considered: the cyclic cumulative distribution function, and the cyclic probability density function. The simulation results showed that these measurements can allow one to gain in performance with respect to measurements of cyclic autocorrelation, cyclic spectrum, and cyclic 4th-order moment. The advantage is particularly evident when the almost-periodically time-variant cumulative distribution and probability density functions exhibit harmonics whose strength is comparable with that of the continuous component. The effectiveness of the proposed detectors was tested on a FSK signal-of-interest in a severe noise and interference environment. Specifically, both additive stationary noise and narrow-band interference were present, with a power spectral density that completely overlapped that of the signal-of-interest. The SNR and SIR were both −20 dB. By operating at a cycle frequency equal to the symbol rate, a performance analysis was carried out using Monte Carlo simulations for the new proposed single-cycle and quadratic-form detectors based on measurements of the cylic CDF and pdf. Specifically, the probability of missed detection versus the data-record length and the receiver operating characteristics were estimated. Moreover, the performances were compared with those of analogous detectors based on measurements of cyclic autocorrelation, cyclic spectrum, and cyclic 4th-order moment measurements. The simulation results showed the better performance of the new proposed detectors. A further analysis was carried out to check the assumption made on the quadratic-form distribution that was exploited to analytically derive the detector threshold. Specifically, for all considered quadratic-form detectors, the nominal or design probability of false alarm (adopted to derive the threshold) was compared with the effective probability of false alarm obtained using Monte Carlo simulations. By increasing the data-record length, the values of the two probabilities of false alarm tended to be equal, except for the case of quadratic forms of measurements of cyclic CDF and pdf obtained using kernel-based estimators. Such a mismatch suggests that, unlike the case of zero cycle frequency, the normalized estimation error for kernel-based estimators is not asymptotically complex normal. Therefore, although the derived threshold provides satisfactory performance, this is not the best choice and better performances are expected to be obtained by properly modeling the distribution of the normalized estimation error and, hence, that of the quadratic-form detection statistic. Finally, note that the performance advantage of one detector over another strongly depends on the kind of signal-of-interest and its cyclic statistical functions. For example, for a pulse-amplitude-modulated signal with 50% duty-cycle rectangular pulse, detectors based on the cyclic autocorrelation and the 4th-order cyclic moment measurements outperformed those based on the cyclic CDF and pdf measurements.

Author Contributions

Conceptualization, A.N.; methodology, D.D., J.L., A.N. and T.S.; software, A.N.; validation, A.N.; formal analysis, A.N.; investigation, D.D., J.L., A.N. and T.S.; resources, A.N.; data curation, A.N.; writing—original draft preparation, A.N.; writing—review and editing, D.D., J.L., A.N. and T.S.; visualization, A.N.; supervision, A.N.; project administration, D.D., J.L., A.N. and T.S.; funding acquisition, A.N. All authors have read and agreed to the published version of the manuscript.

Funding

A.N. was partially supported by the King Abdullah University of Science and Technology (KAUST) Office of Sponsored Research (OSR) under Award OSR-2019-CRG8-4057.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflict of interest. The funders had no role in the design of the study; in the collection, analysis, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

Abbreviations

The following abbreviations are used in this manuscript:
ACSAlmost-Cyclostationary
CDFCumulative Distribution Function
FOTFraction-of-Time
FSKFrequency Shift Keyed
GLRTGeneralized Likelihood Ratio Test
HOCSHigher-Order Cyclostationarity
LRTLikelihood Ratio Test
MCMonte Carlo
pdfProbability Density Function
QFQuadratic Form
ROCReceiver Operating Characteristic
SCSingle Cycle

References

  1. Gardner, W.A. Statistical Spectral Analysis: A Nonprobabilistic Theory; Prentice-Hall: Englewood Cliffs, NJ, USA, 1987. [Google Scholar]
  2. Napolitano, A. Cyclostationary Processes and Time Series: Theory, Applications, and Generalizations; Elsevier: Amsterdam, The Netherlands, 2019. [Google Scholar] [CrossRef]
  3. Besicovitch, A.S. Almost Periodic Functions; Cambridge University Press: London, UK, 1932. [Google Scholar]
  4. Gardner, W.A. Signal interception: A unifying theoretical framework for feature detection. IEEE Trans. Commun. 1988, COM-36, 897–906. [Google Scholar] [CrossRef]
  5. Gardner, W.A.; Spooner, C.M. Signal interception: Performance advantages of cyclic feature detectors. IEEE Trans. Commun. 1992, 40, 149–159. [Google Scholar] [CrossRef]
  6. Gardner, W.A.; Spooner, C.M. Detection and source location of weak cyclostationary signals: Simplifications of the maximum-likelihood receiver. IEEE Trans. Commun. 1993, 41, 905–916. [Google Scholar] [CrossRef]
  7. Spooner, C.M.; Gardner, W.A. The cumulant theory of cyclostationary time-series. Part II: Development and applications. IEEE Trans. Signal Process. 1994, 42, 3409–3429. [Google Scholar] [CrossRef]
  8. Dandawaté, A.V.; Giannakis, G.B. Statistical tests for presence of cyclostationarity. IEEE Trans. Signal Process. 1994, 42, 2355–2369. [Google Scholar] [CrossRef]
  9. Napolitano, A. On cyclostationarity-based signal detection. In Proceedings of the XXVI European Signal Processing Conference (EUSIPCO 2018), Rome, Italy, 3–7 September 2018. [Google Scholar] [CrossRef]
  10. Hurd, H.L.; Gerr, N.L. Graphical methods for determining the presence of periodic correlation. J. Time Ser. Anal. 1991, 12, 337–350. [Google Scholar] [CrossRef]
  11. Enserink, S.; Cochran, D. On detection of cyclostationary signals. In Proceedings of the 1995 International Conference on Acoustics, Speech, and Signal Processing, Washington, DC, USA, 9–12 May 1995; Volume 3, pp. 2004–2007. [Google Scholar] [CrossRef]
  12. Sirianunpiboon, S.; Howard, S.D.; Cochran, D. Detection of cyclostationarity using generalized coherence. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2018), Calgary, AB, Canada, 15–20 April 2018. [Google Scholar]
  13. Dehay, D.; Dudek, A.; Leskow, J. Subsampling for continuous-time almost periodically correlated processes. J. Stat. Plan. Inference 2014, 150, 142–158. [Google Scholar] [CrossRef]
  14. Kim, K.; Akbar, I.; Bae, K.; Um, J.S.; Spooner, C.; Reed, J. Cyclostationary Approaches to Signal Detection and Classification in Cognitive Radio. In Proceedings of the 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN 2007), Washington, DC, USA, 17–20 April 2007; pp. 212–215. [Google Scholar] [CrossRef]
  15. Sutton, P.; Nolan, K.; Doyle, L. Cyclostationary Signatures in Practical Cognitive Radio Applications. IEEE J. Sel. Areas Commun. 2008, 26, 13–24. [Google Scholar] [CrossRef]
  16. Haykin, S.; Thomson, D.J.; Reed, J.H. Spectrum Sensing for Cognitive Radio. Proc. IEEE 2009, 97, 849–877. [Google Scholar] [CrossRef]
  17. Lundén, J.; Koivunen, V.; Huttunen, A.; Poor, H.V. Collaborative Cyclostationary Spectrum Sensing for Cognitive Radio Systems. IEEE Trans. Signal Process. 2009, 57, 4182–4195. [Google Scholar] [CrossRef]
  18. Cohen, D.; Eldar, Y.C. Sub-Nyquist Cyclostationary Detection for Cognitive Radio. IEEE Trans. Signal Process. 2017, 65, 3004–3019. [Google Scholar] [CrossRef]
  19. Yavorskyj, I.N.; Yuzefovych, R.; Kravets, I.B.; Matsko, I.Y. Properties of characteristics estimators of periodically correlated random processes in preliminary determination of the period of correlation. Radioelectron. Commun. Syst. 2012, 55, 335–348. [Google Scholar] [CrossRef]
  20. Javorskyj, I.; Dehay, D.; Kravets, I. Component statistical analysis of second order hidden periodicities. Digit. Signal Process. 2014, 26, 50–70. [Google Scholar] [CrossRef]
  21. Gardner, W.A. Statistically inferred time warping: Extending the cyclostationarity paradigm from regular to irregular statistical cyclicity in scientific data. EURASIP J. Adv. Signal Process. 2018, 2018, 59. [Google Scholar] [CrossRef]
  22. Napolitano, A. Time-Warped Almost-Cyclostationary Signals: Characterization and Statistical Function Measurements. IEEE Trans. Signal Process. 2017, 65, 5526–5541. [Google Scholar] [CrossRef]
  23. Das, S.; Genton, M.G. Cyclostationary Processes With Evolving Periods and Amplitudes. IEEE Trans. Signal Process. 2021, 69, 1579–1590. [Google Scholar] [CrossRef]
  24. Sun, R.B.; Du, F.P.; Yang, Z.B.; Chen, X.F.; Gryllias, K. Cyclostationary Analysis of Irregular Statistical Cyclicity and Extraction of Rotating Speed for Bearing Diagnostics With Speed Fluctuations. IEEE Trans. Instrum. Meas. 2021, 70, 3514011. [Google Scholar] [CrossRef]
  25. Leśkow, J.; Napolitano, A. Foundations of the functional approach for signal analysis. Signal Process. 2006, 86, 3796–3825. [Google Scholar] [CrossRef]
  26. Gardner, W.A. Cyclostationarity.com. 2018. Available online: https://cyclostationarity.com (accessed on 1 October 2023).
  27. Napolitano, A.; Gardner, W.A. Fraction-of-time probability: Advancing beyond the need for stationarity and ergodicity assumptions. IEEE Access 2022, 10, 34591–34612. [Google Scholar] [CrossRef]
  28. Gardner, W.A. Transitioning away from stochastic process models. J. Sound Vib. 2023, 565, 117871. [Google Scholar] [CrossRef]
  29. Kac, M.; Steinhaus, H. Sur les fonctions indépendantes (IV) (Intervalle infini). Stud. Math. 1938, 7, 1–15. [Google Scholar] [CrossRef]
  30. Kac, M. Statistical Independence in Probability, Analysis and Number Theory; The Mathematical Association of America: Washington, DC, USA, 1959. [Google Scholar]
  31. Gardner, W.A.; Brown, W.A. Fraction-of-time probability for time-series that exhibit cyclostationarity. Signal Process. 1991, 23, 273–292. [Google Scholar] [CrossRef]
  32. Gardner, W.A.; Spooner, C.M. The cumulant theory of cyclostationary time-series. Part I: Foundation. IEEE Trans. Signal Process. 1994, 42, 3387–3408. [Google Scholar] [CrossRef]
  33. Izzo, L.; Napolitano, A. The higher-order theory of generalized almost-cyclostationary time-series. IEEE Trans. Signal Process. 1998, 46, 2975–2989. [Google Scholar] [CrossRef]
  34. Miao, H.; Zhang, F.; Tao, R. A general fraction-of-time probability framework for chirp cyclostationary signals. Signal Process. 2021, 179, 107820. [Google Scholar] [CrossRef]
  35. Zemanian, A.H. Distribution Theory and Transform Analysis; Dover: New York, NY, USA, 1987. [Google Scholar]
  36. Dehay, D.; Leśkow, J.; Napolitano, A. Time average estimation in the fraction-of-time probability framework. Signal Process. 2018, 153, 275–290. [Google Scholar] [CrossRef]
  37. Parzen, E. On Estimation of a Probability Density Function and Mode. Ann. Math. Stat. 1962, 33, 1065–1076. [Google Scholar] [CrossRef]
  38. Rosenblatt, M. Curve Estimates. Ann. Math. Stat. 1971, 42, 1815–1842. [Google Scholar] [CrossRef]
  39. Serfling, R.J. Approximation Theorems of Mathematical Statistics; John Wiley & Sons, Inc.: Hoboken, NJ, USA, 1980. [Google Scholar]
  40. Castellana, J.; Leadbetter, M. On smoothed probability density estimation for stationary processes. Stoch. Process. Their Appl. 1986, 21, 179–193. [Google Scholar] [CrossRef]
  41. Shevgunov, T.; Napolitano, A. Fraction-of-time density estimation based on linear interpolation of time series. In Proceedings of the 2021 Systems of Signals Generating and Processing in the Field of on Board Communications, Moscow, Russia, 16–18 March 2021. [Google Scholar] [CrossRef]
  42. Dehay, D. Spectral analysis of the covariance of the almost periodically correlated processes. Stoch. Process. Their Appl. 1994, 50, 315–330. [Google Scholar] [CrossRef]
  43. Dehay, D.; Leśkow, J. Functional limit theory for the spectral covariance estimator. J. Appl. Probab. 1996, 33, 1077–1092. [Google Scholar] [CrossRef]
  44. Leskow, J. Asymptotic normality of the spectral density estimators for almost periodically correlated stochastic processes. Stochatic Process. Their Appl. 1994, 52, 351–360. [Google Scholar] [CrossRef]
  45. Napolitano, A. Generalizations of Cyclostationary Signal Processing: Spectral Analysis and Applications; John Wiley & Sons Ltd.: Hoboken, NJ, USA; IEEE Press: Piscataway, NJ, USA, 2012. [Google Scholar] [CrossRef]
  46. Shevgunov, T.; Efimov, E.; Guschina, O. Estimation of a Spectral Correlation Function Using a Time-Smoothing Cyclic Periodogram and FFT Interpolation–2N-FFT Algorithm. Sensors 2023, 23, 215. [Google Scholar] [CrossRef] [PubMed]
  47. Dandawaté, A.V.; Giannakis, G.B. Nonparametric polyspectral estimators for kth-order (almost) cyclostationary processes. IEEE Trans. Inf. Theory 1994, 40, 67–84. [Google Scholar] [CrossRef]
  48. Dandawaté, A.V.; Giannakis, G.B. Asymptotic theory of mixed time averages and kth-order cyclic-moment and cumulant statistics. IEEE Trans. Inf. Theory 1995, 41, 216–232. [Google Scholar] [CrossRef]
  49. Spooner, C.M. Cyclostationary Signal Processing: Understanding and Using the Statistics of Communication Signals. 2015. Available online: https://cyclostationary.blog (accessed on 1 October 2023).
  50. Picinbono, B. Second-order complex random vectors and normal distributions. IEEE Trans. Signal Process. 1996, 44, 2637–2640. [Google Scholar] [CrossRef]
  51. Van Trees, H.L. Detection, Estimation, and Modulation Theory. Part I; John Wiley & Sons, Inc.: New York, NY, USA, 1971. [Google Scholar]
  52. Huang, G.; Tugnait, J.K. On Cyclostationarity Based Spectrum Sensing Under Uncertain Gaussian Noise. IEEE Trans. Signal Process. 2013, 61, 2042–2054. [Google Scholar] [CrossRef]
Figure 1. Monte Carlo P md versus T. Energy detector (black): (∗). Quadratic form detectors (blue) and single-cycle detectors (green): (▽) cyclic pdf (kernel-based estimator); (□) cyclic CDF (Fourier coefficient of the indicator); (◯) cyclic autocorrelation (cyclic correlogram); (◊) cyclic CDF (kernel-based estimator); (✶) cyclic 4th-order moment.
Figure 1. Monte Carlo P md versus T. Energy detector (black): (∗). Quadratic form detectors (blue) and single-cycle detectors (green): (▽) cyclic pdf (kernel-based estimator); (□) cyclic CDF (Fourier coefficient of the indicator); (◯) cyclic autocorrelation (cyclic correlogram); (◊) cyclic CDF (kernel-based estimator); (✶) cyclic 4th-order moment.
Inventions 08 00152 g001
Figure 2. ROC: Monte Carlo P d versus nominal P fa . (Left) T = 2 15 T s ; (Right) T = 2 19 T s . Energy detector (black): (*). Quadratic form detectors (blue) and single cycle detectors (green): (▽) cyclic pdf (kernel-based estimator); (□) cyclic CDF (Fourier coefficient of the indicator); (◯) cyclic autocorrelation (cyclic correlogram); (◊) cyclic CDF (kernel-based estimator); (✶) cyclic 4th-order moment.
Figure 2. ROC: Monte Carlo P d versus nominal P fa . (Left) T = 2 15 T s ; (Right) T = 2 19 T s . Energy detector (black): (*). Quadratic form detectors (blue) and single cycle detectors (green): (▽) cyclic pdf (kernel-based estimator); (□) cyclic CDF (Fourier coefficient of the indicator); (◯) cyclic autocorrelation (cyclic correlogram); (◊) cyclic CDF (kernel-based estimator); (✶) cyclic 4th-order moment.
Inventions 08 00152 g002
Figure 3. ROC: Monte Carlo P d versus Monte Carlo P fa . (Left) T = 2 15 T s ; (Right) T = 2 19 T s . Quadratic form detectors (blue): (▽) cyclic pdf (kernel-based estimator); (□) cyclic CDF (Fourier coefficient of the indicator); (◯) cyclic autocorrelation (cyclic correlogram); (◊) cyclic CDF (kernel-based estimator); (✶) cyclic 4th-order moment.
Figure 3. ROC: Monte Carlo P d versus Monte Carlo P fa . (Left) T = 2 15 T s ; (Right) T = 2 19 T s . Quadratic form detectors (blue): (▽) cyclic pdf (kernel-based estimator); (□) cyclic CDF (Fourier coefficient of the indicator); (◯) cyclic autocorrelation (cyclic correlogram); (◊) cyclic CDF (kernel-based estimator); (✶) cyclic 4th-order moment.
Inventions 08 00152 g003
Figure 4. Monte Carlo (effective) P fa is versus nominal or design P fa . (Left) T = 2 15 T s ; (Right) T = 2 19 T s . Quadratic form detectors (blue): (▽) cyclic pdf (kernel-based estimator); (□) cyclic CDF (Fourier coefficient of the indicator); (◯) cyclic autocorrelation (cyclic correlogram); (◊) cyclic CDF (kernel-based estimator); (✶) cyclic 4th-order moment. Black line: Monte Carlo P fa = nominal P fa .
Figure 4. Monte Carlo (effective) P fa is versus nominal or design P fa . (Left) T = 2 15 T s ; (Right) T = 2 19 T s . Quadratic form detectors (blue): (▽) cyclic pdf (kernel-based estimator); (□) cyclic CDF (Fourier coefficient of the indicator); (◯) cyclic autocorrelation (cyclic correlogram); (◊) cyclic CDF (kernel-based estimator); (✶) cyclic 4th-order moment. Black line: Monte Carlo P fa = nominal P fa .
Inventions 08 00152 g004
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Dehay, D.; Leśkow, J.; Napolitano, A.; Shevgunov, T. Cyclic Detectors in the Fraction-of-Time Probability Framework. Inventions 2023, 8, 152. https://doi.org/10.3390/inventions8060152

AMA Style

Dehay D, Leśkow J, Napolitano A, Shevgunov T. Cyclic Detectors in the Fraction-of-Time Probability Framework. Inventions. 2023; 8(6):152. https://doi.org/10.3390/inventions8060152

Chicago/Turabian Style

Dehay, Dominique, Jacek Leśkow, Antonio Napolitano, and Timofey Shevgunov. 2023. "Cyclic Detectors in the Fraction-of-Time Probability Framework" Inventions 8, no. 6: 152. https://doi.org/10.3390/inventions8060152

Article Metrics

Back to TopTop