Keywords

1 Introduction

The anti-jamming performance of radar is increasingly important in modern electronic warfare. Mainlobe interference reduces the output SINR of radar, increases false alarm rate, and makes it difficult for previous interference suppression algorithms against sidelobe interference to suppress mainlobe interference, which may cause mainlobe distortion and suppression of desired signals as interference. As one of the important means of electronic jamming, mainlobe interference can easily deceive target distance, velocity, angle and other parameters, seriously affecting the normal operation and detection performance of radar system. In paper [1], a mainlobe interference suppression method based on low sidelobe constraint blocking matrix preprocessing (BMP) is proposed. The Angle of mainlobe interference is estimated using the singular value decomposition (SVD) method, and a blocking matrix is constructed to suppress mainlobe interference. In paper [2], the main lobe interference suppression technique of wideband noise based on space–time adaptive processing (STAP) is studied. A mainlobe interference suppression method based on oblique projection of eigenvalues is proposed in [3]. The eigenvalue oblique projection preprocessing matrix is constructed to filter out the main lobe interference, and then the influence of covariance mismatch matrix is reduced by diagonal loading. In [4], a four-channel monopulse technique for suppressing mainlobe interference was proposed. In Ref. [5], a method for anti-deception interference of an array radar was proposed. The idea based on FRFT transformation mentioned in the paper was applied to suppress the main lobe interference proposed in this paper. We propose a FRFT-based radar’s primary lobe jamming suppression technique that uses FRFT transformation’s special feature for linear frequency modulation signal. The algorithm can effectively suppress jamming and improve peak signal-to-noise ratio after pulse compression according to theoretical analysis. The performance of the proposed method is verified through comprehensive performance analyses and simulation results.

1.1 Signal Model

Using a linear frequency modulation signal as the transmission signal for a radar system, its mathematical expression in the time domain is (Fig. 1):

$$s(t) = {\text{rect}}{{(t} \mathord{\left/ {\vphantom {{(t} {T_{p} )}}} \right. \kern-0pt} {T_{p} )}}{\text{e}}^{{{\text{j}}2\pi f_{c} + {\text{j}}\pi \kappa t^{2} }}$$
(1)
Fig. 1
A diagrammatic illustration depicts radar signals with a desired signal, deceptive jamming, and the goal of suppressing jamming denoted by the parameter theta.

Radar antenna signal reception schematic diagram

In the formula, \(s(t)\) is the radar transmission signal, \({\text{rect(}}{t \mathord{\left/ {\vphantom {t {T_{p} }}} \right. \kern-0pt} {T_{p} }}{)}\) represents the rectangular pulse function, \(T_{p}\) represents the pulse width, \(f_{c}\) represents the signal carrier frequency, and \(\kappa\) represents the modulation frequency.

The mathematical model of the target in the radar echo needs to consider the time delay and frequency shift caused by the target distance and movement, then the mathematical model of the target echo signal is:

$$s_{1} (t) = s_{0} (t - \tau_{1} ){\text{e}}^{{ - {\text{j}}2\pi f_{c} \frac{{2v_{r1} }}{c}t}}$$
(2)

In the formula, \(s_{1} (t)\) is the echo signal of the target, \(\tau_{1}\) is the time delay of the echo signal. Because there is a distance between the radar and the target, there will be a time delay between the echo signal and the radar transmitted signal. The relationship between the time delay \(\tau_{1}\) of the target and the distance \(r_{1}\) of the target is \(\tau_{1} = \frac{{2r_{1} }}{c}\).

1.2 Principles Related to FRFT

In 1980, Namias first proposed the definition of Fractional Fourier transform from a purely mathematical perspective in terms of eigenvalues and eigenfunctions [6]. Subsequently, McBride provided a more rigorous mathematical definition for Fractional Fourier transform in integral form [7]. Below we give the basic definition of Fractional Fourier transform from the perspective of integral transformation.

The p-th order Fractional Fourier transform of a time-domain signal x(t) defined in the t-domain is a linear integral operation:

$$F^{p} (u) = \int\limits_{ - \infty }^{ + \infty } {K_{p} (u,t)x(t)dt}$$
(3)

In the formula, \(K_{p} (u,t)\) is the kernel function of FRFT, and \(p\) represents the transformation order, which can be specifically written as

