Skip to main content
EURASIP Journal on Advances in Signal Processing
EURASIP Journal on Advances in Signal Processing Cover Image
Download PDF

Intra-pulse modulation recognition using short-time ramanujan Fourier transform spectrogram

EURASIP Journal on Advances in Signal Processing volume 2017, Article number: 42 (2017) Cite this article

Abstract

Intra-pulse modulation recognition under negative signal-to-noise ratio (SNR) environment is a research challenge. This article presents a robust algorithm for the recognition of 5 types of radar signals with large variation range in the signal parameters in low SNR using the combination of the Short-time Ramanujan Fourier transform (ST-RFT) and pseudo-Zernike moments invariant features. The ST-RFT provides the time-frequency distribution features for 5 modulations. The pseudo-Zernike moments provide invariance properties that are able to recognize different modulation schemes on different parameter variation conditions from the ST-RFT spectrograms. Simulation results demonstrate that the proposed algorithm achieves the probability of successful recognition (PSR) of over 90% when SNR is above -5 dB with large variation range in the signal parameters: carrier frequency (CF) for all considered signals, hop size (HS) for frequency shift keying (FSK) signals, and the time-bandwidth product for Linear Frequency Modulation (LFM) signals.

Introduction

Intra-pulse modulation recognition aiming at recognizing the intentional intra-pulse modulation type of radar signals plays a critical role in modern intercept receivers, which could be used to recognize the signal threat level and choose the optimal algorithm to estimate parameters of the detected signal [1].

In intra-pulse modulation recognition context, more interest has been focused on the study of the feature based (FB) algorithms [2,3,4,5]. Thereinto, as a significant means to FB, the time-frequency analysis has been developed because it allows description of the instantaneous characteristics of a signal in the two-dimensional (2D) time-frequency space [6,7,8,9,10,11,12,13,14,15]. The authors in [9] proposed a robust method for radar emitter recognition based on the Wigner–Ville distribution (WVD) and transfer learning, the average recognition rate (ARR) reaches more than 90% when signal-to-noise ratio (SNR) is 10 dB. In [10], Gustavo Lopez-Risueno et al. proposed an algorithm based on Short-time Fourier transform (STFT) to distinguish No Modulation, phase shift keying (PSK), frequency shift keying (FSK) and linear frequency modulation (LFM) sweeping a narrow band, it performs well when SNR is around 10 dB. In [11], a morphological operation based method had been exploited for a recognition of constant hop size (HS), constant time-frequency product, and carrier frequency (CF) ranging from 500 MHz to 1GHz intra-pulse modulations, the accuracy can reach more than 95% for SNRs above -4 dB. In [12], Deguo Zeng et al. proposed an approach based on the ambiguity function to recognize six types of modulations, and it suitable for a recognition of LFM signals with bandwidth sweeping from 2 MHz to 15 MHz, pulse-width (PW) equaling 3,5 and 7 μs when SNRs above -1 dB. In [13], the authors utilized the Rihaczek distribution and the Hough transform (HT) to discriminate Monopulse (MP) and binary phase shift keying (BPSK) signals with limited CF, binary frequency shift keying (2FSK) and 4-ary frequency shift keying (4FSK) signals with limited HS, and LFM with large time-bandwidth product ranging from 17.5 to 65, their simulation results show that the probability of successful recognition (PSR) is greater than 90% when the SNR is above -4 dB. However, these approaches suffer from low PSR under negative SNR environment, especially have certain limitations for recognizing radar signals with large variation range on CF, HS and time-bandwidth product in the complicated noise condition. Therefore, it is paramount to explore new robust algorithms to obtain high PSR under conditions of low SNR and to recognize signals in a large variation range of signal parameters.

Recently, the concept of Ramanujan Fourier Transform(RFT) based time-frequency transform, namely Short-time Ramanujan Fourier transform(ST-RFT) has been investigated owing to the good immunity to noise interference of RFT functions [16,17,18]. Following this, the time-frequency analysis of signals based on RFT was considered in a letter by Sugavaneswaran [19]. Their research indicates that in the presence of noise this class of transforms has lower effect in comparison to Discrete Fourier Transform (DFT) based time-frequency transforms. Consequently, regarding the noise robustness, the ST-RFT is more efficient than the traditional DFT based time-frequency transform, and is a promising solution for intra-pulse modulation recognition under low SNR.

Nonetheless, how to realize an efficient recognition procedure for radar signals with large parameter variation range is still a challenging problem. The pseudo-Zernike moments have opened a wider set of applications for radar signal recognition in recent years, because the moments can provide potentially useful invariance properties such as translation, scale, and rotational invariance [20, 21]. In [22], Jarmo Lundén, et al. examined the suitability of pseudo-Zernike moments as features for radar waveform recognition, In [23], a new radar classification algorithm based on STFT and pseudo-Zernike moments features is proposed. Inspired by the aforesaid background, the pseudo-Zernike moments are beneficial to realize intra-pulse modulation recognition in scenarios with large variation in the signal parameters.

The objective in this article is to develop a novel method which contains a “ST-RFT spectrogram computation”, a “moments feature computation” and a “recognition” to realize a classification of MP, LFM, BPSK, 2FSK and 4FSK signals with large variation range in the signal parameters: CF, HS and time-frequency product under negative SNR. The first part is used to obtain the ST-RFT spectrograms, which can represent features of intra-pulse modulation signals even when the SNR is low. In the second part, the pseudo-Zernike moments features are used to extract information on spectrograms, which can provide invariance properties that are able to recognize different modulations when parameters change. The last part is used to classify 5 modulations in detail. Simulation results have showed that the recognition algorithm achieves very reliable performance: over 90% PSR when SNR is above -5 dB with CF ranges from 800 MHz to 1600 MHz, HS ranges from 60 MHz to 1000 MHz, and the time-bandwidth product ranges from 8 to 500.

