## 1.

## Introduction

Synthetic aperture radar (SAR) can realize imaging for ground targets all day and under all weather conditions, which can achieve a high resolution in the range direction due to the use of high transmitted-pulse bandwidth and in the azimuth direction due to the storage of data over a certain observation time.^{1}^{,}^{2} In the conventional SAR imaging mode, the pointing direction of the antenna is nearly perpendicular to the flight path. However, on some occasions, in order to point at an angle from the broadside, squint mode is adopted to increase the flexibility of SAR.^{3}^{,}^{4} Compared to the broadside SAR, squint SAR can give repeat observations on the same region during its whole flight track.^{5} With this prominent advantage, the highly squinted SAR is becoming the research focus.^{3}4.5.^{–}^{6} The conventional imaging method for highly squinted SAR is based on the matched filter (MF) algorithm, which needs Nyquist samples of the echoes. However, along with the improvement of range resolution, the SAR imaging system requires increasing measurements, storage, and downlink bandwidth.^{7} Hence, we intend to find an imaging method for highly squinted SAR, which can not only guarantee the quality of the imaging results but also dramatically reduce the amount of required echo data.

In the last few years, the compressed sensing (CS) theory was introduced in Refs. 8 and 9, which indicates that one can stably and accurately reconstruct nearly sparse signals from dramatically under-sampled data in an incoherent domain. With this prominent advantage, the CS theory has been used in SAR data processing to reduce the data amount and enhance the system performance.^{10}11.12.13.14.15.16.^{–}^{17} A compressive radar imaging scheme based on the CS theory was first reported by Baraniuk and Steeghs,^{11} with which the pulse compression MF is no longer needed. In Ref. 12, the SAR raw data are compressed and the imaging result is reconstructed by using the CS framework with real wavelets. References 13 and 14 convert the two-dimensional (2-D) SAR imaging problem into a subsignal collection problem, which could dramatically reduce the amount of raw data. However, high computation and memory costs are required to decompose and recover the 2-D subsignals. The CS processing is performed after the conventional range compression in Refs. 15 and 16, which could acquire a high-resolution azimuth profile. In Ref. 17, a 2-D sparse SAR imaging scheme with stepped-frequency waveform is put forward. The advantage of this method is that only a small number of frequencies and echo data are needed to reconstruct the image of targets. However, all of these works are suitable only for broadside SAR. There are few reference works devoted specifically to highly squinted SAR imaging combining with CS theory. Due to the special imaging geometry, the highly squinted SAR brings new complexities and challenges to the imaging process. Thus, the aforementioned CS-SAR imaging methods cannot be utilized in highly squinted SAR imaging with the under-sampled echo data.

In this paper, an imaging method for highly squinted SAR based on the CS theory is put forward. First, an imaging method for highly squinted SAR with the Nyquist-sampled data is proposed. The range walk removal function is constructed to correct the linear range walk and the nonlinear chirp scaling (NCS) method is applied to mitigate the range-azimuth coupling. Second, in order to achieve the highly squinted SAR imaging with the under-sampled echo data, the NCS operator and CS imaging scheme are formulated based on the aforementioned imaging method. And then, the imaging result is obtained by using the modified iterative thresholding algorithm (ITA). The main contributions of the present work can be concluded as follows:

1. In order to facilitate the analysis of imaging method with the under-sampled echo data, a new NCS imaging method with Nyquist-sampled echo data is put forward, with which the range walk can be corrected and the range-azimuth coupling can be mitigated.

2. The NCS operator and CS imaging scheme based on the Nyquist-sampled imaging method are established. The modified ITA is utilized to solve the imaging scheme, which forms a highly squinted SAR imaging method. By using the method, just a small amount of imaging data is required for highly squinted SAR imaging.

The rest of the paper is organized as follows. Section 2 gives the signal and geometry model of the highly squinted SAR. An NCS imaging method based on range walk removal is also introduced in this section. In Sec. 3, the NCS operator and CS imaging scheme are constructed. Moreover, the modified ITA is utilized to solve the imaging scheme. Simulation results are presented in Sec. 4 to validate the effectiveness of proposed approach. Finally, we make some conclusions in Sec. 5.

## 2.

## Imaging Algorithm for Highly Squinted Synthetic Aperture Radar with Nyquist-Sampled Data

There are some papers that have put forward highly squinted SAR imaging methods with Nyquist-sampled data.^{3}^{,}^{4} However, it is difficult to obtain the highly squinted imaging operator from these methods. The imaging operator is the key factor in CS SAR imaging method. In order to facilitate the construction of the highly squinted imaging operator, we first focus on establishment of an imaging approach for highly squinted SAR with Nyquist-sampled data in this section.

## 2.1.

### Echo Signal Model for Highly Squinted Synthetic Aperture Radar

The squinted SAR geometry is shown in Fig. 1. An SAR sensor travels along a straight-line flight path during a synthetic aperture length $L$. The velocity and height of platform are $v$ and $h$, respectively. During the data acquisition, the radar beam directs at the target with a squinted angle ${\theta}_{s}$. Symbol ${R}_{0}$ denotes the vertical distance between the scene center and the flight path.

The geometric model of flight path and point scatterer is shown in Fig. 1(b). The distance between the point scatterer $P$ and the flight path is ${R}_{p}$. During the data acquisition, the transmitted chirp signal is

## (1)

$$s(\widehat{t},{t}_{m})=\mathrm{rect}\left(\frac{\widehat{t}}{{T}_{p}}\right)\mathrm{exp}[j2\pi {f}_{0}t+j\pi \gamma {\widehat{t}}^{2}],$$## (2)

$${s}_{r}(\widehat{t},{t}_{m};{R}_{p})=\mathrm{rect}\left[\frac{\widehat{t}-2R({t}_{m};{R}_{p})/c}{{T}_{p}}\right]\mathrm{exp}\left\{j\pi \gamma {[\widehat{t}-\frac{2R({t}_{m};{R}_{p})}{c}]}^{2}\right\}\mathrm{exp}[-\mathrm{j}\frac{4\pi R({t}_{m};{R}_{p})}{\lambda}],$$## (3)

$$R({t}_{m};{R}_{p})=\sqrt{{R}_{p}^{2}+{(v{t}_{m}-{X}_{p})}^{2}-2{R}_{p}(v{t}_{m}-{X}_{p})\mathrm{sin}\text{\hspace{0.17em}}{\theta}_{s}}.$$Expanding the distance $R({t}_{m};{R}_{p})$ in Taylor’s series and neglecting the higher-order terms, $R({t}_{m};{R}_{p})$ can then be expressed approximately as follows:

## (4)

$$R({t}_{m};{R}_{p})={R}_{p}-(v{t}_{m}-{X}_{p})\mathrm{sin}\text{\hspace{0.17em}}{\theta}_{s}+\frac{{(v{t}_{m}-{X}_{p})}^{2}{\mathrm{cos}}^{2}\text{\hspace{0.17em}}{\theta}_{s}}{2{R}_{p}}=\sqrt{{R}_{p}^{2}+{\mathrm{cos}}^{2}\text{\hspace{0.17em}}{\theta}_{s}{(v{t}_{m}-{X}_{p})}^{2}}-(v{t}_{m}-{X}_{p})\mathrm{sin}\text{\hspace{0.17em}}{\theta}_{s}.$$## 2.2.

### Nonlinear Chirp Scaling Imaging Method Based on Range Walk Removal

Applying Fourier transform (FT) with respect to $\widehat{t}$, the signal ${s}_{r}(\widehat{t},{t}_{m};{R}_{p})$ is transferred into range Doppler domain (i.e., range time and azimuth frequency domain), it yields

## (5)

$${S}_{r}({f}_{r},{t}_{m};{R}_{p})=\mathrm{exp}(-j\pi \frac{{f}_{r}^{2}}{\gamma})\mathrm{exp}[-j\frac{4\pi R({t}_{m};{R}_{p})({f}_{r}+{f}_{0})}{c}].$$Submitting Eq. (4) into Eq. (5), we can obtain

## (6)

$${S}_{r}({f}_{r},{t}_{m};{R}_{p})=\mathrm{exp}[-j\frac{4\pi {X}_{p}\text{\hspace{0.17em}}\mathrm{sin}\text{\hspace{0.17em}}{\theta}_{s}({f}_{r}+{f}_{0})}{c}]\mathrm{exp}\left[j\frac{4\pi v{t}_{m}\text{\hspace{0.17em}}\mathrm{sin}\text{\hspace{0.17em}}{\theta}_{s}({f}_{r}+{f}_{0})}{c}\right]\phantom{\rule{0ex}{0ex}}\mathrm{exp}(-j\pi \frac{{f}_{r}^{2}}{\gamma})\mathrm{exp}[-j\frac{4\pi \sqrt{{R}_{p}^{2}+{\mathrm{cos}}^{2}\text{\hspace{0.17em}}{\theta}_{s}(v{t}_{m}-{X}_{p})}({f}_{r}+{f}_{0})}{c}].$$As can be seen from Eq. (6), the second exponential term of ${S}_{r}({f}_{r},{t}_{m};{R}_{p})$ is the linear range walk term. Therefore, the range walk removal function ${H}_{1}({f}_{r},{t}_{m})$ can be written as

## (7)

$${H}_{1}({f}_{r},{t}_{m})=\mathrm{exp}[-j\frac{4\pi v{t}_{m}\text{\hspace{0.17em}}\mathrm{sin}\text{\hspace{0.17em}}{\theta}_{s}({f}_{r}+{f}_{0})}{c}].$$To obtain the 2-D spectrum, we apply FT in azimuth to the aforementioned compensated signal, i.e.,

## (8)

$$S({f}_{r},{f}_{a};{R}_{p})=\mathrm{exp}(-j\pi \frac{{f}_{r}^{2}}{\gamma})\mathrm{exp}[-j\frac{4\pi ({X}_{p}\text{\hspace{0.17em}}\mathrm{sin}\text{\hspace{0.17em}}{\theta}_{s})({f}_{r}+{f}_{0})}{c}]\phantom{\rule{0ex}{0ex}}\mathrm{exp}(-j2\pi {f}_{a}\frac{{X}_{p}}{v})\mathrm{exp}[j\mathrm{\Xi}({f}_{r},{f}_{a};{R}_{p})],$$## (9)

$$\mathrm{\Xi}({f}_{r},{f}_{a};{R}_{p})={\varphi}_{0}({f}_{a})+{\varphi}_{1}({f}_{a}){f}_{r}+{\varphi}_{2}({f}_{a}){f}_{r}^{2}+{\varphi}_{3}({f}_{a}){f}_{r}^{3}+o({f}_{a},{f}_{r}^{4}),$$The chirp rate ${\gamma}_{e}({f}_{a},{R}_{p})$ of $S({f}_{r},{f}_{a};{R}_{p})$ is equivalent to the following expression:

## (10)

$$\frac{1}{{\gamma}_{e}({f}_{a},{R}_{p})}=\frac{1}{\gamma}+\frac{2{R}_{p}}{c{f}_{c}}\frac{1-{B}^{2}({f}_{a})}{{B}^{3}({f}_{a})}.$$Inspecting Eq. (10), ${\gamma}_{e}({f}_{a},{R}_{p})$ is dependent on the Doppler frequency ${f}_{a}$ and the distance ${R}_{p}$, which means the signal $S({f}_{r},{f}_{a};{R}_{p})$ has the characteristic of spatial variance. However, the spatial variance is not considered in the conventional chirp scaling algorithm (CSA). Thus, if using the conventional CSA, the imaging edge would be defocused. The NCS algorithm has considered the spatial variance. Therefore, we adopt it for the following imaging processing.

Before the NCS processing, the third-order term of $S({f}_{r},{f}_{a};{R}_{p})$ should be filtered. According to the above analysis, the filtered function ${H}_{2}({f}_{r})$ is given by

Multiplying Eq. (11) with Eq. (8) and transforming the result into the range Doppler domain by the range inverse FT (IFT), we can obtain

## (12)

$${s}^{\prime}(\widehat{t},{f}_{a};{R}_{p})=\mathrm{exp}(-j\frac{4\pi {X}_{p}\text{\hspace{0.17em}}\mathrm{sin}\text{\hspace{0.17em}}{\theta}_{s}{f}_{0}}{c})\mathrm{exp}(-j2\pi {f}_{a}\frac{{X}_{p}}{v})\mathrm{exp}[-j\frac{4\pi {R}_{p}}{\lambda}B({f}_{a})]\phantom{\rule{0ex}{0ex}}\mathrm{exp}\{-j\pi {\gamma}_{e}({f}_{a},{R}_{p}){[\widehat{t}-\frac{2{X}_{p}\text{\hspace{0.17em}}\mathrm{sin}\text{\hspace{0.17em}}{\theta}_{s}}{c}-\frac{2{R}_{p}}{c}\frac{1}{B({f}_{a})}]}^{2}\}.$$According to the NCS algorithm, the NCS operation function can be written as