$$K_{p} (t,u) = \left\{ {\begin{array}{*{20}l} {\sqrt {(1 - j\cot \alpha )/(2\pi )} \exp \left( {j\frac{{u^{2} + t^{2} }}{2}\cot \alpha - jut\csc \alpha } \right),} & {\alpha \ne n\pi } \\ {\delta (t - u),} & {\alpha = 2n\pi } \\ {\delta (t + u),} & {\alpha = (2n + 1)\pi } \\ \end{array} } \right.$$
(4)

After variable substitution \(u = u/\sqrt {2\pi }\) and \(t = t/\sqrt {2\pi }\), Formula (3) can be further written as

$$\begin{aligned} F^{p} (u) & = {\text{\{ }}F^{p} [x(t)](u){\text{\} }} = \int\limits_{ - \infty }^{ + \infty } {K_{p} (u,t)x(t)dt} ,\quad 0 < \left| p \right| < 2,0 < \left| \alpha \right| < 2 \\ & = \left\{ {\begin{array}{*{20}l} {_{\alpha } \exp (j\frac{{u^{2} + t^{2} }}{2}\cot \alpha - jut\csc \alpha )x(t)dt,} & {\alpha \ne n\pi } \\ {x(t),} & {\alpha = 2n\pi } \\ {x( - t),} & {\alpha = (2n + 1)\pi } \\ \end{array} } \right. \\ \end{aligned}$$
(5)

where \(A_{\alpha } = \sqrt {(1 - j\cot \alpha )/(2\pi )}\), the definition of FRFT given by formula (5) is linear but not shift-invariant (except for \(p = 4n\)), because the kernel function is not only a function of \((u,t)\) but also a function of \(p\). It is worth noting that \(F^{4n}\) and \(F^{4n + 2}\) are equivalent to the identity operator \({\rm I}\) and parity operator \({\rm P}\) respectively. For \(p = 1\), \(\alpha = \pi /2,A_{\alpha } = 1\), and:

$$F^{1} (u) = \int\limits_{ - \infty }^{ + \infty } {\exp (j2\pi ut)x(t)dt}$$
(6)

It can be seen that \(F^{1} (u)\) is the ordinary Fourier transform of \(x(t)\), and similarly, \(F^{ - 1} (u)\) is the ordinary inverse Fourier transform of \(x(t)\).

Linear frequency modulation signals are typical non-stationary signals with large time-bandwidth products, widely used in radar, communication, sonar detection and other fields, especially in radar systems. As a linear transform that decomposes signals into chirp bases without cross-term interference, Fractional Fourier transform is particularly suitable for processing chirp-like signals. Analogous to how any vector on a two-dimensional plane can be decomposed into two basis vectors along x and y axes, any LFM signal can also be decomposed into two chirp bases. By choosing an appropriate order p, FRFT can concentrate the energy of the chirp signal on the basis vector along this direction, forming an impulse pulse, whereas conventional Fourier transform usually does not align with this “optimal direction”, resulting in more dispersed energy with a certain bandwidth. Therefore, FRFT has good energy aggregation characteristics for LFM signals in some fractional transform domains [8].

2 Mainlobe Interference Suppression Algorithm

Assume that the time-domain representation of an arbitrary LFM signal is expressed as \(\phi (t) = \exp ({\text{j}}2\uppi f_{0} t + {\text{j}}\uppi \kappa t^{{2}} )\). Then, the \(p\) th order FRFT transform of LFM signal can be written as [9]:

$$\begin{aligned} & F^{p} [x_{LFM} (t)](u) = F^{p} [\phi (t)](u) \\ & = \left\{ {\begin{array}{*{20}l} {\sqrt {\frac{{1 + {\text{j}}\tan \alpha }}{1 + \kappa \tan \alpha }} \exp \left[ {{\text{j}}\pi \frac{{(\kappa - \tan \alpha )u^{2} + 2uf_{c} \sec \alpha - f_{c}^{2} \tan \alpha }}{1 + \kappa \tan \alpha }} \right],} & {\alpha - \arctan \kappa \ne {{(2i + 1)\pi } \mathord{\left/ {\vphantom {{(2i + 1)\pi } 2}} \right. \kern-0pt} 2}} \\ {\sqrt {\frac{1}{{1 - {\text{j}}\kappa }}} \exp [ {{\text{j}}\pi \cos \alpha ( - f_{c}^{2} \sin \alpha + 2uf_{c} )} ]\delta (u - f_{c} \sin \alpha ),} & {\alpha - \arctan \kappa = {{(2i + 1)\pi } \mathord{\left/ {\vphantom {{(2i + 1)\pi } 2}} \right. \kern-0pt} 2}} \\ \end{array} } \right. \\ \end{aligned}$$
(7)

Utilizing the characteristic of linear frequency modulation signals in Fractional Fourier transform, we propose a radar mainlobe interference suppression technique based on FRFT. The received mainlobe interference mixed echo signal is first processed by FRFT, followed by filtering in the FRFT domain to remove most of the suppressed interference and noise energy. The target signal is then recovered by inverse FRFT. Theoretical analysis suggests that this algorithm can effectively suppress interference and significantly improve the peak signal-to-noise ratio after pulse compression. By analyzing the phase relationship between peak values of continuous pulse echoes and improving the signal-to-noise ratio of fractional domain echo signals through coherent accumulation, it is possible to extract peak values of LFM signals under low signal-to-noise ratio conditions. The design method process is shown in the Fig. 2.

Fig. 2
A flow chart outlines the radar signal processing steps, including F R F T processing and domain filtering to filter out interference, followed by an inverse F R F T transformation to suppress interference signals and enhance the signal-to-noise ratio.

Flowchart of main lobe interference suppression algorithm based on FRFT

Since both deceptive interference signals and target echoes are wideband LFM signals with the same modulation rate \(\kappa\), for ease of analysis, we first analyze the phase relationship in the fractional domain of the target echo signals received by radar antenna after \(p_{0}\) th order FRFT processing. It can be derived that by representing the target echo component in the m-th echo received by the radar antenna as a phase-shifted and frequency-shifted form of an LFM signal.

$$s_{0} (t_{m} ,\tilde{t}) = \chi_{m} \gamma (m){\text{exp}}( - {\text{j2}}\pi f_{m} \tilde{t} + {\text{j}}\pi \kappa \tilde{t}^{2} )$$
(8)

where,

$$\begin{aligned} \chi_{m} & = {\text{rect}}\left[ {\frac{{\tilde{t} - \tau (t_{m} )}}{{T_{p} }}} \right],\quad f_{m} = \kappa \tau (t_{m} ) \\ \gamma (m) & = {\text{exp\{j}}2\pi f_{c} [ - \tau (t_{m} )] + {\text{j}}\pi \kappa [\tau (t_{m} )]^{2} {\text{\} }} \\ \end{aligned}$$
(9)

The above equation can be regarded as the result of an LFM signal with a carrier frequency of \(f_{m}\) and a modulation rate of \(\kappa\) undergoing data truncation and linear transformation. In the actual digital sampling process, the radar antenna uses the same distance gate for digitizing samples of the same echo.

According to the aforementioned analysis, FRFT has many excellent properties such as reversibility, linearity, exponential additivity, commutativity, associativity, time-shift property and frequency-shift property [7,8,9,10]. Utilizing these properties, we analyze the phase relationship in fractional domain of target echo signals received by radar antenna. Since \(\tan \alpha_{0} = \kappa \gg 1\), then \(\kappa {\text{cos}}\alpha_{0} = {\text{sin}}\alpha_{0} \approx 1\). According to Eqs. (7) and (8), the fractional domain form \(F^{{p_{0} }} [\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\smile}$}}{s}_{0} (t_{m} ,\tilde{t})](u)\) can be further expressed as:

$$\begin{aligned} & F^{{p_{0} }} [\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\smile}$}}{s}_{0} (t_{m} ,\tilde{t})](u) \\ & \quad = A_{\kappa } \gamma (m)\exp \left\{ { - {\text{j}}\pi \frac{{\kappa^{3} }}{{\kappa^{2} + 1}}[\tau (t_{m} )]^{2} } \right\} \cdot \exp ( - {\text{j}}2\pi f_{m} {\text{cos}}\alpha_{0} u) \\ & \quad \approx A_{\kappa } \gamma (m)\exp \left\{ { - {\text{j}}\pi \frac{{\kappa^{3} }}{{\kappa^{2} + 1}}[\tau (t_{m} )]^{2} } \right\} \cdot \exp \{ - {\text{j}}2\pi [\tau (t_{m} )]u\} \\ & \quad \approx A_{\kappa } \gamma (m)\exp \{ - {\text{j}}\pi \kappa [\tau (t_{m} )]^{2} \} \cdot \exp \{ - {\text{j}}2\pi [\tau (t_{m} )]u\} \\ & \quad = A_{\kappa } {\text{exp}}\{ - {\text{j}}2\pi f_{c} [\tau (t_{m} )\} \cdot \exp \{ - {\text{j}}2\pi [\tau (t_{m} )]u\} \\ \end{aligned}$$
(10)

wherein, the transformation order \(p_{0}\) is a specific transformation order that converts an LFM signal into a complex single-frequency point signal in a fractional Fourier domain. That is, after performing FRFT with an order of \(p_{0}\), the LFM signal becomes a sine wave with a frequency of \(f = f_{0} \cos \alpha_{0}\) [9]. In digital processing, its specific transformation order is expressed as: \(p_{0} = \frac{2}{\pi }{\text{arctan}}\left( {\frac{{N_{g} \kappa }}{{f_{s}^{2} }}} \right)\).

Since discrete FRFT operations also require dimension normalization processing, this paper adopts discrete scaling proposed in literature to perform scale transformation[11]. By decomposing the above equation according to the radar antenna received signal model, we obtain the fractional domain data \({\mathbf{S}}_{m} (u)\) obtained by processing the target signal of sampling \(m\)th echo with \(p_{0}\)-order FRFT as follows:

$${\mathbf{s}}_{m} (u) = A_{\kappa } \exp [ - {\text{j}}2\pi \tau (t_{m} )(f_{c} + u)] = A_{\kappa } {\text{exp}}[ - {\text{j}}2\pi f_{c} \tau (t_{m} ) - {\text{j}}2\pi \tau (t_{m} )u)]$$
(11)