The rest of the article is organized as follows. Section 2 proposes an intra-pulse modulation recognition model. Section 3 defines the mathematical model of the ST-RFT spectrogram and presents the spectrogram features for all the modulation schemes under consideration. Section 4 focuses on the mathematical model of pseudo-Zernike moments computation and describes the process of moments feature selection. Section 5 presents the proposed recognition algorithm. Simulation results are presented and discussed in Section 6. Finally, conclusions are presented in Section 7.

System model

An intra-pulse modulation recognition approach based on Short-Time Ramanujan Fourier Transform (ST-RFT) and pseudo-Zernike moments feature is proposed in this paper. The system model of the proposed approach is shown in Fig. 1.

Fig. 1
figure1

Model of the intra-pulse modulation recognition approach proposed in this paper

Full size image

Three parts are included in this research: ST-RFT spectrogram computation, moments feature computation, and recognition. The ST-RFT analysis is a preprocess of moments feature computation, which could be used to obtain the ST-RFT spectrograms so as to represent features of intra-pulse modulation signals under negative SNR.

In the moments feature computation part, pseudo-Zernike moments features selected based on the degree of overlapping between each pair of classes of the signal data set are extracted from the spectrograms for its good invariance properties, which consist of ψ 3,3 feature and ψ 2,0, ψ 5,1 features.

After ψ 3,3 feature computation, intra-pulse modulation signals are described by vectors. These describing vectors are used for recognition by using threshold decision. Furthermore, after ψ 2,0 and ψ 5,1 features computation, intra-pulse modulation signals are described by matrices, which are used for recognition by using KNN classifier [22].

Mathematical model of ST-RFT spectrogram and ST-RFT spectrogram features

Ramanujan Fourier transform (RFT)

In the classical DFT, the basis functions e p (n) are defined as [16]

$$ {e}_p(n)= \exp \left(2 j\pi \frac{p}{q} n\right), p=1,\dots, q. $$
(1)

It is clear from (1), e p (n) are obtained as multiples of a basis frequency (1/q).

In the RFT, Ramanujan sums(RS) c q (n) are sums defined as the n-th powers of q-th primitive roots of unity [23]

$$ {c}_q(n)={\displaystyle \sum_{p=1;\left( p, q\right)=1}^q \exp \left(2 j\pi \frac{p}{q} n\right)}. $$
(2)

It can be observed that c q (n) are the sums over the primitive characters e p (n). In other words, the basis functions are built by summing up components which are multiples of the same periodicity q, and only components satisfying (p, q) = 1 contribute to the sum.

The sums were introduced by Ramanujan to play the role of base functions over which typical arithmetical functions s(n) may be projected

$$ s(n)={\displaystyle \sum_{q=1}^{\infty }{s}_q}{c}_q(n) $$
(3)

It is obvious that an arithmetical function s(n) is an infinite sequence defined for 1 ≤ n ≤ ∞ for RFT, rather than that for DFT which is taken with a finite n shown in [24].

The s q is referred to as the RFT coefficient given by [25]

$$ {s}_q=\frac{1}{\phi (q)}\underset{N\to \infty }{ \lim}\frac{1}{N}{\displaystyle \sum_{n=1}^N s(n){c}_q(n)}, $$
(4)

which is what we called the RFT.

Meanwhile, one can write the Wiener-Khintchine formula according to [26], and the linear property and the frequency multiplication property of RFT can be readily obtained.

ST-RFT spectrogram computation

In this paper, the ST-RFT is used to extract the necessary features of 5 modulations for intra-pulse modulation recognition. The reasons for this choice is that as a windowed RFT function, the ST-RFT transform allows simultaneous description of a signal in time and frequency so that the temporal evolution of the signal spectrum can be analyzed in the time-frequency space.

For an arbitrary discrete-time signal s(n) of length N, the ST-RFT of the signal is defined as

$$ S T- R F{T}_s\left( k, q\right)=\frac{1}{\phi (q)}\underset{N\to \infty }{ \lim}\frac{1}{N}{\displaystyle \sum_{n=1}^N s(n)}{\varphi}^{*}\left( n- k\right){c}_q(n), $$
(5)

where φ(k) is the Rectangular window function of length H, and φ(0) = 1.

Then the ST-RFT spectrogram S s (k, q) defined as the squared absolute value of the ST-RFT of s(n) is given by

$$ {S}_s\left( k, q\right)={\left| ST- RF{T}_s\left( k, q\right)\right|}^2. $$
(6)

In the present work here, we take MP signal as an example to illustrate the deduction of the ST-RFT spectrogram expression of 5 modulations: MP signal, LFM signal, BPSK signal, 2FSKsignal and 4FSK signal.

Considering the following continuous-time MP signal

$$ {s}_{MP}(t)= A{e}^{j\left(2\pi \frac{1}{T} t+{\varphi}_0\right)}, $$
(7)

where f c is the carrier frequency(CF), \( T=\frac{1}{f_c} \) is the period of the continuous-time signal, A and φ 0 are the amplitude and the initial phase of MP separately.

For a sampling interval of T s (the sampling frequency (SF) is \( {f}_s=\frac{1}{T_s} \)), the discrete representation of signal (7) then becomes

$$ {s}_{MP}\left( n{T}_s\right)= A{e}^{j\left(2\pi n\frac{T_s}{T}+{\varphi}_0\right)}. $$
(8)

Let us represent \( \frac{T_s}{T} \) as \( \frac{1}{T_0} \), the expression of (8) can be given as