## (13)

$${H}_{3}(\widehat{t},{f}_{a};{R}_{0})=\mathrm{exp}\{j\pi {q}_{2}({f}_{a}){[\widehat{t}-{\tau}_{d}({f}_{a},{R}_{0})]}^{2}\},$$## (14)

$${S}^{\prime}({f}_{r},{f}_{a};{R}_{p})=\mathrm{exp}(-j\frac{4\pi {X}_{p}\text{\hspace{0.17em}}\mathrm{sin}\text{\hspace{0.17em}}{\theta}_{s}{f}_{0}}{c})\mathrm{exp}(-j2\pi {f}_{a}\frac{{X}_{p}}{v})\phantom{\rule{0ex}{0ex}}\mathrm{exp}[-j\frac{4\pi {R}_{0}}{\lambda}B({f}_{a})]\mathrm{exp}[-jZ({f}_{r},{f}_{a},\mathrm{\Delta}\tau )],$$## (15)

$$\mathrm{Z}({f}_{r},{f}_{a},\mathrm{\Delta}\tau )=C({q}_{2},{f}_{a},{f}_{r},{f}_{r}^{2})+D({q}_{2},{f}_{a})\mathrm{\Delta}\tau {f}_{r}.$$The first term of Eq. (15) is independent from the range distance, and the second term is the main factor that causes linear shift in the range direction. In order to eliminate the geometric distortion induced by the spatial variance, we set

## (16)

$$D({q}_{2},{f}_{a})=\frac{1}{\alpha ({f}_{a})},\phantom{\rule[-0.0ex]{1em}{0.0ex}}\alpha ({f}_{a})=\frac{1}{B({f}_{a})}.$$Solving Eq. (16), the modulation rate ${q}_{2}$ can be written as

Submitting Eq. (17) into Eq. (14), we can obtain

## (18)

$${S}^{\prime}({f}_{r},{f}_{a};{R}_{p})=\mathrm{exp}(-j\frac{4\pi {X}_{p}\text{\hspace{0.17em}}\mathrm{sin}\text{\hspace{0.17em}}{\theta}_{s}{f}_{0}}{c})\mathrm{exp}(-j2\pi {f}_{a}\frac{{X}_{p}}{v})\mathrm{exp}[-j\frac{4\pi {R}_{0}}{\lambda}B({f}_{a})]\phantom{\rule{0ex}{0ex}}\mathrm{exp}[-j2\pi {\tau}_{d}^{\prime}({f}_{a},{R}_{p}){f}_{r}]\mathrm{exp}[-j\frac{\pi}{\alpha ({f}_{a}){\gamma}_{e}({f}_{a},{R}_{p})}{f}_{r}^{2}]\mathrm{exp}[jM({f}_{a},{R}_{p})],$$From Eq. (18), the range compression function and range cell migration correction (RCMC) function can be given by

## (19)

$${H}_{4}({f}_{r},{f}_{a};{R}_{p})=\mathrm{exp}\left\{j\frac{4\pi [a({f}_{a})-1]{R}_{0}}{c}{f}_{r}\right\}\mathrm{exp}\left[j\frac{\pi {f}_{r}^{2}}{\alpha ({f}_{a}){\gamma}_{e}({f}_{a};{R}_{p})}\right].$$Multiplying Eq. (19) with Eq. (18), we can complete range compression and RCMC. In order to implement the azimuth processing, we transform the result into the range Doppler domain by range IFT. The azimuth compression and residual phase compensated functions ${H}_{5}({f}_{a},\mathrm{\Delta}\tau ;{R}_{p})$ are written as

## (20)

$${H}_{5}({f}_{a},\mathrm{\Delta}\tau ;{R}_{p})=\mathrm{exp}[j\frac{4\pi {R}_{0}}{\lambda}\mathrm{B}({f}_{a})]\mathrm{exp}[-jM({f}_{a},{R}_{p})].$$Then azimuth IFT is applied to the aforementioned result back into the slow-time domain. The imaging result of highly squinted SAR with the Nyquist samples is obtained. The focused imaging result is with some degree of geometric distortion in range and azimuth directions. The detailed geometric correction method is not discussed in this paper, which can be found in Ref. 4.

## 3.

## Imaging Method with Under-Sampled Data

The imaging method for highly squinted SAR with Nyquist-sampled data is proposed in Sec. 2.2. However, the amount of echo data is huge with high-resolution imaging. Therefore, in order to reduce the amount of echo data, the sampled ratio is set lower than that of the Nyquist requires. A sensing method for direct sampling and compressing analog signals is analog-to-information conversion (AIC).^{10} We adopt the AIC framework with random under-sampling scheme in range direction. The essence of this scheme is to nonuniformly under-sample the echo signal. As for the under-sampled echo data, the aforementioned proposed method with Nyquist-sampled data becomes invalid. An imaging algorithm should be proposed.

The superiority of CS lies in that it merges sensing and compressing together, and a small number of “random” measurements can carry enough information to reconstruct the original signal. Thus, the CS theory is introduced to the highly squinted SAR imaging to reduce the amount of echo data. The CS imaging method is put forward with three sequenced steps: First, the NCS operator is constructed based on the imaging method proposed in Sec. 2.2. Second, CS imaging scheme based on the NCS operator is established in details. Third, the modified ITA is utilized to solve the imaging scheme. The relationship between the imaging method with Nyquist samples and with under samples is shown in Fig. 2.

## 3.1.

### Compressed Sensing Model for Highly Squinted Synthetic Aperture Radar

In order to facilitate the following analysis, the NCS imaging method based on range walk removal in Sec. 2.2 can be expressed as follows:

## (21)

$$\mathrm{\Theta}=\mathrm{\Gamma}({s}_{r})={\mathbf{\omega}}_{a}\xb7\{\langle [(\{[(\{{\widehat{\omega}}_{a}\xb7[({s}_{r}\xb7{\mathbf{\omega}}_{r})\xb7{H}_{1}]\}\xb7{H}_{2})\xb7{\widehat{\omega}}_{r}]\xb7{H}_{3}\}\xb7{\mathbf{\omega}}_{r})\xb7{H}_{4}]\xb7{\widehat{\omega}}_{r}\rangle \xb7{H}_{5}\},$$Equation (21) is a reversible process. If we input the complex image data, the echo signal can be obtained by implementing the inverse process of Eq. (21). The inverse process can be expressed as

