2018
DOI: 10.1109/lgrs.2018.2812158
|View full text |Cite
|
Sign up to set email alerts
|

A Range Perturbation Approach for Correcting Spatially Variant Range Envelope in Diving Highly Squinted SAR With Nonlinear Trajectory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
18
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 11 publications
(18 citation statements)
references
References 11 publications
0
18
0
Order By: Relevance
“…Therefore, the number of FLOPs of azimuth compression Nnormala_num can be calculated byNnormala_num=i=1Nrfalse∑n=1Zi10thinmathspaceMsub_inlog2Msub_in+6Msub_in ANCS is widely used in the frequency‐domain SAR imaging algorithms for azimuth compression [11, 13, 19, 20]. In general, ANCS [19], which is also used in [20], requires three azimuth FFT operations and three complex multiplication operations. Using the parameters in Table 1, the computational complexity of the proposed azimuth compression method is about 60% of that of the ANCS method.…”
Section: Azimuth Compression Based On the Azimuth Sub‐region Derampmentioning
confidence: 99%
See 4 more Smart Citations
“…Therefore, the number of FLOPs of azimuth compression Nnormala_num can be calculated byNnormala_num=i=1Nrfalse∑n=1Zi10thinmathspaceMsub_inlog2Msub_in+6Msub_in ANCS is widely used in the frequency‐domain SAR imaging algorithms for azimuth compression [11, 13, 19, 20]. In general, ANCS [19], which is also used in [20], requires three azimuth FFT operations and three complex multiplication operations. Using the parameters in Table 1, the computational complexity of the proposed azimuth compression method is about 60% of that of the ANCS method.…”
Section: Azimuth Compression Based On the Azimuth Sub‐region Derampmentioning
confidence: 99%
“…Therefore, Nnormala_num can be approximated to 1.8 azimuth FFT operations and 1.8 complex multiplication operations, given byNnormala_numNrNa×][9×log2thinmathspaceNa+10.8 In this case, the number of FLOPs of the proposed algorithm isCproposedNrNa×][10×log2thinmathspaceNr+39×log2thinmathspaceNa+40.8 Similarly, the number of FLOPs of the reference algorithm [20] isCreference=NrNa×][10×log2thinmathspaceNr+25×log2thinmathspaceNa+30 Compared to (43) and (44), we can find the computation of the proposed algorithm is slightly higher than that of the frequency‐domain imaging algorithm based on ANCS processing due to a large computing requirement for KT. For the echo signal generated by the parameters in Table 1 with 6000 sampling points in azimuth and 5120 sampling points in range, the computational times of the reference algorithm [20] and the proposed algorithm are about 8.0 and 11.8 s, respectively, using the personal computer with 2.7 GHz central processor unit clock frequency and 8 GB random‐access memory. The ratio of two computational times 11.8/8.0 (1.47) is slightly higher than the theoretical value Cproposed/Creference (1.40) owing to some extra computations on the azimuth sub‐region deramp.…”
Section: Azimuth Compression Based On the Azimuth Sub‐region Derampmentioning
confidence: 99%
See 3 more Smart Citations