$$ {s}_{MP}(n)= A{e}^{j\left(2\pi n\frac{1}{T_0}+{\varphi}_0\right)}, $$
(9)

where T 0 represents the number of samples in one cycle can be written as \( {T}_0=\frac{f_s}{f_c}. \)

Using Eq. (5), the ST-RFT of MP can be expressed as

$$ S T- R F{T}_{MP}\left( k,{T}_0\right)=\frac{A{ e}^{j\left(2\pi \frac{\left(- k+1\right)}{T_0}+{\varphi}_0\right)}}{\phi \left({T}_0\right)}, $$
(10)

in the case of q = T 0.

Substituting Eq. (10) into Eq. (6), the ST-RFT spectrogram of MP becomes

$$ \begin{array}{c}{S}_{MP}\left( k,{T}_0\right)={\left| ST- RF{T}_{MP}\left( k,{T}_0\right)\right|}^2=\frac{A^2}{{\left(\phi \left({T}_0\right)\right)}^2}.\\ {}\end{array} $$
(11)

ST-RFT spectrogram features

Analysis of ST-RFT spectrogram features

In practice, there exists a tradeoff between time and frequency resolution when determining the window length (the duration of window), that is to say, a long duration of window will provide a poor frequency resolution and vice versa. Through a series of simulation experiments, a Rectangular window of length \( H=\frac{4000}{10}=400 \) is selected, which can provide the best frequency resolution-time resolution tradeoff for 5 modulations above-mentioned. Examples of amplitude normalized ST-RFT spectrograms P s (k, q) (a normalization with respect to its maximum value of each ST-RFT spectrogram S s (k, q))of 5 modulations computed from a sample of length N = 4000 with a Rectangular window of length H = 400 are shown in Fig. 2a-e. The contours on the plot represent relative magnitude with the horizontal axis as q and the vertical axis as k(μs).

Fig. 2
figure2

Examples of amplitude normalized ST-RFT spectrograms P s (k, q) computed from a sample of length N = 4000 with a Rectangular window of length H = 400 for 5 modulations: (a) P MP (k, q) for MP signal; (b) P LFM (k, q) for LFM signal; (c) P BPSK (k, q) for BPSK signal encoded by Barker codes; (d) P 2FSK (k, q) for 2FSK signal encoded by deterministic codes [1 0 1 1 0]; (e) P 4FSK (k, q) for 4FSK signal encoded by deterministic codes [0 3 1 0 2]

Full size image

Figure 2 shows the amplitude normalized ST-RFT spectrograms P s (k, q) reflecting time-frequency distribution features of 5 types of modulation signals. Fig.2a shows the P MP (k, q) for MP signal. Ideally, there would be a straight line centred about T 0 in k-q plane as the Eq. (11) implied. By contrast, Fig. 2a shows the line to be spread out in q direction at the expense of reduced frequency resolution, and the peak energy is mainly concentrated in the location of T 0. The P LFM (k, q) for LFM signal with chirp rate u = 300 as depicted in Fig.2b. Based on the observation of the spectrogram, the spectrum line can be approximated by a piecewise line starting at T 0 and finishing at T 0 − i,where i = 1, 2, … T 0 − 1, and each segment reflects the change of its frequency and phase. The P BPSK (k, q) for BPSK signal shown in Fig. 2c illustrates that the amplitude of spectrum obtains the minimum at instant of time of phase conversion, and in the duration of intercode, the P BPSK (k, q) is the same as the P MP (k, q). The P 2FSK (k, q) for 2FSK signal can be seen in Fig. 2d, which has five vertical line segments centered about T 0 and T 1 in k-q plane embodying the number of frequency points, while for the P 4FSK (k, q) of 4FSK signal has 5 ones centered about T 0, T 2, T 1, T 0, T 3 in k-q plane as shown in Fig. 2e.

In summary, the contours on the plot show different spectrogram features of 5 modulations. Hence, the ST-RFT spectrograms can serve as a discriminating feature.

Analysis of discriminability

The parameter R giving the similarity degree between two amplitude normalized spectrogram P s1(k, q) and P s2(k, q) is defined as

$$ R=\frac{{\displaystyle \sum_{k=1}^N{\displaystyle \sum_{q=1}^N\left({P}_{s1}\left( k, q\right)\times {P}_{s2}\left( k, q\right)\right)}}}{\sqrt{{\displaystyle \sum_{k=1}^N{\displaystyle \sum_{q=1}^N{\left({P}_{s1}\left( k, q\right)\right)}^2}}}\sqrt{{\displaystyle \sum_{k=1}^N{\displaystyle \sum_{q=1}^N{\left({P}_{s2}\left( k, q\right)\right)}^2}}}}. $$
(12)

The similarity degree is bounded, 0 ≤ R ≤ 1.

The similarity between any two amplitude normalized ST-RFT spectrograms computed by Eq. (12) with respect to different modulations in the absence of noise is depicted in Table 1. Intuitively, the MP and BPSK signals are difficult to distinguish from each other due to the fact that the spectrograms of the two modulations are similar enough with a similarity degree of 0.9341. In addition, for MP and LFM signals as well as LFM and BPSK signals, the corresponding R are 0.4312 and 0.4544 respectively that means this feature is considered not reliable to provide an effective method of signal differentiation.

Table 1 Similarity between two P s (k, q) with respect to different modulations in the absence of noise
Full size table

Furthermore, the theoretical analysis in Section 3.2 indicates that the location of the ST-RFT spectral peak will be shifted induced by the variation of CFs of the input signals, then alter the feature value P s (k, q) and will finally influence the recognition results.

To tackle these problems, we propose a novel signal recognition method that is based on the combination of the ST-RFT spectrogram and the pseudo-Zernike moments.