## (22)

$${s}_{r}={\mathrm{\Gamma}}^{-1}(\mathrm{\Theta})=\{{\mathbf{\omega}}_{a}\xb7\langle [(\{[(\{[({\widehat{\omega}}_{a}\xb7\mathrm{\Theta})\xb7{H}_{5}^{*}]\xb7{\mathbf{\omega}}_{r}\}\xb7{H}_{4}^{*})\xb7{\widehat{\omega}}_{r}]\xb7{H}_{3}^{*}\}\xb7{\mathbf{\omega}}_{r})\xb7{H}_{2}^{*}]\rangle \}\xb7{H}_{1}^{*}\xb7{\widehat{\omega}}_{r},$$^{18}where ${\widehat{N}}_{r}$ is the under-sampled number in range direction, and

## (23)

$${\varphi}_{c,d}=\{\begin{array}{cc}1,& c={m}_{d}\\ 0,& \text{others}\end{array}\phantom{\rule[-0.0ex]{1em}{0.0ex}}d=1,\cdots ,{\widehat{N}}_{r};\phantom{\rule[-0.0ex]{1em}{0.0ex}}{m}_{d}\in 1,\cdots ,{N}_{r};.$$The elements in each row vector of $\mathbf{\Phi}$ are 0, other than the ${m}_{d}$th element, where ${m}_{d}$ is the random number. Thus, we can obtain

From Eq. (24), we can find that the size of under-sampled signal ${s}_{r\mathrm{com}}$ is ${N}_{a}\times {\widehat{N}}_{r}$. The under-sampled ratio of echo signal is defined by $\eta ={\widehat{N}}_{r}/{N}_{r}$. Submitting Eq. (24) into Eq. (22), we can obtain

When ${\mathrm{\Gamma}}^{-1}(\xb7)\xb7\mathbf{\Phi}$ satisfies the restricted isometry property (RIP), the imaging result $\mathrm{\Theta}$ can be obtained by solving the following optimization problem:

## (26)

$$\mathrm{min}{\Vert \mathrm{\Theta}\Vert}_{0}\phantom{\rule[-0.0ex]{1em}{0.0ex}}\text{subject to}\text{\hspace{0.17em}}\text{\hspace{0.17em}}{s}_{r\mathrm{com}}={\mathrm{\Gamma}}^{-1}(\mathrm{\Theta})\xb7\mathbf{\Phi},$$## 3.2.

### Modified Iterative Thresholding Algorithm

How to solve the optimization problem of Eq. (26) is an important aspect in CS theory. Two majors are usually called “${\mathrm{L}}_{1}$-minimization” and “greedy pursuit” and the others are the “nonconvex optimization” and the “Bayesian framework.”^{19} Basis pursuit is one kind of the ${\mathrm{L}}_{1}$-minimization algorithm, which is based on the interior point.^{20} ITA is another kind of the ${\mathrm{L}}_{1}$-minimization algorithm, which is known as a first-order algorithm.^{21} By the ITA, Eq. (26) can be transferred into the following expression:

## (27)

$$\underset{\mathrm{\Theta}}{\mathrm{min}}\{\frac{1}{2}{\Vert {s}_{r\mathrm{com}}-{\mathrm{\Gamma}}^{-1}(\mathrm{\Theta})\xb7\mathrm{\Phi}\Vert}_{2}^{2}+\lambda {\Vert \mathrm{\Theta}\Vert}_{1}\},$$^{21}The conventional ITA generates a sequence of approximates according to

## (28)

$${\widehat{\mathrm{\Theta}}}_{k}=\mathrm{soft}[{\widehat{\mathrm{\Theta}}}_{k-1}+\mu {\mathrm{A}}^{H}({s}_{r\mathrm{com}}-\mathrm{A}\xb7{\widehat{\mathrm{\Theta}}}_{k-1}),\lambda ],$$## (29)

$${\widehat{\mathrm{\Theta}}}_{k}=\mathrm{soft}\{{\widehat{\mathrm{\Theta}}}_{k-1}+\mu \xb7\mathrm{\Gamma}[{s}_{r\mathrm{com}}-{\mathrm{\Gamma}}^{-1}({\widehat{\mathrm{\Theta}}}_{k-1})\xb7\mathbf{\Phi}]{\mathbf{\Phi}}^{H},\lambda \}.$$There are two parameters $\lambda $ and $\mu $ that need to be set. According to Refs. 7, 22, and 23, $\lambda $ and $\mu $ can be set as

## (30)

$${\mu}_{k}=\frac{{\Vert {\mathrm{\Gamma}}^{-1}(\mathrm{\Delta}{\widehat{\mathrm{\Theta}}}_{k})\xb7\mathrm{\Phi}\Vert}_{2}^{2}}{{\Vert \mathrm{\Delta}{\widehat{\mathrm{\Theta}}}_{k}\Vert}_{2}^{2}},\phantom{\rule[-0.0ex]{2em}{0.0ex}}{\lambda}_{k}=\frac{{|{\widehat{\mathrm{\Theta}}}_{k}+{u}_{k}\xb7\mathrm{\Delta}{\widehat{\mathrm{\Theta}}}_{k}|}_{I}}{{u}_{k}},$$Require: Under-sampled echo data ${s}_{r\mathrm{com}}$, NCS imaging operator $\mathrm{\Gamma}(\xb7)$ and inverse imaging operator ${\mathrm{\Gamma}}^{-1}(\xb7)$, low-dimensional measurement matrix $\mathbf{\Phi}$.

Ensure: The imaging result $\mathrm{\Theta}$ of highly squinted SAR.

Step 1. Initialization: ${\mathrm{\Theta}}_{0}=0$, the residual error ${p}_{0}={s}_{r\mathrm{com}}$, the maximum iteration ${K}_{\mathrm{max}}$;

Step 2. For $k=0$ to ${K}_{\mathrm{max}}$ do the following steps;

Step 3. Matched filter on residual error: $\mathrm{\Delta}{\widehat{\mathrm{\Theta}}}_{k}=\mathrm{\Gamma}({p}_{k}\xb7{\mathbf{\Phi}}^{\mathrm{H}})$;

Step 4. Compute the current estimation ${\widehat{\mathrm{\Theta}}}_{k+1}$: ${\widehat{\mathrm{\Theta}}}_{k+1}=\mathrm{soft}({\widehat{\mathrm{\Theta}}}_{k}+{u}_{k}\xb7\mathrm{\Delta}{\widehat{\mathrm{\Theta}}}_{k},\lambda )$;

Step 5. Update the residual error: ${p}_{k+1}={s}_{r\mathrm{com}}-{\mathrm{\Gamma}}^{-1}({\widehat{\mathrm{\Theta}}}_{k+1})\xb7\mathbf{\Phi}$;

Step 6. Check the stopping criterion: if $|{\widehat{\mathrm{\Theta}}}_{k+1}-{\widehat{\mathrm{\Theta}}}_{k}{|}_{2}/|{\widehat{\mathrm{\Theta}}}_{k}{|}_{2}>\rho $, then set $k=k+1$ and go to

**Step 3**; otherwise end.

Then $\widehat{\mathrm{\Theta}}(k)$ can be obtained, which is the imaging result for highly squinted SAR with under-sampled echo data.

## 4.

## Experimental Analysis with Simulated and Measured Data

In this section, some simulations are conducted to demonstrate the effectiveness and feasibility of the proposed method. The experiments with simulated data using airborne SAR parameters shown in Table 1 are carried out.

## Table 1

Synthetic aperture radar parameters.

Parameters | Values |
---|---|

Carrier frequency (f0) | 10 GHz |

Range bandwidth (B) | 50 MHz |

Platform velocity (v) | 100 m/s |

Pulse repetition interval (Tp) | 10 μs |

Center slant range (RB) | 14.14 km |

Squint angle (θs) | 45 deg |

The simulation uses an array of three targets, which are located in a $5\text{\hspace{0.17em}}\text{\hspace{0.17em}}\mathrm{km}\times 5\text{\hspace{0.17em}}\text{\hspace{0.17em}}\mathrm{km}$ grid in the slant range plane in azimuth/range, as shown in Fig. 3. Three targets have the same azimuth position and a distance of 2 km in the range direction. In the imaging methods, target P2 located at the center of observed scene is selected as the reference target.

First, the simulated echo data are sampled with the Nyquist theory. The proposed imaging algorithm in Sec. 2.2 is applied to process the simulated data. Figures 4(a) and 4(b) show the images of three targets when considering and not considering the spatial variance. It can be noted that the imaging result of target P2 is not affected by the spatial variance, which is focused well with both two methods. However, when not considering the spatial variance, the imaging results of targets P1 and P3 cannot be focused as shown in Fig. 4(b). By using the proposed method in Sec. 2.2, the targets P1 and P3 are focused quite well as shown in Fig. 4(a). Therefore, the proposed method in Sec. 2.2 is valid and feasible.

Next, in order to validate the proposed method in Sec. 3, the echo data are under-sampled by the random scheme. Let the under-sampled ratios $\eta $ be $1/2$ and $1/3$. The reconstructed imaging results by using the CS imaging method are presented in Fig. 5. Figures 5(a) and 5(b) are the imaging results when $\eta $ is $1/2$ and $1/3$, respectively. Comparing with Fig. 4(a), we can find that the sidelobes of Fig. 5 are lower and the quality of the resultant image is good enough. Therefore, by using the CS imaging method in Sec. 3, just a small amount of imaging data is required for highly squinted SAR imaging.

In addition, to further evaluate the performance of the proposed algorithm, the measured parameters peak sidelobe ratios (PSLRs) of target P2 in range and azimuth directions are calculated. PSLRs of target P2 in Fig. 4(a) are $-13.21$ and $-13.01\text{\hspace{0.17em}}\text{\hspace{0.17em}}\mathrm{dB}$, respectively, which are nearly the theoretical values. However, PSLRs of target P2 in Fig. 5(a) are $-16.12$ and $-15.09\text{\hspace{0.17em}}\text{\hspace{0.17em}}\mathrm{dB}$, respectively, which are much smaller than that of Fig. 4(a). It means that the quality of CS imaging method is better than that of imaging method proposed in Sec. 2.2.

In order to further validate our method, the simulated scene data are utilized in the following analysis. The simulation parameters are set the same as that of the above point target simulation. The observed scene is shown in Fig. 6. Figure 7(a) shows the imaging result without correcting geometric distortion by Nyquist-sampled imaging method, while Fig. 7(b) is the imaging result with geometric distortion corrected. Let the under-sampled ratio $\eta $ be $3/4$. The respective imaging results obtained by Nyquist-sampled imaging method and the proposed CS method are shown in Fig. 7(c) and 7(d). We can find that the Nyquist-sampled imaging method can only obtain image when samples are fully adopted. While $\eta $ is $3/4$, the imaging quality is poor. However, the proposed CS method can perfectly recover the image, with a much reduced sidelobe. Figures 7(e) and 7(f) show the imaging results by the proposed CS imaging method with $\eta =1/2$ and $1/4$, respectively. When $\eta $ is $1/2$, the CS method can recover the image. However, when the under-sampled ratio is $1/4$, the quality of the image is not very good; only the main information of observed scene can be obtained. It is easy to be comprehended and also according with the CS reconstructing theory. Therefore, the proposed method is valid and feasible.

Next, the peak signal-to-noise ratio (PSNR) and CPU times are utilized to compare the quality and efficiency of the proposed methods. The experiment is run in MATLAB 2010a on a computer with an Intel Pentium 3.2 GHz Dual-Core processor and 3GB memory. The comparison results are shown in Table 2. As can be observed from the Table, PSNR of $\eta =3/4$ is higher than that of $\eta =1/2$. It means that the quality of $\eta =3/4$ is better, which is accordingly with the imaging results shown in Figs. 7(d) and 7(e). The CPU time comparison result shows that the Nyquist-sampled method is faster than the CS imaging method. However, the CPU time of the two methods is at the same level of magnitude. And even considering the multiple iterations, the CPU time will still not exceed two orders of magnitude.

## Table 2

Comparison of peak signal-to-noise ratio (PSNR) and CPU time.

Indicators | Methods | ||
---|---|---|---|

Compressed sensing imaging method | Nyquist-sampled imaging method | ||

Under-sampled ratio | 3/4 | 1/2 | |

PSNR (dB) | 45.55 | 40.84 | |

CPU time (s) | 17.3 | 16.1 | 3.1 |

## 5.

## Conclusions

In this paper, an imaging method for highly squinted SAR with under-sampled echo data based on CS theory is proposed, which can solve the problem of the huge data amount in highly squinted SAR system. At first, the imaging method with the Nyquist-sampled echo data is proposed. Based on the method, the CS imaging method with the under-sampled echo data is then put forward. By using the proposed method, the highly squinted SAR imaging result can be obtained with a small amount of echo data.

However, the sampling rate of the proposed method is mainly determined by the sparsity of observed scene, which cannot be strictly defined. Even in some specific conditions, there are still many small targets in the background. In practice, we assume them to be zeros. As a result, the neglected small scatterers may affect the understanding of the imaging result. In order to obtain the small scatterers, the sampling rate of the proposed method cannot be reduced, which should be 100% Nyquist sampling rate. How to use our method for the nonsparse scene with under-sampled echo data is our current research.

## Appendices

## Appendix: Proof for the RIP of Matrix

From Eq. (22), ${\mathrm{\Gamma}}^{-1}(\mathrm{\Theta})$ can be explicitly expressed by

## (31)

$${\mathrm{\Gamma}}^{-1}(\mathrm{\Theta})=\{{\mathbf{\omega}}_{a}\xb7\langle [(\{[(\{[({\mathbf{\omega}}_{a}^{\prime}\xb7\mathrm{\Theta})\xb7{H}_{5}^{*}]\xb7{\mathbf{\omega}}_{r}\}\xb7{H}_{4}^{*})\xb7{\mathbf{\omega}}_{r}^{\prime}]\xb7{H}_{3}^{*}\}\xb7{\mathbf{\omega}}_{r})\xb7{H}_{2}^{*}]\rangle \}\xb7{H}_{1}^{*}\xb7{\mathbf{\omega}}_{r}^{\prime}.$$Let $\theta $ denotes the vector form of $\mathrm{\Theta}$, namely, $\theta =\mathrm{vec}(\mathrm{\Theta})$. According to Ref. 7, ${\mathrm{\Gamma}}^{-1}(\mathrm{\Theta})$ can be written as matrices, and we have

## (32)

$$\mathrm{vec}[{\mathrm{\Gamma}}^{-1}(\mathrm{X})]=\mathbf{G}\xb7x={\widehat{\omega}}_{r}^{\prime}\xb7{\widehat{H}}_{1}^{*}\xb7{\widehat{\omega}}_{a}\xb7{\widehat{H}}_{2}^{*}\xb7{\widehat{\omega}}_{r}\xb7{\widehat{H}}_{3}^{*}\xb7{\widehat{\omega}}_{r}^{\prime}\xb7{H}_{4}^{*}\xb7{\widehat{\omega}}_{r}\xb7{\widehat{H}}_{5}^{*}\xb7{\widehat{\omega}}_{a}^{\prime}\xb7x,$$Thus, ${s}_{r\mathrm{com}}={\mathrm{\Gamma}}^{-1}(\mathrm{\Theta})\xb7\mathbf{\Phi}$ can be written as

where $S=\mathrm{vec}({s}_{r\mathrm{com}})$, $\widehat{\mathrm{\Phi}}={\mathbf{\Phi}}^{\mathrm{H}}\otimes {I}_{{n}_{a}}$. To check whether ${\mathrm{\Gamma}}^{-1}(\xb7)\xb7\mathbf{\Phi}$ satisfies the RIP [Eq. (26)] means to check whether $\widehat{\mathrm{\Phi}}\xb7\mathbf{G}$ obeys the RIP. As discussed in Ref. 24, the randomly selected partial orthogonal matrix satisfies RIP. In this paper, the measurement matrix $\widehat{\mathrm{\Phi}}$ is a random partial unit matrix. Therefore, if the imaging operator $\mathbf{G}$ is an orthogonal matrix, $\widehat{\mathrm{\Phi}}\xb7\mathbf{G}$ obeys the RIP.The imaging operator $\mathbf{G}$ is an orthogonal matrix. ${\widehat{\omega}}_{a}$ and ${\widehat{\omega}}_{a}^{\prime}$ are the DFT matrix and IDFT matrix, which are orthogonal matrices. Thus, we have

## (34)

$${\widehat{\omega}}_{a}\xb7{({\widehat{\omega}}_{a})}^{H}=\mathbf{I}{\widehat{\omega}}_{a}^{\prime}\xb7{({\widehat{\omega}}_{a}^{\prime})}^{H}=\mathbf{I}.$$Meanwhile, we also can obtain

## (35)

$${\widehat{\omega}}_{r}\xb7{({\widehat{\omega}}_{r})}^{H}=\mathbf{I}{\widehat{\omega}}_{r}^{\prime}\xb7{({\widehat{\omega}}_{r}^{\prime})}^{H}=\mathbf{I}.$$${\widehat{H}}_{1}^{*}$, ${\widehat{H}}_{2}^{*}$, ${\widehat{H}}_{3}^{*}$, ${\widehat{H}}_{4}^{*}$, and ${\widehat{H}}_{5}^{*}$ are the diagonal plural matrices, respectively. Thus, we can obtain

## (36)

$${\widehat{H}}_{1}^{*}\xb7{({\widehat{H}}_{1}^{*})}^{H}=\left[\begin{array}{cccc}{\sigma}_{1}& 0& \cdots & 0\\ 0& {\sigma}_{2}& \cdots & 0\\ \vdots & \vdots & \ddots & \vdots \\ 0& 0& \cdots & {\sigma}_{{N}_{r}{N}_{a}}\end{array}\right],\phantom{\rule{0ex}{0ex}}\text{\hspace{0.17em}}\phantom{\rule{0ex}{0ex}}\phantom{\rule{0ex}{0ex}}{\widehat{H}}_{2}^{*}\xb7{({\widehat{H}}_{2}^{*})}^{H}=\left[\begin{array}{cccc}{\epsilon}_{1}& 0& \cdots & 0\\ 0& {\epsilon}_{2}& \cdots & 0\\ \vdots & \vdots & \ddots & \vdots \\ 0& 0& \cdots & {\epsilon}_{{N}_{r}{N}_{a}}\end{array}\right],$$## (37)

$${\widehat{H}}_{3}^{*}\xb7{({\widehat{H}}_{3}^{*})}^{H}=\left[\begin{array}{cccc}{\varsigma}_{1}& 0& \cdots & 0\\ 0& {\varsigma}_{2}& \cdots & 0\\ \vdots & \vdots & \ddots & \vdots \\ 0& 0& \cdots & {\varsigma}_{{N}_{r}{N}_{a}}\end{array}\right],\text{\hspace{0.17em}}\phantom{\rule{0ex}{0ex}}{\widehat{H}}_{4}^{*}\xb7{({\widehat{H}}_{4}^{*})}^{H}=\left[\begin{array}{cccc}{\xi}_{1}& 0& \cdots & 0\\ 0& {\xi}_{2}& \cdots & 0\\ \vdots & \vdots & \ddots & \vdots \\ 0& 0& \cdots & {\xi}_{{N}_{r}{N}_{a}}\end{array}\right],$$## (38)

$${\widehat{H}}_{5}^{*}\xb7{({\widehat{H}}_{5}^{*})}^{H}=\left[\begin{array}{cccc}{\zeta}_{1}& 0& \cdots & 0\\ 0& {\zeta}_{2}& \cdots & 0\\ \vdots & \vdots & \ddots & \vdots \\ 0& 0& \cdots & {\zeta}_{{N}_{r}{N}_{a}}\end{array}\right].$$Furthermore,

## (39)

$$\mathbf{G}\xb7{(\mathbf{G})}^{\mathrm{H}}={\widehat{\omega}}_{r}^{\prime}\xb7{\widehat{H}}_{1}^{*}\xb7{\widehat{\omega}}_{a}\xb7{\widehat{H}}_{2}^{*}\xb7{\widehat{\omega}}_{r}\xb7{\widehat{H}}_{3}^{*}\xb7{\widehat{\omega}}_{r}^{\prime}\xb7{H}_{4}^{*}\xb7{\widehat{\omega}}_{r}\xb7{\widehat{H}}_{5}^{*}\xb7{\widehat{\omega}}_{a}^{\prime}\phantom{\rule{0ex}{0ex}}\xb7{({\widehat{\omega}}_{r}^{\prime}\xb7{\widehat{H}}_{1}^{*}\xb7{\widehat{\omega}}_{a}\xb7{\widehat{H}}_{2}^{*}\xb7{\widehat{\omega}}_{r}\xb7{\widehat{H}}_{3}^{*}\xb7{\widehat{\omega}}_{r}^{\prime}\xb7{H}_{4}^{*}\xb7{\widehat{\omega}}_{r}\xb7{\widehat{H}}_{5}^{*}\xb7{\widehat{\omega}}_{a}^{\prime})}^{\mathrm{H}}\phantom{\rule{0ex}{0ex}}={\widehat{\omega}}_{r}^{\prime}\xb7{\widehat{H}}_{1}^{*}\xb7{\widehat{\omega}}_{a}\xb7{\widehat{H}}_{2}^{*}\xb7{\widehat{\omega}}_{r}\xb7{\widehat{H}}_{3}^{*}\xb7{\widehat{\omega}}_{r}^{\prime}\xb7{H}_{4}^{*}\xb7{\widehat{\omega}}_{r}\xb7{\widehat{H}}_{5}^{*}\xb7{\widehat{\omega}}_{a}^{\prime}\xb7{({\widehat{\omega}}_{a}^{\prime})}^{\mathrm{H}}\phantom{\rule{0ex}{0ex}}\xb7{({\widehat{H}}_{5}^{*})}^{\mathrm{H}}\xb7{({\widehat{\omega}}_{r})}^{\mathrm{H}}\xb7{({\widehat{H}}_{3}^{*})}^{\mathrm{H}}\xb7{({\widehat{\omega}}_{r})}^{\mathrm{H}}\xb7{({\widehat{H}}_{2}^{*})}^{\mathrm{H}}\xb7{({\widehat{\omega}}_{a})}^{\mathrm{H}}\xb7{({\widehat{H}}_{1}^{*})}^{\mathrm{H}}\xb7{({\widehat{\omega}}_{r}^{\prime})}^{\mathrm{H}},\phantom{\rule{0ex}{0ex}}=\left[\begin{array}{cccc}{\sigma}_{1}\xb7{\epsilon}_{1}\xb7{\varsigma}_{1}\xb7{\xi}_{1}\xb7{\zeta}_{1}& 0& \cdots & 0\\ 0& {\sigma}_{2}\xb7{\epsilon}_{2}\xb7{\varsigma}_{2}\xb7{\xi}_{2}\xb7{\zeta}_{2}& \cdots & 0\\ \vdots & \vdots & \ddots & \vdots \\ 0& 0& \cdots & {\sigma}_{{N}_{r}{N}_{a}}\xb7{\epsilon}_{{N}_{r}{N}_{a}}\xb7{\varsigma}_{{N}_{r}{N}_{a}}\xb7{\xi}_{{N}_{r}{N}_{a}}\xb7{\zeta}_{{N}_{r}{N}_{a}}\end{array}\right].$$Therefore, the imaging operator $\mathbf{G}$ is an orthogonal matrix. Furthermore, $\widehat{\mathrm{\Phi}}\xb7\mathbf{G}$ obeys the RIP. Thus, ${\mathrm{\Gamma}}^{-1}(\xb7)\xb7\mathbf{\Phi}$ satisfies the RIP.

## Acknowledgments

This work was supported by the National Natural Science Foundation of China under Nos. 61201369 and 61471386.

## References

A. S. Khwaja and J. W. Ma, “Applications of compressed sensing for SAR moving-target velocity estimation and image compression,” IEEE Trans. Instrum. Meas. 60, 2848-2860 (2011).IEIMAO0018-9456http://dx.doi.org/10.1109/TIM.2011.2122190Google Scholar

W. An et al., “Data compression for multilook polarimetric SAR Data,” IEEE Geosci. Remote Sens. Lett. 6(3), 476–480 (2009).IGRSBY1545-598Xhttp://dx.doi.org/10.1109/LGRS.2009.2017498Google Scholar

L. Zhang et al., “Wavenumber-domain autofocusing for highly squinted UAV SAR imagery,” IEEE Sens. J. 12(5), 1574–1588 (2012).ISJEAZ1530-437Xhttp://dx.doi.org/10.1109/JSEN.2011.2162945Google Scholar

D. X. An et al., “Extended nonlinear chirp scaling algorithm for high-resolution highly squint SAR data focusing,” IEEE Trans. Geosci. Remote Sens. 50(9), 3595–3609 (2012).IGRSD20196-2892http://dx.doi.org/10.1109/TGRS.2012.2183606Google Scholar

M. Vandewal, R. Speck and H. Süß, “Efficient and precise processing for squinted spotlight SAR through a modified Stolt mapping,” EURASIP J. Adv. Signal Process. 2007(1), 1–7 (2007).http://dx.doi.org/10.1155/2007/59704Google Scholar

G. C. Sun et al., “Focus improvement of highly squinted data based on azimuth nonlinear scaling,” IEEE Trans. Geosci. Remote Sens. 49(6), 2308–2322 (2011).IGRSD20196-2892http://dx.doi.org/10.1109/TGRS.2010.2102040Google Scholar

J. Fang et al., “Fast compressed sensing SAR imaging based on approximated observation,” IEEE J. Sel. Topics Appl. Earth Observ. Remote Sens. 7(1), 352–363 (2014).Google Scholar

D. L. Donoho, “Compressed sensing,” IEEE Trans. Inf. Theory 52(4), 1289–1306 (2006).IETTAW0018-9448http://dx.doi.org/10.1109/TIT.2006.871582Google Scholar

E. Candes, J. Romberg and T. Tao, “Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inf. Theory 52 (2), 489–509 (2006).IETTAW0018-9448http://dx.doi.org/10.1109/TIT.2005.862083Google Scholar

B. C. Zhang, W. Hong and Y. R. Wu, “Sparse microwave imaging: principles and applications,” Sci. China Inf. Sci. 55(8), 1722–1754 (2012).1674-733Xhttp://dx.doi.org/10.1007/s11432-012-4633-4Google Scholar

R. G. Baraniuk and P. Steeghs, “Compressive radar imaging,” in Proc. IEEE Radar Conference, pp. 128–133, Boston, Massachusetts (2007).Google Scholar

S. Bhattacharya et al., “Synthetic aperture radar raw data encoding using compressed sensing,” in Proc. IEEE Radar Conference, Rome, Italy (2008).Google Scholar

H. Jiang et al., “Random noise imaging radar based on compressed sensing,” in Proc. IEEE Geoscience Remote Sensing Symp., pp. 4624–4627, Honolulu, Hawaii (2011).Google Scholar

K. R. Vrashney et al., “Sparse representation in structured dictionaries with application to synthetic aperture radar,” IEEE Trans. Signal Process. 56(8), 3548–3561 (2008).ITPRED1053-587Xhttp://dx.doi.org/10.1109/TSP.2008.919392Google Scholar

M. T. Alonso et al., “A novel strategy for radar imaging based on compressive sensing,” IEEE Trans. Geosci. Remote Sens. 48(12), 4285–4295 (2010).IGRSD20196-2892http://dx.doi.org/10.1109/TGRS.2010.2051231Google Scholar

V. M. Patel et al., “Compressed synthetic aperture radar,” IEEE J. Sel. Topics Signal Process. 4(2), 244–254 (2010).http://dx.doi.org/10.1109/JSTSP.2009.2039181Google Scholar

F. F. Gu et al., “Two-dimensional sparse synthetic aperture radar imaging method,” J. Appl. Remote Sens. 9(1), 096099 (2015).1931-3195http://dx.doi.org/10.1117/1.JRS.9.096099Google Scholar

L. Hu et al., “Compressed sensing of complex sinusoids: an approach based on dictionary refinement,” IEEE Trans. Signal Process. 60(7), 3809–3822 (2012).ITPRED1053-587Xhttp://dx.doi.org/10.1109/TSP.2012.2193392Google Scholar

J. A. Tropp and S. J. Wright, “Computational methods for sparse solution of linear inverse problems,” Proc. IEEE 98(6), 948–958 (2010).IEEPAD0018-9219http://dx.doi.org/10.1109/JPROC.2010.2044010Google Scholar

S. S. Chen, D. L. Donoho and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM J. Sci. Comput. 20(1), 33–61 (1998).SJOCE31064-8275http://dx.doi.org/10.1137/S1064827596304010Google Scholar

I. Daubechies, M. Defrise and C. De Mol, “An iterative thresholding algorithm for linear inverse problems with a sparsity constraint,” Commun. Pure Appl. Math. 57(11), 1413–1457 (2004).CPMAMV0010-3640http://dx.doi.org/10.1002/(ISSN)1097-0312Google Scholar

T. Blumensath and M. E. Davies, “Normalized iterative hard thresholding: guaranteed stability and performance,” IEEE J. Sel. Topics Signal Process. 4(2), 298–309 (2010).http://dx.doi.org/10.1109/JSTSP.2010.2042411Google Scholar

Z. B. Xu et al., “L_{1/2} Regularization: a thresholding representation theory and a fast solver,” IEEE Trans. Neural Netw. Learn. Syst. 23(7), 1013–1027 (2012).http://dx.doi.org/10.1109/TNNLS.2012.2197412Google Scholar

E. Candes and T. Tao, “Near optimal signal recovery from random projections: universal encoding strategies?,” IEEE Trans. Inf. Theory 52(12), 5406–5425 (2006).IETTAW0018-9448http://dx.doi.org/10.1109/TIT.2006.885507Google Scholar

## Biography

**Fu-fei Gu** received his MS degree in electrical engineering from the Institute of Information and Navigation, Air Force Engineering University (AFEU), Xi’an, China, in 2011, where he is currently working toward his PhD in electrical engineering. Currently, he is with the radar and signal processing laboratory, School of Information and Navigation, AFEU. His research interests include compressed sensing (CS) theory and radar imaging.

**Qun Zhang** received his PhD in electrical engineering from Xidian University, Xi’an, China, in 2001. Currently, he is a professor with the School of Information and Navigation, Air Force Engineering University, and an adjunct professor with the Key Laboratory of Wave Scattering and Remote Sensing Information, Fudan University. He has published over 200 papers in journals and conferences. His main research interests include signal processing, and its application in synthetic aperture radar and ISAR.

**Yong-an Chen** received his bachelor’s degree in communication engineering from the Institute of Information and Navigation, Air Force Engineering University (AFEU), Xi’an, China, in 2014, where he is currently pursuing the MS degree in electrical engineering. His research interests include radar imaging and target identification.

**Ying Luo** received his MS degree in electrical engineering from the Institute of Telecommunication Engineering, Air Force Engineering University (AFEU), Xi’an, China, in 2008, and his PhD in electrical engineering from AFEU, in 2013. He is currently working in the Key Laboratory for Radar Signal Processing, Xidian University, as a postdoctoral fellow. His research interests include signal processing and ATR in SAR and ISAR.