From Eq. (11), it can be seen that the incident signal of the \(m\)-th echo received by the radar is equivalent to the fractional domain signal \({\mathbf{s}}_{m} (u)\), and the fractional domain frequency of signal \({\mathbf{s}}_{m} (u)\) is determined by time delay \(\tau (t_{m} )\). According to the dimension normalization method in literature [11], the fractional domain frequency corresponding to signal \({\mathbf{s}}_{m} (u)\) can be expressed as:

$$f_{nu} = \left| {\frac{{\frac{{\tau_{\max } + \tau_{\min } }}{2} - \tau (t_{m} )}}{{\sqrt {\frac{{\tau_{\max } - \tau_{\min } }}{{f_{s} }}} }}} \right|$$
(12)

In the equation, \(\left| \cdot \right|\) represents taking absolute value, \(\tau_{\min }\) and \(\tau_{\max }\) respectively represent the time delay corresponding to the minimum value \(R_{\min }\) and maximum value \(R_{\max }\) of distance gate. Since the frequency of target echo signal in fractional domain is determined by target’s time delay relative to center of gate, prior information about target position is usually known before transmitting broadband signal. For example, it is known that target distance interval is \([r_{\min } ,r_{\max } ] \subset [R_{\min } ,R_{\max } ]\), and assuming that two distance intervals have a common center. Accordingly, the highest frequency of target echo in fractional domain is:

$$f_{mu} = \frac{{\frac{{\tau_{\max } + \tau_{\min } }}{2} - \frac{{2r_{min} }}{c}}}{{\sqrt {\frac{{\tau_{\max } - \tau_{\min } }}{{f_{s} }}} }}$$
(13)

Therefore, if the echo signal of the interference target is outside the distance interval \([r_{\min } ,r_{\max } ]\), the frequency of the interference signal in the fractional domain will be greater than \(f_{mu}\), and the interference signal can be filtered out by a low-pass filter in the fractional domain.

3 Simulation Results

A desired signal and a noise suppression interference signal were set up along with two deception interference signals. All the signals are coming from the same direction. The velocities of interference signals 1 and 2 were set to − 10 m/s and − 15 m/s respectively, while the velocity of the desired signal was set to 15 m/s. The signal-to-noise ratio was set as 0 dB, and the interference noise ratio of two deceptive interferences and one suppressing interference was set as 18 dB,18 dB and 35 dB respectively (Fig. 3).

Fig. 3
3 time-frequency chart depicts signal characteristics with varying frequencies over time. Diagram a depicts frequency variation over samples, b. illustrates data frequency, and c. displays amplitude variation with time.

The time–frequency diagram of the signal: a noise suppression interference signal time–frequency distribution diagram, b time–frequency distribution of transmitted signal, c time–frequency distribution of the signal after algorithm processing

From the time–frequency diagrams before and after algorithm processing, it can be seen that the algorithm has clearly filtered out most of the interference in the frequency band after processing, especially suppressing interference.

By processing the echo signal and performing pulse compression and coherent processing, an R-D plane is obtained for moving target detection and parameter estimation. The algorithm simulation results are shown in the Fig. 4.

Fig. 4
2 graphs depict doppler frequency with varying signal-to-noise ratio scenarios. Graph a depicts the doppler frequency response for true target and false target, while graph b displays the doppler frequency response over different range bins.

a R-D distribution of simulated echo received signal b R-D distribution of signal after algorithm processing

According to the simulation results, the proposed algorithm can significantly suppress main lobe interference from two signals in the same direction as the desired signal, thereby making the desired signal more prominent and significantly improving the signal-to-noise ratio.

4 Conclusions

In this paper, we propose an algorithm that involves FRFT processing of the received mixed echo signal with primary lobe jamming. Most of the energy of suppressed jamming and noise in FRFT domain is filtered out. Simulation experiments show that the algorithm can effectively improve the estimation accuracy under the condition of low signal-to-noise ratio with the presence of the main lobe interference. The algorithm can improve the peak signal-to-noise ratio after pulse compression and improve the detection performance of the pulse compression radar.