Mathematical model of pseudo-Zernike moments and moments feature selection

Mathematical model of pseudo-Zernike moments

Moments have been widely used in image processing for pattern recognition due to its useful invariance properties such as translation, scale, and rotational invariance [21, 27]. Such features capture global information about the image and do not require closed boundaries as boundary-based methods such as Fourier descriptors [27].

The formation of polar coordinates of the pseudo-Zernike moments for f(x, y) can be obtained by projecting f(x, y) onto orthogonal pseudo-Zernike polynomials R e,m (ρ)e ieθ, by the integral [28].

$$ {\psi}_{e, m}=\frac{e+1}{\pi}{\displaystyle {\int}_0^{2\pi}{\displaystyle {\int}_0^1{R}_{e, m}\left(\rho \right){e}^{- im\theta}}} f\left(\rho \cos \theta, \rho \sin \theta \right)\rho d\rho d\theta, $$
(13)

where \( \rho =\sqrt{x^2+{y}^2} \) represents the distance from the origin to a point in the x − y plane, and \( \theta = \arctan \frac{y}{x} \) is a counterclockwise angular displacement in radians from the positive x -axis. R e,m (ρ) are the radial polynomials expressed as

$$ {R}_{e, m}\left(\rho \right)={\displaystyle \sum_{l=0}^{e-\left| m\right|}{\left(-1\right)}^l\frac{\left(2 e+1- l\right)!}{l!\left( e+\left| m\right|+1- l\right)!\left( e-\left| m\right|- l\right)!}}{\rho}^{e- l}, $$
(14)

where e = 0, 1, 2,...., ∞ is the degree of the polynomial, m represents its angular dependence, which takes on positive and negative integer values subject to e ≥ |m| only.

The translation invariance of pseudo-Zernike moments

The translation invariance [27] of the pseudo-Zernike moments is suitable to be applied in illustrating effects of the variation of CFs and is utilized as time-frequency spectrogram features in radar signal classification.

For the amplitude normalized spectrogram P s (k, q) of the 5 modulations, the translation invariance is done by transforming the original time-frequency spectrogram P s (k, q) into another one which is \( {P}_s\left( k+\overline{k}, q+\overline{q}\right) \), where \( \overline{k} \) and \( \overline{q} \) are the centroid location of P s (k, q) computed from

$$ \overline{k}=\frac{m_{10}}{m_{00}},\overline{q}=\frac{m_{01}}{m_{00}}, $$
(15)

where m 00 is the zero order moment defined as \( {m}_{00}={\displaystyle \sum_k{\displaystyle \sum_q{P}_s\left( k, q\right)}} \), m 01 and m 10 are first order moments, given by \( {m}_{10}={\displaystyle \sum_k{\displaystyle \sum_q k{P}_s\left( k, q\right)}} \) and \( {m}_{01}={\displaystyle \sum_k{\displaystyle \sum_q q{P}_s\left( k, q\right)}}. \)

In other words, the origin is moved to centroid before moment comoutation.

In the present work here, a parameter δ is presented to illustrate the translation invariance of the pseudo-Zernike moments is suitable to be applied in signal recognition when CFs change.

$$ \delta =\left|{\psi}_{e_i,{m}_i}\right|\left|{}_{CF\ne 1600 MHz}\right.-\left|{\psi}_{e_i,{m}_i}\right|\left|{}_{CF=1600 MHz}\right., i=1,2, $$
(16)
$$ \mathrm{where}{\psi}_{e_1,{m}_1}={\psi}_{2,0},{\psi}_{e_2,{m}_2}={\psi}_{4,2} $$

As Fig. 3 shows, the maximum variations of δ in |ψ 2,0| for MP and LFM signals are 2.31 × 10− 6 and 2 × 10− 6, and the maximum variations of δ in |ψ 4,2| for MP and LFM signals are 3.5 × 10− 6 and 3.48 × 10− 6, all the values are very small. Consequently, the features are nearly invariant to CFs changing and are feasible for signal classification with the variation in the signal CFs.

Fig. 3
figure3

The values of δ versus different CFs of MP and LFM with u = 80

Full size image

Pseudo-Zernike moments feature selection

The overlap measure indicates the degree of overlapping between two clusters, which can be quantified by computing an inter-cluster overlap [29]. A definition of the overlap rate(OLR) was proposed in [30], which is utilized as representative of the degree of overlap between the given two clusters C i and C j . The OLR is determined by the ratio of the number of the overlap points to that the number of small cluster’s points.

