Name
Abstract | ||
|---|---|---|
The backprojection (BP) algorithm has been applied to every SAR mode due to its great focusing quality and adaptability. However, the BP algorithm suffers from immense computational complexity. To improve the efficiency of the conventional BP algorithm, several fast BP (FBP) algorithms, such as the fast factorization BP (FFBP) and Block_FFBP, have been developed in recent studies. In the derivation of Block_FFBP, range data are divided into blocks, and the upsampling process is performed using an interpolation kernel instead of a fast Fourier transform (FFT), which reduces the processing efficiency. To circumvent these limitations, an accelerated BP algorithm based on Block_FFBP is proposed. In this algorithm, a fixed number of pivots rather than the beam centers is applied to construct the relationship of the propagation time delay between the new and old subapertures. Partition in the range dimension is avoided, and the range data are processed as a bulk. This accelerated BP algorithm benefits from the integrated range processing scheme and is extended to bistatic SAR processing. In this sense, the proposed algorithm can be referred to simply as MoBulk_FFBP for the monostatic SAR case and BiBulk_FFBP for the bistatic SAR case. Furthermore, for monostatic and azimuth-invariant bistatic SAR cases where the platform runs along a straight trajectory, the slant range mapping can be expressed in a continuous and analytical form. Real data from the spaceborne/stationary bistatic SAR experiment with TerraSAR-X operating in the staring spotlight mode and from the airborne spotlight SAR experiment acquired in 2016 are used to validate the performances of BiBulk_FFBP and MoBulk_FFBP, respectively. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.3390/rs10010140 | REMOTE SENSING |
Keywords | Field | DocType |
accelerated backprojection algorithm,bistatic SAR,monostatic SAR,bulk processing | Kernel (linear algebra),Interpolation,Algorithm,Fast Fourier transform,Bistatic radar,Geology,Upsampling,Propagation time,Slant range,Computational complexity theory | Journal |
Volume | Issue | ISSN |
10 | 1 | 2072-4292 |
Citations | PageRank | References |
2 | 0.36 | 20 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Heng Zhang | 1 | 8 | 6.91 |
| Jiangwen Tang | 2 | 6 | 0.76 |
| Robert Wang | 3 | 393 | 54.64 |
| Yunkai Deng | 4 | 292 | 54.84 |
| Wang, W. | 5 | 13 | 8.55 |
| Ning Li | 6 | 51 | 19.70 |