$$ O L R\left({C}_i,{C}_j\right)=\left\{\begin{array}{l}1,\kern6.25em if\ {N}_{{}_{Over-\mathrm{Re} gion}}\ge \kern0.3em {N}_{\min },\\ {}\frac{N_{Over\_\mathrm{Re} gion}}{N_{\min }},\kern2em others.\kern2em \end{array}\right. $$
(17)

where N Over_Region represents the number of the overlap points, N min is the minimum value of N i and N j , which stands for the number of points in each cluster separately. The OLR(C i , C j ) varies from 0 to1, the closer the OLR(C i , C j ) is to 0, the better the cluster separation is. Conversely, the closer the OLR(C i , C j ) is to 1, the two clusters become more strongly overlapped.

In the following, three pseudo-Zernike moment features based on the average value of OLR(OLR′)are proposed for signal recognition. Here the signal data projected onto the 2-D/4-D feature space is obtained by testing all features of the pseudo-Zernike moments ranging from order 1 to order 6.

The algorithm of the moments feature selection for distinguishing LFM with the time-bandwidth between 8 and 500 in the case of SNR varying from -5 dB to 5 dB from the rest of signals is summarized as follows:

Algorithm moments feature selection for LFM signal distinction
8 ≤ uτ 2 ≤ 500
Input: s{ MP, BPSK, LFM, 2FSK, 4FSK}
1. Repeat for L = 1, 2,...50 (update the simulation times)
2. Update \( {P}_{s_i, d, u{\tau}^2}^{(L)}\left( k+\overline{k}, q+\overline{q}\right) \) by using Eq. (6) for each d and uτ 2
3. Update \( {\psi_{e, m}}^{(L)}\left({P}_{s_i, d, u{\tau}^2}\right) \) by using Eqs. (13) and (14) for each e
4. if uτ 2 > = 8 and uτ 2 < = 40
5. Update the \( O L{R_{d, u{\tau}^2}^{\hbox{'}}}^{(L)}\left( imag\left({\psi}_{e, m}\right)\right) \) by using Eq. (17) and \( O L{R_{d, u{\tau}^2}^{\hbox{'}}}^{(L)}\left( imag\left({\psi}_{e, m}\right)\right)=\frac{OL{R_{d, u{\tau}^2}}^{(L)}\left( imag\left({\psi}_{e, m}\right)\right)}{4} \) for each e and d
6. Jointly update the minimum of \( O L{R_{d, u{\tau}^2}^{\hbox{'}}}^{(L)} \) and the corresponding imag (L)(ψ e,m )
7. else update the \( O L{R_{d, u{\tau}^2}^{\hbox{'}}}^{(L)}\left( real\left({\psi}_{e, m}\right)\right) \) by using Eq. (17) and \( O L{R_{d, u{\tau}^2}^{\hbox{'}}}^{(L)}\left( real\left({\psi}_{e, m}\right)\right)=\frac{OL{R_{d, u{\tau}^2}}^{(L)}\left( real\left({\psi}_{e, m}\right)\right)}{4} \) for each e and d
8. Jointly update the minimum of \( O L{R_{d, u{\tau}^2}^{\hbox{'}}}^{(L)} \) and the corresponding real (L)(ψ e,m )
9. end if
10. Until s, e, d, uτ 2 do not satisfy the variation range given.
11. Output: {imag(ψ e,m ), real(ψ e,m )}

step 4: Combining the advantages of imag(ψ 3,3) and real(ψ 3,3) to discriminate LFM signals with large variation range in the time-bandwidth product from other modulations.

The ψ 3,3 is computed as

$$ {\psi}_{3,3}=\frac{4}{\pi}{\displaystyle {\int}_0^{2\pi}{\displaystyle {\int}_0^1{R}_{3,3}}}\left(\rho \right){e}^{- i3\theta}{P}_{\tilde{s}}\left(\rho \cos \theta, \rho \sin \theta \right)\rho d\rho d\theta, $$
(18)
$$ {R}_{3,3}\left(\rho \right)={\rho}^3. $$

For other signals classification, we tested all combinations of two features ranging from order 1 to order 6 and measured the \( O L{R}^{\prime }=\frac{{\displaystyle \sum O L R}}{6} \) which is defined as the average value of OLR between different classes taken in the 4-D feature space and find the minimum. Following the foresaid algorithm, the 8th order moments of index 5 versus index27 for pseudo-Zernike moments referring to ψ 2,0 and ψ 5,1 are experimentally selected as features, which specifically suitable for signal classification with the exception of LFM.

The ψ 2,0 and ψ 5,1 are given by

$$ {\psi}_{2,0}=\frac{3}{\pi}{\displaystyle {\int}_0^{2\pi}{\displaystyle {\int}_0^1{R}_{2,0}\left(\rho \right)}}{P}_{\tilde{s}}\left(\rho cos\theta, \rho \sin \theta \right)\rho d\rho d\theta, $$
(19)
$$ {\psi}_{5,1}=\frac{6}{\pi}{\displaystyle {\int}_0^{2\pi}{\displaystyle {\int}_0^1{R}_{5,1}\left(\rho \right){e}^{- i\theta}}}{P}_{\tilde{s}}\left(\rho \cos \theta, \rho \sin \theta \right)\rho d\rho d\theta, $$
(20)
$$ {R}_{2,0}\left(\rho \right)=10{\rho}^2-12\rho +2,{R}_{5,1}\left(\rho \right)=330{\rho}^5-840{\rho}^4+756{\rho}^3-280{\rho}^2+35\rho . $$

Recognition algorithm

Steps of the proposed algorithm

The proposed modulation signal recognition algorithm is shown in Fig. 4.

Fig. 4
figure4

Block scheme of proposed recognition algorithm

Full size image

The starting point are the modulation signals \( \tilde{s}(n), n=0,1,\dots, N-1 \) to which Gaussian white noise is added. And the following steps of classifying various modulation types of signals are shown as follows:

Step 1: ST-RFT spectrogram Computation.

Step 1.1 Computing the amplitude normalized ST-RFT spectrogram \( {P}_{\tilde{s}}\left( k, q\right) \) of 5 modulations mentioned-above.

Step 1.2 Computing the centroid moved amplitude normalized ST-RFT spectrogram \( {P}_{\tilde{s}}\left( k+\overline{k}, q+\overline{q}\right) \).

Step 2: LFM signal classification.

Measuring imag(ψ 3,3) and real(ψ 3,3) respectively. If imag(ψ 3,3) > th LFM_1 or real(ψ 3,3) < th LFM_2, the signal is regarded as LFM, else go to step 3.

Step 3: Other signals classification.

Step 3.1 Pseudo-Zernike moments ψ 2,0 and ψ 5,1 computation.

Step 3.2 Constructing the 2-D feature space by using ψ 2,0 and ψ 5,1 and determining the optimal distribution range of the spectrogram features of different modulations from the feature space.

Step 4: Use a K-nearest neighbour(KNN)classifier to assign each element to a class for the input radar signals, to perform the classification procedure.

The thresholds for LFM signals recognition

The thresholds th LFM_1 and th LFM_2 are utilized to distinguish LFM with the time-bandwidth product between 8 and 40 and to distinguish LFM with the time-bandwidth product between 41 and 500 from other signals. They could be obtained by the iterative thresholding algorithm [20] and lots of simulations.

As in Fig. 5a, the minimum of the average value of imag(ψ 3,3) for LFM signal class is obtained when uτ 2 = 40 at SNR = − 5dB which is close to 0.40 × 10− 4 and for the rest of other signal classes the maximum of the average value of imag(ψ 3,3) obtained at SNR = 5dB is close to 0.21 × 10− 4 in general as shown in Fig. 5b. Finally, we set \( t{h}_{LFM\_1}=\frac{0.40\times {10}^{-4}+0.21\times {10}^{-4}}{2}=0.31\times {10}^{-4} \) as the optimal threshold for LFM classification. Meanwhile, as in Fig. 5c, the average value of real(ψ 3,3) for LFM signal class obtains the maximum at uτ 2 = 41 for SNR = 5 dB and the maximum is close to − 0.73 × 10− 4, and for other signal classes, the minimum of the average values of real(ψ 3,3) is close to − 0.50 × 10− 4 obtained at SNR = − 5dB from Fig. 5d. Thus the threshold th LFM_2 can be set to \( \frac{-0.73\times {10}^{-4}+-0.50\times {10}^{-4}}{2}=-0.62\times {10}^{-4} \) to guarantee the correct classification of the LFM signals with the time-bandwidth product between 41 and 500.

Fig. 5
figure5

The thresholds for LFM signals recognition: a the average values of imag(ψ 3,3) against different uτ 2 ranging from 8 to40 for different SNR values; b the average values of imag(ψ 3,3) versus SNR for different modulations for uτ 2 = 40; c the average values of real(ψ 3,3) against different uτ 2 ranging from 41 to500for different SNR values; d the average values of real(ψ 3,3) versus SNR for different kinds of signals for uτ 2 = 41

Full size image

Results and discussion

Choice of the modulation signal parameters for the Clustering

The parameters used for the clustering are shown in Table 2. CR, PW and HS stand for code rate, pulse-width and frequency hop size, respectively. Meanwhile, for BPSK, we use 5 bit Barker codes, the 2FSK and 4FSK are encoded by deterministic codes in order to lower the effect of deficiency of some codes. Codes are defined as [0 1 0 1 0] for 2FSK and [0 1 2 3 0]for 4FSK. And the length of Rectangular window is set to be 400. In addition, the SNR values from -5 to 5 dB for most conditions.

Table 2 Parameters for the clustering
Full size table

Choice of the modulation signal parameters for test

In order to verify that the proposed method can achieve better performance than the algorithm based STFT, we did the following simulations. The code parameters for BPSK、2FSK and 4FSK are same as the parameters set in 6.1 for both algorithms. The CFs are 800 MHz, 1000 MHz and 1600 MHz. The HSs are 60 MHz, 100 MHz and 1000 MHz. The chirp rates for LFM are 40 MHz/ μs,80 MHz/ μs,100 MHz/ μs,1200 MHz/ μs.And the length of rectangular window is set to be 400 and the SNR values from -5 to 5 dB.

Simulation results analysis

To estimate the classifier performance, 50 signals are used for the clustering, and each simulation was run 100 times, evaluating the average recognition rate (ARR).

The effects of CFs and HSs variation

Figure 6 is used to get indications how much the CFs and HSs variation affect the performance at SNR = 5 dB and SNR = 0 dB respectively. The MP、BPSK and LFM signals are simulated with CFs ranging from 800 MHz to 1600 MHz, the FSK signals are simulated with HSs ranging from 60 MHz to 1000 MHz. As expected, the variation in CFs and HSs would not affect the performance much. And the property makes the pseudo-Zernike moments very suitable to spectrogram features recognization with random variation in the signal parameters: CFs and HSs.

Fig. 6
figure6

The effects of CFs and HSs variation: (a) Performance analysis for different CFs for MP、BPSK and LFM signals at SNR = 5dB; (b) Performance analysis for different HSs for FSK signals at SNR = 0dB

Full size image

The performance of the proposed algorithm

Figure 7 reports the scatter plots related to ψ 2,0 and ψ 5,1 for pseudo-Zernike for all the data of the 4 types modulation signals for different SNR. Both the STFT and ST-RFT based algorithms have been considered. The scatter plots shown in Fig. 7a and c demonstrate that for SNR = 5 dB, the extraction of the pseudo-Zernike moments from ST-RFT give a certain degree of separation within the class. As shown in Fig. 7b and d, for SNR = -5 dB the 4 classes could be considered to be classified more accurate by the proposed algorithms in comparison to the STFT based algorithm. Consequently, in the presence of noise, the proposed algorithm performs well especially for MP and BPSK signals recognition.

Fig. 7
figure7

Scatter plots of 5th vs 27th moments of 4 type modulation signals classes based on ST-RFT and STFT: (a) STFT based algorithm for SNR = 5 dB; (b) STFT based algorithm for SNR = -5 dB; (c) ST-RFT based algorithm for SNR = 5 dB; (d) ST-RFT based algorithm for SNR = -5 dB

Full size image

These behaviors are also confirmed by the results illustrated in Fig. 8, where the ARR is plotted versus different SNRs ranging from -5 dB to 5 dB both for STFT, ST-RFT based algorithms and the algorithm presented in [9]. Thereinto, for STFT and ST-RFT algorithms, the modulations used to obtain the ARR are MP, LFM, BPSK, 2FSK and 4FSK signals satisfying the signal parameters for test discussed in the paper. And for [9], the modulations used to obtain the ARR are the signals of their own choosing. It is obvious that, an increment in the SNR leads to a higher performance. Obviously, in the case of SNR = -5 dB, the proposed algorithm reaches a ARR of 90%, while the ARR of STFT algorithm reaches 70%,and the ST-RFT based algorithms assure a higher level of ARR than the STFT counterpart. Consequently, as conclusion to these analyses, it can be claimed that the performance of our algorithm based on the combination of the ST-RFT and the pseudo-Zernike moments is preferred to STFT based algorithm. Meanwhile, comparison of the work to the techniques presented in [9] shows that the approach proposed in this paper has better robustness against SNR variation.

Fig. 8
figure8

ARR (%) versus different SNRs for different algorithms

Full size image

Conclusions

In this paper, we have presented a new method for intra-pulse modulation recognition under low SNR environment. In this method, the ST-RFT spectrograms for 5 modulation schemes are firstly calculated. Then the pseudo-Zernike moments are applied to the ST-RFT spectrogram to uniquely discriminate the spectrogram features for different modulations when parameters change. Simulation results demonstrate a robust recognition performance over a wide range of SNRs, CFs, HSs, and time-bandwidth product. Meanwhile, based on the simulation results analysis, our method is better comparison of the work to the STFT based technique and the technique presented in [9].

However, our work only on few modulation schemes, a discussion on the technique applied to other modulation schemes, such as NLFM, PWM, PPM will be developed.

Abbreviations

2D:

Two-dimensional

2FSK:

Binary frequency shift keying

4FSK:

4-ary frequency shift keying

ASK:

Amplitude shift keying

ARR:

Average recognition rate

BPSK:

Binary phase shift keying

CF:

Carrier frequency

CR:

Code rate

DFT:

Discrete Fourier Transform

FB:

Feature based

FSK:

Frequency shift keying

GCD:

Greatest common divisor

HS:

Hop size

HT:

Hough transform

KNN:

K-nearest neighbour

LFM:

Linear frequency modulation

MP:

Monopulse

M-PSK:

M-ary phase shift keying

OLR:

Overlap rate

PW:

Pulse-width

PSK:

Phase shift keying

PSR:

Probability of successful recognition

QPSK:

Quadrature phase shift keying

RS:

Ramanujan sums

RFT:

Ramanujan Fourier Transform

STFT:

Short-time Fourier transform

ST-RFT:

Short-Time Ramanujan Fourier Transform

SF:

Sampling frequency

SNR:

Signal-to-noise ratio

WVD:

Wigner–Ville distribution

References

  1. 1.

    W Pei, QZ Yang, Z Jun, T Bin, Autonomous radar pulse modulation classification using modulation components analysis. EURASIP J. Adv. Signal Process. 2016(1), 1-11(2016)

  2. 2.

    OA Dobre, A Abdi, Y Bar-Ness, W Su, Survey of automatic modulation classification techniques: classical approaches and new trends. IET Com 1(2), 137–156 (2007)

    Article  Google Scholar 

  3. 3.

    D Grimaldi, S Rapuano, LD Vito, An Automatic Digital Modulation Classifier for Measurement on Telecommunication Networks. IEEE Trans Instrum Meas 56(5), 1171–1720 (2007)

    Article  Google Scholar 

  4. 4.

    SZ Hsue, SS Soliman, Automatic modulation classification using zero crossing. IEE Proc, Radar, Sonar Navig 137(6), 459–464 (1990)

    Google Scholar 

  5. 5.

    H Alharbi, S Mobien, S Alshebeili, F Alturki, Automatic modulation classification of digital modulations in presence of HF noise. EURASIP J Adv Signal Process 1, 3639–3654 (2012)

    Google Scholar 

  6. 6.

    K Hassan, I Dayoub, W Hamouda, M Berbineau, Automatic Modulation Recognition Using Wavelet Transform and Neural Networks in Wireless Systems. EURASIP J Adv Signal Process 1, 1–13 (2010)

    MATH  Google Scholar 

  7. 7.

    S Qian, D Chen, Joint Time-Frequency Analysis. IEEE Sig Process Mag 16(2), 52–67 (1999)

    Article  Google Scholar 

  8. 8.

    F Hlawatsch, GF Boudreaux-Bartels, Linear and quadratic time-frequency signal representations. IEEE Sig Process Mag 9(2), 21–67 (1992)

    Article  Google Scholar 

  9. 9.

    Z Yang, W Qiu, H Sun, A Nallanathan, Robust Radar Emitter Recognition Based on the Three-Dimensional Distribution Feature and Transfer Learning. Sensors 16(3), 1–14 (2016)

    Article  Google Scholar 

  10. 10.

    G Lopez-Risueno, J Grajal, A Sanz-Osorio, Digital Channelized Receiver Based on Time-Frequency Analysis for Signal Interception. IEEE Trans Aerosp Electron Syst 41(3), 879–898 (2005)

    Article  Google Scholar 

  11. 11.

    Y Zhang, X Ma, D Cao, Automatic Modulation Recognition Based on Morphological Operations. Circuits Syst Signal Process 32(5), 2517–2515 (2013)

    MathSciNet  Article  Google Scholar 

  12. 12.

    D Zeng, H Xiong, J Wang, B Tang, An Approach to Intra-Pulse Modulation Recognition Based on the Ambiguity Function. Circuits Syst Signal Process 29(6), 1103–1122 (2010)

    Article  MATH  Google Scholar 

  13. 13.

    D Zeng, X Zeng, H Cheng, B Tang, Automatic modulation classification of radar signals using the Rihaczek distribution and Hough transform. IET Radar Sonar Navig 6(5), 322–331 (2012)

    Article  Google Scholar 

  14. 14.

    TJ Lynn, AZ Sha’amerr, Automatic analysis and classification of digital modulation signals using spectrogram time frequency analysis. Proc. International Symposium on Communications & Information Technologies (CIT'07) (,Sydney, NSW,2007), pp. 916-920.

  15. 15.

    F Xie, C Li, G Wan, An Efficient and Simple Method of MPSK Modulation Classification. 4th International Conf. on Wireless Communications, Networking and Mobile Computing (WiCOM '08) (,Dilian, China, 2008), pp. 1–3

  16. 16.

    M Planat, H Rosu, S Perrine, Ramanujan sums for signal processing of low-frequency noise. Phys Rev E 66(5), 715–720 (2002)

    MathSciNet  Article  Google Scholar 

  17. 17.

    LT Mainardi, L Pattini, S Cerutti, Application of the Ramanujan Fourier Transform for the Analysis of Secondary Structure Content in Amino Acid Sequences. Meth Inf Med 46(2), 126–129 (2007)

    Google Scholar 

  18. 18.

    S Samadi, MO Ahmad, MNS Swamy, Ramanujan Sums and Discrete Fourier Transforms. IEEE Signal Process Lett 12(4), 293–296 (2005)

    Article  Google Scholar 

  19. 19.

    L Sugavaneswaran, S Xie, K Umapathy, S Krishnan, Time-Frequency Analysis via Ramanujan Sums. IEEE Signal Process Lett 19(6), 352–355 (2012)

    Article  Google Scholar 

  20. 20.

    J Lundén, V Koivunen, Automatic Radar Waveform Recognition, IEEE Journal of selected topics in signal process. 1(1), 124-126 (2007)

  21. 21.

    C Clemente, L Pallotta, AD Maio, JJ Soraghanand, A Fatina, A Novel, Algorithm for Radar Classification Based on Doppler Characteristics Exploiting Orthogonal Pseudo-Zernike Polynomials. IEEE Trans Aerosp Electron Syst 51(1), 417–430 (2015)

    Article  Google Scholar 

  22. 22.

    MW Aslam, Z Zhu, AK Nandi, Automatic Modulation Classification Using Combination of Genetic Programming and KNN. IEEE Trans Wireless Commun 11(11), 2742–2750 (2012)

    Google Scholar 

  23. 23.

    S Ramanujan, On certain trigonometric sums and their applications in the theory of numbers. Trans Cambridge Philos Soc 22(13), 259–276 (1918)

    Google Scholar 

  24. 24.

    PP Vaidyanathan, Ramanujan Sums in the Context of Signal Processing—Part I: Fundamentals. IEEE Trans on Signal Process 62(16), 4145–4157 (2014)

    MathSciNet  Article  Google Scholar 

  25. 25.

    RD Carmichael, Expansions of arthmetical functions in infinite series. Proc London Math Soc 34(13), 1–26 (1930)

    Google Scholar 

  26. 26.

    M Planat, M Minarovjech, M Saniga, Ramanujan sums analysis of long-period sequences and 1/f noise. Epl 85(4), 4005–4010 (2008)

    Google Scholar 

  27. 27.

    A Khotanzad, YH Hong, Invariant Image Recognition by Zernike Moments. IEEE Trans Pattern Anal Mach Intell 12(5), 489–497 (1990)

    Article  Google Scholar 

  28. 28.

    R Mukundan, KR Ramakrishnan, Moment Functions in Image Analysis- Theory and Applications (River Edge, NJ, 1998), pp. 1-150

  29. 29.

    K Dae-Won, KH Lee, D Lee, On cluster validity index for estimation of the optimal number of fuzzy clusters. Patt Recog 37(10), 2009–2025 (2004)

    Article  Google Scholar 

  30. 30.

    Z Hong, Q Jiang, H Guan, F Weng, Measuring overlap-rate in hierarchical cluster merging for image segmentation and ship detection. Proc. International Conference on Fuzzy Systems & Knowledge Discovery(FSKD'07) (,Haikou, Hainan, China, 2007), pp. 420-425

Download references

Acknowledgements

The authors would like to thank the reviewers for their time and effort spent in carefully reviewing the manuscript, and for their valuable comments that have greatly contributed to the enhancement of article’s quality.

Funding

This work is partially supported by Tianjin Research Program Application Foundation and Advanced Technology (15JCQNJC01100).

Authors’ contributions

XM conceived the approach; XM, DL and YS designed the experiments; DL and YS performed the experiments. All authors read and approved the final manuscript.

Competing interests

The authors declare that they have no competing interests.

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Author information

Affiliations

  1. The Department of Computer and Communication Engineering, Engineering Research Center of Communication Devices and Technology, Ministry of Education, Tianjin Key Laboratory of Film Electronic and Communication Devices, Tianjin University of Technology, 391, Binshui-West Road, 300384, Tianjin, Xiqing District, China

    Xiurong Ma, Dan Liu & Yunlong Shan

Authors
  1. Xiurong Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dan Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yunlong Shan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiurong Ma.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Ma, X., Liu, D. & Shan, Y. Intra-pulse modulation recognition using short-time ramanujan Fourier transform spectrogram. EURASIP J. Adv. Signal Process. 2017, 42 (2017). https://doi.org/10.1186/s13634-017-0469-9

Download citation

Keywords

  • Intra-pulse modulation recognition
  • Pseudo-Zernike moments
  • Short-Time Ramanujan Fourier Transform
  • Probability of successful recognition